An improved Jaya optimization algorithm with Lévy flight

Recent advances in metaheuristics have shown the advantages of using the Lévy distribution, which models a kind of random walk (named “Lévy flight”) with occasional “big” steps. This characteristic makes Lévy flight especially useful for performing large “jumps” that allow the search to escape from...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Expert systems with applications Ročník 165; s. 113902
Hlavní autoři: Iacca, Giovanni, dos Santos Junior, Vlademir Celso, Veloso de Melo, Vinícius
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Elsevier Ltd 01.03.2021
Elsevier BV
Témata:
Algorithms
Benchmarks
Continuous optimization
Jaya
Levy distribution
Lévy flight
Optimization
Optimization algorithms
Random walk
Swarm intelligence
Swarm intelligence
Jaya
Continuous optimization
Lévy flight
ISSN:0957-4174, 1873-6793
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Recent advances in metaheuristics have shown the advantages of using the Lévy distribution, which models a kind of random walk (named “Lévy flight”) with occasional “big” steps. This characteristic makes Lévy flight especially useful for performing large “jumps” that allow the search to escape from a local optimum and restart in a different region of the search space. In this paper, we investigate this idea by applying Lévy flight to Jaya, a simple yet effective Swarm Intelligence optimization algorithm recently proposed in the literature. We perform experiments on the CEC 2014 benchmark as well as five industrial optimization problems taken from the CEC 2011 benchmark, and compare the performance of the proposed Lévy flight Jaya Algorithm (LJA) against several state-of-the-art algorithms for continuous optimization. Our numerical results show that, although both Jaya and LJA are in general less efficient than the most advanced algorithms on the CEC 2014 benchmark, LJA largely outperforms the original Jaya algorithm in most cases, and is also highly competitive on the tested industrial problems. •We present the Lévy flight Jaya Algorithm (LJA) for continuous optimization.•We evaluate the effect of the β parameter on LJA.•LJA consistently outperforms the original Jaya on most optimization problems.•We compare LJA with state-of-the-art algorithms on benchmark/industrial problems.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0957-4174
1873-6793
DOI:10.1016/j.eswa.2020.113902