A hybrid artificial bee colony algorithm with high robustness for the multiple traveling salesman problem with multiple depots
Abstract: Highlights•A hybrid algorithm AC-ABC is proposed to solve the MTSP with multiple depots.•AC-ABC has strong robustness since the quality of the solution is less affected by the initial value.•AC-ABC algorithm has good performance in terms of the best travel cost and the execution time.•A tensor representation of solutions is proposed to provide multiple route choices for the MTSP.
Loading