Simplified swarm optimization in disassembly sequencing problems with learning effects

Authors:
Wei-Chang Yeh
Affiliations:
Integration and Collaboration Laboratory, Advanced Analytics Institute, Faculty of Engineering and Information Technology, University of Technology Sydney, PO Box 123 Broadway, New South Wales 200 ...
Venue:
Computers and Operations Research
Year:
2012

Citing 10
Cited 1

Swarm intelligence

Swarm intelligence
A path-relinking approach for a bi-criteria disassembly sequencing problem

Computers and Operations Research
A new hybrid approach for mining breast cancer pattern using discrete particle swarm optimization and statistical method

Expert Systems with Applications: An International Journal
A two-stage discrete particle swarm optimization for the problem of multiple multi-level redundancy allocation in series systems

Expert Systems with Applications: An International Journal
A scatter search approach to the optimum disassembly sequence problem

Computers and Operations Research
A Path Relinking approach for the Team Orienteering Problem

Computers and Operations Research
Scheduling problems with general effects of deterioration and learning

Information Sciences: an International Journal
Modeling automatic assembly and disassembly operations for virtual manufacturing

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Fuzzy-Petri-net-based disassembly planning considering human factors

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Optimization of the Disassembly Sequencing Problem on the Basis of Self-Adaptive Simplified Swarm Optimization

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

Minimizing resource consumption on uniform parallel machines with a bound on makespan

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

In classical disassembly sequencing problems (DSPs), the disassembly time of each item is assumed fixed and sequence-independent. From a practical perspective, the actual processing time of a component could depend on its position in the sequence. In this paper, a novel DSP called the learning-effect DSP (LDSP) is proposed by considering the general effects of learning in DSP. A modified simplified swarm optimization (SSO) method developed by revising the most recently published variants of SSO is proposed to solve this new problem. The presented SSO scheme improves the update mechanism, which is the core of any soft computing based methods, and revises the self-adaptive parameter control procedure. The conducted computational experiment with up to 500 components reflects the effectiveness of the modified SSO method in terms of final accuracy, convergence speed, and robustness.