An improvement of fruit fly optimization algorithm for solving traveling salesman problems

Abstract

TSP (Traveling Salesman Problem, TSP) is a classic combinatorial optimization problem and nowadays it is a hot topic to find a high precision algorithm with short solving time. As its search space increases with the number of cities, it often requires a lot of computation time to find the optimal solution in a large space. So a new TSP solving algorithm is… (More)

Topics

4 Figures and Tables

Cite this paper

@article{Hengyu2014AnIO, title={An improvement of fruit fly optimization algorithm for solving traveling salesman problems}, author={Li Hengyu and Chen Jiqing and Huang Quanzhen and Xie Shaorong and Luo Jun}, journal={2014 IEEE International Conference on Information and Automation (ICIA)}, year={2014}, pages={620-623} }