A New Multiperiod Multiple Traveling Salesman Problem with Heuristic and Application to a Scheduling Problem

A new multiperiod variation of the M-traveling salesman problem is introduced. The problem arises in efficient scheduling of optimal interviews among tour brokers and vendors at conventions of the tourism and travel industry. In classical traveling salesman problem vocabulary, a salesman is a tour broker at the convention and a city is a vendor's booth. In this problem, more than one salesman may be required to visit a city, but at most one salesman per time period can visit each city. The heuristic solution method presented is polynomial and is guaranteed to produce a nonconflicting set of salesmen's tours. The results of an implementation of the method for a recent convention are also reported.

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

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

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

[4]  George L. Nemhauser,et al.  The Traveling Salesman Problem: A Survey , 1968, Oper. Res..

[5]  Stephen C. Graves,et al.  Technical Note - An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem , 1980, Oper. Res..

[6]  Mandell Bellmore,et al.  Pathology of Traveling-Salesman Subtour-Elimination Algorithms , 1971, Oper. Res..

[7]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

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

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

[10]  J. Desrosiers,et al.  Lagrangian relaxation methods for solving the minimum fleet size multiple traveling salesman problem with time windows , 1988 .

[11]  Robert S. Garfinkel,et al.  Minimizing Wallpaper Waste, Part 1: A Class of Traveling Salesman Problems , 1977, Oper. Res..

[12]  Helmut Steckhan.  A Theorem on Symmetric Traveling Salesman Problems , 1970, Oper. Res..

[13]  A. Volgenant,et al.  Identification of non-optimal arcs for the travelling salesman problem , 1982, Oper. Res. Lett..

[14]  Richard M. Karp,et al.  The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..

[15]  D. Simchi-Levi,et al.  Heuristics and bounds for the travelling salesman location problem on the plane , 1987 .

[16]  Victor Klee,et al.  Combinatorial Optimization: What is the State of the Art , 1980, Math. Oper. Res..

[17]  Gerald G. Brown,et al.  Design and Implementation of Large-Scale Primal Transshipment Algorithms , 1976 .

[18]  Robert S. Garfinkel,et al.  The Bottleneck Traveling Salesman Problem: Algorithms and Probabilistic Analysis , 1978, JACM.

[19]  J. Beardwood,et al.  The shortest path through many points , 1959, Mathematical Proceedings of the Cambridge Philosophical Society.