模糊作业时间的拆卸线平衡Pareto多目标优化

doi:10.3778/j.issn.1002-8331.1606-0393

计算机工程与应用 ›› 2018, Vol. 54 ›› Issue (1): 256-263.DOI: 10.3778/j.issn.1002-8331.1606-0393

模糊作业时间的拆卸线平衡Pareto多目标优化

汪开普，张则强，邹宾森，毛丽丽

西南交通大学机械工程学院，成都 610031

出版日期:2018-01-01 发布日期:2018-01-15

Pareto optimization for multi-objective disassembly line balancing with fuzzy operation times

WANG Kaipu, ZHANG Zeqiang, ZOU Binsen, MAO Lili

School of Mechanical Engineering, Southwest Jiaotong University, Chengdu 610031, China

Online:2018-01-01 Published:2018-01-15

摘要/Abstract

摘要： 针对实际拆卸作业的复杂性，建立了考虑模糊作业时间的多目标拆卸线平衡问题的数学模型，提出了一种基于Pareto解集的多目标遗传模拟退火算法进行求解。改进了模拟退火操作的Metropolis准则，使其能够求解多目标优化问题。采用拥挤距离评价非劣解的优劣，保留了优秀个体，并通过精英选择策略，将非劣解作为遗传操作的个体，引导算法向最优方向收敛。基于25项拆卸任务算例，通过与现有的单目标人工蜂群算法进行对比，验证了所提算法的有效性和优越性。最后将该算法应用于某打印机拆卸线实例中，求得8种可选平衡方案，实现了求解结果的多样性。

关键词: 拆卸线平衡, 模糊作业时间, 多目标优化, 遗传模拟退火算法, Pareto解集

Abstract: In view of the complexity of the actual disassembly work, a mathematical model of the multi-objective disassembly line balancing problem considering fuzzy task processing time is constructed, and a Pareto based multi-objective genetic simulated annealing algorithm is proposed. An improved Metropolis criterion of simulated annealing operation is presented to make it to be applicable to multi-objective optimization problem. The crowding distance is introduced as an evaluation mechanism to filter and preserve the elite solutions, and then the elite solutions are performed the genetic operation to guide the convergence to the optimal direction. Comparing the proposed algorithm with a single-objective artificial bee colony algorithm based on the 25-task involved disassembly case, it identifies the validity and the superiority of the proposed algorithm. Finally, the proposed algorithm is applied to a printer disassembly instance, and it acquires 8 balancing schemes and realizes the diversity of the solution results.

Key words: disassembly line balancing, fuzzy operation times, multi-objective optimization, genetic simulated annealing algorithm, Pareto set

汪开普，张则强，邹宾森，毛丽丽. 模糊作业时间的拆卸线平衡Pareto多目标优化[J]. 计算机工程与应用, 2018, 54(1): 256-263.

WANG Kaipu, ZHANG Zeqiang, ZOU Binsen, MAO Lili. Pareto optimization for multi-objective disassembly line balancing with fuzzy operation times[J]. Computer Engineering and Applications, 2018, 54(1): 256-263.

[1]	杨玮，吴莹莹，王婷. 子母式穿梭车仓储系统配置优化问题研究[J]. 计算机工程与应用, 2021, 57(4): 258-265.
[2]	陈万芬，王宇嘉，林炜星. 异构集成代理辅助多目标粒子群优化算法[J]. 计算机工程与应用, 2021, 57(23): 71-80.
[3]	胡小兵，陈树念，张盈斐，谷升豪. 求解多目标路径优化问题的涟漪扩散算法[J]. 计算机工程与应用, 2021, 57(23): 81-90.
[4]	李倩，蒋丽，梁昌勇. 基于模糊时间窗的多目标冷链配送优化[J]. 计算机工程与应用, 2021, 57(23): 255-262.
[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): 156-163.
[11]	郭羽含，胡德甲. 基于随机森林与变邻域下降的车辆合乘求解[J]. 计算机工程与应用, 2020, 56(13): 243-253.
[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.

模糊作业时间的拆卸线平衡Pareto多目标优化

Pareto optimization for multi-objective disassembly line balancing with fuzzy operation times

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics