A multiobjective hybrid genetic algorithm for the capacitated multipoint network design problem
檔案
- 000087662600007.pdf (216.1 KB, Adobe PDF)
日期
2000-06-01
類型
期刊名稱
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS
卷期與頁次
第 30 卷第 3 期,頁 461–470
ISSN
1083-4419
語言
英文
摘要
The capacitated multipoint network design problem (CMNDP) is NP-complete, In this paper, a hybrid genetic algorithm for CMNDP is proposed. The multiobjective hybrid genetic algorithm (MOHGA) differs from other genetic algorithms (GA's) mainly in its selection procedure. The concept of subpopulation is used in MOHGA, Four subpopulations are generated according to the elitism reservation strategy, the shifting Prufer vector, the stochastic universal sampling, and the complete random method, respectively, Mixing these four subpopulations produces the next generation population. The MOHGA can effectively search the feasible solution space due to population diversity, The MOHGA has been applied to CMNDP. By examining computational and analytical results, we notice that the MOHGA can find most nondominated solutions and is much more effective and efficient than other multiobjective GA's.
關鍵詞
genetic algorithmsminimal spanning treemultiobjective functionnondominated solutionsubpopulation所屬典藏
期刊論文引用此條目
Lo, C., & Chang, W. (2000). A multiobjective hybrid genetic algorithm for the capacitated multipoint network design problem. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 30(3), 461–470. https://doi.org/10.1109/3477.846234
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/30487