采用新编码GA的工艺规划与车间调度集成优化  

Process planning and workshop scheduling integrated optimization adopting new coding mode genetic algorithm

作　　者：霍俊杰 王志坚 HUO Junjie;WANG Zhijian(Guoneng Beidian Shengli Energy Co.,Ltd.,Xilinhaote 026000,China;School of Mechanical,Engineering North University of China,Taiyuan 038507,China)

机构地区：[1]内蒙古锡林浩特市国能北电胜利能源有限公司,锡林浩特026000 [2]中北大学机械工程学院,太原038507

出　　处：《现代制造工程》2024年第9期25-33,共9页Modern Manufacturing Engineering

基　　金：国家自然科学基金面上项目(52275139)。

摘　　要：为了实现以完工时间最短为目标的工艺规划与车间调度集成优化,提出了基于新编码遗传算法(Genetic Algorithm,GA)的集成优化方法。对工艺规划与车间调度集成优化(Integrated Process Planning and Scheduling optimization,IPPS)问题进行了描述,并建立了完工时间最短的集成优化模型;设计一种具有最大柔性空间的染色体编码方法,从编码角度保证了集成优化问题的最大柔性度;根据IPPS问题特定约束改进了交叉变异方法,保证遗传操作前后均为可行解,使算法迭代均为有效迭代;进而制定了基于新编码遗传算法的IPPS问题求解流程。经Kim算例验证可知,与现有先进算法两阶段混合算法(Two-stage Hybrid Algorithm,THA)、改进蚁群算法(Enhanced Ant Colony Algorithm,EACA)和混合遗传算法(Hybrid Genetic Algorithm,HGA)相比,新编码GA在小规模、大规模生产情况下集成优化方案的完工时间均最小(分别为343、344、372、320、427及432 min),实验结果验证了新编码GA在IPPS问题求解中的可行性和先进性。In order to achieve integrated optimization of process planning and workshop scheduling with the goal of minimizing completion time,a novel coding Genetic Algorithm(GA) based integrated optimization method was proposed.The Integrated Process Planning and Scheduling optimization(IPPS) problem was described and an integrated optimization model with minimizing completion time was established;a chromosome encoding method with maximum flexibility space was designed to ensure the maximum flexibility of integrated optimization problems from an encoding perspective;crossover and mutation method based on specific constraints of IPPS problem was improved,ensuring feasible solutions before and after genetic operation and making algorithm iterations effective;furthermore,a novel encoding genetic algorithm based IPPS problem solving process was developed.According to the verification of Kim example,compared with the existing advanced algorithms such as Two-stage Hybrid Algorithm(THA),Enhanced Ant Colony Algorithm(EACA),Hybrid Genetic Algorithm(HGA),completion time optimized by the novel coding GA algorithm is the smallest(i.e.343,344,372,320,427,432 min respectively) in the case of small-scale and large-scale production.The experimental results verify that the novel coding GA algorithm in solving IPPS problems is feasibility and progressiveness.

关 键 词：集成优化 工艺规划 车间调度 全新编码 最大柔性空间 遗传算法 

分 类 号：TH186[机械工程—机械制造及自动化] TP18[自动化与计算机技术—控制理论与控制工程]