Savings based ant colony optimization for the capacitated minimum spanning tree problem

Computers and Operations Research

Volumn 33, Issue 6, 2006, Pages 1794-1822

  Reimann, Marc ^a   Laumanns, Marco ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Ant colony Optimization; Capacitated minimum spanning tree problem

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; HEURISTIC METHODS; OPTIMIZATION; SET THEORY; TREES (MATHEMATICS);

ANT COLONY OPTIMIZATION; CAPACITATED MINIMUM SPANNING TREE PROBLEM; POLYNOMIAL TIME; PRIM'S ALGORITHM;

PROBLEM SOLVING;

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

References (45)

1. B. Gavish Topological design of telecommunication networks - local access design methods Annals of Operations Research 33 1991 17 71
2. M.R. Garey, and D.S. Johnson Computers and intractability a guide to the theory of NP-completeness 1979 W.H. Freeman New York
3. M. Dorigo, and T. Stuetzle Ant colony optimization 2004 MIT Press/Bradford Books Cambridge, MA
4. M. Dorigo, V. Maniezzo, and A. Colorni The ant system optimization by a colony of cooperating agents IEEE Transactions on Systems, Man, and Cybernetics - Part B 26 1 1996 29 41
5. B. Bullnheimer, R.F. Hartl, and C. Strauss A new rank-based version of the ant system a computational study Central European Journal of Operations Research 7 1 1999 25 38
6. B. Bullnheimer, R.F. Hartl, and C. Strauss Applying the ant system to the vehicle routing problem S. Voss Meta-heuristics advances and trends in local search paradigms for optimization 1999 Kluwer Boston
7. M. Dorigo, and L.M. Gambardella Ant colony system a cooperative learning approach to the traveling salesman problem IEEE Transactions on Evolutionary Computation 1 1997 53 66
8. L.M. Gambardella, E. Taillard, and G. Agazzi Ant colonies for vehicle routing problems D. Corne New ideas in optimization 1999 McGraw-Hill New York
9. M. Reimann, M. Stummer, and K.F. Doerner A savings based ant system for the vehicle routing problem Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2002) 2002 Morgan Kaufman Publishers Los Altos, CA 1317 1325
10. M. Reimann, K.F. Doerner, and R.F. Hartl D-ants savings based ants divide and conquer the VRP Computers and Operations Research 31 4 2004 563 591
11. T. Stuetzle, and H. Hoos MAX-MIN ant system Future Generation Computing Systems 16 8 2000 889 914
12. W.J. Gutjahr A graph-based ant system and its convergence Future Generation Computing Systems 16 8 2000 873 888
13. W.J. Gutjahr ACO algorithms with guaranteed convergence to the optimal solution Information Processing Letters 82 2002 145 153
14. T. Stuetzle, and M. Dorigo A short convergence proof for a class of ACO algorithms IEEE Transactions on Evolutionary Computation 6 4 2002 358 365
15. J.B. Kruskal On the shortest spanning subtree of a graph and the traveling salesman problem Proceedings of the American Mathematical Society 7 1956 48 50
16. R.C. Prim Shortest connection networks and some generalizations Bell Systems Technology Journal 36 1957 1389 1401
17. B. Gavish Formulations and algorithms for the capacitated minimal directed tree problem Journal of the Association for Computing Machinery 30 1 1983 118 132
18. L. Gouveia A 2n constraint formulation for the capacitated minimal spanning tree problem Operations Research 43 1 1995 130 141
19. B. Gavish Topological design of centralized computer networks - formulations and algorithms Networks 12 1982 355 377
20. L. Gouveia, and M.J. Lopes Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs European Journal of Operational Research 121 2000 394 411
21. A. Amberg, W. Domschke, and S. Voss Capacitated minimum spanning trees algorithms using intelligent search Combinatorial Optimization: Theory and Practice 1 1 1996 9 39
22. L. Gouveia, and P. Martins The capacitated minimum spanning tree problem an experiment with a hop-indexed model Annals of Operations Research 86 1999 271 294
23. L. Gouveia, and P. Martins A hierarchy of hop-indexed models for the capacitated minimum spanning tree problem Networks 35 1 2000 1 16
24. R. Fukasawa, M. Poggi de Aragao, O. Porto, and E. Uchoa Robust branch-and-cut-and-price for the capacitated minimum spanning tree problem Proceedings of the international network optimization conference Evry, France 2003 231 236
25. Y.M. Sharaiha, M. Gendreau, G. Laporte, and I.H. Osman A tabu search algorithm for the capacitated shortest spanning tree problem Networks 29 1997 161 171
26. R. Patterson, H. Pirkul, and E. Rolland A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem Journal of Heuristics 5 1999 159 180
27. L.R. Esau, and K.C. Williams On teleprocessing system design. Part II - A method for approximating the optimal network IBM Systems Journal 5 3 1966 142 147
28. G.R. Raidl, and C. Drexel A predecessor coding in an evolutionary algorithm for the capacitated minimum spanning tree problem Proceedings of Late Breaking Papers at the Genetic and Evolutionary Computation Conference (GECCO 2000) 2000 Las Vegas 309 316
29. R.K. Ahuja, J.B. Orlin, and D. Sharma Multi-exchange neighborhood search algorithms for the capacitated minimum spanning tree problem Mathematical Programming 91 2001 71 97
30. R.K. Ahuja, J.B. Orlin, and D. Sharma A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem Operations Research Letters 31 2003 185 194
31. Thompson PM, Orlin JB. The theory of cyclic transfers. Working Paper OR 200-89, OR Center. Cambridge, MA: MIT; 1989.
32. P.M. Thompson, and H.N. Psaraftis Cyclic transfer algorithms for multi-vehicle routing and scheduling problems Operations Research 41 1993 935 946
33. M. de Souza, C. Duhamel, and C. Ribeiro A GRASP heuristic for the capacitated minimum spanning tree problem using a memory-based local search strategy M. Resende J. Souza Metaheuristics computer decision-making 2003 Kluwer Boston
34. Reimann M, Laumanns M. A hybrid ACO algorithm for the Capacitated minimum spanning tree problem. In: Blum C et al., editors. Proceedings of first International workshop on hybrid metaheuristics (HM2004); 2004. p. 1-10.
35. G. Clarke, and J.W. Wright Scheduling of vehicles from a central depot to a number of delivery points Operations Research 12 1964 568 581
36. I.H. Osman Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem Annals of Operations Research 41 1993 421 451
37. C. Blum, and M. Dorigo The hyper-cube framework for ant colony optimization IEEE Transactions on Systems, Man and Cybernetics B 34 2 2004 1161 1772
38. Reimann M, Laumanns M. A hybrid ACO algorithm for the capacitated minimum spanning tree problem. Proceedings of ECAI2004, Workshop on hybrid metaheuristics, Valencia, Spain; 2004, to appear.
39. Dongarra JJ. Performance of various computers using standard linear equations software, (Linpack benchmark report). Computer science technical report CS-89-85, University of Tennessee; 2004.
40. L. Hall Experience with a cutting plane algorithm for the capacitated spanning tree problem INFORMS Journal on Computing 8 3 1996 219 234
41. N. Christofides, A. Mingozzi, and P. Toth The vehicle routing problem N. Christofides Combinatorial optimization 1979 Wiley Chicester
42. C.E. Bonferroni Teoria statistica delle classi e calcolo delle probabilità Pubblicazioni del R Istituto Superiore di Scienze Economiche e Commerciali di Firenze 8 1936 3 62
43. S. Holm A simple sequentially rejective multiple test procedure Scandinavian Journal of Statistics 6 1979 65 70
44. Taillard ED. A statistical test for comparing success rates. Extended abstract MIC'03, Kyoto, Japan: 2003.
45. Martins P. Personal communication.