An improved firefly algorithm for traveling salesman problems
Mingbo Wang, Qiang Fu, Nan Tong, Mengmeng Li, Yiming Zhao · 2016
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.