Skip to main content

Artificial bee colony algorithms for two-sided assembly line worker assignment and balancing problem

  • Conference paper
  • First Online:
Book cover Distributed Computing and Artificial Intelligence, 14th International Conference (DCAI 2017)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 620))

Abstract

Worker assignment is a new type of problem in assembly line balancing problems, which typically occurs in sheltered work centers for the disabled. However, only a few contributions consider worker assignment in a two-sided assembly line. This research presents three variants of artificial bee colony algorithm to solve worker assignment and line balancing in two-sided assembly lines. The utilization of meta-heuristics is motivated by the NP-hard nature of the problem and the chosen methods utilize different operators for onlooker phase and scout phase. The proposed algorithms are tested on 156 cases generated from benchmark problems. A comparative study is conducted on the results obtained from the three proposed variants and other well-known metaheuristic algorithms, such as simulated annealing, particle swarm optimization and genetic algorithm. The computational study demonstrates that the proposed variants produce more promising results and are able to solve this new problem effectively in an acceptable computational time.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Miralles, C., Garcia-Sabater, J.P., Andres, C., Cardos, M.: Advantages of assembly lines in sheltered work centres for disabled. A case study. International Journal of Production Economics 110, 187–197 (2007)

    Google Scholar 

  • 2. Miralles, C., García-Sabater, J.P., Andrés, C., Cardós, M.: Branch and bound procedures for solving the assembly line worker assignment and balancing problem: Application to sheltered work centres for disabled. Discrete Applied Mathematics 156, 352–367 (2008)

    Google Scholar 

  • 3. Bartholdi, J.: Balancing two-sided assembly lines: a case study. The International Journal Of Production Research 31, 2447–2461 (1993)

    Google Scholar 

  • 4. Li, Z., Tang, Q., Zhang, L.: Two-sided assembly line balancing problem of type I: Improvements, a simple algorithm and a comprehensive study. Computers & Operations Research 79, 78–93 (2017)

    Google Scholar 

  • 5. Tang, Q., Li, Z., Zhang, L.: An effective discrete artificial bee colony algorithm with idle time reduction techniques for two-sided assembly line balancing problem of type-II. Computers & Industrial Engineering 97, 146–156 (2016)

    Google Scholar 

  • 6. Relich, M., Śwíc, A., Gola, A.: A knowledge-based approach to product concept screening. In: Distributed Computing and Artificial Intelligence, 12th International Conference, pp. 341–348. Springer, (Year)

    Google Scholar 

  • 7. Relich, M., Bzdyra, K.: Knowledge discovery in enterprise databases for forecasting new product success. In: International Conference on Intelligent Data Engineering and Automated Learning, pp. 121–129. Springer, (Year)

    Google Scholar 

  • 8. Chaves, A.A., Miralles, C., Lorena, L.A.N.: Clustering search approach for the assembly line worker assignment and balancing problem. In: Proceedings of the 37th international conference on computers and industrial engineering, Alexandria, Egypt, pp. 1469–1478. (Year)

    Google Scholar 

  • 9. Li, Z., Tang, Q., Zhang, L.: Minimizing the cycle time in two-sided assembly lines with assignment restrictions: improvements and a simple algorithm. Mathematical Problems in Engineering (Article ID 4536426): 1–15,

    Google Scholar 

  • 10. Tapkan, P., Ozbakir, L., Baykasoglu, A.: Modeling and solving constrained two-sided assembly line balancing problem via bee algorithms. Applied Soft Computing 12, 3343–3355 (2012)

    Google Scholar 

  • 11. Li, Z., Janardhanan, M.N., Tang, Q., Nielsen, P.: Co-evolutionary particle swarm optimization algorithm for two-sided robotic assembly line balancing problem. Advances in Mechanical Engineering 8, 1687814016667907 (2016)

    Google Scholar 

  • 12. Özcan, U., Toklu, B.: Balancing of mixed-model two-sided assembly lines. Computers & Industrial Engineering 57, 217–227 (2009)

    Google Scholar 

  • 13. Kim, Y.K., Song, W.S., Kim, J.H.: A mathematical model and a genetic algorithm for two-sided assembly line balancing. Computers & Operations Research 36, 853–865 (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mukund Nilakantan Janardhanan .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Cite this paper

Janardhanan, M.N., Li, Z., Nielsen, P., Tang, Q. (2018). Artificial bee colony algorithms for two-sided assembly line worker assignment and balancing problem. In: Omatu, S., Rodríguez, S., Villarrubia, G., Faria, P., Sitek, P., Prieto, J. (eds) Distributed Computing and Artificial Intelligence, 14th International Conference. DCAI 2017. Advances in Intelligent Systems and Computing, vol 620. Springer, Cham. https://doi.org/10.1007/978-3-319-62410-5_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-62410-5_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-62409-9

  • Online ISBN: 978-3-319-62410-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics