New heuristics and lower bounds for the Min-Max k-chinese postman problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2461, Issue , 2002, Pages 64-74

  Ahr, Dino ^a   Reinelt, Gerhard ^a  

^a UNIVERSITY OF HEIDELBERG   (Germany)

Author keywords

Arc routing; Chinese postman problem; Heuristics; Lower bounds; Min Max optimization

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ARC ROUTING; CHINESE POSTMAN PROBLEM; HEURISTICS; LOWER BOUNDS; MIN-MAX OPTIMIZATION;

HEURISTIC ALGORITHMS;

EID: 33845661806     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45749-6_10     Document Type: Conference Paper

References (22)

1. D. Applegate, W. Cook, S. Dash, and A. Rohe. Solution of a Min-Max Vehicle Routing Problem. INFORMS Journal on Computing, 14(2):132-143, 2002. 65
2. A. A. Assad and B. L. Golden. Arc Routing Methods and Applications. In M. G. Ball, T. L. Magnanti, C. L. Monma, and G. L. Nemhauser, editors, Network Routing, volume 8 of Handbooks in Operations Research and Management Science, chapter 5, pages 375-483. Elsevier, 1995. 65
3. E. Benavent, V. Campos, A. Corberan, and E. Mota. The Capacitated Arc Routing Problem: Lower Bounds. Networks, 22:669-690, 1992. 65, 71, 72
4. N. Christofides. The Optimum Traversal of a Graph. Omega, 1:719-732, 1973. 65
5. N. Christofides, V. Campos, A. Corberan, and E. Mota. An Algorithm for the Rural Postman Problem. Technical Report I. C. O. R. 81.5, Imperial College, 1981. 71, 72
6. A. Corberan, A. Letchford, and J. M. Sanchis. A Cutting Plane Algorithm for the General Routing Problem. Mathematical Programming Series A, 90(2):291-316, 2001. 71
7. A. Corberan and J. M. Sanchis. A polyhedral approach to the rural postman problem. European Journal of Operational Research, 79:95-114, 1994. 71
8. M. Dror. Arc Routing: Theory, Solutions and Applications. Kluwer Academic Publishers, 2000. 65
9. J. Edmonds and E. L. Johnson. Matching, Euler Tours and the Chinese Postman. Mathematical Programming, 5:88-124, 1973. 67, 68
10. H. A. Eiselt, M. Gendreau, and G. Laporte. Arc routing problems I: The Chinese Postman Problem. Operations Research, 43(2):231-242, 1995. 65
11. H. A. Eiselt, M. Gendreau, and G. Laporte. Arc routing problems II: The Rural Postman Problem. Operations Research, 43(3):399-414, 1995. 65
12. G. N. Frederickson, M. S. Hecht, and C. E. Kim. Approximation Algorithms for some routing problems. SIAM Journal on Computing, 7(2):178-193, May 1978. 64, 67
13. B. L. Golden, J. S. DeArmon, and E. K. Baker. Computational experiments with algorithms for a class of routing problems. Computers & Operations Research, 10(1):47-59, 1983. 71, 72
14. B. L. Golden and R. T. Wong. Capacitated arc routing problems. Networks, 11:305-315, 1981. 65, 67
15. T. Gonzalez. Clustering to minimize the maximum intercluster distance. Theoretical Computer Science, 38:293-306, 1985. 68
16. M. Guan. Graphic Programming using odd and even points. Chinese Mathematics, 1:273-277, 1962. 67
17. A. Hertz, G. Laporte, and M. Mittaz. A Tabu Search Heuristic for the Capacitated Arc Routing Problem. Operations Research, 48(1):129-135, 2000. 65
18. A. Hertz, G. Laporte, and P. Nanchen Hugo. Improvement Procedures for the Undirected Rural Postman Problem. INFORMS Journal on Computing, 11(1):53-62, 1999. 65
19. A. Hertz and M. Mittaz. Heuristic Algorithms. In M. Dror, editor, Arc Routing: Theory, Solutions and Applications, chapter 9, pages 327-386. Kluwer Academic Publishers, 2000. 65
20. L. Y. O. Li. Vehicle Routeing for Winter Gritting. PhD thesis, Department of Management Science, Lancaster University, 1992. 71
21. L. Y. O. Li and R. W. Eglese. An Interactive Algorithm for Vehicle Routeing for Winter-Gritting. Journal ofthe Operational Research Society, 47:217-228, 1996. 71, 72
22. W. L. Pearn. Solvable cases of the fc-person Chinese postman problem. Operations Research Letters, 16(4):241-244, 1994. 65