DocumentCode
2460436
Title
Particle Swarm Optimization for the Bi-objective Degree constrained Minimum Spanning Tree
Author
Goldbarg, Elizabeth F. G. ; de Souza, G.R. ; Goldbarg, Marco C.
Author_Institution
Universidade Federal do Rio Grande do Norte, Brazil (phone: 55-84-3215-3814; fax: 55-84-3215-3815; e-mail: beth@dimap.ufrn.br).
fYear
0
fDate
0-0 0
Firstpage
420
Lastpage
427
Abstract
This paper presents a particle swarm optimization algorithm for the multi-criteria degree constrained minimum spanning tree problem. The operators for the particle´s velocity are based upon local search and path-relinking procedures. The proposed heuristic is compared with other evolutionary algorithm presented previously for the same problem. A computational experiment is reported. The results show that the method proposed in this paper finds high quality solutions for the problem.
Keywords
evolutionary computation; particle swarm optimisation; trees (mathematics); biobjective degree-constrained minimum spanning tree; evolutionary algorithm; local search; multicriteria degree; particle swarm optimization; path-relinking procedures; Birds; Clustering algorithms; Design optimization; Evolutionary computation; History; Particle swarm optimization; Polynomials; Psychology; Steady-state; Tree graphs;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 2006. CEC 2006. IEEE Congress on
Conference_Location
Vancouver, BC
Print_ISBN
0-7803-9487-9
Type
conf
DOI
10.1109/CEC.2006.1688339
Filename
1688339
Link To Document