期刊
NEURAL COMPUTING & APPLICATIONS
卷 27, 期 7, 页码 1853-1866出版社
SPRINGER LONDON LTD
DOI: 10.1007/s00521-015-1978-9
关键词
Travelling salesman problem; NP-hard combinatorial optimization problem; Nature-inspired metaheuristic; Discrete bat-inspired algorithm
The travelling salesman problem (TSP) is one of the well-known NP-hard combinatorial optimization and extensively studied problems in discrete optimization. The bat algorithm is a new nature-inspired metaheuristic optimization algorithm introduced by Yang in 2010, especially based on echolocation behavior of microbats when searching their prey. Firstly, this algorithm is used to solve various continuous optimization problems. In this paper we extend a discrete bat-inspired algorithm to solve the famous TSP. Although many algorithms have been used to solve TSP, the main objective of this research is to investigate this discrete version to achieve significant improvements, not only compared to traditional algorithms but also to another metaheuristics. Moreover, this study is based on a benchmark dataset of symmetric TSP from TSPLIB library.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据