Continuous-space embedding genetic algorithm applied to the degree constrained minimum spanning tree problem

2009 IEEE Congress on Evolutionary Computation, CEC 2009

Volumn , Issue , 2009, Pages 1391-1398

  Pereira, Tiago L ^a   Carrano, Eduardo G ^b   Takahashi, Ricardo H C ^a   Wanner, Elizabeth F ^c   Neto, Oriane M ^a  

^a FEDERAL UNIVERSITY OF MINAS GERAIS   (Brazil)

^b CENTRO FEDERAL DE EDUCAÇÃO TECNOLÓGICA DE MINAS GERAIS   (Brazil)

^c FEDERAL UNIVERSITY OF OURO PRETO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

CANDIDATE SOLUTION; COMPUTATIONAL COSTS; COMPUTATIONAL EFFORT; CONTINUOUS SPACES; DEGREE-CONSTRAINED MINIMUM SPANNING TREE; EVOLUTIONARY APPROACH; POPULATION CONVERGENCE; SOLUTION QUALITY; SPACE EMBEDDING; TEST INSTANCES;

COMBINATORIAL OPTIMIZATION; CONSTRAINED OPTIMIZATION; CONVERGENCE OF NUMERICAL METHODS;

EVOLUTIONARY ALGORITHMS;

EID: 70449775012     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2009.4983106     Document Type: Conference Paper

References (15)

1. E. G. Carrano, R. H. C. Takahashi, C. M. Fonseca, and O. M. Neto, "Non-linear network topology optimization - an embedding vector space approach, " Submitted, 2008.
2. R. Prim, "Shortest connection networks and some generalizations, " Bell. Syst. Tech. Jour., vol.36, pp. 1389-1401, 1957.
3. J. B. Kruskal, "On the shortest spanning subtree of a graph and the traveling sallesman problem, " Proc. Amer. Math. Soc., vol.7, pp. 48- 50, 1956.
4. G. R. Raidl, "An efficient evolutionary algorithm for the degreeconstrained minimum spanning tree problem, " in Proc. IEEE Congress on Evolutionary Computation, 2000, pp. 89-96.
5. M. Krishnamoorthy, A. T. Ernst, and Y. M. Sharaiha, "Comparison of algorithms for the degree constrained minimum spanning tree, " Journal of Heuristics, vol.7, pp. 587-611, 2001.
6. Wamiliana, "Solving the degree constrained minimum spanning tree problem using tabu and modified penalty search methods, " Jurnal Teknik Industri, vol.6, no.1, pp. 1-9, 2004.
7. M. C. Souza and P. Martins, "Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem, " European Journal of Operational Research, vol.191, pp. 677-690, 2008.
8. C. H. Papadimitriou and U. V. Vazirani, "On two geometric problems related to the traveling salesman problem, " Journal of Algorithms, vol.5, pp. 231-246, 1984.
9. S. C. Narula and C. A. Ho, "Degree-constrained minimum spanning trees, " Computers & Operations Research, vol.7, pp. 239-249, 1980.
10. G. P. H. Chou and C. Chu, "Genetic algorithms for communication network design - An empirical study of the factors that influence performance, " IEEE Transactions on Evolutionary Computation, vol.5, pp. 236-249, 2001.
11. F. Rothlauf, Representations for Genetic and Evolutionary Algorithms, 2nd ed. Springer, 2006.
12. H. Prüfer, "Neuer Beweis eines Satzesüber Permutationen, " Arch. Math. Phys, vol.27, pp. 742-744, 1918.
13. T. Paulden and D. K. Smith, "From the Dandelion code to the Rainbow code: A class of bijective spanning tree representations with linear complexity and bounded locality, " IEEE Transactions on Evolutionary Computation, vol.10, pp. 108-123, 2006.
14. G. R. Raidl and B. A. Julstrom, "Edge-sets: An effective evolutionary encoding of spanning trees, " IEEE Transactions on Evolutionary Computation, vol.7, pp. 225-239, 2003.
15. E. G. Carrano, C. M. Fonseca, R. H. C. Takahashi, L. C. A. Pimenta, and O. M. Neto, "A preliminary comparison of tree encoding schemes for evolutionary algorithms, " in Proc. IEEE Conf. System, Man and Cybernetics, Montreal, Canada, 2007.