A biased random-key genetic algorithm for the capacitated minimum spanning tree problem

Computers and Operations Research

Volumn 57, Issue , 2015, Pages 95-108

  Ruiz, Efrain ^a   Albareda Sambola, Maria ^a   Fernández, Elena ^a   Resende, Mauricio G C ^b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

Biased random key genetic algorithm; Capacitated minimum spanning tree; Combinatorial optimization; Graphs; Heuristics; Networks; Optimization; Spanning trees; Trees

Indexed keywords

BENCHMARKING; CLUSTERING ALGORITHMS; COMBINATORIAL OPTIMIZATION; DECISION TREES; ENCODING (SYMBOLS); GENETIC ALGORITHMS; GRAPH ALGORITHMS; INTEGRATED CIRCUIT DESIGN; NETWORKS (CIRCUITS); OPTIMIZATION;

CAPACITATED MINIMUM SPANNING TREES; GRAPHS; HEURISTICS; RANDOM KEYS; SPANNING TREE; TREES;

TREES (MATHEMATICS);

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

References (55)

1. R.K. Ahuja, J.B. Orlin, and D. Sharma Multiexchange neighborhood structures for the capacitated minimum spanning tree problem Math Progr 91 2001 71 97
2. R.K. Ahuja, J.B. Orlin, and D. Sharma A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem Oper Res Lett 31 2003 185 194
3. A. Amberg, W. Domeschke, and S. Voss Capacitated minimum spanning trees algorithms using intelligent search Comb Optim Theory Pract 1 1996 9 33
4. A. Amberg, W. Domeschke, and S. Voss Multiple center capacitated arc routing problems a tabu search algorithm using capacitated trees Eur J Oper Res 124 2000 360 376
5. Araque JR, Hall LA, Magnanti TL. Capacitated trees, capacitated routing, and associated polyhedra. Technical report SOR-90-12, Program in Statistics and Operations Research. Princeton University, Princeton, NJ. 1990.
6. J.C. Bean Genetic algorithms and random keys for sequencing and optimization ORSA J Comput 6 1994 154 160
7. L.S. Buriol, M.G.C. Resende, C.C. Ribeiro, and M. Thorup A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing Networks 46 2005 36 56
8. L.S. Buriol, M.J. Hirsch, T. Querido, P.M. Pardalos, M.G.C. Resende, and M. Ritt A biased random-key genetic algorithm for road congestion minimization Optim Lett 4 2010 619 633
9. A. Chow, and W. Kershenbaum A unified algorithm for designing multidrop teleprocessing networks IEEE Trans Commun COM-22 1974 1762 1772
10. Christofides A. Worst case analysis of a new heuristic for the travelling salesman problem. Technical report 388, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA, 1976.
11. L.R. Esau, and K.C. Williams On teleprocessing system design, Part II a method for approximating the optimal network IBM Syst J 5 1966 142 147
12. G.N. Frederickson Approximation algorithms for some postman problems J Assoc Comput Mach 26 1979 538 554
13. G.N. Frederickson, M.S. Hecht, and K. Chul Approximation algorithms for some routing problems SIAM J Comput 7 1979 178 193
14. B. Gavish Topological design of centralized computer networks formulations and algorithms Networks 12 1982
15. B. Gavish Formulations and algorithms for the capacitated minimal directed tree problem J Assoc Comput Mach 30 1983 118 132
16. B. Gavish Augmented Lagrangean based algorithms for centralized network design IEEE Trans Commun 33 1985 1247 1257
17. Gavish B, Altinkemer K. Parallel savings heuristics for the topological design of local access tree networks. In: Proceedings of the IEEE conference on communications; 1986. p. 130-9.
18. F. Glover, and M. Laguna Tabu search 1997 Kluwer Boston
19. J.F. Gonçalves, and M.G.C. Resende Biased random-key genetic algorithms for combinatorial optimization J. Heuristics 17 2011 487 525
20. J.F. Gonçalves, and M.G.C. Resende A parallel multi-population biased random-key genetic algorithm for a container loading problem Comput Oper Res 39 2012 179 190
21. J.F. Gonçalves, M.G.C. Resende, and J.J.M. Mendes. A biased random-key genetic algorithms with forward-backward improvement for the resource constrained project scheduling problem J Heuristics 17 2011 467 486
22. J.F. Gonçalves, M.G.C. Resende, and R.F. Toso An experimental comparison of biased and unbiased random-key genetic algorithms Pesqu Oper 34 2014 143 164 10.1590/0101-7438.2014.034.02.0143
23. L. Gouveia A comparison of directed formulations for the capacitated minimal spanning tree problem Telecommun Syst 1 1993 51 76
24. L. Gouveia A 2n-constraint formulation for the capacitated minimal spanning tree problem Oper Res 43 1995 130 141
25. L. Gouveia Multicommodity flow models for spanning trees with hop constraints Eur J Oper Res 95 1996 178 190
26. L. Gouveia, and L. Hall Multistars and directed flow formulations Networks 40 2002 188 201
27. L. Gouveia, and M. Lopes The capacitated minimum spanning tree problem: on improved multistar constraints Eur J Oper Res 160 2005 47 62
28. L. Gouveia, and P. Martins A hierarchy of hop-indexed models for the capacitated minimal spanning tree problem Networks 35 2000 1 16
29. L. Gouveia, and P. Martins The capacitated minimum spanning tree problem revisiting hop-indexed formulations Comput Oper Res 32 2005 2435 2452
30. L. Gouveia, and J. Paixão Dynamic programming based heuristics for the topological design of local access networks Ann Oper Res 33 1991 305 327
31. L. Hall Experience with a cutting plane algorithm for the capacitated spanning tree problem INFORMS J Comput 8 1996 219 234
32. J.B. Kruskal On the shortest spanning subtree of a graph and the traveling salesman problem Proc Am Math Soc 7-1 1956 8 50
33. C. Martinez, I. Loiseau, M.G.C. Resende, and S. Rodriguez BRKGA algorithm for the capacitated arc routing problem Electron Notes Theor Comput Sci 281 2011 69 83
34. P. Martins Enhanced second order algorithm applied to the capacitated minimum spanning tree problem Comput Oper Res 34 2007 2495 2519
35. Martins P. Personal communication. 2014.
36. J.J.M. Mendes, J.F. Gonçalves, and M.G.C. Resende A random key based genetic algorithm for the resource constrained project scheduling problem Comput Oper Res 36 2009 92 109
37. E.H. Neville The codifying of tree-structure Math Proc Camb Philos Soc 49 1953 381 385
38. T.F. Noronha, M.G.C. Resende, and C.C. Ribeiro A biased random-key genetic algorithm for routing and wavelength assignment J Glob Optim 50 2011 503 518
39. C. Papadimitriou The complexity of the capacitated tree problem Networks 8 1978 217 230
40. R.C. Prim Shortest connection matrix network and some generalizations Bell Syst Tech J 36 1957 1389 1401
41. H. Prüfer Neuer Beweis eines Satzes über Permutationen Arch Math Phys 27 1918 742 744
42. G.R. Raidl, and B.A. Julstrom Edge sets: an effective evolutionary coding of spanning trees IEEE Trans Evol Comput 7 2003 225 239
43. C. Rego, and F. Mathew A filter-and-fan algorithm for the capacitated minimum spanning tree problem Comput Ind Eng 60 2011 187 194
44. C. Rego, F. Mathew, and F. Glover RAMP for the capacitated minimum spanning tree problem Ann Oper Res 181 2010 661 681
45. M. Reimann, and M. Laumanns Savings based ant colony optimization for the capacitated minimum spanning tree problem Comput Oper Res 33 2006 1794 1822
46. R. Reis, M. Ritt, L.S. Buriol, and M.G.C. Resende A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion Int Trans Oper Res 18 2011 401 423
47. M.G.C. Resende, R.F. Toso, J.F. Gonçalves, and R.M.A. Silva A biased random-key genetic algorithm for the Steiner triple covering problem Optim Lett 6 2012 605 619
48. F. Rothlauf, D. Goldberg, and A. Heinzl Network random keys - a tree representation scheme for genetic and evolutionary algorithms Evol Comput 10 2002 75 97
49. Ruiz R. The capacitated spanning tree problem [Ph.D. thesis]. Department of Statistics and Operations Research. Universitat Politècnica de Catalunya. 2013.
50. 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 167
51. M.C. Souza, C. Duhamel, and C.C. Ribeiro A GRASP heuristic for the capacitated minimum spanning tree problem using memory-based local search strategy Appl Optim 86 2003 627 658
52. Spears WM, DeJong KA. On the virtues of parameterized uniform crossover. In: Proceedings of the fourth international conference on genetic algorithms; 1991. p. 230-6.
53. E. Thompson, T. Paulden, and D.K. Smith The dandelion code a new coding of spanning trees for genetic algorithms IEEE Trans Evol Comput 11 2007 91 100
54. R.F. Toso, and M.G.C. Resende A C++ application programming interface for biased random-key genetic algorithms Optimization Methods and Software 30 2015 81 93
55. E. Uchoa, R. Fukasawa, J. Lysgaard, A. Pessoa, M. Poggi de Aragão, and D. Andrade Robust branch-cut-and-price algorithm for the capacitated minimum spanning tree problem over a large extended formulation Math Progr 112 2008 443 472