期刊文献+

基于强化协同算法的多目标生产调度模型研究

Research on Production Scheduling Based on Multi-objective Collaborative Optimization Algorithm
下载PDF
导出
摘要 针对流程工业生产调度具有复杂性、多约束性和多目标性难以优化的特点,提出了一种新型强化协同优化算法(NCO),并将该算法应用于求解多目标优化问题,提出了基于NCO算法的多目标协同优化方法(MONCO)。研究表明,MONCO算法应用于车间调度问题,不仅可以优化生产工序,还能减少迭代次数,提高计算效率。 In view of the complexity,multi-constraint and multi-objective characteristics of production scheduling in process industry,an enhanced collaborative optimization algorithm(NCO)is proposed,which is applied to solve multi-objective optimization problems,and a multi-objective collaborative optimization method(MONCO)based on NCO is proposed.The simulation results show that MONCO algorithm can not only optimize the effect,but also reduce the number of iterations and improve the computational efficiency.
作者 贾万达 彭艳 石宝东 JIAWan-da;PENG Yan;SHI Bao-dong(National Cold Rolled Strip Equipment and Technology Engineering Research Center,Yanshan University,Qinhuangdao 066004,Hebei)
出处 《电脑与电信》 2020年第9期1-5,共5页 Computer & Telecommunication
基金 国家重点研发计划,项目编号:2017YFB0306400 河北省自然科学基金杰出青年科学基金,项目编号:E2019203452 材料成形与模具技术国家重点实验室开放基金项目,项目编号:P2020-013。
关键词 多目标优化 流程工业生产调度 协同优化 multi-objective optimization process industry production scheduling collaborative optimization
  • 相关文献

参考文献2

二级参考文献24

  • 1张传顺,莫蓉,石胜友,常智勇,陈泽峰.基于遗传算法的制造网格资源调度方法研究[J].中国机械工程,2006,17(18):1916-1920. 被引量:12
  • 2Paolo Brandimarte.Routing and scheduling in a flexible job shop by tabu search[J].Annals of Operations Research.1993(3)
  • 3Garey M R,Johnson D S,Sethi R.The complexity of flowshop and job-shop scheduling [J].Mathematics of Operations Research,1976,3(1):117-129.
  • 4Brandimarte P.Routing and scheduling in a flexible job shop by tabu search [J].Annals of Operations Research,1993,1(3):157-183.
  • 5Hurink E,Jurisch B,Thole M.Tabu search for the job shopscheduling problem with multi-purpose machine [J].Operations Research Spectrum,1994,15(4):205-215.
  • 6Mastrolilli M,Gambardella L M.Effective neighborhood func-tions for the flexible job shop problem [J].Journal of Scheduling,2000,3(1):3-20.
  • 7Gao J,Sun L,Gen M.A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems [J].Computers & Operation Research,2008,35(9):2892-2907.
  • 8Pezzella F,Morganti G,Ciaschetti G.A genetic algorithm for theflexible job-shop scheduling problem [J].Computers & Operation Research,2008,35(10):3202-3212.
  • 9Hmida B A,Haouari M,Huguet M J,et al.Discrepancy search for the flexible job shop scheduling problem [J].Computers & Operation Research,2010,37(12):2192-2201.
  • 10Yuan Y,Xu H,Yang J.A hybrid harmony search algorithm for the flexible job shop scheduling problem [J].Applied Soft Computing,2013,13(7):3259-3272.

共引文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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