An improved firefly algorithm for traveling salesman problems
Authors
Ming-bo Wang, Qiang Fu, Nan Tong, Mengmeng Li, Yiming Zhao
Corresponding Author
Ming-bo Wang
Available Online December 2015.
- DOI
- 10.2991/nceece-15.2016.193How to use a DOI?
- Keywords
- fireflies algorithm; Traveling Salesman Problem; mutation mechanism; Elite Strategy; C2Opt operator
- Abstract
Firefly algorithm, a new type of swarm intelligence in optimization, has a good performance in combinatorial optimization problem. For Traveling Salesmen Problem (TSP), this process proposes an optimized path approach based on the modified firefly algorithm. In order to avoid a local optimum, an elitist strategy combined with mutation mechanism and the mechanism of fluorescence change are used to help the fireflies group go out of the local optimal area. For problems on intersection of sets, C2Opt operator can be used on the global optimization of the path. Finally, the experimental result would be compared with other classical algorithm to verify the reliability via TSPLIB instance test.
- Copyright
- © 2016, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Ming-bo Wang AU - Qiang Fu AU - Nan Tong AU - Mengmeng Li AU - Yiming Zhao PY - 2015/12 DA - 2015/12 TI - An improved firefly algorithm for traveling salesman problems BT - Proceedings of the 2015 4th National Conference on Electrical, Electronics and Computer Engineering PB - Atlantis Press SP - 1085 EP - 1092 SN - 2352-5401 UR - https://doi.org/10.2991/nceece-15.2016.193 DO - 10.2991/nceece-15.2016.193 ID - Wang2015/12 ER -