求解复杂混合流水车间调度的改进NSGAⅡ算法
A Modified NSGAⅡ Algorithm for SolvingComplex Hybrid Flow-Shop Scheduling Problem
宋存利 1竺啸天1
作者信息
- 1. 大连交通大学软件学院,辽宁大连 116028
- 折叠
摘要
针对砂型铸造车间调度问题中同时存在单机处理、并行处理与批处理的情形,构建复杂混合流水车间调度问题并提出一种改进非支配排序遗传算法求解上述问题.首先,以最小化最大完工时间和总能量消耗为优化目标建立线性规划模型,针对工序特征提出启发式解码规则.其次,提出了基于非支配的交叉对象匹配机制提升可行解的多样性,提出了基于区域中心的贪婪变邻域搜索机制提升可行解质量.最后,对改进算法进行了仿真,证明了算法的有效性.
Abstract
A complex hybrid flow-shop scheduling problem is proposed in studying the sand cast shop scheduling problem with the existence of single-machine processes,parallel processes and batch processes in the same time.And a modified non-dominated sorting genetic algorithm is proposed to solve the problem.Firstly,a linear programming model was used with the objective of minimizing makespan and total energy cost simultaneously,and a heuristic deco-ding scheme based on stage characteristic was presented.Secondly,a crossover-matching mechanism based on non-dominating was adopted to increase solution diversity,and a greedy variable neighborhood search based on center of areas was used in the proposed algorithm to avoid poor results.Finally,numerical simulations show the effectiveness of the proposed algorithm.
关键词
混合流水车间调度/多目标/非支配排序遗传算法/变邻域搜索Key words
HFSP/Multi-objective/NSGAⅠ/VNS引用本文复制引用
基金项目
辽宁省教育厅科研项目(LJKZ0489)
辽宁省教育厅科研项目(LJKZ0486)
辽宁省博士科研启动基金(2019-BS-042)
出版年
2024
NETL
NSTL
万方数据