supported by the National Natural Science Foundation of China(Nos.61472159 and 61373051)
The traveling salesman problem(TSP), a typical non-deterministic polynomial(NP) hard problem, has been used in many engineering applications. As a new swarm-intelligence optimization algorithm, the fruit fly optimizat...