An ant colony optimization algorithm for the Multiple Traveling Salesmen Problem

The multiple traveling salesmen problem (MTSP) is a generalization of the famous traveling salesman problem (TSP), where more than one salesman is used in the solution. Though the MTSP is a typical computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing and scheduling problems. The paper proposed an ant colony optimization (ACO) algorithm for the MTSP with two objectives: the objective of minimizing the maximum tour length of all the salesmen and the objective of minimizing the maximum tour length of each salesman. In the algorithm, the pheromone trail updating and limits followed the MAX-MIN Ant System (MMAS) scheme, and a local search procedure was used to improve the performance of the algorithm. We compared the results of our algorithm with genetic algorithm (GA) on some benchmark instances in literatures. Computational results show that our algorithm is competitive on both the objectives.

[1]  M. M. Flood.  The Traveling-Salesman Problem , 1956 .

[2]  Martin W. P. Savelsbergh,et al.  The Vehicle Routing Problem with Time Windows: Minimizing Route Duration , 1992, INFORMS J. Comput..

[3]  Paul M. Thompson,et al.  Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems , 1993, Oper. Res..

[4]  Jean-Yves Potvin,et al.  An Exchange Heuristic for Routeing Problems with Time Windows , 1995 .

[5]  M Dorigo,et al.  Ant colonies for the travelling salesman problem. , 1997, Bio Systems.

[6]  T. Glenn Bailey,et al.  Reactive Tabu Search in unmanned aerial reconnaissance simulations , 1998, 1998 Winter Simulation Conference. Proceedings (Cat. No.98CH36274).

[7]  David L. Woodruff,et al.  Solving the medium newspaper production/distribution problem , 1999, Eur. J. Oper. Res..

[8]  Takao Enkawa,et al.  Competition-based neural network for the multiple travelling salesmen problem with minmax objective , 1999, Comput. Oper. Res..

[9]  Lixin Tang,et al.  A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron & Steel Complex , 2000, Eur. J. Oper. Res..

[10]  M. D. Leenheer,et al.  Future Generation Computer Systems , 2000 .

[11]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

[12]  Ching-Fang Liaw,et al.  A hybrid genetic algorithm for the open shop scheduling problem , 2000, Eur. J. Oper. Res..

[13]  Amelia C. Regan,et al.  Local truckload pickup and delivery with hard time window constraints , 2002 .

[14]  Cliff T. Ragsdale,et al.  Scheduling pre-printed newspaper advertising inserts using genetic algorithms , 2002 .

[15]  Kap Hwan Kim,et al.  A crane scheduling method for port container terminals , 2004, Eur. J. Oper. Res..

[16]  Serhiy D. Shtovba.  Ant Algorithms: Theory and Applications , 2005, Programming and Computer Software.

[17]  Yupo Chan,et al.  The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations , 2005, Math. Comput. Model..

[18]  Sanem Sariel,et al.  REAL TIME AUCTION BASED ALLOCATION OF TASKS FOR MULTI-ROBOT EXPLORATION PROBLEM IN DYNAMIC ENVIRONMENTS , 2005 .

[19]  Pan Junjie,et al.  An Ant Colony Optimization Algorithm for Multiple Travelling Salesman Problem , 2006, First International Conference on Innovative Computing, Information and Control - Volume I (ICICIC'06).

[20]  Sheldon H. Jacobson,et al.  Optimal search strategies using simultaneous generalized hill climbing algorithms , 2006, Math. Comput. Model..

[21]  Cliff T. Ragsdale,et al.  A new approach to solving the multiple traveling salesperson problem using genetic algorithms , 2006, Eur. J. Oper. Res..

[22]  T. Bektaş.  The multiple traveling salesman problem: an overview of formulations and solution procedures , 2006 .

[23]  R. Sengupta,et al.  Lower and Upper Bounds for a Symmetric Multiple Depot, Multiple Travelling Salesman Problem , 2006 .

[24]  K Huang,et al.  MULTIPLE TRAVELING SALESMAN PROBLEM AND ITS APPLICATION TO HOT ROLLING PLANNING , 2007 .

[25]  Zhang Yi,et al.  A columnar competitive model for solving multi-traveling salesman problem☆ , 2007 .

[26]  Cliff T. Ragsdale,et al.  A Grouping Genetic Algorithm for the Multiple Traveling Salesperson Problem , 2007, Int. J. Inf. Technol. Decis. Mak..

[27]  Alok Singh,et al.  A new grouping genetic algorithm approach to the multiple traveling salesperson problem , 2008, Soft Comput..