系统管理学报

系统管理学报 ›› 2023, Vol. 32 ›› Issue (6): 1205-1213.DOI: 10.3969/j.issn.1005-2542.2023.06.006

• 工业工程与工程管理 • 上一篇    下一篇

用多目标动态规划求解拆卸序列的Pareto最优前沿

郭秀萍1，周玉莎2   

  1. 1.北京邮电大学经济管理学院，北京 100876；2.华北水利水电大学 管理与经济学院，郑州 450045
  • 收稿日期:2022-10-13 修回日期:2023-04-24 出版日期:2023-11-28 发布日期:2023-11-30
  • 基金资助:

    国家自然科学基金资助项目（71471151）

A Multi-Objective Dynamic Programming Approach for Pareto Front of a Disassembly Sequence Optimization Problen

GUO Xiuping1, ZHOU Yusha2   

  1. 1.School of Economics and Management, Beijing University of Posts and Telecommunication, Beijing 100876, China; 2.School of Management and Economics, North China University of Water Resources and Electric Power, Zhengzhou 450045, China
  • Received:2022-10-13 Revised:2023-04-24 Online:2023-11-28 Published:2023-11-30

PDF

摘要：

针对拆卸序列多目标优化问题，考虑拆卸任务先后顺序约束，提出基于改进的与/或图（Transformed AND/OR Graph，TAOG）和基于Pareto占优概念的多目标动态规划（Multi-Objective Dynamic Programming，MODP）求解方法。与其他多目标优化方法相比，MODP不需要调整计算参数和考虑参数变化对解的影响，并可获得问题的Pareto最优前沿，是求解拆卸序列多目标优化问题的精确算法。通过求解算例，验证了提出方法的可行性和高效性。

关键词:

拆卸序列优化, 改进与或图, 多目标动态规划, 帕累托最优前沿

Abstract:

Aimed at a multi-objective disassembly sequence optimization problem, considering the precedence relations between the disassembly tasks, a transformed AND/OR graph (TAOG) based and Pareto based multi-objective dynamic programming approach (MODP) is proposed. Compared with other optimization algorithms, the proposed method does not need to adjust parameters and to consider the effects of the changing parameters. In addition, MODP can obtain the Pareto front of the multi-objective disassembly sequence optimization problem and is an exact algorithm for the problem. The simulation results show that the proposed algorithm is feasible and effective.

Key words:

disassembly sequence optimization, transformed AND/OR graph (TAOG), multi-objective dynamic programming approach (MODP), Pareto front

中图分类号: