Eglese, R. W. and Letchford, A. N. (1998) The rural postman problem with deadline classes. European Journal of Operational Research, 105 (3). pp. 390-400. ISSN 0377-2217Full text not available from this repository.
Vehicle routing problems with general time windows are extremely difficult to solve. However, the time windows in a particular problem may have a special structure which can be exploited. We consider a single-vehicle arc routing problem in which the arcs are partitioned into deadline classes. It is shown that a cutting-plane approach works well for this problem.
|Journal or Publication Title:||European Journal of Operational Research|
|Uncontrolled Keywords:||arc routing problems ; integer programming ; polyhedral combinatorics ; Rural postman problem ; Time windows ; Cutting-planes|
|Departments:||Lancaster University Management School > Management Science|
|Deposited On:||11 Jul 2011 18:55|
|Last Modified:||04 Nov 2015 03:15|
Actions (login required)