摘要
研究考虑机器具有老化效应和工件带有释放时间约束的作业车间调度问题(job shop-scheduling problem,JSP)。建立以最小化最大完工时间为目标的调度优化模型,并设计1种改进的算术优化算法(improved arithmetic optimization algorithm,IAOA)对该问题进行求解。算法首先通过排序值转换规则将IAOA连续解空间映射到JSP的离散空间,并对JSP进行编码,然后使用插入式贪婪解码算法进行解码。提出了非线性数学优化加速函数和6种邻域搜索策略对标准算术优化算法(arithmetic optimization algorithm,AOA)进行改进。通过在33个JSP数据集上进行测试并与AOA、灰狼优化算法和算术三角函数优化算法进行对比分析,结果表明提出的IAOA具有较好的优化效果以及收敛能力,且该算法克服了AOA求解精度低、收敛速度慢的缺陷。
The Job Shop-Scheduling Problem(JSP),which considers the constraints of machines with aging effects and workpieces with release time,is studied.A scheduling optimization model with the objective of minimizing the maximum completion time is developed and an improved Arithmetic Optimization Algorithm(IAOA)is designed to solve the problem.The algorithm maps the IAOA continuous solution space to the discrete space of the JSP by means of ranked-order value(ROV)transformation rules,encodes the JSP and decodes it using an insertion greedy decoding algorithm.A non-linear mathematical optimization acceleration(MOA)function and six neighborhood search strategies are proposed to improve the standard Arithmetic Optimization Algorithm(AOA).The IAOA is compared with AOA,Grey Wolf Optimizer(GWO)and Arithmetic Trigonometric Optimization Algorithm(ATOA)by solving 33 benchmark problems.The experimental results show that the IAOA proposed has better optimization effect and convergence ability on JSP.The IAOA algorithm proposed overcomes the shortcomings of the AOA algorithm in terms of low solution accuracy and slow convergence speed.
作者
陈照辉
刘海杨
夏倩
张新功
CHEN Zhaohui;LIU Haiyang;XIA Qian;ZHANG Xingong(School of Mathematics,Physics,and Data Science,Chongqing University of Science and Technology,Chongqing 401331;School of Intelligent Engineering,Chongqing University of Science and Technology,Chongqing 401331;Chongqing Xiejiawan School,Chongqing 400050;School of Mathematical Sciences,Chongqing Normal University,Chongqing 401331,China)
出处
《重庆师范大学学报（自然科学版）》
CAS
北大核心
2024年第2期56-64,共9页
Journal of Chongqing Normal University:Natural Science
基金
国家自然科学基金——重大项目(No.11991022),面上项目(No.11971443)
重庆市自然科学基金(No.cstc2021jcyj-msxmX0229)
重庆市教育委员会科学技术研究计划——重点项目(No.KJZD-K202000501,No.KJZD-K202301502),青年项目(No.KJQN202001507)。
关键词
算术优化算法
作业车间调度问题
插入式贪婪解码算法
机器老化效应
释放时间
arithmetic optimization algorithm
job-shop scheduling problems
insertion greedy decoding algorithm
machine aging effect
releasetime
