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

Volumn 42, Issue 1, 2012, Pages 250-261

  Yeh, Wei Chang ^a,b  

^a UNIVERSITY OF TECHNOLOGY SYDNEY   (Australia)

^b NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

End of life (EOL); feasible solution generator (FSG); precedence preservative operator (PPO); repetitive pairwise exchange (RPX); self adaptive parameter control (SPC); simplified swarm optimization (SSO)

Indexed keywords

NP-HARD; POLYNOMIAL APPROXIMATION; SOFT COMPUTING;

END OF LIVES; FEASIBLE SOLUTION GENERATOR (FSG); PRECEDENCE PRESERVATIVE OPERATORS (PPO); REPETITIVE PAIRWISE EXCHANGES (RPX); SELF ADAPTIVE PARAMETER CONTROLS (SPC); SIMPLIFIED SWARM OPTIMIZATIONS (SSO);

COMPUTATIONAL EFFICIENCY;

EID: 84655163249     PISSN: 10834427     EISSN: 15582426     Source Type: Journal    
DOI: 10.1109/TSMCA.2011.2157135     Document Type: Article

References (27)

1. S. M. Gupta and S. M. McGovern, “Multi-objective optimization in disassembly sequencing problems,” in Proc. 2nd World Conf. POM and 15th Annu. POM Conf., Cancun, Mexico, Apr. 30-May 3, 2004.
2. K. E. Moore, A. Gungor, and S. M. Gupta, “Petri net approach to disassembly process planning for products with complex AND/OR precedence relationships,” Eur. J. Oper. Res., vol. 135, no. 2, pp. 428–449, Dec. 2001.
3. A. Gungor, M. Surendra, and S. M. Gupta, “Disassembly sequence plan generation using branch-and-bound algorithm,” Int. J. Prod. Res., vol. 39, no. 3, pp. 481–509, Feb. 2001.
4. S. M. McGovern and S. M. Gupta, “Ant colony optimization for disassembly sequencing with multiple objectives,” Int. J. Adv. Manuf. Technol., vol. 30, no. 5/6, pp. 481–496, Sep. 2006.
5. A. J. D. Lambert and S. M. Gupta, Disassembly Modeling for Assembly, Maintenance, Reuse, and Recycling. Boca Raton, FL: CRC Press, 2005.
6. E. Kongar and S. M. Gupta, “Disassembly sequencing using genetic algorithm,” Int. J. Adv. Manuf. Technol., vol. 30, no. 5/6, pp. 497–506, Sep. 2006.
7. V. N. Rajan and S. Y. Nof, “Minimal precedence constraints for integrated assembly and execution planning,” IEEE Trans. Robot. Autom., vol. 12, no. 2, pp. 175–186, Apr. 1996.
8. Y. F. Huang and C. S. G. Lee, “Precedence knowledge in feature mating operation assembly planning,” in Proc. IEEE Int. Conf. Robot. Autom., 1989, pp. 216–221.
9. Y. Tang, M. Zhou, and M. Gao, “Fuzzy-Petri-net-based disassembly planning considering human factors,” IEEE Trans. Syst., Man, Cybern. A, Syst., Humans, vol. 36, no. 4, pp. 718–726, Jul. 2006.
10. S. M. Gupta and S. M. McGovern, “Greedy algorithm for disassembly line scheduling,” in Proc. IEEE Int. Conf. Syst., Man, Cybern., Oct. 5-8, 2003, vol. 2, pp. 1737–1744.
11. K. -M. Lee and M. Bailey-Van Kuren, “Modeling and supervisory control of a disassembly automation workcell based on blocking topology,” IEEE Trans. Robot. Autom., vol. 16, no. 1, pp. 67–77, Feb. 2000.
12. Y. Tang, M. C. Zhou, and R. Caudill, “An integrated approach to disassembly planning and demanufacturing operation,” IEEE Trans. Robot. Autom., vol. 17, no. 6, pp. 773–784, Dec. 2001.
13. S. M. Mok, C. -H. Wu, and D. T. Lee, “Modeling automatic assembly and disassembly operations for virtual manufacturing,” IEEE Trans. Syst., Man, Cybern. A, Syst., Humans, vol. 31, no. 3, pp. 223–232, May 2001.
14. M. M. Gao, M. C. Zhou, and R. Caudill, “Integration of disassembly leveling and bin assignment for demanufacturing automation,” IEEE Trans. Robot. Autom., vol. 18, no. 6, pp. 867–874, Dec. 2002.
15. S. C. Sarin, H. D. Sherali, and A. Bhootra, “A precedence-constrained asymmetric traveling salesman model for disassembly optimization,” IIE Trans., vol. 38, no. 3, pp. 223–237, Mar. 2006.
16. W. C. Yeh, “Study on quickest path networks with dependent components and apply to RAP,” Rep. NSC 97-2221-E-007-099-MY3, Taiwan, National Tsinghua University, Aug. 1, 2008-Jul. 31, 2011.
17. W. C. Yeh, “A two-stage discrete particle swarm optimization for the problem of multiple multi-level redundancy allocation in series systems,” Expert Syst. Appl., vol. 36, no. 5, pp. 9192–9200, Jul. 2009.
18. W. C. Yeh, W. W. Chang, and Y. Y. Chung, “A new hybrid approach for mining breast cancer pattern using discrete particle swarm optimization and statistical method,” Expert Syst. Appl., vol. 36, no. 4, pp. 8204–8211, May 2009.
19. J. Kennedy and R. C. Eberhart, “Particle swarm optimization,” in Proc. IEEE Int. Conf. Neural Netw., 1995, vol. 27, pp. 1942–1948.
20. J. Kennedy and R. C. Eberhart, “A discrete binary version of the particle swarm algorithm,” in Proc. IEEE Int. Conf. Syst., Man, Cybern., Oct. 12-15, 1997, vol. 5, pp. 4104–4108.
21. Y. Shi and R. C. Eberhart, “Empirical study of particle swarm optimization,” in Proc. Congr. Evol. Comput., 1999, pp. 1945–1950.
22. J. Kennedy, R. C. Eberhart, and Y. Shi, Swarm Intelligence. New York: Morgan Kaufmann, 2001.
23. G. G. Yen and W. F. Leong, “Dynamic multiple swarms in multiobjective particle swarm optimization,” IEEE Trans. Syst., Man, Cybern. A, Syst., Humans, vol. 39, no. 4, pp. 890–911, Jul. 2009.
24. S. Agrawal, Y. Dashora, M. K. Tiwari, and Y. -J. Son, “Interactive particle swarm: A pareto-adaptive metaheuristic to multiobjective optimization,” IEEE Trans. Syst., Man, Cybern. A, Syst., Humans, vol. 38, no. 2, pp. 258–277, Mar. 2008.
25. C. Bierwirth, D. C. Mattfeld, and H. Kopfer, “On permutation representations for scheduling problems,” in Parallel Problem Solving From Nature IV, H. -M. Voigt, W. Ebeling, I. Rechenberg, and H. -P. Schwefel, Eds. Berlin, Germany: Springer-Verlag, 1996, pp. 310–318.
26. C. Bierwirth and D. C. Mattfeld, “Production scheduling and rescheduling with genetic algorithms,” Evol Comput., vol. 7, no. 1, pp. 1–18, 1999.
27. W. C. Yeh, “A new branch-and-bound approach for the n/2/Flowshop/aF + βC max flowshop scheduling problem,” Comput. Oper. Res., vol. 26, no. 13, pp. 1293–1310, Nov. 1999.