Corberan, A and Sanchis, J M and Letchford, A N (2001) A cutting plane algorithm for the general routing problem. Mathematical Programming, 90 (2). pp. 291-316. ISSN 0025-5610Full text not available from this repository.
The General Routing Problem (GRP) is the problem of finding a minimum cost route for a single vehicle, subject to the condition that the vehicle visits certain vertices and edges of a network. It contains the Rural Postman Problem, Chinese Postman Problem and Graphical Travelling Salesman Problem as special cases. We describe a cutting plane algorithm for the GRP based on facet-inducing inequalities and show that it is capable of providing very strong lower bounds and, in most cases, optimal solutions.
|Journal or Publication Title:||Mathematical Programming|
|Uncontrolled Keywords:||cutting planes ; General Routing Problem ; Rural Postman Problem ; Arc Routing|
|Departments:||Lancaster University Management School > Management Science|
|Deposited On:||11 Jul 2011 18:56|
|Last Modified:||04 Nov 2015 03:16|
Actions (login required)