期刊文献+

改进混合Jaya优化算法求解柔性作业车间调度问题 被引量:4

Flexible job shop scheduling problem with improved hybrid Jaya optimization algorithm
下载PDF
导出
摘要 针对柔性作业车间调度问题(Flexible Job shop Scheduling Problem,FJSP),以最小化最大完工时间为优化目标,在研究现有Jaya优化算法的基础上,结合邻域搜索算法,提出一种改进混合Jaya优化算法。首先,针对MSOS编码方式设计种群初始化方法;其次,提出一种基于Jaya优化算法思想的离散化更新算子,使算法适用于FJSP;然后,设计了2种新型邻域结构,有效增强了算法的局部寻优能力;最后,通过3组著名的FJSP基准算例进行测试,并与相同目标的其他算法进行对比分析。结果表明,改进混合Jaya优化算法能有效求解FJSP,且比相同目标的其他算法有更强的求解能力。 Based on the research of the existing Jaya optimization algorithm,an improved hybrid Jaya optimization algorithm combined with the neighborhood search algorithm was proposed for solving the Flexible Job shop Scheduling Problem(FJSP)with the objective to minimize makespan.Firstly,a population initialization method was designed for the MSOS encoding method.Secondly,to make the algorithm suitable for FJSP,a discretization update operator based on the idea of Jaya optimization was proposed.Thirdly,two new neighborhood structures were designed to improve the local optimization ability of the algorithm.Finally,it was tested through three sets of FJSP benchmarks,and compared with other algorithms which have the same target.The result shows that the improved hybrid Jaya optimization algorithm can effectively solve the flexible job shop scheduling problem,and it has better solving ability than other algorithms with the same goal.
作者 陆家辉 吉卫喜 于俊杰 姜一啸 LU Jiahui;JI Weixi;YU Junjie;JIANG Yixiao(School of Mechanical Engineering,Jiangnan University,Wuxi 214122,China;Jiangsu Provincial Key Laboratory of Food Manufacturing Equipment,Wuxi 214122,China)
出处 《现代制造工程》 CSCD 北大核心 2021年第11期26-34,共9页 Modern Manufacturing Engineering
基金 山东省重大科技创新工程基金项目(2019JZZY020111)。
关键词 柔性作业车间 Jaya优化算法 邻域搜索算法 邻域结构 flexible job shop Jaya optimization algorithm neighborhood search algorithm neighborhood structure
  • 相关文献

参考文献8

二级参考文献66

  • 1张超勇,饶运清,刘向军,李培根.基于POX交叉的遗传算法求解Job-Shop调度问题[J].中国机械工程,2004,15(23):2149-2153. 被引量:110
  • 2王磊,黄文奇.求解工件车间调度问题的一种新的邻域搜索算法[J].计算机学报,2005,28(5):809-816. 被引量:20
  • 3张超勇,饶运清,李培根,邵新宇.柔性作业车间调度问题的两级遗传算法[J].机械工程学报,2007,43(4):119-124. 被引量:105
  • 4MASTROLILLI M, GAMBARDELLA L M. Effective neighborhood functions for the flexible job shop problem[J]. Journal of Scheduling, 20007 3(1): 3-20.
  • 5WANG L, WANG S Y, XU Y, et al. A bi-population based estimation of distribution algorithm for the flexible job-shop scheduling problem[J]. Computers & Industrial Engineering, 2012, 62(4): 917-926.
  • 6WANG L, ZHOU G, XU Y, et al. An effective artificial bee colony algorithm for the flexible job-shop scheduling problem[J]. International Journal of Advanced Manufacturing Technology, 2012, 60(1-4): 303-315.
  • 7YUAN Y, XU H, YANG J D. A hybrid harmony search algorithm for the flexible job shop scheduling problem[J] Applied Soft Computing, 2013, 13(7): 3259-3272.
  • 8GAO J, SUN L Y, GEN M. A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems[J]. Computers & Operations Research, 2008, 35(9): 2892-2907.
  • 9YUAN Y, XU H. Flexible job shop scheduling using hybrid differential evolution algorithms[J]. Computers & Industrial Engineering, 2013, 65(2): 246-260.
  • 10GAO J, GEN M, SUN L Y, et al. A hybrid of genetic algorithm and bottleneck shifting for multiobjective flexible job shop scheduling problems[J]. Computers & Industrial Engineering, 2007, 53(1): 149-162.

共引文献128

同被引文献30

引证文献4

二级引证文献13

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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