多目标等量分批柔性作业车间调度集成优化方法

计算机工程与应用 ›› 2012, Vol. 48 ›› Issue (16): 237-243.

多目标等量分批柔性作业车间调度集成优化方法

曾强1，沈玲1，杨育2，宋红娜1

1.河南理工大学，河南焦作 454000
2.重庆大学机械传动国家重点实验室，重庆 400030

出版日期:2012-06-01 发布日期:2012-06-01

Integrated multi-objective optimization method for equal lot splitting flexible job-shop scheduling problem

ZENG Qiang1, SHEN Ling1, YANG Yu2, SONG Hongna1

1.Henan Polytechnic University, Jiaozuo, Henan 454000, China
2.State Key Laboratory of Mechanical Transmissions, Chongqing University, Chongqing 400030, China

Online:2012-06-01 Published:2012-06-01

摘要/Abstract

摘要： 针对多目标等量分批柔性作业车间调度问题，提出了一种集成优化方法。构建了一种以完工时间最短、生产成本最低为优化目标的多目标等量分批柔性调度集成优化模型。提出并设计了一种改进的非支配排序遗传算法对模型加以求解。算法中引入面向对象技术处理复杂的实体逻辑关系，采用三段式分段编码技术分别对分批方案、加工顺序、设备进行编码，采用三段式分段交叉和变异的混合遗传算子实现遗传进化，采用两种精细化调度技术进行解码以缩短流程时间。通过案例分析验证了所提方法的有效性。

关键词: 等量分批, 柔性调度, 多目标优化, NSGA II算法

Abstract: Aiming at the multi-objective optimization problem for the equal lot splitting flexible job-shop scheduling, an integrated optimization method is proposed. Firstly, a multi-objective optimization model is established with the objective to minimize the makespan and minimize the manufacturing cost. Then, an improved Non-dominated Sorting Genetic Algorithm II（NSGA II） is presented and designed to solve the model. In the algorithm, an object-oriented technique is introduced to deal with the complicated logical relation between different entities, a three-segment encoding technique is used to encode the lot splitting scheme, the process sequences and machines, a three-segment hybrid crossover and mutation operator is used to implement genetic evolution, and two delicacy scheduling techniques are applied to reduce the flow time of each sub-batch. Finally, the effectiveness of the scheduling method proposed is validated by case study.

Key words: equal batch splitting, flexible job-shop scheduling, multi-objective optimization, NSGA II algorithm

曾强1，沈玲1，杨育2，宋红娜1. 多目标等量分批柔性作业车间调度集成优化方法[J]. 计算机工程与应用, 2012, 48(16): 237-243.

ZENG Qiang1, SHEN Ling1, YANG Yu2, SONG Hongna1. Integrated multi-objective optimization method for equal lot splitting flexible job-shop scheduling problem[J]. Computer Engineering and Applications, 2012, 48(16): 237-243.

[1]	杨玮，吴莹莹，王婷. 子母式穿梭车仓储系统配置优化问题研究[J]. 计算机工程与应用, 2021, 57(4): 258-265.
[2]	李倩，蒋丽，梁昌勇. 基于模糊时间窗的多目标冷链配送优化[J]. 计算机工程与应用, 2021, 57(23): 255-262.
[3]	陈万芬，王宇嘉，林炜星. 异构集成代理辅助多目标粒子群优化算法[J]. 计算机工程与应用, 2021, 57(23): 71-80.
[4]	胡小兵，陈树念，张盈斐，谷升豪. 求解多目标路径优化问题的涟漪扩散算法[J]. 计算机工程与应用, 2021, 57(23): 81-90.
[5]	李大海，艾志刚，王振东. 基于全组合策略的多目标阴阳对算法[J]. 计算机工程与应用, 2021, 57(22): 110-124.
[6]	崔彩霞，毕超超，范勤勤. 基于隐马尔可夫链的自适应MODE及应用[J]. 计算机工程与应用, 2021, 57(14): 83-94.
[7]	吴天纬，安斯光，孙崎岖，李梅，孙丽宏，申屠南瑛. 改进聚合树的高维多目标降维优化算法[J]. 计算机工程与应用, 2020, 56(21): 47-53.
[8]	王利利，张琳娟，尚雪宁，高德云. 计算智能在电动车充电站规划的应用研究综述[J]. 计算机工程与应用, 2020, 56(2): 1-10.
[9]	涂经科，梁俊斌，蒋婵，王天舒. 大规模无环有向管网中移动物联网监测进展[J]. 计算机工程与应用, 2020, 56(17): 1-11.
[10]	郭羽含，胡德甲. 基于随机森林与变邻域下降的车辆合乘求解[J]. 计算机工程与应用, 2020, 56(13): 243-253.
[11]	王亚东，石全，尤志锋，宋卫星. 差分准对立学习多目标蚁狮算法[J]. 计算机工程与应用, 2020, 56(13): 156-163.
[12]	董骏峰，王祥，梁昌勇. 基于个体邻域的改进NSGA-II算法[J]. 计算机工程与应用, 2019, 55(5): 166-174.
[13]	刘庆，王洋，李星，李红叶. 基因池操作遗传算法的应用层组播路由优化[J]. 计算机工程与应用, 2019, 55(21): 142-150.
[14]	乐春宇，马义中，张建侠. 结合Kriging和物理规划的多目标代理优化算法[J]. 计算机工程与应用, 2019, 55(21): 240-246.
[15]	严太山，文怡婷，李文彬，杨勃. 出租车合乘多目标优化方法研究[J]. 计算机工程与应用, 2019, 55(20): 222-226.