Skip to main content
SpringerLink
Log in

A Discrete Bat Algorithm for Disassembly Sequence Planning

  • Published:
Journal of Shanghai Jiaotong University (Science) Aims and scope Submit manuscript

Abstract

Based on the bat algorithm (BA), this paper proposes a discrete BA (DBA) approach to optimize the disassembly sequence planning (DSP) problem, for the purpose of obtaining an optimum disassembly sequence (ODS) of a product with a high degree of automation and guiding maintenance operation. The BA for solving continuous problems is introduced, and combining with mathematical formulations, the BA is reformed to be the DBA for DSP problems. The fitness function model (FFM) is built to evaluate the quality of disassembly sequences. The optimization performance of the DBA is tested and verified by an application case, and the DBA is compared with the genetic algorithm (GA), particle swarm optimization (PSO) algorithm and differential mutation BA (DMBA). Numerical experiments show that the proposed DBA has a better optimization capability and provides more accurate solutions than the other three algorithms.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. ZHANG X F, YU G, HU Z Y, et al. Parallel disassembly sequence planning for complex products based on fuzzy-rough sets [J]. The International Journal of Advanced Manufacturing Technology, 2014, 72(1-4): 231–239.

    Article  Google Scholar 

  2. MIN S S, ZHU X J, ZHU X. Mechanical product disassembly and/or graph construction [C]//International Conference on Measuring Technology and Mechatronics Automation. Changsha, China: IEEE, 2010: 627–631.

    Chapter  Google Scholar 

  3. PETER M, WANG C G, CHEN J T. Virtual disassembly sequences generation and evaluation [J]. Procedia CIRP, 2016, 44(1): 347–352.

    Google Scholar 

  4. MAROUA K, MOEZ T, NIZAR A. Disassembly sequence planning based on a genetic algorithm [J]. Proceedings of the Institution of Mechanical Engineers, Part C: Journal of Mechanical Engineering Science, 2015, 229(12): 2281–2290.

    Google Scholar 

  5. PORNSING C, WATANASUNGSUIT A. A discrete particle swarm optimization for disassembly sequence planning [C]//IEEE International Conference on Management of Innovation and Technology. London, UK: IEEE, 2014: 480–485.

    Google Scholar 

  6. ZHANG X H, TIAN L. Selective disassembly sequence planning based on ant colony algorithm [C]//7th International Conference on System of Systems Engineering. Genova, Italy: IEEE, 2012: 236–239.

    Google Scholar 

  7. LU C, LIU Y C. A disassembly sequence planning approach with an advanced immune algorithm [J]. Proceedings of the Institution of Mechanical Engineers, Part C: Journal of Mechanical Engineer Science, 2012, 226(11): 2739–2749.

    Google Scholar 

  8. LIU Z F, YANG D J, GU G G. Disassembly sequence planning based on particle swarm-simulated annealing optimization [J]. Journal of Hefei University of Technology: Natural Science Edition, 2011, 34(2): 161–165 (in Chinese).

    Google Scholar 

  9. YEH W C, WEI S C. Simplified swarm optimization in efficient tool assignment of disassembly sequencing problem [C]//IEEE Congress on Evolutionary Computation. Cancun, Mexico: IEEE, 2013: 2712–2719.

    Google Scholar 

  10. YEH W C. Simplified swarm optimization in disassembly sequencing problems with learning effects [J]. Computers & Operation Research, 2012, 39(9): 2168–2177.

    Article  MATH  Google Scholar 

  11. SONG S X, ZHANG W S, ZHANG L. Product disassembly sequence planning based on improved artificial bee colony algorithm [J]. China Mechanical Engineering, 2016, 27(17): 2384–2390 (in Chinese).

    Google Scholar 

  12. XIA K, GAO L, LI W D, et al. Disassembly sequence planning using a simplified teaching-learning-based optimization algorithm [J]. Advanced Engineering Informatics, 2014, 28(4): 518–527.

    Article  Google Scholar 

  13. YANG X S. A new metaheuristic bat-inspired algorithm [C]//Nature Inspired Cooperative Strategies for Optimization (NICSO 2010). Berlin, German: Springer, 2010: 65–74.

    Chapter  Google Scholar 

  14. YANG X S, AMIR H G. Bat algorithm: a novel approach for global engineering optimization [J]. Engineering Computations, 2012, 29(5): 464–483.

    Article  Google Scholar 

  15. ZHAO Y X, YANG X S, LIU L Q. New meta-heuristic optimization algorithms [M]. Beijing, China: Science Press, 2013: 313–314 (in Chinese).

    Google Scholar 

  16. YASSINE S, MOHMMED E R. A novel discrete bat algorithm for solving the travelling salesman problem [J]. Neural Computing & Applications, 2016, 27(7): 1853–1866.

    Article  Google Scholar 

  17. YANG X S, MEHMET K, SIMON F. Bat algorithm for topology optimization in microelectronic applications [C]//The 1st International Conference on Future Generation Communication Technologies. London, UK: IEEE, 2012: 150–155.

    Google Scholar 

  18. ESLAM A H, AHMED I H, ABOUL E H, et al. A discrete bat algorithm for the community detection problem [J]. Lecture Notes in Computer Science, 2015, 9129(1): 188–199.

    Google Scholar 

  19. IWANKOWICZ R R. An efficient evolutionary method of assembly sequence planning for shipbuilding industry [J]. Assembly Automation, 2016, 36(1): 60–71.

    Article  Google Scholar 

  20. PENG M. Research on assembly sequence planning based on differential mutation bat algorithm [D]. Xiangtan, China: Xiangtan University, 2014 (in Chinese).

    Google Scholar 

  21. ZENG B, LI M F, ZHANG Y, et al. Research on assembly sequence planning based on firefly algorithm [J]. Journal of Mechanical Engineering, 2013, 49(11): 177–184 (in Chinese).

    Article  Google Scholar 

  22. WANG S, SUN Z Z, GUO J W, et al. Assembly sequence planning based on shuffled frog leaping algorithm [J]. Computer Integrated Manufacturing Systems, 2014, 20(12): 2991–2999 (in Chinese).

    Google Scholar 

  23. JIAO Q L, XU D, LI C. Product disassembly sequence planning based on flower pollination algorithm [J]. Computer Integrated Manufacturing Systems, 2016, 22(12): 2791–2799 (in Chinese).

    Google Scholar 

  24. LI X. Research on assembly sequence planning based on the genetic algorithm and application [D]. Shenyang, China: Northeastern University, 2011 (in Chinese).

    Google Scholar 

  25. LV H G, LU C. A discrete particle swarm optimization algorithm for assembly sequence planning [C]//8th International Conference on Reliability, Maintainability and Safety. Chengdu, China: IEEE, 2009: 1119–1122.

    Google Scholar 

  26. EBERHART R C, KENNEDY J. A new optimizer using particle swarm theory [C]//Proceedings of the 6th International Symposium on Micro Machine and Human Science. Piscataway, NJ, USA: IEEE, 1995: 39–43.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Arms Engineering, Academy of Armored Force Engineering, Beijing, 100072, China

    Qinglong Jiao  (焦庆龙) & Da Xu  (徐达)

Authors
  1. Qinglong Jiao  (焦庆龙)
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Da Xu  (徐达)
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Qinglong Jiao  (焦庆龙).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jiao, Q., Xu, D. A Discrete Bat Algorithm for Disassembly Sequence Planning. J. Shanghai Jiaotong Univ. (Sci.) 23, 276–285 (2018). https://doi.org/10.1007/s12204-018-1937-6

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12204-018-1937-6

Keywords

CLC number

Document code

Search

Navigation