Skip to main content

Disassembly Sequence Planning Using a Simplified Teaching-Learning-Based Optimization Algorithm

  • Chapter
  • First Online:
Sustainable Manufacturing and Remanufacturing Management

Abstract

Disassembly sequence planning (DSP) is a challenging NP-hard combinatorial optimization problem. As a new and promising population-based evolutional algorithm, teaching-learning-based optimization (TLBO) algorithm has been successfully applied to various research problems. However, TLBO is not capable or effective in DSP optimization problems with discrete solution spaces and complex disassembly precedence constraints. This chapter presents a simplified teaching-learning-based optimization (STLBO) algorithm to solve DSP problems effectively. The STLBO algorithm inherits the main idea of the teaching-learning-based evolutionary mechanism from the TLBO algorithm, while the realization method of the evolutionary mechanism and the adaptation methods of the algorithm parameters are different. Three new operators are developed and incorporated in the STLBO algorithm to ensure its applicability to DSP problems with complex disassembly precedence constraints: i.e., a feasible solution generator (FSG) used to generate a feasible disassembly sequence, a teaching phase operator (TPO), and a learning phase operator (LPO) used to learn and evolve the solutions toward better ones by applying the method of precedence preservation crossover operation. Numerical experiments and case studies on waste product disassembly planning have been carried out to demonstrate the effectiveness of the designed operators and the results exhibited that the developed algorithm performs better than other relevant algorithms under a set of public benchmarks.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Gungor, A., & Gupta, S. M. (1999). Issues in environmentally conscious manufacturing and product recovery: a survey. Computers & Industrial Engineering, 36, 811–853.

    Article  Google Scholar 

  2. Lambert, A. J. D. (2003). Disassembly sequencing: A survey. International Journal of Production Research, 41, 3721–3759.

    Article  Google Scholar 

  3. Smith, S. S., & Chen, W. H. (2011). Rule-based recursive selective disassembly sequence planning for green design. Advanced Engineering Informatics, 25, 77–87.

    Article  Google Scholar 

  4. Kuo, T. C., Zhang, H. C., & Huang, S. H. (2000). Disassembly analysis for electromechanical products: A graph-based heuristic approach. International Journal of Production Research, 38, 993–1007.

    Article  Google Scholar 

  5. Kongar, E., & Gupta, S. M. (2006). Disassembly sequencing using genetic algorithm. International Journal of Advanced Manufacturing Technology, 30, 497–506.

    Article  Google Scholar 

  6. Giudice, F., & Fargione, G. (2007). Disassembly planning of mechanical systems for service and recovery: A genetic algorithms based approach. Journal of Intelligent Manufacturing, 18, 313–329.

    Article  Google Scholar 

  7. Go, T. F., Wahab, D. A., Ab Rahman, M. N., Ramli, R., & Hussain, A. (2012). Genetically optimised disassembly sequence for automotive component reuse. Expert Systems with Applications, 39, 5409–5417.

    Article  Google Scholar 

  8. Wang, H., Xian, D. G., & Duan, G. H. (2008). A genetic algorithm for product disassembly sequence planning. Neurocomputing, 71, 2720–2726.

    Article  Google Scholar 

  9. Wu, H., & Zuo, H. F. (2009). Using genetic/simulated annealing algorithm to solve dis-assembly sequence planning. Journal of System Engineering Electron, 20, 906–912.

    Google Scholar 

  10. Li, J. R., Khoo, L. P., & Tor, S. B. (2002). A novel representation scheme for disassembly sequence planning. International Journal of Advanced Manufacturing Technology, 20, 621–630.

    Article  Google Scholar 

  11. Seo, K. K., Park, J. H., & Jang, D. S. (2001). Optimal disassembly sequence using genetic algorithms considering economic and environmental aspects. International Journal of Advanced Manufacturing Technology, 18, 371–380.

    Article  Google Scholar 

  12. Li, J. R., Khoo, L. P., & Tor, S. B. (2005). An object-oriented intelligent disassembly se-quence planner for maintenance. Computers in Industry, 56, 699–718.

    Article  Google Scholar 

  13. Tseng, Y. J., Yu, F. Y., & Huang, F. Y. (2011). A green assembly sequence planning model with a closed-loop assembly and disassembly sequence planning using a particle swarm optimization method. International Journal of Advanced Manufacturing Technology, 57, 1183–1197.

    Article  Google Scholar 

  14. Wang, Y., & Liu, J. H. (2010). Chaotic particle swarm optimization for assembly sequence planning. Robotics and Computer-Integrated Manufacturing, 26, 212–222.

    Article  MathSciNet  Google Scholar 

  15. Lv, H. G., & Lu, C. (2010). An assembly sequence planning approach with a discrete particle swarm optimization algorithm. International Journal of Advanced Manufacturing Technology, 50, 761–770.

    Article  Google Scholar 

  16. Yeh, W. C. (2012). Optimization of the disassembly sequencing problem on the ba-sis of self-adaptive simplified swarm optimization. IEEE Transactions on System, Man, Cybernetics, Part A, 42, 250–261.

    Article  Google Scholar 

  17. Yeh, W. C. (2012). Simplified swarm optimization in disassembly sequencing problems with learning effects. Computer Operation Research, 39, 2168–2177.

    Article  Google Scholar 

  18. Li, W. D., Xia, K., Gao, L., & Chao, K. M. (2013). Selective disassembly planning for waste electrical and electronic equipment with case studies on liquid crystal displays. Robotics and Computer-Integrated Manufacturing, 29, 248–260.

    Article  Google Scholar 

  19. Wang, J. F., Liu, J. H., & Zhong, Y. F. (2005). A novel ant colony algorithm for assembly sequence planning. International Journal of Advanced Manufacturing Technology, 25, 1137–1143.

    Article  Google Scholar 

  20. Agrawal, S., & Tiwari, M. K. (2008). A collaborative ant colony algorithm to stochastic mixed-model U-shaped disassembly line balancing and sequencing problem. International Journal of Production Research, 46, 1405–1429.

    Article  Google Scholar 

  21. McGovern, S. M., & Gupta, S. M. (2006). Ant colony optimization for disassembly sequencing with multiple objectives. International Journal of Advanced Manufacturing Technology, 30, 481–496.

    Article  Google Scholar 

  22. Wang, J. F., Liu, J. H., Li, S. Q., & Zhong, Y. F. (2003). Intelligent selective disassembly using the ant colony algorithm. Ai Edam, 17, 325–333.

    Google Scholar 

  23. Adenso-Diaz, B., Garcia-Carbajal, S., & Lozano, S. (2007). An efficient GRASP algorithm for disassembly sequence planning. OR Spectrum, 29, 535–549.

    Article  Google Scholar 

  24. Adenso-Díaz, B., García-Carbajal, S., & Gupta, S. M. (2008). A path-relinking approach for a bi-criteria disassembly sequencing problem. Computer Operation Research, 35, 3989–3997.

    Article  Google Scholar 

  25. Andres, C., Lozano, S., & Adenso-Diaz, B. (2007). Disassembly sequence planning in a disassembly cell context. Robotics and Computer-Integrated Manufacturing, 23, 690–695.

    Article  Google Scholar 

  26. Rao, R. V., Savsani, V. J., & Vakharia, D. P. (2012). Teaching–Learning-Based Optimiza-tion: An optimization method for continuous non-linear large scale prob-lems. Information Sciences, 183, 1–15.

    Article  MathSciNet  Google Scholar 

  27. Rao, R. V., Savsani, V. J., & Vakharia, D. P. (2011). Teaching-learning-based optimiza-tion: A novel method for constrained mechanical design optimization prob-lems. Computer Aided Design, 43, 303–315.

    Article  Google Scholar 

  28. Rao, R., & Patel, V. (2012). An elitist teaching-learning-based optimization algorithm for solving complex constrained optimization problems. International Journal of Industrial Engineering Computations, 3.

    Article  Google Scholar 

  29. Rao, R., & Patel, V. (2013). Comparative performance of an elitist teach-ing-learning-based optimization algorithm for solving unconstrained opti-mization problems. International Journal of Industrial Engineering Computations, 4.

    Article  Google Scholar 

  30. Pawar, P. J., & Rao, R. V. (2012). Parameter optimization of machining processes using teaching–learning-based optimization algorithm. The International Journal of Advanced Manufacturing Technology, 67, 995–1006.

    Article  Google Scholar 

  31. Venkata, Rao R., & Kalyankar, V. D. (2013). Parameter optimization of modern ma-chining processes using teaching–learning-based optimization algorithm. Engineering Applications on Artificial Intelligence, 26, 524–531.

    Article  Google Scholar 

  32. Rao, R. V., & Kalyankar, V. D. (2012). Parameter optimization of machining processes using a new optimization algorithm. Material Manufacturing Processing, 27, 978–985.

    Article  Google Scholar 

  33. Chandra, S. S., Naik, A., & Parvathi, K. (2012). High dimensional real parameter optimization with teaching learning based optimization. International Journal of Industrial Engineering Computations, 3, 807–816.

    Article  Google Scholar 

  34. Jadhav, H. T., Chawla, D., & Roy, R. (2012). Modified teaching learning based algorithm for economic load dispatch incorporating wind power. In Proceedings of 2012 11th International Conference on Environment and Electrical Engineering (EEEIC), (pp. 397–402).

    Google Scholar 

  35. Niknam, T., Golestaneh, F., & Sadeghi, M. S. (2012). Multiobjective teaching–learning-based optimization for dynamic economic emission dispatch. IEEE Systems Journal, 6, 341–352.

    Article  Google Scholar 

  36. Li, J. R., Wang, Q. H., Huang, P., & Shen, H. Z. (2010). A novel connect-or-knowledge-based approach for disassembly precedence constraint gener-ation. International Journal of Advanced Manufacturing Technology, 49, 293–304.

    Article  Google Scholar 

  37. González, B., & Adenso-Díaz, B. (2005). A bill of materials-based approach for end-of-life decision making in design for the environment. International Journal of Production Research, 43, 2071–2099.

    Article  Google Scholar 

  38. Gonzalez, B., & Adenso-Diaz, B. (2006). A scatter search approach to the optimum dis-assembly sequence problem. Computer Operation Research, 33, 1776–1793.

    Article  Google Scholar 

  39. Adenso-Diaz, B., Moure, F., & Rendueles, M. (2002). Automatic disassembly plans: Application to the continuous process industries. Journal of Manufacturing Systems, 21, 276–286.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Liang Gao .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer International Publishing AG, part of Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Xia, K., Gao, L., Li, W., Chao, KM. (2019). Disassembly Sequence Planning Using a Simplified Teaching-Learning-Based Optimization Algorithm. In: Li, W., Wang, S. (eds) Sustainable Manufacturing and Remanufacturing Management. Springer, Cham. https://doi.org/10.1007/978-3-319-73488-0_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-73488-0_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-73487-3

  • Online ISBN: 978-3-319-73488-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics