Skip to main content
Log in

Assembly sequence planning based on adaptive gravitational search algorithm

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

Aiming at the assembly sequence planning (ASP) of complex products, the evaluation system for the geometric feasibility, priority constraint, aggregation, redirection, and stability of the assembly sequence was considered. An assembly sequence planning method based on adaptive gravitational search algorithm (AGSA) is proposed. It includes building a mathematical model of algorithm optimization and the coding of assembly products based on the ASP problem. The reverse learning (RL) method is used to initialize the coding product to expand the search range of the initial population, and a new non-repeating exchange (NRE) rule is established to obtain a reasonable optimal value. At the same time, the dynamic adaptive adjustment coefficient (AAC) is used to accelerate the convergence and realize the dynamic adjustment of the assembly sequence until the optimal assembly sequence is obtained. Finally, two examples are given to verify the assembly sequence planning method based on the AGSA, and the superiority of this method is verified by comparing with other algorithms.

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

Access this article

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

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  1. Abdullah A, Rashid MFFA, Ponnambalam SG, Ghazalli Z (2019) Energy efficient modeling and optimization for assembly sequence planning using moth flame optimization. Assembly Autom 39 (2):356–368

    Article  Google Scholar 

  2. Arul R, Ravi G, Velusami S (2014) An improved harmony search algorithm to solve economic load dispatch problems with generator constraints. Electr Eng 96(1):55–63

    Article  Google Scholar 

  3. Bedeoui A, Hadj RB, Hammadi M, Trigui M, Aifaoui N (2019) Assembly sequence plan generation of heavy machines based on the stability criterion. Int J Adv Manuf Technol 102(9):2745–2755

    Article  Google Scholar 

  4. Choi YK, Dong ML, Cho YB (2009) An approach to multi-criteria assembly sequence planning using genetic algorithms. Int J Adv Manuf Technol 42(1-2):180–188

    Article  Google Scholar 

  5. Gao KZ, Suganthan PN, Pan QK, Chua TJ, Chong CS (2014) Discrete harmony search algorithm for flexible job shop scheduling problem with multiple objectives. J Intell Manuf 27(2):363–374

    Article  Google Scholar 

  6. Giladi C, Sintov A (2020) Manifold learning for efficient gravitational search algorithm. Inf Sci 517:18–36

    Article  MathSciNet  Google Scholar 

  7. Hadj RB, Belhadj I, Trigui M, Aifaoui N (2018) Assembly sequences plan generation using features simplification. Adv Eng Softw 119:1–11

    Article  Google Scholar 

  8. Ibrahim I, Ibrahim Z, Ahmad H, Jusof MFM, Yusof ZM, Nawawi SW, Mubin M (2015) An assembly sequence planning approach with a rule-based multi-state gravitational search algorithm. Int J Adv Manuf Technol 79(5):1363–1376

    Article  Google Scholar 

  9. Ibrahim I, Ibrahim Z, Ahmad H, Yusof ZM (2016) An assembly sequence planning approach with a multi-state particle swarm optimization. Lect Notes Comput Sc :841–852

  10. Kucukkoc I, Buyukozkan K, Satoglu SI, Zhang DZ (2019) A mathematical model and artificial bee colony algorithm for the lexicographic bottleneck mixed-model assembly line balancing problem. J Intell Manuf 30(8):2913–2925

    Article  Google Scholar 

  11. Li M, Wu B, Hu Y, Jin C, Shi T (2013) A hybrid assembly sequence planning approach based on discrete particle swarm optimization and evolutionary direction operation. Int J Adv Manuf Technol 68(1):617–630

    Article  Google Scholar 

  12. Liu Y, Liu X, Qi L (2012) Assembly sequence planning based on ant colony algorithm. Mach Electron 141:397–404

    Google Scholar 

  13. Lu C, Yang Z (2016) Integrated assembly sequence planning and assembly line balancing with ant colony optimization approach. Int J Adv Manuf Technol 83(1-4):243–256

    Article  Google Scholar 

  14. Lv HG, Cong L (2010) An assembly sequence planning approach with a discrete particle swarm optimization algorithm. Int J Adv Manuf Technol 50(5-8):761–770

    Article  Google Scholar 

  15. Marian RM, Luong LHS, Abhary K (2006) A genetic algorithm for the optimisation of assembly sequences. Comput Ind Eng 50(4):503–527

    Article  Google Scholar 

  16. Qiao L, Qie Y, Zhu Z, Zhu Y, Zaman UKU, Anwer N (2018) An ontology-based modelling and reasoning framework for assembly sequence planning. Int J Adv Manuf Technol 94(9):4187–4197

    Article  Google Scholar 

  17. Shoval S, Efatmaneshnik M, Ryan MJ (2016) Assembly sequence planning for processes with heterogeneous reliabilities. Int J Prod Res 55(10):2806–2828

    Article  Google Scholar 

  18. Tizhoosh HR (2005) Opposition-based learning: a new scheme for machine intelligence. CIMCA/IAWTIC 1:695–701

    Google Scholar 

  19. Xin L, Jianzhong S, Yujun C (2017) An efficient method of automatic assembly sequence planning for aerospace industry based on genetic algorithm. Int J Adv Manuf Technol 90(5-8):1307–1315

    Article  Google Scholar 

  20. Yang Y, Yang M, Shu L, Li S, Liu Z (2020) A novel parallel assembly sequence planning method for complex products based on psobc. Math Probl Eng 2020(3):1–11

    Google Scholar 

  21. Zhang W, Ma M, Li H, Yu J, Zhang Z (2020) An interference discrimination method for assembly sequence planning and assembly simulation. Assembly Autom 40(4):541–552

    Article  Google Scholar 

  22. Zhang Z, Yuan B, Zhang Z (2016) A new discrete double-population firefly algorithm for assembly sequence planning. P I Mech Eng Part B-J Eng Manuf 230(12):2229–2238

    Article  Google Scholar 

  23. Zhou W, Zheng JR, Yan JJ, Wang JF (2011) A novel hybrid algorithm for assembly sequence planning combining bacterial chemotaxis with genetic algorithm. Int J Adv Manuf Technol 52(5-8):715–724

    Article  Google Scholar 

Download references

Funding

This work was supported by the National Key R&D Program of China (Grant No. SQ2020YFF04 13296), the Gansu Province SME Innovation Fund (Grant No. 20CX4JA002), and the Lanzhou Talent Innovation and Entrepreneurship Project (Grant No. 2020-RC-105).

Author information

Authors and Affiliations

Authors

Contributions

GB wrote the manuscript and collected the data. ZSC, SH, and MCW collected the data and contributed to the writing of the text. All authors read and approved the final manuscript.

Corresponding author

Correspondence to Bo Gao.

Ethics declarations

Consent for Publication

All authors consented to the publication.

Competing interests

The authors declare that they have no competing interests.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gao, B., Zhang, S., Sun, H. et al. Assembly sequence planning based on adaptive gravitational search algorithm. Int J Adv Manuf Technol 115, 3689–3700 (2021). https://doi.org/10.1007/s00170-021-07241-w

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-021-07241-w

Keywords

Navigation