Simplified swarm optimization in disassembly sequencing problems with learning effects

被引:91
作者
Yeh, Wei-Chang [1 ,2 ]
机构
[1] Natl Tsing Hua Univ, Dept Ind Engn & Engn Management, Hsinchu 300, Taiwan
[2] Univ Technol Sydney, Fac Engn & Informat Technol, Integrat & Collaborat Lab, Adv Analyt Inst, Sydney, NSW 2007, Australia
关键词
Disassembly sequencing problem; Learning effects; Simplified swarm optimization (SSO); Update mechanism; Self-adaptive parameter control;
D O I
10.1016/j.cor.2011.10.027
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
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. (C) 2011 Elsevier Ltd. All rights reserved.
引用
收藏
页码:2168 / 2177
页数:10
相关论文
共 32 条
[1]   A path-relinking approach for a bi-criteria disassembly sequencing problem [J].
Adenso-Diaz, Belarmino ;
Garcia-Carbajal, Santiago ;
Gupta, Surendra M. .
COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (12) :3989-3997
[2]   Single-machine scheduling with learning considerations [J].
Biskup, D .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 115 (01) :173-178
[3]   Integration of disassembly leveling and bin assignment for demanufacturing automation [J].
Gao, MM ;
Zhou, MC ;
Caudill, RJ .
IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 2002, 18 (06) :867-874
[4]   A scatter search approach to the optimum disassembly sequence problem [J].
González, B ;
Adenso-Díaz, B .
COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (06) :1776-1793
[5]   Disassembly sequence plan generation using a branch-and-bound algorithm [J].
Güngör, A ;
Gupta, SM .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2001, 39 (03) :481-509
[6]  
GUPTA SM, 2004, P 2 WORLD C POM 15 A
[7]  
Kennedy J, 1997, IEEE SYS MAN CYBERN, P4104, DOI 10.1109/ICSMC.1997.637339
[8]  
Kennedy J, 1995, 1995 IEEE INTERNATIONAL CONFERENCE ON NEURAL NETWORKS PROCEEDINGS, VOLS 1-6, P1942, DOI 10.1109/icnn.1995.488968
[9]  
Kennedy J. F., 2001, Swarm intelligence
[10]   Disassembly sequencing using genetic algorithm [J].
Kongar, Elif ;
Gupta, Surendra M. .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2006, 30 (5-6) :497-506