Skip to main content

Advertisement

SpringerLink
Log in

An assembly sequence planning approach with a rule-based multi-state gravitational search algorithm

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

Abstract

Assembly sequence planning (ASP) becomes one of the major challenges in product design and manufacturing. A good assembly sequence leads to reduced costs and duration in the manufacturing process. However, assembly sequence planning is known to be a classical NP-hard combinatorial optimization problem; ASP with many product components becomes more difficult to solve. In this paper, an approach based on a new variant of the gravitational search algorithm (GSA) called the rule-based multi-state gravitational search algorithm (RBMSGSA) is used to solve the assembly sequence planning problem. As in the gravitational search algorithm, the RBMSGSA incorporates Newton’s law of gravity, the law of motion, and a rule that makes each assembly component of each individual solution occur once based on precedence constraints; the best feasible sequence of assembly can then be determined. To verify the feasibility and performance of the proposed approach, a case study has been performed and a comparison has been conducted against other three approaches based on simulated annealing (SA), a genetic algorithm (GA), and binary particle swarm optimization (BPSO). The experimental results show that the proposed approach has achieved significant improvement in performance over the other methods studied.

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. Mello LSHD, Arthur CD (1990) AND/OR graph representation of assembly plans. IEEE Trans Robot Autom 6(2):188–199

    Article  Google Scholar 

  2. Zhang W (1989) Representation of assembly and automatic robot planning by petri net. IEEE Trans Syst Man Cybern 19(2):418–422

    Article  Google Scholar 

  3. Lee S, Shin YG (1990) Assembly planning based on geometric reasoning. Comput Graph 14(2):237–250

    Article  Google Scholar 

  4. Moore EK, As¸kıner G, Surendra MG (2001) Petri net approach to disassembly process planning for products with complex and/or precedence relations. Eur J Oper Res 135(2):428–449

    Article  MATH  Google Scholar 

  5. Zha XF (2000) An object-oriented knowledge based petri net approach to intelligent integration of design and assembly planning. Artif Intell Eng 14(1):83–112

    Article  Google Scholar 

  6. Garrod W, Everett LJ (1990) A.S.A.P.: automated sequential assembly planner. ASME International Computers in Engineering Conference, Boston, pp 139–150

    Google Scholar 

  7. Chakrabarty S, Wolter J (1997) A structure-oriented approach to assembly sequence planning. IEEE Trans Robot Autom 13(1):14–29

    Article  Google Scholar 

  8. Hong DS, Cho HS (1995) A neural network based computation scheme for generating optimized robotic assembly sequences. Eng Appl Artif Intell 8(2):129–145

    Article  Google Scholar 

  9. Chen WC, Tai PH, Deng WJ, Hsieh LF (2008) A three-stage integrated approach for assembly sequence planning using neural networks. Expert Syst Appl 34(3):1777–1786

    Article  Google Scholar 

  10. Huang HH, Wang MH, Johnson MR (2000) Disassembly sequence generation using a neural network approach. J Manuf Syst 19(2):73–82

    Article  Google Scholar 

  11. Bonneville F, Perrard C, Henrioud JM (1995) A genetic algorithm to generate and evaluate assembly plans. IEEE Symposium on Emerging Technologies and Factory Automation, Paris, pp 231–239

    Google Scholar 

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

    Google Scholar 

  13. De L, Latinne P, Rekiek B (2001) Assembly planning with an ordering genetic algorithm. Int J Prod Res 39(16):3623–3640

    Article  MATH  Google Scholar 

  14. Lu C, Wong YS, Fuh JYH (2006) An enhanced assembly planning approach using a multi-objective genetic algorithm. Proc Inst Mech Eng Part B J Eng Manuf 220(2):255–272

    Article  Google Scholar 

  15. Marian RM, Luong LHS, Abhary K (2003) Assembly sequence planning and optimization using genetic algorithms: part i. automatic generation of feasible assembly sequences. Appl Soft Comput 2(3):223–253

    Article  Google Scholar 

  16. Tseng YJ, Yu FY, Huang FY (2010) A multi-plant assembly sequence planning model with integrated assembly sequence planning and plant assignment using GA. Int J Adv Manuf Technol 48(1–4):333–345

    Article  Google Scholar 

  17. 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 

  18. Milner JM, Graves SC, Whitney DE (1994) Using simulated annealing to select least-cost assembly sequences. IEEE International Conference on Robotics and Automation, CA, pp 2058–2063

    Google Scholar 

  19. Motavalli S, Islam A (1997) Multi-criteria assembly sequencing. Comput Ind Eng 32(4):743–751

    Article  Google Scholar 

  20. Wang JF, Liu JH, Zhong YF (2005) A novel ant colony algorithm for assembly sequence planning. Int J Adv Manuf Technol 25(11–12):1137–1143

    Article  Google Scholar 

  21. Gao L, Qian WR, Li XY, Wang JF (2010) Application of memetic algorithm in assembly sequence planning. Int J Adv Manuf Technol 49(9–12):1175–1184

    Article  Google Scholar 

  22. Guo YW, Li WD, Mileham AR, Owen GW (2009) Applications of particle swarm optimization in integrated process planning and scheduling. Robot Comput Integr Manuf 25(2):280–288

    Article  Google Scholar 

  23. Mukred JAA, Ibrahim Z, Ibrahim I, Adam A, Wan K, Yusof ZM, Mokhtar N (2012) A binary particle swarm optimization approach to optimize assembly sequence planning. Adv Sci Lett 13(1):732–738

    Article  Google Scholar 

  24. Tseng YJ, Yu FY, Huang FY (2011) A green assembly sequence planning model with a closed-loop assembly and disassembly sequence planning using a particle swarm optimization method. Int J Adv Manuf Technol 57(9–12):1183–1197

    Article  Google Scholar 

  25. Cheng H, Li Y, Zhang KF (2009) Efficient method of assembly sequence planning based on ga and optimizing by assembly path feedback for complex product. Int J Adv Manuf Technol 42(11–12):1187–1204

    Google Scholar 

  26. 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–4):617–630

    Article  Google Scholar 

  27. Blum C, Roli A (2003) Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput Surv 35(3):268–308

    Article  Google Scholar 

  28. Talbi EG (2009) Metaheuristics: from design to implementation. John Wiley & Sons, NJ

    Book  Google Scholar 

  29. Rashedi E, Nezamabadi-pour H, Saryazdi S (2009) GSA: a gravitational search algorithm. Inf Sci 179(13):2232–2248

    Article  MATH  Google Scholar 

  30. Rashedi E, Nezamabadi-pour H, Saryazdi S (2010) BGSA: binary gravitational search algorithm. Nat Comput 9(3):727–745

    Article  MATH  MathSciNet  Google Scholar 

  31. Stentz A (1994) Optimal and efficient path planing for partially-known environments. IEEE International Conference on Robotics and Automation, CA, pp 3310–3317

    Google Scholar 

  32. Dieterich J, Hartke B (2012) Empirical review of standard benchmark functions using evolutionary global optimization. Appl Math 3:1552–1564

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Electrical and Electronics Engineering, Universiti Malaysia Pahang, 26600, Pekan, Pahang, Malaysia

    Ismail Ibrahim, Zuwairie Ibrahim, Hamzah Ahmad & Mohd Falfazli Mat Jusof

  2. Faculty of Manufacturing Engineering, Universiti Malaysia Pahang, 26600, Pekan, Pahang, Malaysia

    Zulkifli Md. Yusof

  3. Faculty of Electrical Engineering, Universiti Teknologi Malaysia, 81310, Skudai, Johor, Malaysia

    Sophan Wahyudi Nawawi

  4. Faculty of Engineering, Universiti Malaya, 50603, Kuala Lumpur, Malaysia

    Marizan Mubin

Authors
  1. Ismail Ibrahim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zuwairie Ibrahim
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hamzah Ahmad
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Mohd Falfazli Mat Jusof
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Zulkifli Md. Yusof
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Sophan Wahyudi Nawawi
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Marizan Mubin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zuwairie Ibrahim.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ibrahim, I., Ibrahim, Z., Ahmad, H. et al. An assembly sequence planning approach with a rule-based multi-state gravitational search algorithm. Int J Adv Manuf Technol 79, 1363–1376 (2015). https://doi.org/10.1007/s00170-015-6857-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-015-6857-0

Keywords

Search

Navigation