A discrete bat algorithm based on Lévy flights for Euclidean traveling salesman problem

•A new discrete bat algorithm based on Lévy flights is proposed.•2-opt, 2.5-opt and 3-opt define the movement of bats in the search space.•A modified uniform crossover is designed for diversification and intensification.•Bat algorithm is tested on set of symmetric instances from TSPLIB.•Statistical...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Expert systems with applications Ročník 172; s. 114639
Hlavní autori:	Saji, Yassine, Barkatou, Mohammed
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Elsevier Ltd 15.06.2021 Elsevier BV
Predmet:	Algorithms Bat algorithm Combinatorial analysis Comparative studies Heuristic methods Lévy flights NP-hard combinatorial optimization problem Optimization Population-based metaheuristics Random walk Search methods Traveling salesman problem Lévy flights Traveling salesman problem Population-based metaheuristics Bat algorithm NP-hard combinatorial optimization problem
ISSN:	0957-4174, 1873-6793
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!