Abstract
Motivated by a real-world application, we present a multi-container loading problem with 3-open dimensions. We formulate it as a biobjective mixed-integer nonlinear program with lexicographic objectives in order to reflect the decision maker’s optimization priorities. The first objective is to minimize the number of containers, while the second objective is to minimize the volume of those containers. Besides showing the NP-hardness of this sequential optimization problem, we provide bounds for it which are used in the three proposed algorithms, as well as, on their evaluation when a certificate of optimality is not available. The first is an exact parametric-based approach to tackle the lexicographic optimization through the second objective of the problem. Nevertheless, given that the parametric programs correspond to large nonlinear mixed-integer optimizations, we present a heuristic that is entirely mathematical-programming based. The third algorithm enhances the solution quality of the heuristic. These algorithms are specifically tailored for the real-world application. The effectiveness and efficiency of the devised heuristics is demonstrated with numerical experiments.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alonso MT, Alvarez-Valdes R, Iori M, Parreño F, Tamarit JM (2017) Mathematical models for multicontainer loading problems. Omega 66:106–117
Araya I, Moyano M, Sanchez C (2020) A beam search algorithm for the biobjective container loading problem. Eur J Oper Res 286(2):417–431
Bortfeldt A, Wäscher G (2013) Constraints in container loading - A state-of-the-art review. Eur J Oper Res 229(1):1–20
Coniglio S, D’Andreagiovanni F, Furini F (2019) A lexicographic pricer or the fractional bin packing problem. Operat Res Lett 47:622–628
Chen CS, Lee SM, Shen QS (1995) An analytical model for the container loading problem. Eur J Oper Res 80(1):68–76
Dahmani N, Clautiaux F, Krichen S, Talbi E (2013) Iterative approaches for solving a multi-objective 2-dimensional vector packing problem. Comput Ind Eng 66(1):158–170
Delorme M, Iori M, Martello S (2016) Bin packing and cutting stock problems: mathematical models and exact algorithms. Eur J Oper Res 255(1):1–20
Ehrgott M (2005) Multicriteria optimization. Springer-Verlag, Berlin Heidelberg
Fernández A, Gil C, Baños R, Montoya MG (2013) A parallel multi-objective algorithm for two-dimensional bin packing with rotations and load balancing. Expert Syst Appl 40(13):5169–5180
M E Garey, D S Johnson (1990) Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., USA
Hessler K, Irnich S, Kreiter T, Pferschy U (2020) Lexicographic bin-packing optimization for loading trucks in a direct-shipping system. Discussion paper, Gutenberg School of Management and Economics
Junqueira L, Morabito R (2017) On solving three-dimensional open-dimension rectangular packing problems. Eng Optim 49(5):733–745
Khanafer A, Clautiaux F, Hanafi S, Talbi E (2012) The min-conflict packing problem. Comput Operat Res 39(9):2122–2132
Liu Y, Chu C, Yu Y (2012) Aggregated state dynamic programming for a multiobjective two-dimensional bin packing problem. Int J Prod Res 50(15):4316–4325
Liu Y, Chu C, Wu F (2014) A heuristic for variable size multiobjective two-dimensional bin packing. Int J Prod Res 52(12):3450–3465
Liu DS, Tan KC, Huang SY, Goh CK, Ho WK (2008) On solving multiobjective bin packing problems using evolutionary particle swarm optimization. Eur J Oper Res 190(2):357–382
Meyer C, Floudas C (2004) Trilinear monomials with positive or negative domains: facets of the convex and concave envelopes. Front Glob Optimiz pp. 327-352
Silva EF, Toffolo TAM, Wauters T (2019) Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems. Comput Oper Res 109:12–27
Silva E, Oliveira JF, Wäscher G (2016) The pallet loading problem: a review of solution methods and computational experiments. Int Trans Oper Res 23:147–172
Spencer KY, Tsvetkov PV, Jarrell JJ (2019) A greedy memetic algorithm for a multiobjective dynamic bin packing problem for storing cooling objects. J Heuristics 25:1–45
Toffolo TAM, Esprit E, Wauters T, Vanden Berghe G (2017) A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem. Eur J Oper Res 257(2):526–538
Tsai J-F, Li H-L (2006) A global optimization method for packing problems. Eng Optim 38:687–700
Tsai J-F, Wang P-C, Lin M-H (2015) A global optimization approach for solving three-dimensional open dimension rectangular packing problems. Optimization 64(12):2601–2618
Vieira MVC, Ferreira F, Duque J, Almeida R (2021) On the packing process in a shoe manufacturer. J Operat Res Soc 72(4):853–864
Vieira MVC, Ferreira F (2020) Packing Shoes Efficiently. Impact 2020:34–38
Zhao X, Bennell JA, Bektas T, Dowsland KA (2016) A comparative review of 3D container loading algorithms. Int Trans Oper Res 23(1–2):287–320
Zheng J-N, Chien C-F, Gen M (2015) Multi-objective multi-population biased random-key genetic algorithm for the 3-D container loading problem. Comput Ind Eng 89:80–87
Acknowledgements
The first author was partially supported by the Fundação para a Ciência e a Tecnologia (Portuguese Foundation for Science and Technology) through the project UI/297/2020 (Centro de Matemática e Aplicações). The second author thanks the support of the Institut de valorisation des données and Fonds de recherche du Québec through the FRQ–IVADO Research Chair in Data Science for Combinatorial Game Theory, and the Natural Sciences and Engineering Research Council of Canada through the discovery grant 2019-04557.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Vieira, M.V.C., Carvalho, M. Lexicographic optimization for the multi-container loading problem with open dimensions for a shoe manufacturer. 4OR-Q J Oper Res 21, 491–512 (2023). https://doi.org/10.1007/s10288-022-00522-4
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10288-022-00522-4