The development of a Sub-Population Genetic Algorithm II (SPGAII) for the Multi-objective Combinatorial Problems

淡江大學機構典藏 > 工學院 > 資訊工程學系暨研究所 > 期刊論文 > Item 987654321/121436

請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/121436

題名:	The development of a Sub-Population Genetic Algorithm II (SPGAII) for the Multi-objective Combinatorial Problems
作者:	Chang, P.C.;Chen, S. H.
關鍵詞:	Genetic algorithm;Parallel scheduling problems;Multidimensional knapsack problem;Multi-objective optimization
日期:	2009
上傳時間:	2021-10-05 12:10:21 (UTC+8)
摘要:	Previous research has shown that sub-population genetic algorithm is effective in solving the multi-objective combinatorial problems. Based on these pioneering efforts, this paper extends the SPGA algorithm with a global Pareto archive technique and a two-stage approach to solve the multi-objective problems. In the first stage, the areas next to the two single objectives are searched and solutions explored around these two extreme areas are reserved in the global archive for later evolutions. Then, in the second stage, larger searching areas except the middle area are further extended to explore the solution space in finding the near-optimal frontiers. Through extensive experimental results, SPGA II does outperform SPGA, NSGA II, and SPEA 2 in the parallel scheduling problems and knapsack problems; it shows that the approach improves the sub-population genetic algorithm significantly. It may be of interests for researchers in solving multi-objective combinatorial problems.
關聯:	Applied Soft Computing Journal 9(1), p.173-181
DOI:	10.1016/j.asoc.2008.04.002
顯示於類別:	[資訊工程學系暨研究所] 期刊論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
index.html		0Kb	HTML	22	檢視/開啟

在機構典藏中所有的資料項目都受到原著作權保護.

TAIR相關文章