期刊
APPLIED SOFT COMPUTING
卷 61, 期 -, 页码 921-934出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.asoc.2017.08.037
关键词
Estimation of distribution algorithm; Copula theory; m-Machine reentrant permutation flow-shop; Critical path; Local search
资金
- National Science Foundation of China [51665025, 60904081]
- Academic and Technical Leader Candidate Project for Young and Middle-Aged Persons of Yunnan Province [2012HB011]
- Applied Basic Research Foundation of Yunnan Province [2015FB136]
- Discipline Construction Team Project of Kunming University of Science and Technology [14078212]
Aiming at the m-machine reentrant permutation flow-shop scheduling problem (MRPFSSP), a copula based hybrid estimation of distribution algorithm (CHEDA) is presented to minimize the makespan criterion. Firstly, we establish both the operation-based model and the graph model for MRPFSSP, and then several inherent properties about critical path and blocks are proposed and analyzed. Secondly, the copula theory is utilized to build CHEDA's probability model (i.e., the joint distribution function, JDF) to efficiently extract the useful information from the excellent individuals. Thirdly, the global search based on the JDF model and a new population sampling method is designed to find the promising sub-regions in the total solution space. Fourthly, a problem-dependent local search based on the critical path and blocks is embedded into CHEDA to enhance the local exploitation ability. Finally, simulation experiments and comparisons demonstrate the effectiveness of the proposed CHEDA. (C) 2017 Published by Elsevier B.V.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据