Skip to main content

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

Abstract

The single row layout problem (SRLP) is defined as the optimal arrangement of n machines with varying length along a straight line in order to minimize the weighted sum of distances between all machine pairs. In this paper, an artificial bee colony (ABC) metaheuristic is proposed to solve the SRLP considering sequence-dependent, asymmetric clearances for the first time. The algorithm is evaluated on several benchmark instances selected from literature as well as random generated ones involving up to \(n = 60\) machines. By comparing the computational results, either to optimal or best known solutions, it is revealed that our ABC performs efficiently, especially for instances with sequence-dependent asymmetric clearances.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.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

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    Here we are following the recommendation of [13] to conduct the scout bees phase before the onlooker bees phase in order to limit the maximum number of fitness evaluations per cycle. That is contrary to [7] who proposed the reverse order.

  2. 2.

    Please note that \(\pi ^i\) (superscript) denotes one of the SN permutations in the ABC algorithm, whereas \(\pi _i\) (subscript) and \(\pi _i^i\) denotes a machine in the permutation \(\pi \) and \(\pi ^i\), respectively.

  3. 3.

    An outlier with an RPD of 3.38% was neglected.

References

  1. de Alvarenga, A.G., Negreiros-Gomes, F.J., Mestria, M.: Metaheuristic methods for a class of the facility layout problem. J. Intell. Manuf. 11(4), 421–430 (2000)

    Article  Google Scholar 

  2. Blum, C., Li, X.: Swarm intelligence in optimization. In: Blum, C., Merkle, D. (eds.) Swarm Intelligence. Natural Computing Series. Springer, Heidelberg (2008). doi:10.1007/978-3-540-74089-6_2

  3. Bonabeau, E., Dorigo, M., Theraulaz, G.: Swarm Intelligence From Natural to Artificial Systems, no. 1. Oxford University Press, New York (1999)

    MATH  Google Scholar 

  4. Datta, D., Amaral, A.R., Figueira, J.R.: Single row facility layout problem using a permutation-based genetic algorithm. Eur. J. Oper. Res. 213(2), 388–394 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  5. Heragu, S.S., Kusiak, A.: Machine layout problem in flexible manufacturing systems. Oper. Res. 36(2), 258–268 (1988)

    Article  Google Scholar 

  6. Hungerländer, P.: Single-row equidistant facility layout as a special case of single-row facility layout. Int. J. Prod. Res. 52(5), 1257–1268 (2014)

    Article  Google Scholar 

  7. Karaboga, D.: An idea based on honey bee swarm for numerical optimization. Technical report, Engineering Faculty, Computer Engineering Department (2005)

    Google Scholar 

  8. Keller, B., Buscher, U.: Single row layout models. Eur. J. Oper. Res. 245(3), 629–644 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  9. Kothari, R., Ghosh, D.: Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods. Eur. J. Oper. Res. 224, 93–100 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  10. Kothari, R., Ghosh, D.: An efficient genetic algorithm for single row facility layout. Optim. Lett. 6(2), 679–690 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  11. Kothari, R., Ghosh, D.: A scatter search algorithm for the single row facility layout problem. J. Heuristics 20(2), 125–142 (2014)

    Article  Google Scholar 

  12. Liu, Y., Passino, K.M.: Swarm intelligence: literature overview. Technical report, Department of Electrical Engineering, The Ohio State University (2000)

    Google Scholar 

  13. Mernik, M., Liu, S.H., Karaboga, D., Črepinšek, M.: On clarifying misconceptions when comparing variants of the artificial bee colony algorithm by offering a new implementation. Inf. Sci. 291, 115–127 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  14. Nugent, C.E., Volhnann, T.E., Rum, J.: An experimental comparison of techniques for the assignment of facilities to locations. Oper. Res. 16(1), 150–173 (1968)

    Article  Google Scholar 

  15. Palubeckis, G.: Fast simulated annealing for single-row equidistant facility layout. Appl. Math. Comput. 263, 287–301 (2015)

    MathSciNet  Google Scholar 

  16. Palubeckis, G.: Single row facility layout using multi-start simulated annealing. Comput. Ind. Eng. 107, 1–16 (2017)

    Article  Google Scholar 

  17. Samarghandi, H., Taabayan, P., Jahantigh, F.F.: A particle swarm optimization for the single row facility layout problem. Comput. Ind. Eng. 58(4), 529–534 (2010)

    Article  Google Scholar 

  18. Saravanan, M., Ganesh Kumar, S.: Different approaches for the loop layout problems: a review. Int. J. Adv. Manuf. Technol. 08, 1–17 (2013)

    Google Scholar 

  19. Soimart, P., Pongcharoen, P.: Multi-row machine layout design using aritificial bee colony. In: 2011 International Conference on Economics and Business Information, vol. 9, pp. 103–108 (2011)

    Google Scholar 

  20. Solimanpur, M., Vrat, P., Shankarsa, R.: An ant algorithm for the single row layout problem in flexible manufacturing systems. Comput. Oper. Res. 32(3), 583–598 (2005)

    Article  MATH  Google Scholar 

  21. Tompkins, J.A., White, J.A., Bozer, Y.A., Tanchoco, J.M.A.: Facilities Planning. Wiley, New York (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Birgit Keller .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Cite this paper

Manzke, L., Keller, B., Buscher, U. (2018). An Artificial Bee Colony Algorithm to Solve the Single Row Layout Problem with Clearances. In: Wilimowska, Z., Borzemski, L., Świątek, J. (eds) Information Systems Architecture and Technology: Proceedings of 38th International Conference on Information Systems Architecture and Technology – ISAT 2017. ISAT 2017. Advances in Intelligent Systems and Computing, vol 657. Springer, Cham. https://doi.org/10.1007/978-3-319-67223-6_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-67223-6_27

  • Published:

  • Publisher Name: Springer, Cham

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

  • Online ISBN: 978-3-319-67223-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics