基于IIGA的分布式装配置换流水车间调度  

Distributed assembly permutation flowshop scheduling problem based on IIGA

作　　者：董海 王志彬 DONG Hai;WANG Zhibin(School of Applied Technology,Shenyang University,Shenyang 110000,CHN;School of Mechanical Engineering,Shenyang University,Shenyang 110000,CHN)

机构地区：[1]沈阳大学应用技术学院,辽宁沈阳110000 [2]沈阳大学机械工程学院,辽宁沈阳110000

出　　处：《制造技术与机床》2022年第11期169-176,共8页Manufacturing Technology & Machine Tool

基　　金：国家自然科学基金(71672117);中央引导地方科技发展资金计划(2021JH6/10500149)。

摘　　要：针对分布式装配置换流水车间调度问题,提出一种改进的迭代贪婪算法进行求解。首先,以最小化总流经时间为优化目标建立数学模型,提出一种改进的迭代贪婪算法,采用结合CDS(campbell dudek smith)和NEH(nawaz-enscore-ham)的启发式方法以生成较高质量的初始解,提高种群的多样性;其次,针对可重构产品与作业设计破坏和重构过程,将移除的序列插入指定位置,采用本地搜索策略获得新的解决方案;最后,通过不同规模的仿真实验对本文所提算法与其他四种智能算法进行对比,实验结果表明改进的迭代贪婪算法在求解分布式装配置换流水车间调度方面具有高效性和稳定性。In this paper,an improved iterative greedy algorithm is proposed to solve the distributed assembly Permutation Flowshop Scheduling Problem.First,establish a mathematical model with the optimization goal of minimizing the total elapsed time and an improved iterative greedy algorithm is proposed,which uses a heuristic method combining CDS(campbell dudek smith)and NEH(nawaz-enscore-ham)to generate higher-quality initial solutions and improve population diversity;Secondly,design the destruction and reconstruction process for reconfigurable products and jobs,insert the removed sequence into the specified position,and use the local search strategy to obtain new solutions;Finally,the algorithm proposed in this paper is compared with other four intelligent algorithms through simulation experiments of different scales.The experimental results show that the improved iterative greedy algorithm has high efficiency and stability in solving distributed assembly replacement flow shop scheduling.

关 键 词：分布式车间 本地搜索 生产调度 最小化总流经时间 迭代贪婪算法 

分 类 号：TB497[一般工业技术] TP18[自动化与计算机技术—控制理论与控制工程]