Genetic algorithm approach on multi-criteria minimum spanning tree problem (1999) [9 citations — 0 self]
|
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@ARTICLE{Zhou99geneticalgorithm,author = {Gengui Zhou and Mitsuo Gen},
title = {Genetic algorithm approach on multi-criteria minimum spanning tree problem},
journal = {European Journal of Operational Research},
year = {1999},
volume = {114},
pages = {141--152}
}
Years of Citing Articles
Abstract:
Abstract: Minimum Spanning Tree (MST) problem is of high importance in network optimization. The multi-criteria MST (mc-MST) is a more realistic representation of the practical problem in the real-world, but it is difficult for the traditional network optimiza-tion technique to deal with. In this paper, a genetic algorithm (GA) approach is developed to deal with this problem. Without neglecting its network topology, the proposed method adopts the Prfifer number as the tree encoding and applies the Multiple Criteria Decision Making (MCDM) technique and nondominated sorting technique to make the GA search give out all Pareto optimal solutions either focused on the region near the ideal point or distributed all along the Pareto frontier. Compared with the enumeration method of Pareto optimal solution, the numerical analysis shows the efficiency and effectiveness of the GA approach on the mc-MST problem.
