期刊文献+

基于改进PSO的压铸自动化生产线优化调度

Optimal Scheduling of Automatic Die Casting Production Line Based on Improved PSO
下载PDF
导出
摘要 针对某压铸自动化生产线调度的实际需求,考虑运输机的速度对生产调度和环境的影响,以设备总空闲时间、设备负荷均衡、产出零件数和运输机等待时间为优化目标,建立压铸自动化生产线多目标并行机调度数学模型,提出一种求解多目标并行机调度的改进的粒子群算法。通过引入动态惯性权重、个体极值和群体极值的扰动、建立极值库,提高粒子群算法的全局寻优能力。通过模拟退火算法对粒子进行局部优化,避免算法提前收敛。最后,通过实验验证了算法的有效性。 According to the actual demand of a die casting automatic production line scheduling,considering the impact of transport speed on production scheduling and the environment,taking the total idle time of equipment,equipment load balance,number of castings produced and waiting time of transporters as optimization objectives,a multi-objective parallel machine scheduling mathematical model for die casting automation production line is established,an improved particle swarm optimization algorithm for multi-objective parallel machine scheduling is proposed.By introducing the dynamic inertia weight,the perturbation of individual extremum and population extremum,and establishing the extremum library,the global optimization ability of the particle swarm optimization algorithm is improved,particle optimization is performed by simulated annealing algorithm to avoid the convergence of the algorithm in advance.Finally,lots of experiments prove the effectiveness of the algorithm.
作者 陶丽华 迟晓晨 谷东伟 TAO Lihua;CHI Xiaochen;GU Dongwei(School of Mechanical and Electrical Engineering,Changchun University of Technology,Changchun 130012,China)
出处 《机械工程师》 2021年第9期4-7,10,共5页 Mechanical Engineer
基金 工业与信息化智能制造新模式项目(2016080)。
关键词 压铸自动化生产线 并行机调度 多目标优化 改进粒子群算法 die casting automatic production line parallel machine scheduling multi objective optimization improved particle swarm algorithm
  • 相关文献

参考文献10

二级参考文献51

  • 1洪宗友,闫萍,庞哈利.Blocking流水车间调度问题的MBT算法研究[J].辽宁师范大学学报(自然科学版),2007,30(2):148-151. 被引量:2
  • 2RONCONI D P. A note on constructive heuristics for the flowshop problem with blocking[J]. International Journal of Production Economics, 2004,87 (1) : 39-48. 被引量:1
  • 3GONG H, TANG L, DUIN C W. A two-stage flow shop scheduling problem on batching machine and a discrete ma- chine with blocking and shared setup times[J]. Computers and Operations Research,2010,37(5) :960-969. 被引量:1
  • 4HALL N G, SRISKANDARAJAH C. A survey of machine scheduling problems with blocking and no-wait in process[J]. Operations Research, 1996,44(3) : 510-525. 被引量:1
  • 5WANG Ling, PAN Quanke, TASGETIREN M F. A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem[J].Computers & Industrial Engi- neering,2011,61(1) :76-83. 被引量:1
  • 6NAWAZ M, ENSCORE E E J, HAM I. A heuristic algorithm for the m-machine, n-job flow shop sequencing problem[J]. O- mega, 1983,11 (1) : 91-95. 被引量:1
  • 7WANG L, ZHANG L, ZHENG D Z. An effective hybrid ge- netic algorithm for flow shop scheduling with limited buffers[J]. Computers & Operations Research, 2006, 33 (10): 2960-2971. 被引量:1
  • 8WANG Ling, PAN Quanke. A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling prob- lems[J]. Computers & Operations Research, 2010, 37 ( 3 ) : 509-520. 被引量:1
  • 9GRABOWSKI J, PEMPERA J. The permutation flow shop problem with blocking, a tabu search approach[J].Omega, 2007,35 (3) : 302-311. 被引量:1
  • 10PAN Quanke,WANG Ling. Effective heuristics for the bloc- king flow shop scheduling problem with makespan minimiza- tion[J]. Omega, 2012,40 (2) : 218-229. 被引量:1

共引文献17

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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