Skip to main content
SpringerLink
Log in

A Crow Search-Based Genetic Algorithm for Solving Two-Dimensional Bin Packing Problem

  • Conference paper
  • First Online:
KI 2019: Advances in Artificial Intelligence (KI 2019)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 11793))

Abstract

The two-dimensional bin packing problem (2D-BPP) consists of packing, without overlapping, a set of rectangular items with different sizes into smallest number of rectangular containers, called “bins”, having identical dimensions. According to the real-word requirements, the items may either have a fixed orientation or they can be rotated by 90°. In addition, it may or not be subjugate to the guillotine cutting. In this article, we consider the two-dimensional bin packing problem with fixed orientation and free cutting. In fact, we propose a hybrid approach by combining two bio-inspired algorithms that are the crow search algorithm (CSA) and the genetic algorithm (GA) to solve the considered problem. So, the main idea behind this hybridization is to expect reaching a sort of cooperative synergy between the operators of the two combined algorithms. That is, the CSA is discretized and adapted to the 2D-BPP context, while using genetic operators to improve individuals (i.e. crows) adaptation. The average performance of the proposed hybrid approach is evaluated on the standard benchmark instances of the considered problem and compared with two other bio-inspired algorithms having closely similar nature; namely standard genetic algorithm and binary particle swarm optimization algorithm. The obtained results are very promising.

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 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 74.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

References

  1. Wäscher, G., Haußner, H., Schumann, H.: An improved typology of cutting and packing problems. Eur. J. Oper. Res. 183, 1109–1130 (2007)

    Article  Google Scholar 

  2. Crainic, T.G., et al.: Bin packing problems with uncertainty on item characteristics: An application to capacity planning in logistics. Procedia-Soc. Behav. Sci. 111, 654–662 (2014)

    Article  Google Scholar 

  3. Wee, T.S., Magazine, M.J.: Assembly line balancing as generalized bin packing. Oper. Res. Lett. 1, 56–58 (1982)

    Article  Google Scholar 

  4. Song, W., et al.: Adaptive resource provisioning for the cloud using online bin packing. IEEE Trans. Comput. 63, 2647–2660 (2014)

    Article  MathSciNet  Google Scholar 

  5. Lodi, A., Martello, S., Vigo, D.: Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS J. Comput. 11, 345–357 (1999)

    Article  MathSciNet  Google Scholar 

  6. Epstein, L., Van Stee, R.: Optimal online algorithms for multidimensional packing problems. SIAM J. Comput. 35, 431–448 (2005)

    Article  MathSciNet  Google Scholar 

  7. Laabadi, S.: A new algorithm for the Bin-packing problem with fragile objects. In: 3rd International Conference on Logistics Operations Management, pp. 1–7. IEEE, Fez (2016)

    Google Scholar 

  8. Bansal, N., Liu, Z., Sankar, A.: Bin-packing with fragile objects and frequency allocation in cellular networks. Wirel. Netw. 15, 821–830 (2009)

    Article  Google Scholar 

  9. Shakhsi, N.M., Joulaei, F., Razmi, J.: Extending two-dimensional bin packing problem: consideration of priority for items. J. Ind. Syst. Eng. 3, 72–84 (2009)

    Google Scholar 

  10. Hamdi-Dhaoui, K., Labadie, N., Yalaoui, A.: Algorithms for the two dimensional bin packing problem with partial conflicts. RAIRO-Oper. Res. 46, 41–62 (2012)

    Article  MathSciNet  Google Scholar 

  11. Khanafer, A., Clautiaux, F., Talbi, E.G.: Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts. Comput. Oper. Res. 39, 54–63 (2012)

    Article  MathSciNet  Google Scholar 

  12. Berkey, J.O., Wang, P.Y.: Two-dimensional finite bin-packing algorithms. J. Oper. Res. Soc. 38, 423–429 (1987)

    Article  Google Scholar 

  13. Monaci, M., Toth, P.: A set-covering-based heuristic approach for bin-packing problems. INFORMS J. Comput. 18, 71–85 (2006)

    Article  MathSciNet  Google Scholar 

  14. Baumgartner, L., Schmid, V., Blum, C.: Solving the two-dimensional bin packing problem with a probabilistic multi-start heuristic. In: Coello, C.A.C. (ed.) LION 2011. LNCS, vol. 6683, pp. 76–90. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-25566-3_6

    Chapter  Google Scholar 

  15. Wong, L.: Heuristic placement routines for two-dimensional rectangular bin packing problems. Ph.D. thesis, Universiti Putra Malaysia (2009)

    Google Scholar 

  16. Parreño, F., et al.: A hybrid GRASP/VND algorithm for two-and three-dimensional bin packing. Ann. Oper. Res. 179, 203–220 (2010)

    Article  MathSciNet  Google Scholar 

  17. Lai, K.K., Chan, J.W.: Developing a simulated annealing algorithm for the cutting stock problem. Comput. Ind. Eng. 32, 115–127 (1997)

    Article  Google Scholar 

  18. Gonçalves, J.F., Resende, M.G.: A biased random key genetic algorithm for 2D and 3D bin-packing problems. Int. J. Prod. Econ. 145, 500–510 (2013)

    Article  Google Scholar 

  19. Soke, A., Bingul, Z.: Hybrid genetic algorithm and simulated annealing for two-dimensional non-guillotine rectangular packing problems. Eng. Appl. Artif. Intell. 19, 557–567 (2006)

    Article  Google Scholar 

  20. Blum, C., Schmid, V.: Solving the 2D bin packing problem by means of a hybrid evolutionary algorithm. Procedia Comput. Sci. 18, 899–908 (2013)

    Article  Google Scholar 

  21. Shin, Y.B., Kita, E.: Solving two-dimensional packing problem using particle swarm optimization. Comput. Assist. Methods Eng. Sci. 19, 241–255 (2017)

    MathSciNet  Google Scholar 

  22. Liu, D.S., et al.: On solving multiobjective bin packing problems using evolutionary particle swarm optimization. Eur. J. Oper. Res. 190, 357–382 (2008)

    Article  MathSciNet  Google Scholar 

  23. Reeves, C., Rowe, J.E.: Genetic Algorithms: Principles and Perspectives: A Guide to GA Theory. Springer, New York (2002). https://doi.org/10.1007/b101880

    Book  MATH  Google Scholar 

  24. Askarzadeh, A.: A novel metaheuristic method for solving constrained engineering optimization problems: crow search algorithm. Comput. Struct. 169, 1–12 (2016)

    Article  Google Scholar 

  25. De Souza, R.C.T., et al.: A V-shaped binary crow search algorithm for feature selection. In: IEEE Congress on Evolutionary Computation, pp. 1–8. IEEE, Rio de Janeiro (2018)

    Google Scholar 

  26. Goldberg, D., Lingle, R.: Alleles, loci, and the travelling salesman problem. In: First International Conference on Genetic Algorithms and their Applications, pp. 154–159. Lawrence Erlbaum Associates, Hillsdale (1985)

    Google Scholar 

  27. http://or.dei.unibo.it/library/two-dimensional-bin-packing-problem

  28. Martello, S., Vigo, D.: Exact solution of the two-dimensional finite bin packing problem. Manag. Sci. 44, 388–399 (1998)

    Article  Google Scholar 

  29. Kennedy, J., Eberhart, R.C.: A discrete binary version of the particle swarm algorithm. In: International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation, vol. 5, pp. 4104–4108 (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory of Mathematics and Applications, ENS - Hassan II University, Casablanca, Morocco

    Soukaina Laabadi & Hassan El Amri

  2. Laboratory of Analysis, Modeling Systems and Decision Support, ENSA - Hassan I University, Berrechid, Morocco

    Mohamed Naimi & Boujemâa Achchab

Authors
  1. Soukaina Laabadi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohamed Naimi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hassan El Amri
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Boujemâa Achchab
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Soukaina Laabadi .

Editor information

Editors and Affiliations

  1. Freie Universität Berlin, Berlin, Germany

    Christoph Benzmüller

  2. Universität Mannheim, Mannheim, Germany

    Heiner Stuckenschmidt

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Laabadi, S., Naimi, M., El Amri, H., Achchab, B. (2019). A Crow Search-Based Genetic Algorithm for Solving Two-Dimensional Bin Packing Problem. In: Benzmüller, C., Stuckenschmidt, H. (eds) KI 2019: Advances in Artificial Intelligence. KI 2019. Lecture Notes in Computer Science(), vol 11793. Springer, Cham. https://doi.org/10.1007/978-3-030-30179-8_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-30179-8_17

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-30178-1

  • Online ISBN: 978-3-030-30179-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation