Double evolutional artificial bee colony algorithm for multiple traveling salesman problem

The double evolutional artificial bee colony algorithm (DEABC) is proposed for solving the single depot multiple traveling salesman problem (MTSP). The proposed DEABC algorithm, which takes advantage of the strength of the upgraded operators, is characterized by its guidance in exploitation search and diversity in exploration search. The double evolutional process for exploitation search is composed of two phases of half stochastic optimal search, and the diversity generating operator for exploration search is used for solutions which cannot be improved after limited times. The computational results demonstrated the superiority of our algorithm over previous state-of-the art methods.