Algorithms for the rural postman problem
β Scribed by W.L. Pearn; T.C. Wu
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 668 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0305-0548
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The Rural Postman Problem (RPP), on an undirected network, is a classic edge-routing problem. The Crossing Postman Problem is a generalization which is introduced here. Results are presented on the structure of optimal solutions to both problems. A new formulation for RPP, based on these results, is
Vehicle routing problems with general time windows are extremely difficult to solve, tlowever, 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