Improvement procedures for the undirected rural postman problem

INFORMS Journal on Computing

Volumn 11, Issue 1, 1999, Pages 53-62

  Hertz, Alain ^a   Laporte, Gilbert ^b   Hugo, Pierrette Nanchen ^c  

^a EPFL   (Switzerland)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

^c Centrale de Compensation   (Switzerland)

Author keywords

Heuristics; Undirected rural postman problem; Vehicle routing

Indexed keywords

EID: 0003112831     PISSN: 10919856     EISSN: None     Source Type: Journal    
DOI: 10.1287/ijoc.11.1.53     Document Type: Article

References (15)

1. A.A. ASSAD and B.L. GOLDEN, 1995. Arc Routing Methods and Applications. In Network Routing, Handbooks in Operations Research and Management Science, M.O. Ball, T.L. Magnanti, C.L. Monma, and G.L. Nemhauser (eds.). North-Holland, Amsterdam, 375-483.
2. N. CHRISTOFIDES, 1976. Worst-Case Analysis of a New Heuristic for the Traveling Salesman Problem. Report No. 388, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA.
3. N. CHRISTOFIDES, V. CAMPOS, A. CORBERAN, and E. MOTA, 1981. An Algorithm for the Rural Postman Problem. Imperial College Report IC.O.R.81.5, London.
4. A. CORBERAN, 1998. Private communication.
5. A. CORBERAN and J.M. SANCHIS, 1991. On the General Routing Problem Polyhedron: Facets from the GTSP and RPP Polyhedra. Working Paper, Departamento de Estadística e Investigación Operativa, Universidad de Valencia, Spain.
6. A. CORBERAN and J.M. SANCHIS, 1994. A Polyhedral Approach to the Rural Postman Problem. European Journal of Operational Research 79, 95-114.
7. G.A. CROES, 1958. A Method for Solving Traveling-Salesman Problems. Operations Research 6, 791-812.
8. J. EDMONDS and E.L. JOHNSON, 1973. Matching, Euler Tours and the Chinese Postman Problem. Mathematical Programming 5, 88-124.
9. H.A. EISELT, M. GENDREAU, and G. LAPORTE, 1995. Arc Routing Problems, Part II: The Rural Postman Problem. Operations Research 43, 399-414.
10. G.N. FREDERICKSON, 1979. Approximation Algorithms for Some Postman Problems. SIAM Journal on Computing 7, 178-193.
11. M. GENDREAU, A. HERTZ, and G. LAPORTE, 1992. New Insertion and Postoptimization Procedures for the Traveling Salesman Problem. Operations Research 40, 1086-1094.
12. A. HERTZ, G. LAPORTE, and M. MITTAZ, 1999. A Tabu Search Heuristic for the Capacitated Arc Routing Problem. Operations Research, in press.
13. J.K. LENSTRA and A.H.G. RINNOOY KAN, 1976. On General Routing Problems. Networks 6, 273-280.
14. S. LIN, 1965. Computer Solutions of the Traveling Salesman problem. Bell System Technical Journal 44, 2245-2269.
15. J.M. SANCHIS, 1990. El Poliedro del Problema del Cartero Rural. Ph.D. Thesis, Universidad de Valencia, Spain.