This paper proposes adaptive versions of the particle swarm optimization algorithm (PSO). These new algorithms present self-adaptive inertia weight and timevarying adaptive swarm topology techniques. The objective of these new approaches is to avoid premature convergence by executing the exploration and exploitation stages simultaneously. Although proposed PSOs are fundamentally based on commonly utilized swarm behaviors of swarming creatures, the novelty is that the whole swarm may divide into many sub-swarms in order to find a good source of food or to flee from predators. This behavior allows the particles to disperse through the search space (diversification) and the sub-swarm, where the worst performance dies out while that with the best performance grows by producing offspring. The tendency of an individual particle to avoid collision with other particles by means of simple neighborhood rules is retained in these algorithms. Numerical experiments show that the new approaches, survival sub-swarms adaptive PSO (SSS-APSO) and survival sub-swarms adaptive PSO with velocity-line bouncing (SSS-APSO-vb), outperform other competitive algorithms by providing the best solutions on Communicated by V. Loia. B Choosak Pornsing a suite of standard test problem with a much higher consistency than the algorithms compared.

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.

No abstract

No abstract

No abstract