Please wait a minute...
浙江大学学报(工学版)
J4  2011, Vol. 45 Issue (10): 1746-1752    DOI: 10.3785/j.issn.1008-973X.2011.10.008
    
Product remanufacture disassembly planning based on
adaptive particle swarm optimization algorithm
XU Jin, ZHANG Shu-you, FEI Shao-mei
Department of Mechanical Engineering, Zhejiang University, Hangzhou 310027, China
Download:   PDF(0KB) HTML
Export: BibTeX | EndNote (RIS)      

Abstract  

Depth matrix and disassembly interference matrix were presented to establish disassembly model. A method of generating feasible disassembly sequence was proposed to produce the feasible region of disassembly. An adaptive particle swarm optimization was presented. The inertia weight with cyclical linear attenuation strategy based on sawtooth wave was designed to strike a balance between global and local searching ability, and adaptive mutation was utilized to avoid falling into local optimal solution. The algorithm used feasible disassembly sequence list to get particle code in order to solve the disassembly sequence planning problem. A strategy of generating section feasible disassembly sequence was used in particle mutation and particle updated based on floating window. Then the feasibility of particle sequence list after every iteration was guaranteed to avoid judging the feasibility of particle, and the efficiency of the algorithm was improved. The effectiveness of the algorithm was proved by a typical example.

Published: 01 October 2011
CLC:  TP 391.7  
Service
E-mail this article
Add to my bookshelf
Add to citation manager
E-mail Alert
RSS
Articles by authors
Cite this article:

XU Jin, ZHANG Shu-you, FEI Shao-mei. Product remanufacture disassembly planning based on
adaptive particle swarm optimization algorithm. J4, 2011, 45(10): 1746-1752.

URL:

https://www.zjujournals.com/eng/10.3785/j.issn.1008-973X.2011.10.008     OR     https://www.zjujournals.com/eng/Y2011/V45/I10/1746


基于自适应粒子群的产品再制造拆卸规划

采用干涉矩阵和拆卸深度矩阵建立拆卸模型,给出可行拆卸序列生成方法,产生了拆卸可行域.设计一种自适应粒子群算法,该算法基于锯齿波提出惯性权重因子周期线性衰减,实现全局与局部搜索的平衡,给出适应变异策略,避免陷入局部最优解.针对拆卸序列规划问题,使用拆卸序列可行链表对粒子编码,构建区段拆卸序列,应用到粒子变异和基于浮动窗口的粒子更新中,保证每次迭代后粒子序列的可行性,避免对不可行序列的判断,提高了求解效率.通过一个典型实例,验证了该方法的有效性.

［1］ LAMBERT A J D.Determining optimum disassembly sequences in electronic equipment ［J］.Computers and Industrial Engineering,2002,43(3)： 553-575.
［2］ KUO T C.Disassembly sequence and cost analysis for electromechanical products ［J］. Robotics and ComputerIntEgrated Manufacturing,2000,16(1)： 43-54.
［3］ ZUSSMAN E,ZHOU M C.A methodology for modeling and adaptive planning of disassembly processes ［J］.IEEE Transactions on Robotics and Automation, 1999, 15(1): 190-194.
［4］ HOMEM DE MELLO L S,SANDERSON A C. AND/OR graph representation of assembly plans ［J］.IEEE Transactions on Robotics and Automation,1990,6(2)： 188-199.
［5］ 易建军,孙英策,季白杨,等.基于广义CAD 模型的汽车产品拆卸规划［J］.浙江大学学报：工学版,2008,42(2)： 327-331.
YI Jianjun,SUN Yingce,JI Baiyang,et al.Disassemble sequence and route planning of automobile product based on generalized CAD modeling ［J］.Journal of Zhejiang University: Engineering Science,2008,42(2)： 327-331.
［6］ WANG Hui,XIANG Dong,DUAN Guanghong.A genetic algorithm for product disassembly sequence planning ［J］. Neurocomputing, 2008, 71(13)： 2720-2726.
［7］ 章小红,李世其,王俊蜂.基于蚁群算法的产品拆卸序列规划方法［J］.计算机辅助设计与图形学学报,2007,19(3)： 387-397.
ZHANG Xiaohong,LI Shiqi,WANG Junfeng.Product disassembly sequence planning based on ant colony optimization ［J］.Journal of ComputerAided Design and Computer Graphics,2007,19(3)： 387-397.
［8］ WANG Junfeng,LIU Jihong,LI Shiqi. Intelligent selective disassembly using the ant colony algorithm ［J］.Artificial Intelligence for Engineering Design,Analysis and Manufacturing,2003,17(4) ： 325-333.
［9］ 张秀芬,张树有.基于粒子群算法的产品拆卸序列规划方法［J］.计算机集成制造系统,2009,15(3)： 508-514.
ZHANG Xiufen,ZHANG Shuyou.Product disassembly sequence planning based on particle swarm optimization algorithm ［J］. Computer Integrated Manufacturing Systems, 2009,15(3)： 508-514.
［10］ VAN DEN BERGH F.An analysis of particle swarm optimizers ［D］. Pretoria: University of Pretoria,2002.
[1] SHEN Ye, LI Min-dan, XIA Shun-ren. Learning algorithm with non-balanced data for computer-aided
diagnosis of breast cancer[J]. J4, 2013, 47(1): 1-7.
[2] SHEN Ye, LI Min-dan, XIA Shun-ren. Learning algorithm with non-balanced data for computer-aided
diagnosis of breast cancer[J]. J4, 2013, 47(1): 1-7.
[3] ZHAO Jie-yi, TANG Min, TONG Ruo-feng. CUDA based shadow volume algorithm for subdivision surfaces[J]. J4, 2012, 46(7): 1301-1306.
[4] JIE Li-Jun, WANG Pan-Ni, ZHANG Shuai. Modified PSO method for automating transfer function designing
in volume rendering[J]. J4, 2010, 44(8): 1466-1472.
[5] MA Jin, Li-Feng, LI Jian-Hua. Perturbation method for distributed privacy-preserving data mining[J]. J4, 2010, 44(2): 276-282.
[6] CHENG Wen-Lou, TANG Lin-Zhong, LIU Yun-Tong. Ontology-based knowledge service modeling for innovation design process of ornament[J]. J4, 2009, 43(12): 2268-2273.
[7] LIU Xiao-Jian, SUN Shou-Qian, CHEN Shi. Image-based 3D pattern structure mapping of woven products[J]. J4, 2009, 43(8): 1367-1371.