首页|改进蜉蝣算法求解工艺规划与调度集成问题

改进蜉蝣算法求解工艺规划与调度集成问题

扫码查看
原文链接
  • 国家科技期刊平台
  • NETL
  • NSTL
  • 万方数据
针对工艺规划与调度集成问题(IPPS),基于AND/OR析取图和"组合"的概念以最小化最大完工时间为优化目标建立数学模型;设计一种整数编码方案,该方案无需预先为工件生成加工路径,可同时处理工艺规划与调度问题,由于初始解对算法的寻优能力的影响,在种群初始化时考虑机器的负荷以提高初始种群的质量;解码时采用插空的方法生成活跃调度,以缩短工件整体的加工时间;离散蜉蝣算法实现求解IPPS,采用Metropolis准则接收较差的解,引入自适应因子提高算法的收敛速度,设计局部搜索算法提高算法的精度.最后通过大规模基准算例进行实验并与其他算法对比分析,验证该算法有较好寻优性能.
Improved Mayfly Algorithm for Integrated of Process Planning and Scheduling
Aiming at the integrated of process planning and scheduling(IPPS),a mathematical model is established based on AND/OR disjunction graph and the concept of"combination"to minimize the makespan optimization target.An integer coding scheme is designed,which does not need to generate a processing path for the workpiece in advance,can deal with process plan-ning and scheduling problems at the same time.Due to the effect of the initial solution on the algorithm's ability to find the opti-mal,the load of the machine is considered to improve the quality of the initial population when the population is initialized.The plug-in method is used to generate active scheduling during decoding to shorten the overall processing time.The discrete mayfly algorithm is used to solve IPPS,and the Metropolis criterion is used to receive poor solutions,and the adaptive factors are intro-duced to improve the convergence speed of the algorithm,and a local search algorithm is designed to improve the accuracy of the algorithm.Finally,large-scale benchmark studies are carried out and compared with other algorithms to verify that the algorithm has good optimization performance.

integrated of process planning and schedulingmayfly algorithmadaptive factorinteger encoding scheme

杨柯、潘大志、池莹

展开 >

西华师范大学数学与信息学院,四川 南充 637009

最优化理论与应用四川省高校重点实验室,四川 南充 637009

工艺规划与调度集成 蜉蝣算法 自适应因子 整数编码方案

国家自然科学基金资助项目四川省教育厅自然科学基金资助项目西华师范大学英才科研基金资助项目西华师范大学校级大学生创新创业训练计划项目

1187105918ZA046917YC385cxcy2023047

2024

10.3969/j.issn.1006-2475.2024.04.016

计算机与现代化
江西省计算机学会 江西省计算技术研究所

计算机与现代化

CSTPCD
影响因子：0.472
ISSN：1006-2475
年,卷(期)：2024.(4)
  • 28