期刊文献+

基于遗传蚁群算法的批量塑件混合流水生产调度研究 被引量:3

Scheduling of hybrid flow shop for batch of plastic parts based on ant colony and genetic algorithm
在线阅读 下载PDF
导出
摘要 根据塑件成型生产的调度特点,以最小提前/拖期惩罚为目标,设计了批量塑件成型的混合流水调度模型,并给出了批量工件移动策略和设备占用时间计算方法,利用混合遗传蚁群算法求解该模型,提出了利用等待时间和加工时间作为启发因子影响选择概率,以提前/拖期惩罚决定信息素浓度更新规则的方法。用仿真结果验证了该算法是正确有效的。 According to the chaxacterlstlc ot producUon scneatumg zor piasuc parts ing the lowest advance/delay punishment as the aim, a hybrid flow shop scheduling model for batch moulding of plastic parts was proposed. The moving strategy of batch of work pieces and computing method of equipment occupation time were presented. The hybrid ge netic and ant colony algorithm was applied to solve the model, the waiting time and pro duction time were used as a kind of inspiration factor to influence the choosing probabili ty and the advance/delay punishment was used as the updating rule decider of pheromone. The algorithm was confirmed accuracy and validity by the simulation results.
出处 《模具工业》 2013年第5期9-13,共5页 Die & Mould Industry
关键词 塑件生产 混合流水 生产调度 蚁群算法 manufacture of plastic parts hybrid flow shop production scheduling ant colo-ny algorithm
  • 相关文献

参考文献9

二级参考文献44

  • 1周亚勤,李蓓智,杨建国.基于遗传算法的批量Flow-shop调度问题研究[J].机械制造,2004,42(10):57-59. 被引量:7
  • 2技术政策编辑组.机械工业共性制造技术政策要点说明(模具部分)[J].机械工艺师,1994(6):2-4. 被引量:3
  • 3熊禾根,李建军,孔建益,杨金堂,蒋国璋.考虑工序相关性的动态Job shop调度问题启发式算法[J].机械工程学报,2006,42(8):50-55. 被引量:33
  • 4NAIDU J T.A note on a well-know dispatching rule to minimize total tardiness[J].International Journal of Management Science, 2003, 31(2) : 137-140.
  • 5MOSHEIOV G,ORON D.A note on the SPT heuristic for solving scheduling problems with generalized due dates[J]. Computer & Operations Research, 2004,31(5):645-655.
  • 6Stutzle T.An ant approach for the flow shop problem[C]//Aachen: Proceedings of the sixth European Congress on intelligent Techniques and Soft Computing,1998,3:1560-1564.
  • 7Ying K C,Liao C J.An ant colony system for permutation flowshop sequencing[J].Computers & Operations Research, 2004,31 (5) : 791-801.
  • 8Rajendran C,Ziegler H.Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs[J].European Journal of Operational Research, 2004,155(2) :426-438.
  • 9Cordon O,de Viana,Herrera F,et al.Analysis of the best-worst ant system and its variants on the TSP[J].Mathware and Soft computing, 2002,9 ( 2-3 ) : 177-192.
  • 10王定伟,等.智能优化方法[M].北京:高等教育出版社,2007.

共引文献91

同被引文献48

引证文献3

二级引证文献57

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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