Discrete particle swarm optimization for disassembly sequence planning

Abstract

Due to government regulations, customer preferences, and cooperate finance interest, End-of-life (EOL) processing of products is becoming increasingly desirable. Reusing, recycling, remanufacturing, and disposing are choices for its processing. Most of all alternatives, disassembly may be needed. However, the disassembly process is a relatively expensive process due to its labor-intensive nature. Consequently, finding an optimal or near optimal disassembly sequence is desirable. This report presents a method of using discrete particle swarm optimization (PSO) for solving disassembly sequencing problem. The idea of applying PSO for a combinatorial optimization problem is proposed. Additionally, a dynamic precedence matrix for coping precedence constraints is presented. The test results show that the proposed method is effective and efficient for solving the disassembly sequencing problem.

Disassembly sequence planning: Recent developments and future trends

“…With this method, the velocity and position of particles are updated in each iteration. Pornsing and Watanasungsuit 46 used the discrete PSO to convert continuous velocity to discrete velocity through sigmoid and round functions. Xu et al 58 employed adaptive PSO to avoid premature convergence by using the inertia weight and adaptive mutation rate.…”

“…Manual work Yeh and colleagues, [38][39][40] Xia et al, [42][43][44][45]109 Pornsing and Watanasungsuit, 46 Xing et al, 47 Lu and Liu, 48 ElSayed et al, 50,116 Go et al, 52 Chen and Chen, 53 Zhang and colleagues, [54][55][56] Li et al, 57 Xu et al, 58 Azab et al, 59 Kheder et al, 60,146 Jin et al, 61,85,115 Tian et al, [62][63][64] Deng et al, 65 Kuo, 66,67 Guo and colleagues, 68,110 Hsu, 69 Huang et al, 71 Wang et al, 72 Jue et al, 73 Zhang, 74 Wang and colleagues, [75][76][77] Dong and Zhang, 78 Wei, 79 Zhao et al, 81 Zhang et al, 82 Yang et al, 83 Alshibli et al, 84 Güngö r and Gupta,…”

“…46,102 Based on the same rules, 74 the disassembly interference matrix was iteratively updated through the following rule: if all elements in column i are 0, then component i will be disassembled, after which, all the elements in row i of the disassembly interference matrix will be set to 0. 46 Slightly different from the method of publication, 46 component i should be disassembled if there is only a non-zero element in column (or row) i, after which, the corresponding row i and column i are deleted dynamically. 102 In terms of disassembly operations and support relationships, there also exist matrix-based methods that are different from the above.…”

“…In cases where manual disassembly is adopted to deal with uncertainties in the disassembly process, labour costs become a consideration. 46 Other factors affecting disassembly costs are the parts number 36 the disassembly distance, 47 maintenance degree, 60 mean time to repair (MTTR) 127 and operation number. 129 The disassembly revenue for a component is also a disassembly objective.…”

“…Disassembly cost objectives Disassembly time Basic disassembly time Time required for disassembling a regular component Yeh, 38,39 Chen et al, 41 Xia et al, 42 Pornsing and Watanasungsuit, 46 ElSayed et al, 49,50,116 Go et al, 52 Zhang and colleagues, [54][55][56] Azab et al, 59 Hsu, 69 Zhang, 74 Wang, 75 Tang et al, 96 Luo and colleagues, 101,102 Smith et al, 108 Li et al, 111,112 Jin et al, 115 Song and colleagues, 118,119 Percoco and Diella, 120 Wang et al, 124 Giudice and Fargione 143 and Kang et al 144…”