Tackling the container loading problem: A hybrid approach based on integer linear programming and genetic algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4446 LNCS, Issue , 2007, Pages 154-165

  Nepomuceno, Napoleão ^a   Pinheiro, Plácido ^a   Coelho, André L V ^a  

^a UNIVERSITY OF FORTALEZA   (Brazil)

Author keywords

Combinatorial optimization; Container loading; Genetic algorithms; Hybrid methods; Integer linear programming; Metaheuristics

Indexed keywords

COMBINATORIAL OPTIMIZATION; CONTAINERS; GENETIC ALGORITHMS; INTEGER PROGRAMMING; LOADING;

CONTAINER LOADING; HYBRID METHODS; INTEGER LINEAR PROGRAMMING; METAHEURISTICS;

PROBLEM SOLVING;

EID: 38049079262     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71615-0_14     Document Type: Conference Paper

References (15)

1. Beasley, J.: An Exact Two-dimensional Non-guillotine Cutting Tree Search Procedure. Oper. Res. 33 (1985) 49-64
2. Bischoff, E., Marriot, M.: A Comparative Evaluation of Heuristics for Container Loading. Eur. J. Oper. Res. 44 (1990) 267-276
3. Bischoff, E., Ratcliff, M.: Issues in the Development of Approaches to Container Loading. Omega Int. J. Manage. S. 23 (1995) 377-390
4. Dyckhoff, H.: A Typology of Cutting and Packing Problems. Eur. J. Oper. Res. 44 (1990) 145-159
5. Dyckhoff, H., Scheithauer, G., Terno, J.: Cutting and Packing. In: Dell'Amico, M., Maffioli, F., Martello, S. (eds.): Annotated Bibliographies in Combinatorial Optimization, John Wiley & Sons, New York (1997) 393-412
6. Dumitrescu, I., Stützle, T.: Combinations of Local Search and Exact Algorithms. In: Cagnoni et al (eds.): Applications of Evolutionary Computing. Lecture Notes in Computer Science 2611. Springer-Verlag, Berlin Heidelberg New York (2003) 211-223
7. Gilmore, P., Gomory, R.: A Linear Programming Approach to the Cutting Stock Problem (Part I). Oper. Res. 9 (1961) 849-859
8. Morabito, R., Arenales, S.: Abordagens para o Problema do Carregamento de Contêineres. Pesquisa Operacional 17 (1997) 29-56 (in Portuguese)
9. Plateau, A., Tachat, D., Tolla, P.: A Hybrid Search Combining Interior Point Methods and Metaheuristics for 0-1 Programming. Int. T. Oper. Res. 9 (2002) 731-746
10. 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)
11. Puchinger, J., Raidl, G., Koller, G.: Solving a Real-World Glass Cutting Problem. In: Gottlieb, J., Raidl, G. (eds.): Evolutionary Computation in Combinatorial Optimization, Lecture Notes in Computer Science 3004. Springer-Verlag, Berlin Heidelberg New York (2004) 162-173
12. Puchinger, J., Raidl, G.: Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification. In: Mira, J., Alvarez, J. (eds.): Interplay Between Natural and Artificial Computation, Lecture Notes in Computer Science 3562. Springer-Verlag, Berlin Heidelberg New York (2005) 41-53
13. Terno, J., Scheithauer, J., Sommerweiß, U.: An Efficient Approach for the Multi-pallet Loading Problem. Eur. J. Oper. Res. 123 (2000) 372-381
14. TOPS Engineering Corporation. MaxLoad Pro Version 2.7X User's Guide (2004).
15. Yeung, L. H. W., Tang, W. K. S.: A Hybrid Genetic Approach for Container Loading in Logistics Industry. IEEE T. Ind. Electron. 52 (2005), 617-627