Neighborhood structures for the container loading problem: a VNS implementation

This paper presents a Variable Neighborhood Search (VNS) algorithm for the container loading problem. The algorithm combines a constructive procedure based on the concept of maximal-space, with five new movements defined directly on the physical layout of the packed boxes, which involve insertion and deletion strategies.The new algorithm is tested on the complete set of Bischoff and Ratcliff problems, ranging from weakly to strongly heterogeneous instances, and outperforms all the reported algorithms which have used those test instances.

[1]  David Pisinger,et al.  Heuristics for the container loading problem , 2002, Eur. J. Oper. Res..

[2]  Hermann Gehring,et al.  A Parallel Genetic Algorithm for Solving the Container Loading Problem , 2002 .

[3]  A. Moura,et al.  A GRASP approach to the container-loading problem , 2005, IEEE Intelligent Systems.

[4]  Daniel Mack,et al.  A parallel tabu search algorithm for solving the container loading problem , 2003, Parallel Comput..

[5]  Rainer Kolisch,et al.  Experimental investigation of heuristics for resource-constrained project scheduling: An update , 2006, Eur. J. Oper. Res..

[6]  Andreas Bortfeldt,et al.  A tabu search algorithm for weakly heterogeneous container loading problems , 1998 .

[7]  Gerhard Wäscher,et al.  An improved typology of cutting and packing problems , 2007, Eur. J. Oper. Res..

[8]  Hermann Gehring,et al.  A Genetic Algorithm for Solving the Container Loading Problem , 1997 .

[9]  Ramón Alvarez-Valdés,et al.  A Maximal-Space Algorithm for the Container Loading Problem , 2008, INFORMS J. Comput..

[10]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[11]  Graham Kendall,et al.  Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques , 2013 .

[12]  E. E. Bischoff,et al.  Three-dimensional packing of items with limited load bearing strength , 2006, Eur. J. Oper. Res..

[13]  Michel Gendreau,et al.  An efficient variable neighborhood search heuristic for very large scale vehicle routing problems , 2007, Comput. Oper. Res..

[14]  Pierre Hansen,et al.  Les Cahiers Du Gerad Variable Neighborhood Search Methods , 1999 .

[15]  D. Mack,et al.  A parallel hybrid local search algorithm for the container loading problem , 2004 .

[16]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[17]  Haris Gavranovic.  Local search and suffix tree for car-sequencing problem with colors , 2008, Eur. J. Oper. Res..

[18]  M.S.W. Ratcliff,et al.  Loading pallets with non-identical items , 1995 .

[19]  Hermann Gehring,et al.  A hybrid genetic algorithm for the container loading problem , 2001, Eur. J. Oper. Res..

[20]  E. E. Bischoff,et al.  Issues in the development of approaches to container loading , 1995 .

[21]  Eberhard E. Bischoff,et al.  Weight distribution considerations in container loading , 1999, Eur. J. Oper. Res..

[22]  Michael Eley,et al.  Solving container loading problems by block arrangement , 2002, Eur. J. Oper. Res..

[23]  J. A. George,et al.  A heuristic for packing boxes into a container , 1980, Comput. Oper. Res..

[24]  Eberhard E. Bischoff,et al.  A comparative evaluation of heuristics for container loading , 1990 .

[25]  Jack Brimberg,et al.  Variable neighborhood search for the vertex weighted k , 2006, Eur. J. Oper. Res..

[26]  Eberhard E. Bischoff,et al.  Allowing for weight considerations in container loading , 1998 .

[27]  Pierre Hansen,et al.  Variable neighborhood search , 1997, Eur. J. Oper. Res..

[28]  Belén Melián-Batista,et al.  The Parallel Variable Neighborhood Search for the p-Median Problem , 2002, J. Heuristics.