We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Skip to main content
SpringerLink

Station ant colony optimization for the type 2 assembly line balancing problem

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

Abstract

An improved ant colony optimization (ACO), namely, station ant colony optimization (SACO), is proposed to solve the type 2 assembly line balancing problem (ALBP-2). In the algorithm, ACO is employed to search different better combinations of tasks (component solutions) for each station; an iteration compress mechanism is proposed to reduce the searching space of feasible solutions of ALBP-2. Three heuristic factors [i.e., (1) task time, (2) number of successors, and (3) number of releasable successors], two pheromones, and a task assignment mechanism are proposed to search better component solutions for every station. Finally, the effectiveness and stability of SACO are confirmed through comparison with literatures in 23 instances included in nine examples.

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. Scholl A (1999) Balancing and sequencing of assembly lines, 2nd edn. Physica, Heidelberg

    Google Scholar 

  2. Master AA (1970) An experimental investigation and comparative evaluation of production line balancing techniques. Manag Sci 16(11):728–745

    Article  Google Scholar 

  3. Gutjahr AL, Nemhauser GL (1964) An algorithm for the line balancing problem. Manag Sci 11(2):308–315

    Article  MathSciNet  MATH  Google Scholar 

  4. Salveson ME (1955) The assembly line balancing problem. J Ind Eng 6(3):18–25

    Google Scholar 

  5. Ghosh S, Gagnon RJ (1989) A comprehensive literature review and analysis of the design, balancing and scheduling of assembly lines. Int J Prod Res 27(4):637–670

    Article  Google Scholar 

  6. Boctor FF (1995) A multiple-rule heuristic for assembly line balancing. J Oper Res Soc 46(1):62–69

    MATH  Google Scholar 

  7. Arcus AL (1996) COMSOAL: a computer method of sequencing operations for assembly lines. Int J Prod Res 4(4):259–277

    Article  Google Scholar 

  8. Klein R, Scholl A (1996) Maximizing the production rate in simple assembly line balancing—a branch and bound procedure. Eur J Oper Res 91(2):367–385

    Article  MATH  Google Scholar 

  9. Scholl A, Klein R (1997) SALOME: a bidirectional branch and bound procedure for assembly line balancing. INFORMS J Comput 9(4):319–334

    Article  MATH  Google Scholar 

  10. Scholl A, Klein R (1999) Balancing assembly lines effectively a computational comparison. Eur J Oper Res 114(1):50–58

    Article  MATH  Google Scholar 

  11. Scholl A, Becker C (2006) State-of-the art exact and heuristic solution procedures for simple assembly line balancing. Eur J Oper Res 168(3):666–693

    Article  MathSciNet  MATH  Google Scholar 

  12. Talbot FB, Patterson JH (1984) An integer programming algorithm with network cuts for solving the assembly line balancing problem. Manag Sci 30(1):85–99

    Article  MATH  Google Scholar 

  13. Anderson EJ, Ferris MC (1994) Genetic algorithms for combinational optimization: the assembly line balancing problem. ORSA J Comput 6:161–173

    Article  MATH  Google Scholar 

  14. Rubinovitz J, Levitin G (1995) Genetic algorithm for assembly line balancing. Int J Prod Econ 41(1–3):343–354

    Article  Google Scholar 

  15. Scholl A, Voß S (1996) Simple assembly line balancing—Heuristic approaches. J Heuristics 2:217–244

    Article  Google Scholar 

  16. Chiang WC (1998) The application of a tabu search metaheuristic to the assembly line balancing problem. Ann Oper Res 77:209–227

    Article  MATH  Google Scholar 

  17. Goncalves JF, Raimundo de Almeida J (2002) A hybrid genetic algorithm for assembly line balancing. J Heuristics 8(6):629–642

    Article  Google Scholar 

  18. Sophie DL, Angel R, Soriano P (2006) Balancing assembly lines with Tabu search. Eur J Oper Res 168(3):826–837

    Article  MATH  Google Scholar 

  19. Boysen N, Fliedner M (2008) A versatile algorithm for assembly line balancing. Eur J Oper Res 184(1):39–56

    Article  MathSciNet  MATH  Google Scholar 

  20. Uğurdağ HF, Rachamadugu R, Papachristou CA (1997) Designing paced assembly lines with fixed number of stations. Eur J Oper Res 102:488–501

    Article  MATH  Google Scholar 

  21. Liu SB, Ong HL, Huang HC (2003) Two bi-directional heuristics for the assembly line type II problem. Int J Adv Manuf Technol 22(9–10):656–661

    Article  Google Scholar 

  22. Nearchou AC (2007) Balancing large assembly line by a new heuristic based on differential evolution method. Int J Adv Manuf Technol 34(9–10):1016–1029

    Article  Google Scholar 

  23. Ozcan K (2010) A Petri net-based heuristic for simple assembly line balancing problem of type 2. Int J Adv Manuf Technol 46(1–4):329–338

    Google Scholar 

  24. Colorni A, Dorigo M, Maniezzo V (1991) Distributed optimization by ant colonies. Proceedings of ECAL91-European conference on artificial life, Paris, France. Elsevier, Amsterdam, pp 134–142

    Google Scholar 

  25. Dorigo M, Stützle T (2004) Ant colony optimization. MIT Press, Cambridge

    Book  MATH  Google Scholar 

  26. Tsai CF, Tsai CW, Chang C (2003) A new and efficient ant-based heuristic method for solving the traveling salesman problem. Expert Syst 20(4):179–186

    Article  Google Scholar 

  27. Lee Z, Lee W (2003) A hybrid search algorithm of ant colony optimization and genetic algorithm applied to weapon-target assignment problems. Intell Data Eng Autom Learn 2690:278–285

    Article  Google Scholar 

  28. Gagné C, Price WL, Gravel M (2002) Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times. J Oper Res Soc 53(8):895–906

    Article  MATH  Google Scholar 

  29. Bautista J, Pereira J (2002) Ant algorithms for assembly line balancing. In proceedings of the third international workshop ANTS, Brussels, pp 65–75

    Book  Google Scholar 

  30. McMullen PR, Tarasewich P (2003) Using ant techniques to solve the assembly line balancing problem. IIE Trans 35(7):605–617

    Article  Google Scholar 

  31. Zeqiang Z, Wenming C, Bin Z, Jinnuo W (2007) Improved ant colony optimization for assembly line balancing problem. Comput Integr Manuf Syst 13(8):1632–1638, in Chinese

    Google Scholar 

  32. Ana SS, Pedro MV (2009) 2-ANTBAL: an ant colony optimisation algorithm for balancing two-sided assembly lines. Comput Ind Eng 56(2):489–506

    Article  Google Scholar 

  33. Ihsan S, Erdal E, Arda A (2009) Ant colony optimization for the single model U-type assembly line balancing problem. Int J Prod Econ 120(2):287–300

    Article  Google Scholar 

  34. Zhang X, Chen X, He Z (2010) An ACO-based algorithm for parameter optimization of support vector machines. Expert Syst Appl 37(9):6618–6628

    Article  Google Scholar 

  35. Barthodi JJ (1993) Balancing two-sided assembly lines: a case study. Int J Prod Res 31(10):2447–2461

    Article  Google Scholar 

  36. Kim YK, Song WS, Kim JH (2009) A mathematical model and a genetic algorithm for two-sided assembly line balancing. Comput Oper Res 36(3):853–865

    Article  MATH  Google Scholar 

  37. Thomopoulos NT (1967) Line balancing-sequencing for mixed-model assembly. Manag Sci 14(2):B59–B75

    Article  Google Scholar 

  38. Erdal E, Hadi G (1999) Shortest-route formulation of mixed-model assembly line balancing problem. Eur J Oper Res 116(1):194–204

    Article  MATH  Google Scholar 

  39. Mingzhou J, David SW (2003) A new heuristic method for mixed model assembly line balancing problem. Comput Ind Eng 44(1):159–169

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer College, Wuhan University, Wuhan, 430072, China

    Qiaoxian Zheng & Yuanxiang Li

  2. Faculty of Mathematic & Computer Science, Hubei University, Wuhan, 430062, China

    Qiaoxian Zheng

  3. Science College, Wuhan University of Science and Technology, Wuhan, 430065, China

    Ming Li

  4. College of Mechanics and Automation, Wuhan University of Science and Technology, Wuhan, 430065, China

    Qiuhua Tang

Authors
  1. Qiaoxian Zheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ming Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yuanxiang Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Qiuhua Tang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Qiaoxian Zheng.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zheng, Q., Li, M., Li, Y. et al. Station ant colony optimization for the type 2 assembly line balancing problem. Int J Adv Manuf Technol 66, 1859–1870 (2013). https://doi.org/10.1007/s00170-012-4465-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-012-4465-9

Keywords

Search

Navigation