Skip to main content
SpringerLink
Log in

Ant Algorithms for Assembly Line Balancing

  • Conference paper
  • First Online:
Ant Algorithms (ANTS 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2463))

Included in the following conference series:

Abstract

The present work is focused on the assembly line balancing design problems whose objective is to minimize the number of stations needed to manufacture a product in a line given a fixed cycle time, equivalent to a fixed production rate. The problem is solved using an ACO metaheuristic implementation with different features, obtaining good results. Afterwards, an adaptation of the previous implementation is used to solve a real case problem found in a bike assembly line with a hierarchical multi-objective function and additional constraints between tasks.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agnetis, A., A. Ciancimino, M. Lucertini and M. Pizzichella: Balancing Flexible Lines for Car Components Assembly. International Journal of Production Research (1995) 33: 333–350.

    Article  MATH  Google Scholar 

  2. Bauer, A., B. Bullnheimer, R.F. Hartl and C. Strauss: An Ant Colony Optimization Approach for the Single Machine Total Tardiness Problem. In Proceedings of the 1999 Congress on Evolutionary Computation (CEC’99). IEEE Press, Piscataway, NJ. (1999) 1445–1450.

    Google Scholar 

  3. Bautista, J., R. Suárez, M. Mateo and R. Companys: Local Search Heuristics for the Assembly Line Balancing Problem with Incompatibilities Between Tasks. In Proceedings of the 2000 IEEE International Conference on Robotics and Automation, ICRA 2000, (2000) 2404–2409.

    Google Scholar 

  4. Baybars, I.: A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem. Management Science (1986) 32 (8): 909–932.

    Article  MATH  MathSciNet  Google Scholar 

  5. Boctor F.F.: A Multiple-rule Heuristic for Assembly Line Balancing. Journal of the Operational Research Society, (1995) 46: 62–69.

    Article  MATH  Google Scholar 

  6. Daganzo, C.F and D.E. Blumfield: Assembly System Design Principles and Tradeoffs, International Journal of Production Research (1994) 32: 669–681

    Article  MATH  Google Scholar 

  7. Deckro, R.F.: Balancing Cycle Time and Workstations. IIE Transactions (1989) 21: 106–111

    Article  Google Scholar 

  8. Dorigo M. and L. M. Gambardella: Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation (1997) 1(1): 53–66.

    Article  Google Scholar 

  9. Dorigo M., V. Maniezzo and A. Colorni: The Ant System: An Autocatalytic Optimizing Process. Technical Report 91-016 Revised, Dipartimento di Electronica, Politecnico di Milano, Italy (1991).

    Google Scholar 

  10. Dorigo M., V. Maniezzo and A. Colorni: The Ant System: Optimization by a Colony of Cooperating Agents. IEEE Transactions on Systems, Man, and Cybernetics-Part B, (1996) 26(1): 29–41

    Article  Google Scholar 

  11. Hackman, S.T. M.J. Magazine and T.S. Wee: Fast, Effective Algorithms for Simple Assembly Line Balancing Problems. Operations Resarch (1989) 37, 916–924.

    MATH  Google Scholar 

  12. Hoffmann, T.R.: Eureka. A Hybrid System for Assembly Line Balancing. Management Science, (1992) 38 (1): 39–47.

    MATH  Google Scholar 

  13. Johnson R.V.: Optimally Balancing Assembly Lines with „FABLE”. Management Science (1988) 34: 240–253

    Google Scholar 

  14. Daniel Merkle, Martin Middendorf: An Ant Algorithm with a New Pheromone Evaluation Rule for Total Tardiness Problems, Proceeding of the EvoWorkshops (2000)

    Google Scholar 

  15. Merkle, D., M. Middedorf, and H. Schmeck: Ant Colony Optimization for Resource Constrained Project Scheduling. Proceedings of GECCO-2000. (2000)

    Google Scholar 

  16. Scholl, A.: Balancing and Sequencing of Assembly Lines, Physica-Verlag, Heidelberg (1999)

    Google Scholar 

  17. Scholl, A. and R. Klein: Balancing Assembly Lines Effectively-A Computational Comparison. European Journal of Operational Research (1999) 114: 50–58

    Article  MATH  Google Scholar 

  18. Taillard É. D.: Ant Systems, in: P. Pardalos & M. G. C. Resende (eds.), Handbook of Applied Optimization, Oxford Univ. Press, (2002) 130–137

    Google Scholar 

  19. Talbot, F.B., J.H. Patterson and W.V. Gehrlein: A Comparative Evaluation of Heuristic Line Balancing Techniques, Management Science (1986) 32: 430–454.

    Google Scholar 

  20. Ugurdag, H.F., R. Rachamadugu, and A. Papachristou: Designing Paced Assembly Lines with Fixed Number of Stations. European Journal of Operational Research, (1997) 102(3): 488–501.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ETSEIB, Universitat Politécnica de Catalunya, Avda. Diagonal 647, Planta 7, 08028, Barcelona, Spain

    Joaquín Bautista & Jordi Pereira

Authors
  1. Joaquín Bautista
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jordi Pereira
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IRIDIA, Université de Bruxelles, CP 194/6 Avenue Franklin D. Roosevelt 50, 1050, Brussels, Belgium

    Marco Dorigo , Gianni Di Caro  & Michael Sampels ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bautista, J., Pereira, J. (2002). Ant Algorithms for Assembly Line Balancing. In: Dorigo, M., Di Caro, G., Sampels, M. (eds) Ant Algorithms. ANTS 2002. Lecture Notes in Computer Science, vol 2463. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45724-0_6

Download citation

  • DOI: https://doi.org/10.1007/3-540-45724-0_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44146-5

  • Online ISBN: 978-3-540-45724-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation