A Global Archive Sub-Population Genetic Algorithm with Adaptive Strategy in Multi-objective Parallel-Machine Scheduling Problem

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

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/121469

题名:	A Global Archive Sub-Population Genetic Algorithm with Adaptive Strategy in Multi-objective Parallel-Machine Scheduling Problem
作者:	Chang, Pei-Chann;Chen, Shih-Hsin;Hsieh, Jih-Chang
日期:	2006
上传时间:	2021-10-14 12:11:03 (UTC+8)
摘要:	This research extends the sub-population genetic algorithm and combines it with a global archive and an adaptive strategy to solve the multi-objective parallel scheduling problems. In this approach, the global archive is applied within each subpopulation and once a better Pareto solution is identified, other subpopulations are able to employ this Pareto solution to further guide the searching direction. In addition, the crossover and mutation rates are continuously adapted according to the performance of the current generation. As a result, the convergence and diversity of the evolutionary processes can be maintained in a very efficient manner. Intensive experimental results indicate that the sub-population genetic algorithm combing the global archive and the adaptive strategy outperforms NSGA II and SPEA II approaches.
關聯:	Lecture Notes in Computer Science 4221, p.730-739
显示于类别:	[資訊工程學系暨研究所] 期刊論文

文件中的档案:

档案	大小	格式	浏览次数
index.html	0Kb	HTML	71	检视/开启

在機構典藏中所有的数据项都受到原著作权保护.

TAIR相关文章