期刊文献+

面向饲料加工的排产优化方法研究

Study on Production Scheduling Optimization Method for Feed Processing
原文传递
导出
摘要 为了提高饲料企业在成本和质量上的优势,需要采用更加科学的方法制定排产计划。首先根据饲料加工排产的特点构建了基于批量组织生产的排产模型;其次,针对布谷鸟搜索(cuckoo search,CS)算法收敛速度慢与局部搜索能力弱的问题,提出不同的改进策略形成改进CS算法求解了排产模型,改进算法运用NEH方法、Logistic混沌映射方法以及随机方法生成初始解,使用了动态改变步长的策略以平衡算法探索能力与开发能力,增加基于差分进化的交叉阶段以增强最优解的挖掘能力。采用改进CS算法,以最小化总流经时间为求解目标,在40个Taillard测试集实例和实际饲料排产数据上进行了实验,验证了改进CS算法的寻优能力。结果证明了改进CS算法在求解流水线式生产车间排产问题上的有效性。 In order to improve the cost and quality advantages of feed enterprises,more scientific methods can be used to formulate production scheduling plans.Firstly,according to the characteristics of feed processing scheduling,a scheduling model based on batch organization production is constructed.Secondly,aiming at the problems of slow convergence speed and weak local search ability of cuckoo algorithm,an improved cuckoo optimization algorithm with different improvement strategies is formed.The NEH method,the Logistic chaotic mapping method and the random method were employed to create initial solution.The strategy of dynamically changing the step size is used to balance the exploration ability and exploitation ability of the algorithm.The crossover stage based on differential evolution is added to enhance the mining ability of the optimal solution.The improved cuckoo search algorithm is used to solve 40 Taillard test problems and an actual feed scheduling problem with minimization of total flow time.The experimental results show the effectiveness of the proposed algorithm in solving flow shop scheduling problem.
作者 亓祥波 王宏伟 王浩毅 马志强 张浩 QI Xiangbo;WANG Hongwei;WANG Haoyi;MA Zhiqiang;ZHANG Hao(College of Mechanical Engineering,Shenyang University,Shenyang 110044;Shenyang Institute of Automation Chinese Academy of Sciences,Shenyang 110016,China)
出处 《重庆师范大学学报(自然科学版)》 CAS 北大核心 2024年第2期65-73,共9页 Journal of Chongqing Normal University:Natural Science
基金 国家自然科学基金青年科学基金项目(No.61803367) 辽宁省教育厅基本科研项目(No.LJKQZ2021164)。
关键词 置换流水车间调度 布谷鸟搜索算法 差分进化 permutation flow shop scheduling cuckoo search differential evolution
  • 相关文献

参考文献1

二级参考文献13

  • 1Michael P,张智海.调度:原理、算法和系统[M].2版.北京:清华大学出版社,2007:12-75.
  • 2Garey M R,Johnson D S, Sethi R. The complexity of flow shop and job shop scheduling[J].Mathematics of Operations Research,1976,1(2) :117-- 129.
  • 3Yang X S,Deb S. Cuckoo search via Levy flights[C]// Proceedings of World Congress on Nature & Biologically Inspired Computing (NaBIC2009), India: IEEE Publications, 2009: 210 - 214.
  • 4Yang X S,Deb S. Engineering optimization by cuckoo search [J]. International Journal of Mathematical Modelling and Numerical Opfimisation, 2010, 1 ( 4 ) : 330- 343.
  • 5Tasgetren M F, Sevkli M, Liang Y C, et al. Particle swarm optimization algorithm for permutation flowshop sequencing problem [J]. Lecture Notes in Computer Science, 2004,3172: 382 - 389.
  • 6Carlier J. Scheduling with disjunctive constraints[J]. Operations Research, 1978,12 (4) : 333 - 350.
  • 7ShiY, Eberhart R. A Modified Particle Swarm Optimizer [C]//Proceedings of IEEE International Conference on Evolutionary Computation, Anchorage: IEEE Publications, 1998 : 69 - 73.
  • 8刘延风,刘三阳.多构造蚁群优化求解置换流水车间调度问题[J].计算机科学,2010,37(1):222-224. 被引量:5
  • 9朱夏,李小平,王茜.基于总空闲时间增量的无等待流水调度混合遗传算法[J].计算机研究与发展,2011,48(3):455-463. 被引量:10
  • 10田野,刘大有.求解流水车间调度问题的混合粒子群算法[J].电子学报,2011,39(5):1087-1093. 被引量:18

共引文献33

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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