Improved algorithm to solve the multi-criteria minimum spanning tree problem

Ruan Jian Xue Bao/Journal of Software

Volumn 17, Issue 3, 2006, Pages 364-370

  Chen, Guo Long ^a,b   Guo, Wen Zhong ^b   Tu, Xue Zhu ^b   Chen, Huo Wang ^a  

^a NATIONAL UNIVERSITY OF DEFENSE TECHNOLOGY   (China)

^b FUZHOU UNIVERSITY   (China)

Author keywords

Minimum spanning tree; Pareto optimal

Indexed keywords

GENETIC ALGORITHMS; OPTIMIZATION;

IMPROVED ALGORITHM; MULTI CRITERIA MINIMUM SPANNING TREE (MC-MST); NP HARD PROBLEM; PARETO OPTIMAL;

COMPUTATIONAL COMPLEXITY;

EID: 33646738111     PISSN: 10009825     EISSN: None     Source Type: Journal    
DOI: 10.1360/jos170364     Document Type: Article

References (6)

1. Yan WM, Wu WM. Data Structure. 2nd ed. Beijing: Tsinghua University Press, 1992. 168-174 (in Chinese).
2. Zhou GG, Gen M. Genetic algorithm approach on multi-criteria minimum spanning tree problem. European Journal of Operational Research, 1999, 114(1): 141-152.
3. Knowles JD. Local-Search and hybrid evolutionary algorithms for Pareto optimization[Ph.D. Thesis]. University of Reading, RG6 6AY, 2002.
4. Srinivas N, Deb K. Multiobjective optimization using non-dominated sorting in genetic algorithms. Evolutionary Computation, 1995, 2(3): 221-248.
5. Gottlieb J, Julstrom BA, Raidl GR, Rothlauf F. Prüfer numbers: A poor representation of spanning trees for evolutionary search. In: Spector L, Goodman E, Wu A, Langdon W, Voigt HW, Gen M, Sen S, Dorigo M, Pezeshk S, Garzon M, Burke E, eds. Proc. of the 2001 Genetic and Evolutionary Computation Conf. San Francisco: Morgan Kaufmann Publishers, 2000. 343-350.
6. Xie T, Chen HW, Kang LS. Evolutionary algorithms of multi-objective optimization problems. Chinese Journal of Computers, 2003, 26(8): 997-1003 (in Chinese with English abstract).