A constructive heuristic for the Undirected Rural Postman Problem

Computers and Operations Research

Volumn 33, Issue 12, 2006, Pages 3450-3457

  Ghiani, Gianpaolo ^a   Laganà, Demetrio ^b   Musmanno, Roberto ^b  

^a UNIVERSITY OF SALENTO   (Italy)

^b UNIVERSITY OF CALABRIA   (Italy)

Author keywords

Arc routing; Heuristics; Rural Postman Problem

Indexed keywords

BENCHMARKING; HEURISTIC PROGRAMMING; ITERATIVE METHODS; OPTIMIZATION;

ARC ROUTING; HEURISTICS; RURAL POSTMAN PROBLEM;

PROBLEM SOLVING;

EID: 33645132522     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2005.02.014     Document Type: Article

References (14)

1. M. Grötschel, M. Jünger, and G. Reinelt Optimal control of plotting and drilling machines: a case study Z Operations Research 35 1991 61 84
2. G. Ghiani, and G. Improta The Laser-plotter beam routing problem Journal of the Operational Research Society 52 2001 945 951
3. H.A. Eiselt, M. Gendreau, and G. Laporte Arc routing problems, part 1: the Chinese postman problem Operations Research 43 1995 231 242
4. H.A. Eiselt, M. Gendreau, and G. Laporte Arc routing problems, part 2: the rural postman problem Operations Research 43 1995 399 414
5. A.A. Assad, and B.L. Golden Arc routing methods and applications M.O. Ball T.L. Magnanti C.L. Monma G.L. Nemhauser Handbook of operations research and management science: networks 1995 North-Holland Amsterdam 375 483
6. Christofides N, Campos V, Corberán A, Mota E. An algorithm for the rural postman problem, Imperial College Report IC.O.R.81.5; 1981.
7. A. Corberán, and J.M. Sanchis A polyhedral approach to the rural postman problem. European Journal of Operational Research 79 1994 95 114
8. A.N. Letchford New inequalities for the general routing problem European Journal of Operational Research 96 1997 317 322
9. G. Ghiani, and G. Laporte A branch-and-cut algorithm for the undirected rural postman problem Mathematical Programming 87 2000 467 481
10. E. Fernandez, R. Garfinkel, O. Meza, and M. Ortega On the undirected rural postman problem: tight bounds based on a new formulation Operations Research 51/2 2003 281 291
11. G.N. Frederickson Approximation algorithms for some postman problems SIAM Journal on Computing 7 1979 178 193
12. W.L. Pearn, and T.C. Wu Algorithms for the rural postman problem Computers and Operations Research 22 1995 819 828
13. A. Hertz, G. Laporte, and P. Nanchen-Hugo Improvement procedures for the undirected rural postman problem INFORMS Journal on Computing 11 1999 53 62
14. J. Edmonds Maximum matching and a polyhedron with 0,1-vertices Journal Res. Nat. Bureau Standards B69B 1965 125 130