Journal of South China University of Technology (Natural Science Edition) ›› 2015, Vol. 43 ›› Issue (1): 126-131,139.doi: 10.3969/j.issn.1000-565X.2015.01.020

• Computer Science & Technology • Previous Articles     Next Articles

Discrete Artificial Firefly Algorithm for Solving Traveling Salesman Problems

Yu Hong-tao1 Gao Li-qun1 Han Xi-chang2   

  1. 1.School of Information Science and Technology, Northeastern University,Shenyang 110819,Liaoning,China;2.College of Automation, Shenyang Institute of Engineering,Shenyang 110136,Liaoning,China
  • Received:2014-03-24 Revised:2014-07-14 Online:2015-01-25 Published:2014-12-01
  • Contact: 于宏涛（1978-），男，在职博士生，沈阳工程学院讲师，主要从事智能优化算法研究 . E-mail:neu970773@sohu.com
  • About author:于宏涛（1978-），男，在职博士生，沈阳工程学院讲师，主要从事智能优化算法研究 .
  • Supported by:
    Supported by the National Natural Science Foundation of China （ 61273155 ）

PDF

403

Abstract:

Proposed in this paper is a discrete artificial firefly algorithm combined with variable neighborhood search algorithm, which is used to solve traveling salesman problems.First, the distance of artificial firefly algorithm is redefined by introducing the concepts of swap operator and swap sequence.Secondly, in order to increase the diversity of firefly swarms and to avoid quick convergence to local optimal solution, a perturbation mechanism is designed on the basis of variable neighborhood search algorithm.Then, several different traveling salesman problems are solved by using the proposed algorithm, and the results finally show that the proposed algorithm is superior to the typical ones in literatures because it helps obtain good solving results.

Key words: artificial firefly algorithm, variable neighborhood search, traveling salesman problem, combinatorial optimization

CLC Number: