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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Expert systems with applications Jg. 172; S. 114639
Hauptverfasser:	Saji, Yassine, Barkatou, Mohammed
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Elsevier Ltd 15.06.2021 Elsevier BV
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!