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

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

作　　者：郭秀萍 周玉莎 GUO Xiuping;ZHOU Yusha(School of Economics and Management,Beijing University of Posts and Telecommunication,Beijing 100876,China;School of Management and Economics,North China University of Water Resources and Electric Power,Zhengzhou 450045,China)

机构地区：[1]北京邮电大学经济管理学院,北京100876 [2]华北水利水电大学管理与经济学院,郑州450045

出　　处：《系统管理学报》2023年第6期1205-1212,共8页Journal of Systems & Management

基　　金：国家自然科学基金资助项目(71471151)。

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

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

分 类 号：F224.3[经济管理—国民经济] TH122[机械工程—机械设计及理论]