Improved fruit fly optimization algorithm for traveling salesman problem

Abstract

An improved fruit fly optimization algorithm (FOA) is proposed to solve the traveling salesman problem. In this paper, in order to use FOA to solve the discrete problems, a new method of Visual Search is presented. The fruit fly movement process is proposed to avoid the fruit fly optimization algorithm fall into the local optimal solution. A novel strategy is used to enhance the good individuals in the fruit fly population. The proposed algorithm is evaluated on the TSP test problems. The experimental results show that this algorithm presents extreme fast convergence speed and accuracy.