DocumentCode
1968573
Title
Multi-objective Optimization for the Degree-Constrained Minimum Spanning Tree
Author
He, Fangguo ; Qi, Huan
Author_Institution
Inst. of Syst. Eng., Huazhong Univ. of Sci. & Technol., Wuhan
Volume
4
fYear
2008
fDate
12-14 Dec. 2008
Firstpage
992
Lastpage
995
Abstract
The multi-objective degree-constrained minimum spanning tree problem (MST) is an NP-hard problem. In this paper, a model of the problem is formulated and an improved genetic algorithm for the problem is proposed. We employ partheno-genetic operations to improve the efficiency of genetic algorithm, and design a niche count with adaptive niche radius to keep the population diversity. The experiments show that the method is able to find Pareto optimal solutions.
Keywords
computational complexity; genetic algorithms; graph theory; NP-hard problem; adaptive niche radius; degree-constrained minimum spanning tree; genetic algorithm; multi-objective optimization; partheno-genetic operations; Algorithm design and analysis; Computer science; Evolutionary computation; Genetic algorithms; Helium; NP-hard problem; Pareto optimization; Software engineering; Systems engineering and theory; Tree graphs; Degree-constrained minimum spanning tree; Multi-objective optimization; genetic algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Science and Software Engineering, 2008 International Conference on
Conference_Location
Wuhan, Hubei
Print_ISBN
978-0-7695-3336-0
Type
conf
DOI
10.1109/CSSE.2008.868
Filename
4722785
Link To Document