Recent advances in metaheuristics have shown the advantages of using Lévy distribution, which models a kind random walk (named “Lévy flight”) with occasional “big” steps. This characteristic makes flight especially useful for performing large “jumps” that allow search to escape from local optimum and restart different region space. In this paper, we investigate idea by applying Jaya, simple yet...