Optimizing highly constrained truck loadings using a self-adaptive genetic algorithm

Most research into the Container Loading problem has been done on theoretical problem sets and while taking one or two constraints into account. In this paper we discuss the successful implementation of a self-adaptive Genetic Algorithm applying only mutation, with a variable mutation rate. This is applied to a real-world problem with actual problem instances from industry. We introduce an abstract, indirect representation for the considered loadings together with two mutation strategies. Solutions of these different strategies are compared with each other, a static mutation rate GA, and with solutions created by human planners as used in industry, for a set of over 500 realworld problem instances. Furthermore, we examine how our automated results compare to those generated by experienced human planners, showing that they are valid loadings and match fitness values.

[1]  Dalius Rubliauskas,et al.  A RANDOMIZED HEURISTIC FOR THE CONTAINER LOADING PROBLEM: FURTHER INVESTIGATIONS , 2006 .

[2]  Ramón Alvarez-Valdés,et al.  Neighborhood structures for the container loading problem: a VNS implementation , 2010, J. Heuristics.

[3]  Hamadi Hasni,et al.  On a Hybrid Genetic Algorithm for Solving the Container Loading Problem with no Orientation Constraints , 2013, J. Math. Model. Algorithms.

[4]  Türkay Dereli,et al.  A HYBRID SIMULATED ANNEALING ALGORITHM FOR SOLVING MULTI-OBJECTIVE CONTAINER-LOADING PROBLEMS , 2010, Appl. Artif. Intell..

[5]  Mauricio G. C. Resende,et al.  A biased random key genetic algorithm for 2D and 3D bin packing problems , 2013 .

[6]  Andrew Lim,et al.  A reference length approach for the 3D strip packing problem , 2012, Eur. J. Oper. Res..

[7]  Graham Kendall,et al.  A hybrid placement strategy for the three-dimensional strip packing problem , 2011, Eur. J. Oper. Res..

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

[9]  Mark Goh,et al.  Three-dimensional bin packing problem with variable bin height , 2010, Eur. J. Oper. Res..

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

[11]  Thomas Bäck,et al.  On the log-normal self-adaptation of the mutation rate in binary search spaces , 2011, GECCO '11.

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

[13]  Andreas Bortfeldt,et al.  Constraints in container loading - A state-of-the-art review , 2013, Eur. J. Oper. Res..