计算机工程与应用2017，Vol.53Issue(2)：64-71,8.DOI:10.3778/j.issn.1002-8331.1604-0262
置换流水车间调度问题的两阶段分布估计算法
Two-stage estimation distribution algorithm for permutation flowshop scheduling problem
摘要
Abstract
Aiming to solve the permutation flow shop scheduling problem, minimizing the total flow time as the objective function, it proposes a novel two-stage estimation of distribution algorithm. In the first stage, it firstly uses NEH (Nawaz-Enscore-Ham, NEH)heuristic to construct a relatively optimal initial individual, and then generates initial popu-lation randomly. To keep the diversities of the population, it puts forward a preferred mechanism to select individuals and establish the probability model, and at the same time, uses elite mechanism to keep the optimal individual in the contem-porary populations. Finally it uses probability model to sample and generate the next generation of population. In the second stage, it uses the insert and interchange operator to do neighborhood search around the optimal individual which is got in the first stage in order to improve the global search ability of estimation of distribution algorithm and prevent it from entrapping the local optimal. Through sufficient experiments, contrast and analysis for outcome of the examples, it proves the feasibility and effectiveness of the proposed algorithm.关键词
分布估计算法/置换流水车间调度问题/NEH启发式/择优机制/邻域搜索Key words
estimation of distribution algorithm/permutation flowshop scheduling problem/NEH heuristics/preferred mechanism/neighborhood search分类
信息技术与安全科学引用本文复制引用
孙良旭,曲殿利,刘国莉..置换流水车间调度问题的两阶段分布估计算法[J].计算机工程与应用,2017,53(2):64-71,8.基金项目
国家青年基金资助项目（No.71301066）；国家科技支撑计划项目（No.20141BAB02B03）；辽宁省科学事业公益研究基金项目（No.2014003021）。 （）
