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
β¦ LIBER β¦
Reoptimizing the rural postman problem
β Scribed by Archetti, C.; Guastaroba, G.; Speranza, M.G.
- Book ID
- 118747155
- Publisher
- Elsevier Science
- Year
- 2013
- Tongue
- English
- Weight
- 292 KB
- Volume
- 40
- Category
- Article
- ISSN
- 0305-0548
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
On crossings, the Crossing Postman Probl
β
Garfinkel, Robert S.; Webb, Ian R.
π
Article
π
1999
π
John Wiley and Sons
π
English
β 125 KB
π 1 views
Privatized rural postman problems
β
JuliΓ‘n ArΓ‘oz; Elena FernΓ‘ndez; Cristina Zoltan
π
Article
π
2006
π
Elsevier Science
π
English
β 250 KB
Algorithms for the rural postman problem
β
W.L. Pearn; T.C. Wu
π
Article
π
1995
π
Elsevier Science
π
English
β 668 KB
The rural postman problem with deadline
β
A.N. Letchford; R.W. Eglese
π
Article
π
1998
π
Elsevier Science
π
English
β 694 KB
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
Arc Routing Problems, Part II: The Rural
β
H. A. Eiselt, Michel Gendreau and Gilbert Laporte
π
Article
π
1995
π
INFORMS
π
English
β 639 KB
The Directed Rural Postman Problem with
β
Benavent, E.; Soler, D.
π
Article
π
1999
π
INFORMS
π
English
β 134 KB