Chaotic hybrid discrete bat algorithm for traveling salesman problem

被引：0

作者：

Qi Y.-H. ^{[1
]}

Cai Y.-G. ^{[1
]}

Cai H. ^{[2
]}

Tang Y.-L. ^{[1
]}

Lü W.-X. ^{[1
]}

机构：

[1] School of Automation, Guangdong University of Technology, Guangzhou, 510006, Guangdong

[2] Department of Health Science & Technology, Aalborg University, Aalborg

来源：

| 1600年 / Chinese Institute of Electronics卷 / 44期

关键词：

2-Opt; Bat algorithm; Chaotic initialization; Traveling salesman problem;

D O I：

10.3969/j.issn.0372-2112.2016.10.037

中图分类号：

学科分类号：

摘要：

In view of some problems,like slow convergence speed and low constringency rate,arising during the process of applying discrete bat algorithms to solve travelling salesman problem,a chaotic hybrid discrete bat algorithm is proposed.The proposed algorithm adopts chaotic initialization strategy to improve the capability of optimization,and the 2-Opt to enhance the capability of local search and to speed up the convergence speed.A large amount of simulations show that the algorithm can achieve their solutions rapidly for some small scale traveling salesman problems,and obtain their solutions in a relatively short time with the error less than 0.4% for large ones. © 2016, Chinese Institute of Electronics. All right reserved.

引用

页码：2543 / 2547

页数：4

共 10 条

[1] Gao H.-C., Feng B.-Q., Zhu L., Reviews of the meta-heuristic algorithms for TSP, Control and Decision, 21, 3, pp. 241-247, (2006)
[2] Yang X.-S., A new metaheuristic bat-inspired algorithm, Nature Inspired Cooperative Strategies for Optimization, 284, pp. 65-74, (2010)
[3] Li Z.-Y., Ma L., Zhang H.-Z., Discretebat algorithm for solving minimum ratio traveling salesman problem, Application Research of Computers, 32, 2, pp. 356-359, (2015)
[4] Jordehi A.R., Chaotic bat swarm optimization (CBSO), Applied Soft Computing, 26, pp. 523-530, (2015)
[5] Yu L.-L., Wang W.-L., Jie J., Solution of travel salesman problem based on hybrid particle swarm optimization algorithm, Computer Engineering, 36, 11, pp. 183-184, (2010)
[6] Yong W., The hybrid genetic algorithm with two local optimization strategies for traveling salesman problem, Computers & Industrial Engineering, 70, pp. 124-133, (2014)
[7] Zhou Y.-Q., Huang Z.-X., Liu H.-X., Discrete glowworm swarm optimization algorithm for TSP problem, Acta Electronica Sinica, 40, 6, pp. 1164-1170, (2012)
[8] Rafsanjani M.K., Eskandari S., Saeid A.B., A similarity-based mechanism to control genetic algorithm and local search hybridization to solve traveling salesman problem, Neural Computing and Applications, 26, 1, pp. 213-222, (2015)
[9] Gao S., Solving traveling salesman problem by chaos ant colony optimization algorithm, System Engineering Theory and Practice, 25, 9, pp. 100-104, (2005)
[10] Jiang C.-H., Dai S.-G., Hu Y.-H., Hybrid genetic algorithm for capacitated vehicle routing problem, Computer Integrated Manufacturing Systems, 13, 10, pp. 2047-2052, (2007)

← 1 →