A tabu search algorithm for the min-max k-Chinese postman problem

Computers and Operations Research

Volumn 33, Issue 12, 2006, Pages 3403-3422

  Ahr, Dino ^a   Reinelt, Gerhard ^a  

^a UNIVERSITY OF HEIDELBERG   (Germany)

Author keywords

Arc routing; Chinese postman problem; Min max optimization; Tabu search

Indexed keywords

GRAPH THEORY; HEURISTIC PROGRAMMING; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; ROADS AND STREETS;

ARC ROUTING; CHINESE POSTMAN PROBLEM; MIN-MAX OPTIMIZATION; TABU SEARCH;

ALGORITHMS;

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

References (45)

1. G.N. Frederickson, M.S. Hecht, and C.E. Kim Approximation algorithms for some routing problems SIAM Journal on Computing 7 2 1978 178 193
2. Ahr D, Reinelt G. New heuristics and lower bounds for the min-max k-Chinese postman problem. In: Möring R, Raman R, editors. Algorithms - ESA 2002, 10th Annual European Symposium, Rome, Italy, September 17-21, 2002.
3. Proceedings, Lecture notes in computer science, vol. 2461. Berlin: Springer; 2002. p. 64-74.
4. F. Glover Heuristic for integer programming using surrogate constraints Decision Science 8 1977 156 166
5. F. Glover Future paths for integer programming and links to artificial intelligence Computers & Operations Research 13 1986 533 549
6. F. Glover Tabu search, Part I ORSA Journal on Computing 1 1990 190 219
7. F. Glover Tabu search, Part II ORSA Journal on Computing 2 1991 4 32
8. F. Glover, and M. Laguna Tabu search C. Reeves Modern heuristic techniques for combinatorial problems 1993 Blackwell Scientific Publications Oxford 70 150
9. Reeves C, editor. Modern heuristic techniques for combinatorial problems. Oxford: Blackwell Scientific Publications; 1993.
10. Aarts E, Lenstra JK, editors. Local search in combinatorial optimization. New York: Wiley, 1997.
11. Gendreau M, Laporte G, Potvin J-Y. Metaheuristics for the capacitated VRP. In: Toth P, Vigo D, editors. The vehicle routing problem, SIAM monographs on discrete mathematics and applications. Philadelphia, PA: SIAM; 2002. p. 129-54 [Chapter 6].
12. Willard JAG. Vehicle routing using r-optimal tabu search. Master's thesis, The Management School, Imperial College, London, 1989.
13. S. Lin Computer solutions of the traveling salesman problem Bell System Technical Journal 44 1965 2245 2269
14. Pureza VM, França PM. Vehicle routing problems via tabu search metaheuristic. Technical Report CRT-347, Centre for Research on Transportation, Montreal, Canada, 1991.
15. I.H. Osman Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem Annals of Operations Research 41 1993 421 451
16. M. Gendreau, A. Hertz, and G. Laporte A tabu search heuristic for the vehicle routing problem Management Science 40 1994 1276 1290
17. M. Gendreau, A. Hertz, and G. Laporte New insertion and postoptimization procedures for the traveling salesman problem Operations Research 40 1992 1086 1094
18. É.D. Taillard Parallel iterative search methods for vehicle routing problems Networks 23 1993 661 673 The CVRP with distance constraint is also considered
19. A. Volgenant, and R. Jonker The symmetric traveling salesman problem and edge exchange in minimal 1-trees European Journal of Operational Research 12 1983 394 403
20. Y. Rochat, and É.D. Taillard Probabilistic diversification and intensification in local search for vehicle routing Journal of Heuristics 1 1995 147 167
21. Toth P, Vigo D. The granular tabu search (and its application to the vehicle routing problem). Technical Report OR/98/9, DEIS, Università di Bologna, Italy, 1998.
22. P.M. França, M. Gendreau, G. Laporte, and F.M. Müller The m-traveling salesman problem with minmax objective Transportation Science 29 3 1995 267 275
23. B.L. Golden, G. Laporte, and É.D. Taillard An adaptive memory heuristic for a class of vehicle routing problems with minmax objective Computers & Operations Research 24 1997 445 452
24. Li LYO. Vehicle routeing for winter-gritting. PhD thesis, Department of Management Science, Lancaster University, 1992.
25. R.W. Eglese Routeing winter gritting vehicles Discrete Applied Mathematics 48 3 1994 231 244
26. P. Greistorfer Computational experiments with heuristics for a capacitated arc routing problem U. Derigs A. Bachem A. Drexl Operations Research Proceedings, 1994 1994 Springer Berlin 185 190
27. A. Hertz, G. Laporte, and M. Mittaz A tabu search heuristic for the capacitated arc routing problem Operations Research 48 1 2000 129 135
28. A. Hertz, G. Laporte, and P. Nanchen Hugo Improvement procedures for the undirected rural postman problem INFORMS Journal on Computing 11 1 1999 53 62
29. A. Hertz, and M. Mittaz A variable neighborhood descent algorithm for the undirected capacitated arc routing problem Transportation Science 35 4 2001 425 434
30. N. Mldadenović, and P. Hansen Variable neighborhood search Computers & Operations Research 24 11 1997 1097 1100
31. Lacomme P, Prins C, Ramdane-Chérif W. A genetic algorithm for the capacitated arc routing problem and its extensions. In: Boers EJW editor. Applications of evolutionary computing, Lecture notes in computer science, vol. 2037. Berlin: Springer; 2001. p. 473-83.
32. Lacomme P, Prins C, Ramdane-Chérif W. Competitive memetic algorithms for arc routing problems. Research Report losi-2001-01, University of Technology of Troyes, France, 2001. Annals of Operations Research, to appear.
33. P. Greistorfer A tabu scatter search metaheuristic for the arc routing problem Computers and Industrial Engineering 44 2 2003 249 266
34. P. Beullens, L. Muyldermans, D. Cattrysse, and D. Van Oudheusden A guided local search heuristic for the capacitated arc routing problem European Journal of Operational Research 147 3 2003 629 643
35. Muyldermans L, Beullens P, Cattrysse D, Van Oudheusden D. The k-opt approach for the general routing problem. Technical Report, Center for Industrial Management, Katholieke Universiteit Leuven, 2001. Working Paper 01/18.
36. E. Dijkstra A note on two problems in connexion with graphs Numerische Mathematik 1 1959 269 271
37. R.W. Floyd Algorithm 97: shortest path Communications of the ACM 5 6 1962 345
38. J.K. Lenstra, and A.H.G. Rinnooy-Kan On the general routing problem Networks 6 1976 273 280
39. J. Edmonds, and E.L. Johnson Matching, Euler tours and the Chinese postman Mathematical Programming 5 1973 88 124
40. Christofides N, Campos V, Corberán A, Mota E. An algorithm for the rural postman problem. Technical Report I.C.O.R. 81.5, Imperial College, 1981.
41. A. Corberán, and J.M. Sanchis A polyhedral approach to the rural postman problem European Journal of Operational Research 79 1994 95 114
42. A. Corberán, A. Letchford, and J.M. Sanchis A cutting plane algorithm for the general routing problem Mathematical Programming Series A 90 2 2001 291 316
43. E. Benavent, V. Campos, A. Corberán, and E. Mota The capacitated arc routing problem: lower bounds Networks 22 1992 669 690
44. 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 1983 47 59
45. L.Y.O. Li, and R.W. Eglese An interactive algorithm for vehicle routeing for winter-gritting Journal of the Operational Research Society 47 1996 217 228