A GRASP heuristic for the mixed Chinese postman problem

European Journal of Operational Research

Volumn 142, Issue 1, 2002, Pages 70-80

  Corberan A ^a   Marti R ^a   Sanchis, J M ^b  

^a UNIVERSITY OF VALENCIA   (Spain)

^b UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

Author keywords

Chinese postman; GRASP; Metaheuristics; Routing

Indexed keywords

ADAPTIVE ALGORITHMS; GRAPH THEORY; OPTIMIZATION; PROBLEM SOLVING;

ROUTING;

HEURISTIC METHODS;

EID: 0036793630     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(01)00296-X     Document Type: Article

References (25)

1. Assad A.A., Golden B.L. Arc routing methods and applications. Ball M.O., Magnanti T.L., Monma C.L., Nemhauser G.L. Network Routing. Handbooks of Operations Research and Management Science. vol. 8:1995;375-483 North-Holland, Amsterdam.
2. Benavent E., Corberán A., Sanchis J.M. Linear programming based methods for solving arc routing problems. Dror M. ARC Routing: Theory, Solutions and Applications. 2000;231-276 Kluwer Academic Publishers, Reading, MA.
3. Christofides N. The optimum traversal of a graph. Omega. 1(6):1973;719-732.
4. Christofides N., Benavent E., Campos V., Corberán A., Mota E. An optimal method for the mixed postman problem. Thoft-Christensen P. System Modelling and Optimization. Lecture Notes in Control and Information Sciences. vol. 59:1984;641-649 Springer, Berlin.
5. A. Corberán, A. Romero, J.M. Sanchis, The general routing problem on a mixed graph, Technical Paper, Department of Statistics and OR, University of Valencia, Spain, 1999.
6. Dror M. ARC Routing: Theory, Solutions and Applications. 2000;Kluwer Academic Publishers, Reading, MA.
7. Edmonds J., Johnson E.L. Matching Euler tours and the Chinese postman. Mathematical Programming. 5:1973;88-124.
8. Eglese R.W., Letchford A.N. Polyhedral theory for arc routing problems. Dror M. ARC Routing: Theory, Solutions and Applications. 2000;199-230 Kluwer Academic Publishers, Reading, MA.
9. Eiselt H.A., Gendreau M., Laporte G. Arc routing problems, Part 1: The Chinese postman problem. Operations Research. 43:1995;231-242.
10. Eiselt H.A., Gendreau M., Laporte G. Arc routing problems, Part 2: The rural postman problem. Operations Research. 43:1995;399-414.
11. Feo T., Resende M. A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters. 8:1989;67-71.
12. Feo T., Resende M. Greedy randomized adaptive search procedures. Journal of Global Optimization. 6:1995;109-133.
13. Ford L.R., Fulkerson D.R. Flows in Networks. 1962;Princeton University Press, Princeton, NJ.
14. Frederickson G.N. Approximation algorithms for some postman problems. Journal of the ACM. 26(3):1979;538-554.
15. Grötschel M., Win Z. A cutting-plane algorithm for the windy postman problem. Mathematical Programming. 55:1992;339-358.
16. Guan M. Graphic programming using odd or even points. Chinese Mathematics. 1:1962;237-277.
17. Hertz A., Mittaz M. Heuristic algorithms. Dror M. ARC Routing: Theory, Solutions and Applications. 2000;327-387 Kluwer Academic Publishers, Reading, MA.
18. Laguna M., Feo T., Elrod H. A greedy randomized adaptive search procedure for the 2-partition problem. Operations Research. 42(4):1994;677-687.
19. Liebling T.M. Graphentheorie in planungs - und tourenproblemen. Lecture Notes in Operations Research and Mathematical Systems. vol. 21:1970;Springer, Berlin.
20. Minieka E. Optimization Algorithms for Networks and Graphs. 1979;Marcel Dekker, New York.
21. Nobert Y., Picard J.C. An optimal algorithm for the mixed Chinese postman problem. Networks. 27:1996;95-108.
22. Padberg M.W., Rao M.R. Odd minimum cut-sets and b-matchings. Mathematics for Operations Research. 7:1982;67-80.
23. Papadimitriou C.H. On the complexity of edge traversing. Journal of the ACM. 23:1976;544-554.
24. Raghavachari B., Veerasamy J. Approximation algorithms for the mixed postman problem. Bixby R.E., Boyd E.A., Ríos-Mercado R.Z. Proceedings of 6th Integer Programming and Combinatorial Optimization. 1998;169-179 Springer, Berlin.
25. Resende M. Computing approximate solutions of the maximum covering problem with GRASP. Journal of Heuristics. 4:1998;161-177.