摘要
针对带工序跳跃的绿色混合流水车间机器和自动引导车(AGV)联合调度问题,提出改进memetic algorithm (MA)以同时最小化最大完工时间和总能耗.首先,设计基于工序、机器和转速的三层编码策略,最大程度保证算法在整个解空间中搜索;然后,设计混合种群初始化方法以提高初始种群解的质量,同时设计交叉和变异算子以及两种基于问题的邻域搜索策略来平衡算法的全局搜索和局部搜索能力;最后,通过大量仿真实验验证MA算法求解该问题的有效性和优越性.
For the joint scheduling of machines and automated guided vehicles(AGVs) in the green hybrid flow shop problem with missing operations, an improved memetic algorithm(MA) is proposed to minimize both the maximum completion time and the total energy consumption, simultaneously. Firstly, a three-layer encoding method based on operations, machines and speeds is designed to ensure the search of the algorithm in the whole solution space to the greatest extent. Then, a hybrid population initialization method is designed to improve the quality of initial population.Meanwhile, crossovers, mutation operators and two kinds of neighbourhood search strategies based on the problem are designed to balance the global and local search ability of the algorithm. Finally, simulation experiments show the superiority of the proposed algorithm in solving the joint scheduling of machines and AGVs in the green hybrid flow shop problem with missing operations.
作者
耿凯峰
叶春明
GENG Kai-feng;YE Chun-ming(School of Business,University of Shanghai for Science and Technology,Shanghai 200093,China;Information Construction and Management Center,Nanyang Institute of Technology,Nanyang 473004,China)
出处
《控制与决策》
EI
CSCD
北大核心
2022年第10期2723-2732,共10页
Control and Decision
基金
国家自然科学基金项目(71840003)
上海市科委“科技创新行动计划”软科学重点项目(20692104300)
河南省科技攻关项目(182102210113)。
关键词
工序跳跃
AGV调度
绿色调度
顺序相关调整时间
missing operations
AGV scheduling
green scheduling
sequence dependent setup times
