Heuristics for the Mixed Rural Postman Problem

Computers and Operations Research

Volumn 27, Issue 2, 2000, Pages 183-203

  Corberán, Angel ^a   Martí, Rafael ^a   Romero, Antonio ^a  

^a UNIVERSITY OF VALENCIA   (Spain)

Author keywords

Arc routing; Metaheuristics; Postman problems; Tabu search

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; CRITICAL PATH ANALYSIS; HEURISTIC METHODS; STATISTICAL METHODS;

ARC ROUTING; METAHEURISTICS; MIXED RURAL POSTMAN PROBLEMS; TABU SEARCH METHODS;

OPERATIONS RESEARCH;

METHODOLOGY; PLANNING METHOD; TRANSPORTATION PLANNING;

EID: 0034141693     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(99)00031-3     Document Type: Article

References (22)

1. Edmonds J, Johnson EL. Matching, euler tours and the chinese postman problem. Mathematical Programming 1973;5:88-124.
2. Papadimitriou CH. On the complexity of edge traversing. Journal of ACM 1976;23:544-54.
3. Frederickson GN. Approximation algorithms for some postman problems. Journal of ACM 1979;26:538-54.
4. Pearn WL, Liu CM. Algorithms for the chinese postman problem on mixed networks. Computers & Operations Research 1995;22:479-89.
5. Grötschel M, Win Z. A cutting plane algorithm for the Windy postman problem. Mathematical Programming 1992;55:339-58.
6. Nobert Y, Picard JC. An optimal algorithm for the mixed chinese postman problem. Networks 1996;27:95-108.
7. Lenstra JK, Rinnooy Kan AHG. On general routing problems. Networks 1976;6:273-80.
8. Pearn WL, Wu TC. Algorithms for the rural postman problem. Computers & Operations Research 1995;22:819-28.
9. Hertz A, Laporte G, Nanchen P. Improvement procedures for the undirected rural postman problem. Informs Journal on Computing, in press.
10. Corberán A, Sanchis JM. A polyhedral approach to the rural postman problem. European Journal of Operational Research 1994;79:95-114.
11. Corberán A, Sanchis JM. The general routing problem polyhedron: Facets from RPP and GTSP polyhedra. European Journal of Operational Research 1998;108:538-50.
12. Letchford AN. New inequalities for the general routing problem. European Journal of Operational Research 1997;96:317-22.
13. Eiselt HA, Gendreau M, Laporte G. Arc routing problems, part I: The chinese postman problem. Operations Research 1995;43:231-42.
14. Eiselt HA, Gendreau M, Laporte G. Arc routing problems, part II: The rural postman problem. Operations Research 1995;43:399-414.
15. Assad AA, Golden BL. Arc routing methods and applications. In: Ball M et al., editors. Network Routing. Handbooks in OR and MS, vol. 8. Amsterdam: North-Holland, 1995.
16. Alvarez-Valdés R, Benavent E, Campos V, Corberán A, Mota E, Tamarit JM, Valls V. Arc, a computerised system for urban garbage collection. TOP (Journal of the Spanish OR Society) 1993;1:89-106.
17. Christofides N, Benavent E, Campos V, Corberán A, Mota E. An optimal method for the mixed postman problem. In: Thoft-Christensen P, editor. System Modelling and Optimization, Lecture Notes in Control and Information Sciences, vol. 59. Berlin: Springer, 1984.
18. Christofides N, Campos V, Corberán A, Mota E. An algorithm for the rural postman problem on a directed graph. Mathematical Programming Study 1986;26:155-66.
19. Ford LR, Fulkerson DR. Flows in Networks. Princeton, NJ: Princeton University Press, 1962.
20. Glover F, Laguna M. Tabu Search. Dordrecht: Kluwer Academic, 1997.
21. Corberán A, Romero A, Sanchis JM. Facets of the mixed rural postman problem polyhedron. Communication Presented at the EURO/INFORMS Conference. Barcelona, July 1997.
22. Padberg MW, Rao MR. Odd minimum cut-sets and b-matchings. Mathematics and Operations Research 1982;7:67-80.