By Topic

Continuous-space embedding genetic algorithm applied to the Degree Constrained Minimum Spanning Tree Problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Pereira, T.L. ; Dept. of Electr. Eng., Univ. Fed. de Minas Gerais, Belo Horizonte ; Carrano, E.G. ; Takahashi, R.H.C. ; Wanner, E.F.
more authors

This work presents an evolutionary approach for solving a difficult problem of combinatorial optimization, the DCMST (degree-constrained minimum spanning tree problem). Three genetic algorithms which embed candidate solutions in the continuous space are proposed here for solving the DCMST. The results achieved by these three algorithms have been compared with four other existing algorithms according to three merit criteria: i) quality of the best solution found; ii) computational effort spent by the algorithm, and; iii) convergence tendency of the population. The three proposed algorithms have provided better results for both solution quality and population convergence, with reasonable computational cost, in tests performed for 25-node and 50-node test instances. The results suggest that the proposed algorithms are well suited for dealing with the problem under study.

Published in:

Evolutionary Computation, 2009. CEC '09. IEEE Congress on

Date of Conference:

18-21 May 2009