置换流水车间调度问题的两阶段分布估计算法

发布时间：2018-04-25 00:17

本文选题：分布估计算法 + 置换流水车间调度问题　；参考：《计算机工程与应用》2017年02期

【摘要】：针对置换流水车间调度问题,以最小化总流水时间为目标,提出了一种新颖的两阶段分布估计算法。第一阶段先利用NEH(Nawaz-Enscore-Ham,NEH)启发式构造一个较优的初始个体,然后随机生成初始种群,为保留种群的多样性,提出一种择优机制来选择个体并建立概率模型,同时在当代种群中利用精英机制保留当代种群中的最优解,最后利用概率模型采样并生成下一代种群。第二阶段采用插入、互换操作算子对第一阶段得到的最优解进行邻域搜索,来提高分布估计算法的全局搜索能力,阻止其陷入局部最优解。通过对算例进行实验、对比和分析,证明该算法的可行性和有效性。
[Abstract]:In order to minimize the total flow time, a novel two-stage distribution estimation algorithm is proposed for the permutation flow shop scheduling problem. In the first stage, an optimal initial individual is constructed by using the NEH Nawaz-Enscore-Hamn (NEH) heuristic method, and then the initial population is randomly generated. In order to preserve the diversity of the population, a selective mechanism is proposed to select the individual and establish a probability model. At the same time, the elite mechanism is used to preserve the optimal solution in the contemporary population, and the probability model is used to sample and generate the next generation population. In the second stage, the neighborhood search of the optimal solution obtained in the first stage is performed by inserting and interchanging operators to improve the global search ability of the distribution estimation algorithm and to prevent it from falling into the local optimal solution. The feasibility and effectiveness of the algorithm are proved by the experiment, comparison and analysis of an example.
【作者单位】：辽宁科技大学软件学院;辽宁科技大学高温材料与镁资源学院;辽宁科技大学理学院;
【基金】：国家青年基金资助项目(No.71301066) 国家科技支撑计划项目(No.20141BAB02B03) 辽宁省科学事业公益研究基金项目(No.2014003021)
【分类号】：TP18;TB497

【相似文献】