关键词: Pareto解集, 多目标优化, 选择拆卸, 蚁群算法

Abstract: To improve product disassembly planning efficiency, the multi-objective disassembly planning problem is analyzed, therefore, a multi-objective ant colony algorithm based on Pareto set is proposed, and the construction process of disassembly sequences is presented. To acquire the feasibility disassembly parts and disassembly directions the disassembly matrix is used to derivate the feasible condition of disassembly. The axis aligned bounding boxes is utilized for calculating the disassembly distance of part. The optimal sequence concerning with minimizing the changes of disassembly direction, total disassembly distance and the sequence length is given. The ant colony algorithm is utilized for searching the solutions and the Pareto solution set is acquired by calculating the dominance relations between solutions. The specific steps of algorithm are given. Finally, compared with a typical single target ant colony planning algorithm an internal combustion engine case is conducted to demonstrate the feasibly and efficiency of the proposed method.

Key words: School of Information and Control Engineering;Northeastern University