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-2217
Full text not available from this repository.
Official URL: https://doi.org/10.1016/S0377-2217(97)00090-8
Abstract
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.
Item Type:
Journal Article
Journal or Publication Title:
European Journal of Operational Research
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/aacsb/disciplinebasedresearch
Subjects:
Departments:
ID Code:
43242
Deposited By:
Deposited On:
11 Jul 2011 17:55
Refereed?:
Yes
Published?:
Published
Last Modified:
16 Sep 2023 00:31