The rural postman problem with deadline classes |
| |
| Affiliation: | 1. Arctic Geology Department, The University Centre in Svalbard, UNIS, Norway;2. Snow Scan Research, Engineering, Education GmbH, Stadlauerstrasse 31, 1220 Vienna, Austria;3. Department of Civil Engineering and Natural Hazards, BOKU - University of Natural Resources and Applied Life Sciences, Peter Jordan Strasse 82, A-1190 Vienna, Austria;1. Electrical Engineering and Computer Science, York University, Canada;2. Microsoft Research, Redmond, WA, USA |
| |
| 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. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
