Library Header Image
LSE Research Online LSE Library Services

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

Butler, Martin, Williams, H. Paul and Yarrow, Leslie-Ann (1997) The two-period travelling salesman problem applied to milk collection in Ireland. Computational Optimization and Applications, 7 (3). pp. 291-306. ISSN 0926-6003

Full text not available from this repository.
Identification Number: 10.1023/A:1008608828763


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.

Item Type: Article
Official URL:
Additional Information: © 1997 Kluwer Academic Publishers
Divisions: Management
Subjects: H Social Sciences > HD Industries. Land use. Labor
Q Science > QA Mathematics
Date Deposited: 24 Jan 2011 10:45
Last Modified: 15 May 2024 23:39

Actions (login required)

View Item View Item