期刊文献+

一种求解混合零空闲置换流水车间调度禁忌分布估计算法 被引量:4

A TABU ESTIMATION OF DISTRIBUTION ALGORITHM TO SOLVE THE MIXED NO-IDLE PERMUTATION FLOWSHOP SCHEDULING PROBLEM
下载PDF
导出
摘要 结合混合零空闲置换流水车间调度问题MNPFSP(Mixed no-idle permutation flowshop scheduling problem)的特性,运用基于概率模型的分布估计算法解决该问题。算法将启发式算法融入分布估计算法中提高了初始解的质量。为了避免算法陷入局部最优,将禁忌算法融入分布估计算法中,提出一种禁忌分布估计算法求解混合零空闲置换流水车间问题。为了提高种群的多样性,加入了三种邻域搜索。实例测试结果显示,该算法求解混合零空闲置换流水车间问题具有很好的优势。 According to the characteristics of the mixed no-idle permutation flowshop scheduling problem,an estimation of distribution algorithm based on probability model is used to solve this problem. What's more,the heuristic algorithm is designed into the estimation of distribution algorithm in order to improve the quality of the initial solution. In order to avoid the algorithm into local optimum,the tabu algorithm is designed into the estimation of distribution algorithm. The tabu estimation of distribution algorithm is proposed to solve the mixed no-idle permutation flowshop scheduling problem with three added kinds of local searches in order to improve the diversity of population. Experimental result shows that the algorithm has advantages to solve this problem.
出处 《计算机应用与软件》 2017年第1期270-274,292,共6页 Computer Applications and Software
基金 辽宁省教育厅科学研究项目(L2015265)
关键词 混合零空闲置换流水车间调度问题算法 分布估计算法 启发式算法 禁忌算法 Mixed no-idle permutation flowshop scheduling problem Estimation of distribution algorithm Heuristic algorithm Tabu algorithm
  • 相关文献

参考文献10

二级参考文献178

  • 1吴大为,陆涛栋,刘晓冰,孟永胜.求解作业车间调度问题的并行模拟退火算法[J].计算机集成制造系统,2005,11(6):847-850. 被引量:20
  • 2高海兵,周驰,高亮.广义粒子群优化模型[J].计算机学报,2005,28(12):1980-1987. 被引量:102
  • 3周树德,孙增圻.分布估计算法综述[J].自动化学报,2007,33(2):113-124. 被引量:209
  • 4李士勇,杨丹.基于改进蚁群算法的巡航导弹航迹规划[J].宇航学报,2007,28(4):903-907. 被引量:22
  • 5SAADANI N E I, GUINET A, MOALA M. A traveling salesman approach to solve the f/no_ idle/cmax problem [ J]. European Journal of Operation Research, 2005, 161 : 11-20.
  • 6SAADANI N E H, BAPTISETE P, MOALLA M. The simple F2//Cmax with forbiddden tasks in first or last position: A problem more complex than it seems[J]. Eur J Oper Res, 2005, 161: 21-31.
  • 7KALCZYNSKI P J, KAMBUROWSKI J. A heuristic for minimizing the makespan in no-idle permutation flow shop [ J ]. Comput Ind Eng, 2005, 49 : 146-154.
  • 8BZRAZ D, MOSHEIOV G. A note on a greedy heuristic for the flow-shop makespan minimization with no machine idle-time [J]. EurJ OperRes, 2008, 184(2): 810-813.
  • 9PAN Quan-ke, WANG Ling. No-idle permutation flow shop scheduling based on a hybrid discrete particle swarm optimization algorithm[ J]. The International Journal of Advanced Manufacturing Technology, 2008, 39 (7-8) : 796-807.
  • 10PAN Quan-ke, WANG Ling. A novel differential evolution algorithm for no-idle permutation flow-shop scheduling problems [ J]. European J. of Industrial Engineering, 2008, 2 (3) : 279-297.

共引文献293

同被引文献35

引证文献4

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部