期刊
EXPERT SYSTEMS WITH APPLICATIONS
卷 29, 期 3, 页码 705-712出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.eswa.2005.04.033
关键词
scheduling problem; genetic algorithm; multi-objective optimization; evolution strategy
This paper introduces a two-phase sub population genetic algorithm to solve the parallel machine-scheduling problem. In the first phase, the population will be decomposed into many sub-populations and each sub-population is designed for a scalar multi-objective. Subpopulation is a new approach for solving multi-objective problems by fixing each sub-population for a pre-determined criterion. In the second phase, non-dominant solutions will be combined after the first phase and all sub-population will be unified as one big population. Not only the algorithm merges sub-populations but the external memory of Pareto solution is also merged and updated. Then, one unified population with each chromosome search for a specific weighted objective during the next evolution process. The two phase sub-population genetic algorithm is applied to solve the parallel machine-scheduling problems in testing of the efficiency and efficacy. Experimental results are reported and the superiority of this approach is discussed. (c) 2005 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据