Optimizing load balanced 3D-bin packing with product family: A multi-objective genetic algorithm

Open Access

Issue		RAIRO-Oper. Res. Volume 60, Number 4, July-August 2026


Page(s)		1907 - 1930
DOI		https://doi.org/10.1051/ro/2026059
Published online		16 July 2026

M.T. Alonso, R. Alvarez-Valdes, M. Iori, F. Parreño and J.M. Tamarit, Mathematical models for multicontainer loading problems. Omega 66 (2017) 106–117. [Google Scholar]
I. Araya and M.C. Riff, A beam search approach to the container loading problem. Comput. Oper. Res. 43 (2014) 100–107. [Google Scholar]
E.E. Bischoff and M.S.W. Ratcliff, Issues in the development of approaches to container loading. Omega 23 (1995) 377–390. [Google Scholar]
A. Bortfeldt and H. Gehring, A hybrid genetic algorithm for the container loading problem. Eur. J. Oper. Res. 131 (2001) 143–161. [Google Scholar]
A. Bortfeldt and G. Wäscher, Constraints in container loading – a state-of-the-art review. Eur. J. Oper. Res. 229 (2013) 1–20. [Google Scholar]
A. Bortfeldt, H. Gehring and D. Mack, A parallel tabu search algorithm for solving the container loading problem. Parallel Comput. 29 (2003) 641–662. [Google Scholar]
F. Braam and D. van den Berg, Which rectangle sets have perfect packings?. Oper. Res. Perspect. 9 (2022) 100211. [Google Scholar]
P.B. Castellucci, F.M. Toledo and A.M. Costa, Output maximization container loading problem with time availability constraints. Oper. Res. Perspect. 6 (2019) 100126. [Google Scholar]
C.S. Chen, S.M. Lee and Q.S. Shen, An analytical model for the container loading problem. Eur. J. Oper. Res. 80 (1995) 68–76. [Google Scholar]
M.G. Costa and M.E. Captivo, Weight distribution in container loading: a case study. Int. Trans. Oper. Res. 23 (2016) 239–263. [Google Scholar]
T.G. Crainic, L. Gobbato, G. Perboli and W. Rei, Logistics capacity planning: A stochastic bin packing formulation and a progressive hedging meta-heuristic. Eur. J. Oper. Res. 253 (2016) 404–417. [Google Scholar]
A. de Almeida and M.B. Figueiredo, A particular approach for the three-dimensional packing problem with additional constraints. Comput. Oper. Res. 37 (2010) 1968–1976. [Google Scholar]
J.L. de Castro Silva, N.Y. Soma and N. Maculan, A greedy search for the three-dimensional bin packing problem: the packing static stability case. Int. Trans. Oper. Res. 10 (2003) 141–153. [Google Scholar]
T.A. de Queiroz, F.K. Miyazawa, Y. Wakabayashi and E.C. Xavier, Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing. Comput. Oper. Res. 39 (2012) 200–212. [Google Scholar]
T. Dereli and G.S. Das, A hybrid ‘bee(s) algorithm’ for solving container loading problems. Appl. Soft Comput. 11 (2011) 2854–2862. [Google Scholar]
T. Dokeroglu and A. Cosar, Optimization of one-dimensional bin packing problem with island parallel grouping genetic algorithms. Comput. Ind. Eng. 75 (2014) 176–186. [Google Scholar]
M. Eley, A bottleneck assignment approach to the multiple container loading problem. OR Spectr. 25 (2003) 45–60. [Google Scholar]
S. Erbayrak, V. Ozkır and U.M. Yıldırım, Multi-objective 3D bin packing problem with load balance and product family concerns. Comput. Ind. Eng. 159 (2021) 107518. [Google Scholar]
E. Falkenauer, A hybrid grouping genetic algorithm for bin packing. J. Heuristics 2 (1996) 5–30. [Google Scholar]
Y. Fan, J. Chu and H. Xu, Improvement grouping genetic algorithm for solving the bin packing problem. J. Phys. Conf. Ser. 1550 (2020) 032168. [Google Scholar]
T. Fanslau and A. Bortfeldt, A tree search algorithm for solving the container loading problem. INFORMS J. Comput. 22 (2010) 222–235. [Google Scholar]
X. Feng, I. Moon and J. Shin, Hybrid genetic algorithms for the three-dimensional multiple container packing problem. Flex. Serv. Manuf. J. 27 (2015) 451–477. [Google Scholar]
G. Fuellerer, K.F. Doerner, R.F. Hartl and M. Iori, Metaheuristics for vehicle routing problems with three-dimensional loading constraints. Eur. J. Oper. Res. 201 (2010) 751–759. [Google Scholar]
M. Gajda, A. Trivella, R. Mansini and D. Pisinger, An optimization approach for a complex real-life container loading problem. Omega 107 (2022) 102559. [Google Scholar]
H. Gehring and A. Bortfeldt, A genetic algorithm for solving the container loading problem. Int. Trans. Oper. Res. 4 (1997) 401–418. [Google Scholar]
J.A. George and D.F. Robinson, A heuristic for packing boxes into a container. Comput. Oper. Res. 7 (1980) 147–156. [Google Scholar]
P.C. Gilmore and R.E. Gomory, A linear programming approach to the cutting stock problem – part II. Oper. Res. 11 (2013) 863–888. [Google Scholar]
J.F. Gonçalves and M.G. Resende, A biased random key genetic algorithm for 2D and 3D bin packing problems. Int. J. Prod. Econ. 145 (2013) 500–510. [Google Scholar]
Y. Gonzalez, G. Miranda and C. Leon, Multi-objective multi-level filling evolutionary algorithm for the 3D cutting stock problem. Procedia Comput. Sci. 96 (2016) 355–364. [Google Scholar]
K. He and W. Huang, An efficient placement heuristic for three-dimensional rectangular packing. Comput. Oper. Res. 38 (2011) 227–233. [Google Scholar]
M. Iori and S. Martello, Routing problems with loading constraints. Top 18 (2010) 4–27. [Google Scholar]
T. Jamrus and C.F. Chien, Extended priority-based hybrid genetic algorithm for the less-than-container loading problem. Comput. Ind. Eng. 96 (2016) 227–236. [Google Scholar]
İ. Kabasakal and F.D. Keskin, Decision support system based on genetic algorithm for variable sized bin packing problem with item conflicts. Int. Rev. Econ. Manag. 5 (2017) 1–17. [Google Scholar]
K. Kang, I. Moon and H. Wang, A hybrid genetic algorithm with a new packing strategy for the three-dimensional bin packing problem. Appl. Math. Comput. 219 (2012) 1287–1299. [MathSciNet] [Google Scholar]
A. Lim, H. Ma, J. Xu and X. Zhang, An iterated construction approach with dynamic prioritization for solving the container loading problems. Expert Syst. Appl. 39 (2012) 4292–4305. [Google Scholar]
J. Liu, Y. Yue, Z. Dong, C. Maple and M. Keech, A novel hybrid tabu search approach to container loading. Comput. Oper. Res. 38 (2011) 797–807. [Google Scholar]
A. Lodi, S. Martello and D. Vigo, Tspack: a unified tabu search code for multi-dimensional bin packing problems. Ann. Oper. Res. 131 (2004) 203–213. [Google Scholar]
S. Martello and D. Vigo, Exact solution of the two-dimensional finite bin packing problem. Manag. Sci. 44 (1998) 388–399. [Google Scholar]
S. Martello, D. Pisinger and D. Vigo, The three-dimensional bin packing problem. Oper. Res. 48 (2000) 256–267. [Google Scholar]
N. Mohamadi, Application of genetic algorithm for the bin packing problem with a new representation scheme. Math. Sci. 4 (2010) 253–266. [Google Scholar]
I. Moon and T.V.L. Nguyen, Container packing problem with balance constraints. OR Spectr. 36 (2014) 837–878. [Google Scholar]
A. Moura and J.F. Oliveira, A grasp approach to the container-loading problem. IEEE Intell. Syst. 20 (2005) 50–57. [Google Scholar]
F. Parreño, R. Alvarez-Valdés, J.M. Tamarit and J.F. Oliveira, A maximal-space algorithm for the container loading problem. INFORMS J. Comput. 20 (2008) 412–422. [Google Scholar]
D. Pisinger, Heuristics for the container loading problem. Eur. J. Oper. Res. 141 (2002) 382–392. [Google Scholar]
A.G. Ramos, E. Silva and J.F. Oliveira, A new load balance methodology for container loading problem in road transportation. Eur. J. Oper. Res. 266 (2018) 1140–1152. [Google Scholar]
L. Sheng, S. Xiuqin, C. Changjian, Z. Hongxia, S. Dayong and W. Feiyue, Heuristic algorithm for the container loading problem with multiple constraints. Comput. Ind. Eng. 108 (2017) 149–164. [Google Scholar]
C.D. Tarantilis, E.E. Zachariadis and C.T. Kiranoudis, A hybrid metaheuristic algorithm for the integrated vehicle routing and three-dimensional container-loading problem. IEEE Trans. Intell. Transp. Syst. 10 (2009) 255–271. [Google Scholar]
A. Trivella and D. Pisinger, The load-balanced multi-dimensional bin-packing problem. Comput. Oper. Res. 74 (2016) 152–164. [Google Scholar]
Y. Wu, W. Li, M. Goh and R. de Souza, Three-dimensional bin packing problem with variable bin height. Eur. J. Oper. Res. 202 (2010) 347–355. [Google Scholar]
L.H.W. Yeung and W.K.S. Tang, A hybrid genetic approach for container loading in logistics industry. IEEE Trans. Ind. Electron. 52 (2005) 617–627. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.