Abstract
We describe a new extension to the Symmetric Travelling Salesman Problem (STSP) in which some nodes are visited inboth of 2 periods and the remaining nodes are visited in either 1 ofthe periods. A number of possible Integer Programming Formulationsare given. Valid cutting plane inequalities are defined for thisproblem which result in an, otherwise prohibitively difficult, modelof 42 nodes becoming easily solvable by a combination of cuts andBranch-and-Bound. Some of the cuts are entered in a “pool” andonly used when it is automatically verified that they are violated.Other constraints which are generalisations of the subtour and combinequalities for the single period STSP, are identified manuallywhen needed. Full computational details of solution process aregiven.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. Balas, "The prize collecting travelling salesman problem," Networks, vol. 19, pp. 621–636, 1989.
P. Bauer, "The circuit polytope: Facets," Report no. 94, p. 153, University of Köln, 1994.
M. Fischetti, J.J. Salazar, and P. Toth, "The symmetric generalised travelling salesman polytope," Technical Report DEIS, University of Bologna, 1994.
M. Fischetti, J.J. Salazar, and P. Toth, "A branch-and-cut algorithm for the symmetric generalised travelling salesman problem," Technical Report DEIS, University of Bologna, 1994.
M. Grötschel and M.W. Padberg, "On the symmetric travelling salesman problem I: Inequalities," Mathematical Programming, vol. 16, pp. 265–280, 1979.
A.H. Land, "The solution of 100-city symmetric travelling salesman problems," Research Project, London School of Economics, 1979.
E.L. Lawler, J.K. Lenstra, A.H. Rinnooy Kan, and D.B. Shmoys (Eds.), The Travelling Salesman Problem: A Guided Tour of Combinatorial Optimisation, Wiley: Chichester, 1985.
P. Miliotis, "Integer programming approaches to the travelling salesman problem," Mathematical Programming, vol. 10, pp. 367–378, 1976.
P. Miliotis, "Using cutting planes to solve the symmetric travelling salesman problem," Mathematical Programming, vol. 15, pp. 177–178, 1978.
G. Nemhauser and L. Wolsey, Integer Programming and Combinatorial Optimisation, Wiley, 1988.
M.W. Padberg and G. Rinaldi, "Optimisation of a 532-city symmetric travelling salesman problem by branch and cut," Operations Research Letters, vol. 6, pp. 1–7, 1987.
G. Rinaldi and L.A. Yarrow, Optimising a 48-City Travelling Salesman Problem: A Case Study in Combinatorial Problem Solving, preprint R122, IASI-CNR: Rome, 1989.
. XPRESS-MP Reference Manual, Dash Associates, Blisworth House, Church Lane, Blisworth, Northants NN7 3BX, UK, 1993.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Butler, M., Williams, H.P. & Yarrow, LA. The Two-Period Travelling Salesman Problem Applied to Milk Collection in Ireland. Computational Optimization and Applications 7, 291–306 (1997). https://doi.org/10.1023/A:1008608828763
Issue Date:
DOI: https://doi.org/10.1023/A:1008608828763