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

Full description

Saved in:

Bibliographic Details
Published in:	Expert systems with applications Vol. 172; p. 114639
Main Authors:	Saji, Yassine, Barkatou, Mohammed
Format:	Journal Article
Language:	English
Published:	New York Elsevier Ltd 15.06.2021 Elsevier BV
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!