New particle swarm optimization algorithm for solving degree constrained minimum spanning tree problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5351 LNAI, Issue , 2008, Pages 1077-1085

  Binh, Huynh Thi Thanh ^a   Nguyen, Truong Binh ^a  

^a HANOI UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Viet Nam)

Author keywords

Degree constrained minimum spanning tree; Genetic algorithm; Particle swarm optimization; Swarm intelligent

Indexed keywords

ARTIFICIAL INTELLIGENCE; BIONICS; COMPUTATIONAL EFFICIENCY; CONSTRAINED OPTIMIZATION; DIESEL ENGINES; GENETIC ALGORITHMS; OPTIMIZATION; PARTICLE SWARM OPTIMIZATION (PSO); QUERY PROCESSING;

COMPUTATIONAL EXPERIMENTS; DEGREE CONSTRAINED MINIMUM SPANNING TREE; MINIMUM SPANNING TREE PROBLEMS; MST PROBLEMS; NP-HARD; PARTICLE SWARM OPTIMIZATION; PARTICLE SWARM OPTIMIZATION ALGORITHMS; SPANNING TREES; SWARM INTELLIGENT; UNDIRECTED GRAPHS;

TREES (MATHEMATICS);

EID: 58349117549     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-89197-0_110     Document Type: Conference Paper

References (9)

1. Goldbarg, E.F.G., de Souza, G.R., Goldbarg, C.: Particle Swarm Optimization for the Biobjective Degree constrained Minimum Spanning Tree. IEEE Congress on Evolutionary Computation, 1527-1534 (2006)
2. Zhou, G., Gen, M.: Approach to degree-constrained minimum spanning tree problem using genetic algorithm. Engineering Design & Automation 3(2), 157-165 (1997)
3. Gottlieb, J., Julstrom, B.A., Raidl, G.R., Rothlauf, F.: Prüfer numbers: A poor representation of spanning trees for evolutionary search (2000)
4. Knowles, J., Corne, D.: A New Evolutionary Approach to the Degree-Constrained Minimum Spanning Tree Problem. IEEE Trans. on Evolutionary Computation 4(2), 125-134 (2000)
5. Krishnamoorthy, M., Ernst, A.T., Sharaiha, Y.M.: Comparison of Algorithms for the Degree Constrained Minimum Spanning Tree. Journal of Heuristics 7, 587-611 (2001)
6. Hanr, L., Wang, Y.: A Novel Genetic Algorithm for Degree-Constrained Minimum Spanning Tree Problem. IJCSNS International Journal of Computer Science and Network Security 6(7A) (2006)
7. Krishnamoorthy, M., Craig, G., Palaniswarmi, M.: Comparison of heuristic algorithms for the degree constrained minimum spanning tree. In: Osman, I.H., Kelly, J.P. (eds.) Metaheuristics: Theory and Applications, pp. 83-96 (1996)
8. Hansen, P., Mladenovíc, N.: An Introduction to variable neighborhood search. In: Vos, S., Martello, S., Osman, I.H., Roucairol, C. (eds.) Metaheuristic: Advances and trends in local Search Procedures for Optimization. Kluwer, Dordrecht (1999)
9. Bui, T.N., Zrncic, C.M.: An Ant-Based Algorithm for Finding Degree-Constrained Minimum Spanning Tree. In: GECCO 2006 (2006)