Abstract
This paper presents a novel hybrid approach for solving the Container Loading (CL) problem based on the combination of Integer Linear Programming (ILP) and Genetic Algorithms (GAs). More precisely, a GA engine works as a generator of reduced instances for the original CL problem, which are formulated as ILP models. These instances, in turn, are solved by an exact optimization technique (solver), and the performance measures accomplished by the respective models are interpreted as fitness values by the genetic algorithm, thus guiding its evolutionary process. Computational experiments performed on standard benchmark problems, as well as a practical case study developed in a metallurgic factory, are also reported and discussed here in a manner as to testify the potentialities behind the novel approach.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Beasley, J.: An Exact Two-dimensional Non-guillotine Cutting Tree Search Procedure. Oper. Res. 33, 49–64 (1985)
Bischoff, E., Marriot, M.: A Comparative Evaluation of Heuristics for Container Loading. Eur. J. Oper. Res. 44, 267–276 (1990)
Bischoff, E., Ratcliff, M.: Issues in the Development of Approaches to Container Loading. Omega Int. J. Manage. S. 23, 377–390 (1995)
Dyckhoff, H.: A Typology of Cutting and Packing Problems. Eur. J. Oper. Res. 44, 145–159 (1990)
Dyckhoff, H., Scheithauer, G., Terno, J.: Cutting and Packing. In: Dell’Amico, M., Maffioli, F., Martello, S. (eds.) Annotated Bibliographies in Combinatorial Optimization, pp. 393–412. John Wiley & Sons, New York (1997)
Dumitrescu, I., Stützle, T.: Combinations of Local Search and Exact Algorithms. In: Raidl, G.R., Cagnoni, S., Cardalda, J.J.R., Corne, D.W., Gottlieb, J., Guillot, A., Hart, E., Johnson, C.G., Marchiori, E., Meyer, J.-A., Middendorf, M. (eds.) EvoIASP 2003, EvoWorkshops 2003, EvoSTIM 2003, EvoROB/EvoRobot 2003, EvoCOP 2003, EvoBIO 2003, and EvoMUSART 2003. LNCS, vol. 2611, pp. 211–223. Springer, Heidelberg (2003)
Gilmore, P., Gomory, R.: A Linear Programming Approach to the Cutting Stock Problem (Part I). Oper. Res. 9, 849–859 (1961)
Morabito, R., Arenales, S.: Abordagens para o Problema do Carregamento de Contêineres. Pesquisa Operacional 17, 29–56 (1997)
Plateau, A., Tachat, D., Tolla, P.: A Hybrid Search Combining Interior Point Methods and Metaheuristics for 0-1 Programming. Int. T. Oper. Res. 9, 731–746 (2002)
Puchinger, J.: Combining Metaheuristics and Integer Programming for Solving Cutting and Packing Problems. PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms (2006)
Puchinger, J., Raidl, G., Koller, G.: Solving a Real-World Glass Cutting Problem. In: Gottlieb, J., Raidl, G.R. (eds.) EvoCOP 2004. LNCS, vol. 3004, pp. 162–173. Springer, Heidelberg (2004)
Puchinger, J., Raidl, G.: Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification. In: Mira, J.M., Álvarez, J.R. (eds.) IWINAC 2005. LNCS, vol. 3562, pp. 41–53. Springer, Heidelberg (2005)
Terno, J., Scheithauer, J., Sommerweiß, U.: An Efficient Approach for the Multi-pallet Loading Problem. Eur. J. Oper. Res. 123, 372–381 (2000)
TOPS Engineering Corporation. MaxLoad Pro Version 2.7X User’s Guide (2004)
Yeung, L.H.W., Tang, W.K.S.: A Hybrid Genetic Approach for Container Loading in Logistics Industry. IEEE T. Ind. Electron. 52, 617–627 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Nepomuceno, N., Pinheiro, P., Coelho, A.L.V. (2007). Tackling the Container Loading Problem: A Hybrid Approach Based on Integer Linear Programming and Genetic Algorithms. In: Cotta, C., van Hemert, J. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2007. Lecture Notes in Computer Science, vol 4446. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71615-0_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-71615-0_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71614-3
Online ISBN: 978-3-540-71615-0
eBook Packages: Computer ScienceComputer Science (R0)