Skip to main content
Article thumbnail
Location of Repository

The two-period travelling salesman problem applied to milk collection in Ireland

By Martin Butler, H. Paul Williams and Leslie-Ann Yarrow

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 ldquopoolrdquo 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 are given

Topics: HD Industries. Land use. Labor, QA Mathematics
Publisher: Springer
Year: 1997
DOI identifier: 10.1023/A:1008608828763
OAI identifier: oai:eprints.lse.ac.uk:31593
Provided by: LSE Research Online
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://www.springer.com/mathem... (external link)
  • http://eprints.lse.ac.uk/31593... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.