SpringerLink
Log in

A novel ant colony algorithm for assembly sequence planning

  • Original Article
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

An ant colony algorithm-based approach to assembly sequence generation and optimization of mechanical products is presented in this article. For diverse assemblies, the approach generates different amount of ants cooperating to find optimal solutions with the least reorientations during assembly processes. Based on assembly by disassembly philosophy, a candidate list composed by feasible and reasonable disassembly operations that are derived from disassembly matrix guides sequences construction in the solution space expressed implicitly, and so guarantees the geometric feasibility of sequences. The state-transition rule and local- and global-updating rules are defined to ensure acquiring of the optimal solutions. Cases are given to show the effectiveness of the proposed approach, and the characteristics of the algorithm are discussed.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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. Boothroyd G, Dewhurst P, Knight W (1994) Product design for manufacture and assembly. Marcel Dekker, New York

  2. Ben-Arich D, Kramer B (1994) Computer-aided process planning for assembly: generation of assembly operation sequences. Int J Prod Res 33(3):643–656

    Article  Google Scholar 

  3. De Fazio TL, Whitney DE (1987) Simplified generation of all mechanical assembly sequences. IEEE J Robotics Automation 3(6):640–658

    Article  Google Scholar 

  4. Homem De Mello LS, Sanderson AC (1991) A correct and complete algorithm for the generation of mechanical assembly sequences. IEEE Trans Robot Automation 7(2):228–240

    Article  Google Scholar 

  5. Kaufman SG, Wilson RH, et al. (1996) The Archimedes 2 mechanical assembly planning system. Proceedings of the IEEE International Conference on Robotics and Automation, pp 3361–3368

  6. Smith GC, Smith SS-F (2002) An enhanced genetic algorithm for automated assembly planning. Robot Comput Integr Manuf 18(5–6):355–364

    Google Scholar 

  7. Zha XF, Lim SYE, Fok SC (1999) Development of expert system for concurrent product design and planning for assembly. Int J Adv Manuf Technol 15(3):153–162

    Article  Google Scholar 

  8. Anwar SM (1997) Multi-criteria assembly sequencing. Comput Industr Eng 32(4):743–751

    Article  Google Scholar 

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

    Article  Google Scholar 

  10. Bonneville F, Perrard C, Henrioud JM (1995) A genetic algorithm to generate and evaluate assembly plans. Proceedings of the IEEE Symposium on Emerging Technology and Factory Automation, 231–239

  11. Chen SF, Liu Y (2001) An adaptive genetic assembly sequence planner. Int J Comput Integr Manuf 14(5):489–500

    Article  Google Scholar 

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

    Article  Google Scholar 

  13. Guan Q, Liu JH, Zhong YF (2002) A concurrent hierarchical evolution approach to assembly process planning. Int J Prod Res 40(14):3357–3374

    Article  Google Scholar 

  14. Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evolu Comput 1(1):53–66

    Article  Google Scholar 

  15. Dorigo M (1992) Optimization, learning and natural algorithms. Thesis, Department of Electronics, Politecnico di Milano, Italy

  16. Dorigo M et al. (1996) The ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybernet 26(1):29–41

    Article  Google Scholar 

  17. McMullen PR (2001) An ant colony optimization approach to addressing a JIT sequencing problem with multiple objectives. Artif Intell Eng 15(3):309–307

    Article  Google Scholar 

  18. T’kindt V, Monmarche N et al. (2002) An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem. Eur J Oper Res 142(3):250–257

    Article  Google Scholar 

  19. Failli F, Dini G (2000) Ant colony systems in assembly planning: a new approach to sequence detection and optimization. Proceedings of the 2nd CIRP International Seminar on Intelligent Computation in Manufacturing Engineering, 227–232

    Google Scholar 

  20. Huang YM, Huang CT (2002) Disassembly matrix for disassembly processes of products. Int J Prod Res 40(2):255–273

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CAD Center, School of Mechanical Science and Engineering, Huazhong University of Science & Technology, Wuhan, Hubei, P.R. China, 430074

    J.F. Wang, J.H. Liu & Y.F. Zhong

Authors
  1. J.F. Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J.H. Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Y.F. Zhong
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to J.F. Wang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, J., Liu, J. & Zhong, Y. A novel ant colony algorithm for assembly sequence planning. Int J Adv Manuf Technol 25, 1137–1143 (2005). https://doi.org/10.1007/s00170-003-1952-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-003-1952-z

Keywords

Search

Navigation