The multiple traveling salesman problem: an overview of formulations and solution procedures

[1]  Abraham P. Punnen,et al.  The traveling salesman problem and its variations , 2007 .

[2]  Tolga Bektas,et al.  Integer linear programming formulations of multiple salesman problems and its variations , 2006, Eur. J. Oper. Res..

[3]  Gilbert Laporte,et al.  Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows , 2004 .

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

[5]  Cathy Macharis,et al.  Opportunities for OR in intermodal freight transport research: A review , 2004, Eur. J. Oper. Res..

[6]  Hussain Aziz Saleh,et al.  The design of the global navigation satellite system surveying networks using genetic algorithms , 2004, Eng. Appl. Artif. Intell..

[7]  E. Wacholder,et al.  A neural network algorithm for the multiple traveling salesmen problem , 1989, Biological Cybernetics.

[8]  Roberto Cordone,et al.  A heuristic approach to the overnight security service problem , 2003, Comput. Oper. Res..

[9]  Chi-Hwa Song,et al.  Extended simulated annealing for augmented TSP and multi-salesmen TSP , 2003, Proceedings of the International Joint Conference on Neural Networks, 2003..

[10]  Ted K. Ralphs,et al.  Parallel branch and cut for capacitated vehicle routing , 2003, Parallel Comput..

[11]  Fernando José Von Zuben,et al.  Multiple criteria optimization based on unsupervised learning and fuzzy inference applied to the vehicle routing problem , 2002, J. Intell. Fuzzy Syst..

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

[13]  Gu Guochang,et al.  An implementation of evolutionary computation for path planning of cooperative mobile robots , 2002, Proceedings of the 4th World Congress on Intelligent Control and Automation (Cat. No.02EX527).

[14]  Michel Gendreau,et al.  A guide to vehicle routing heuristics , 2002, J. Oper. Res. Soc..

[15]  Kenneth DeJong,et al.  Evolutionary Computational Approaches to Solving the Multiple Traveling Salesman Problem Using a Neighborhood Attractor Schema , 2002, EvoWorkshops.

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

[17]  Eleni Hadjiconstantinou,et al.  Routing under Uncertainty: An Application in the Scheduling of Field Service Engineers , 2002, The Vehicle Routing Problem.

[18]  Paolo Toth,et al.  Branch-And-Bound Algorithms for the Capacitated VRP , 2002, The Vehicle Routing Problem.

[19]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[20]  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..

[21]  Anup Basu,et al.  Efficient coordinated motion , 2000 .

[22]  Takao Enkawa,et al.  A self‐organizing neural network approach for multiple traveling salesman and vehicle routing problems , 1999 .

[23]  William A. Gruver,et al.  Team scheduling by genetic search , 1999, Proceedings of the Second International Conference on Intelligent Processing and Manufacturing of Materials. IPMM'99 (Cat. No.99EX296).

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

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

[26]  Barry Brumitt,et al.  GRAMMPS: a generalized mission planner for multiple mobile robots in unstructured environments , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).

[27]  Takao Enkawa,et al.  A competitive neural network algorithm for solving vehicle routing problem , 1997 .

[28]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[29]  K. Ruland,et al.  The pickup and delivery problem: Faces and branch-and-cut algorithm , 1997 .

[30]  Barry Brumitt,et al.  Dynamic mission planning for multiple mobile robots , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[31]  Yang GuoXing,et al.  Transformation of multidepot multisalesmen problem to the standard travelling salesman problem , 1995 .

[32]  Bruce L. Golden,et al.  Solving vehicle routing problems using elastic nets , 1994, Proceedings of 1994 IEEE International Conference on Neural Networks (ICNN'94).

[33]  Gilbert Laporte,et al.  The vehicle routing problem: An overview of exact and approximate algorithms , 1992 .

[34]  G. Laporte.  The traveling salesman problem: An overview of exact and approximate algorithms , 1992 .

[35]  J. A. Gromicho Dos Santos,et al.  Exact Solution of Multiple Traveling Salesman Problem , 1992 .

[36]  Kenneth C. Gilbert,et al.  A New Multiperiod Multiple Traveling Salesman Problem with Heuristic and Application to a Scheduling Problem , 1992 .

[37]  Chau-Yun Hsu,et al.  A study of feature-mapped approach to the multiple travelling salesmen problem , 1991, 1991., IEEE International Sympoisum on Circuits and Systems.

[38]  Jean-Yves Potvin,et al.  A Generalized K-Opt Exchange Procedure For The MTSP , 1989 .

[39]  Gilbert Laporte,et al.  Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems , 1988, Transp. Sci..

[40]  A. Volgenant,et al.  Technical Note - An Improved Transformation of the Symmetric Multiple Traveling Salesman Problem , 1988, Oper. Res..

[41]  C. Okonjo-Adigwe.  An effective method of balancing the workload amongst salesmen , 1988 .

[42]  Bezalel Gavish,et al.  An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems , 1986, Oper. Res..

[43]  Agha Iqbal Ali,et al.  The asymmetric M-travelling salesmen problem: A duality based branch-and-bound algorithm , 1986, Discret. Appl. Math..

[44]  Gilbert Laporte,et al.  Optimal Routing under Capacity and Distance Restrictions , 1985, Oper. Res..

[45]  P. Bhave,et al.  Integer programming formulations of vehicle routing problems , 1985 .

[46]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

[47]  Richard H Mole,et al.  Combinatorial analysis for route first-cluster second vehicle routing , 1983 .

[48]  Paolo Toth,et al.  Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations , 1981, Math. Program..

[49]  Joseph H. Discenza,et al.  A more compact formulation of the symmetric multiple traveling salesman problem with fixed charges , 1981, Networks.

[50]  Bruce L. Golden,et al.  Two generalizations of the traveling salesman problem , 1981 .

[51]  Gilbert Laporte,et al.  A Cutting Planes Algorithm for the m-Salesmen Problem , 1980 .

[52]  M. R. Rao,et al.  Technical Note - A Note on the Multiple Traveling Salesmen Problem , 1980, Oper. Res..

[53]  Stephen C. Graves,et al.  The Travelling Salesman Problem and Related Problems , 1978 .

[54]  Manfred W. Padberg,et al.  Technical Note - A Note on the Symmetric Multiple Traveling Salesman Problem with Fixed Charges , 1977, Oper. Res..

[55]  Robert A. Russell,et al.  Technical Note - An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions , 1977, Oper. Res..

[56]  Bezalel Gavish,et al.  Note---A Note on “The Formulation of the M-Salesman Traveling Salesman Problem” , 1976 .

[57]  Jan Karel Lenstra,et al.  Some Simple Applications of the Travelling Salesman Problem , 1975 .

[58]  Mandell Bellmore,et al.  Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem , 1974, JACM.

[59]  C. S. Orloff.  Routing a fleet of M vehicles to/from a central facility , 1974, Networks.

[60]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[61]  J. Svestka,et al.  Computational Experience with an M-Salesman Traveling Salesman Algorithm , 1973 .

[62]  Andrew B. Whinston,et al.  Computer-Assisted School Bus Scheduling , 1972 .

[63]  S. Gorenstein.  Printing Press Scheduling for Multi-Edition Periodicals , 1970 .

[64]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[65]  William J. Cook,et al.  Solution of a Large-Scale Traveling-Salesman Problem , 1954, 50 Years of Integer Programming.