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

作者：

Highlights：

• 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 tests prove the superiority of the discrete bat algorithm.

摘要

•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 tests prove the superiority of the discrete bat algorithm.

论文关键词：Bat algorithm,Traveling salesman problem,NP-hard combinatorial optimization problem,Population-based metaheuristics,Lévy flights

论文评审过程：Received 1 December 2019, Revised 31 July 2020, Accepted 18 January 2021, Available online 26 January 2021, Version of Record 8 February 2021.

论文官网地址：https://doi.org/10.1016/j.eswa.2021.114639