A hybrid genetic algorithm for the container loading problem

By Andreas Bortfeldt, H. Gehring. European Journal of Operational Research, 2001

325 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Artificial intelligence in supply chain management: theory and applications (2010, background): “…(Fontanili et al. 2000); inventory control (Disney et al. 2000, Haq and Kannan 2006); container loading (Gehring and Bortfeldt 1997, Bortfeldt and Gehring 2001); material handling (Wu and Appleton 2002), delivery reliability assurance (Antony et al. 2006); freight consolidation (Min et al.…”
An improved typology of cutting and packing problems (2007, background): “Pisinger, 2002), in which rectangular-shaped boxes have to be packed into a container (three-dimensional, rectangular SKP; also see Bischoff and Marriott, 1990; Scheithauer, 1999; Bortfeldt and Gehring, 2001).”
A Tabu Search Algorithm for a Routing and Container Loading Problem (2006, background): “The loading problem is related to various threedimensional packing problems, in particular to container-loading problems, where constraints on the supporting surface or on the fragility of the items are frequently considered (e.g., Bortfeldt and Gehring 2001; Eley 2002; Pisinger 2002).”
An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints (2007, methodology): “For the 2CLP, heuristic approaches have been proposed by Pisinger (1998, 2002) and Bortfeldt and Gehring (2000), an analytical model was pro posed by Chen, Lee, and Shen (1995), and an LP based bound was presented by Scheithauer (1992, 1999).”