Abstract
This paper presents a new hybrid genetic algorithm for solving the container loading problem in the general case, precisely when the boxes have no orientation constraints. In order to improve the genetic algorithm efficiency, we developed a hybrid method, based on deterministic approaches combining the wall-building, level-slice approach and strip packing. A serie of experiments was achieved on 47 related benchmarks from the OR-Library. We could reach an average utilization of 94.47% and an average computation time of 840s on a 1.7 GHz core duo.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
Bischoff, E.E.: Tree dimensional packing of items with limited load bearing strength. Eur. J. Oper. Res. 68(3), 952–966 (2004)
Bischoff, E.E., Janetz, F., Ratcliff, M.S.W.: Loading pallets with non-identical items. Eur. J. Oper. Res. 84(3), 681–692 (1995)
Bischoff, E.E., Ratcliff, M.S.W.: Issues in the development of approaches to container loading. Omega 23(4), 377–390 (1995)
Bortfeldt, A. Gehring, H.: A hybrid genetic algorithm for the container loading problem. Eur. J. Oper. Res. 131(1), 143–161(2001)
Bortfeldt, A., Gehring, H., Mack, D.: A parallel tabu search algorithm for solving the container loading problem. Parallel Comput. 29(5), 641–662 (2003)
Crainic, T.G., Perboli, G., Tadei, R.: Extreme point-based heuristics for three-dimensional bin packing. INFORMS J. Comput. 20(3), 368–384 (2008)
Davies, A.P., Bischoff, E.E.: Weight distribution considerations in container loading. Eur. J. Oper. Res. 141(2), 393–409 (2002)
Eley, M.: Solving container loading problems by block arrangements. Eur. J. Oper. Res. 114(3), 509–527(1999)
Fekete, S.P., Schepers, J.A.: New exact algorithm for general orthogonal d-dimensional knapsack problems. In: Proceedings of the 5th Annual European Symposium on Algorithms, vol. 1284, 144–156 Springer-Verlag (1997)
Gehring, H., Bortfeldt, A.: A parallel genetic algorithm for solving the container loading problem. Int. Trans. Oper. Res. 9(4), 497–511 (2002)
George, J.A., Robinson, D.F.: Heuristic for packing boxes into a container. Comput. Oper. Res. 7(3), 147–156 (1980)
Haupt, R.L., Haupt, S.E.: Practical Genetic Algorithms. John Wiley, New York (1998)
Hemminki, J.: Container loading with variable strategies in each layer. Presented at ESI-X, EURO Summer institute, Jouy-En-Josas, France, 2–15 July (1994)
Hifi, M.: Approximate algorithms for the container loading problem. Int. Trans. Oper. Res. 9(6), 747–774 (2002)
Hifi, M.: Exact algorithms for unconstrained three-dimensional cutting problems: a comparative study. Comput. Oper. Res. 31(5), 657–674 (2004)
Huang, W., He, K.: A new heuristic algorithm for cuboids packing with no orientation constraints. Comput. Oper. Res. 36(2), 425–432 (2009)
Liang, S.C., Lee, C.Y., Huang, C.S.W.: A hybrid meta-heuristic for thee container loading problem. Commun. Int. Inf. Manag. Assoc. 7(4), 73–84 (2007)
Lim, A., Rodrigues, B., Wang, Y.: A multi-faced build up algorithm for three-dimensional packing problems. Omega 31(6), 471–481 (2003)
Mack, D., Bortfeldt, A., Gehring, H.: A parallel hybrid local search algorithm for the container loading problem. Int. Trans. Oper. Res. 11(5), 511–533 (2004)
Martello, S., Pisinger, D.,Vigo, D.: The three-dimensional bin packing problem. Oper. Res. 48(2), 256–267 (2000)
Morabito, R., Arenales, M.: An AND/OR-graph approach to the container loading problem. Int. Trans. Oper. Res. 1(1), 59–73 (1994)
Moura, A., Oliveira, J.F.: A GRASP approach to the container loading problem. IEEE Intell. Syst. 20(4), 50–57 (2005)
Parreno, F., Alvarez-Valdes, R., Oliveira, J.F., Tamarit, J.M.: A maximal-space algorithm for the container loading problem. INFORMS J. Comput. 20(3), 412–422 (2008)
Pisinger, D.: Heuristics for the container loading problem. Eur. J. Oper. Res. 141(2), 382–392 (2002)
Terno, J., Scheithauer, G., Sommerweiß, U., Rieme, J.: An efficient approach for the multi-pallet loading problem. Eur. J. Oper. Res. 123(2), 372–381 (2000)
Toulouse, M., Crainic, T.G., Gendreau, M.: Issues in designing parallel and distributed search algorithms for discrete optimization problems. CRT-96-36, Centre de Recherche sur les Transports, Université de Montréal, Canada (1996)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Hasni, H., Sabri, H. On a Hybrid Genetic Algorithm for Solving the Container Loading Problem with no Orientation Constraints. J Math Model Algor 12, 67–84 (2013). https://doi.org/10.1007/s10852-012-9179-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10852-012-9179-3