A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem

DOI10.1016/J.EJOR.2016.07.033zbMath1394.90500OpenAlexW2481042922MaRDI QIDQ1752837

Túlio A. M. Toffolo, Tony Wauters, Eline Esprit, Greet vanden Berghe

Publication date: 24 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2016.07.033

zbMATH Keywords

bin packingdecomposition strategiesESICUP challengeruin-and-recreate heuristicthree dimensional multiple container loading problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Case-oriented studies in operations research (90B90) Discrete location and assignment (90B80)

Related Items (15)

Logistic constraints in container loading problems: the impact of complete shipment conditions ⋮ Solving a large multicontainer loading problem in the car manufacturing industry ⋮ A data-driven approach for mixed-case palletization with support ⋮ A beam search algorithm for the biobjective container loading problem ⋮ Lexicographic optimization for the multi-container loading problem with open dimensions for a shoe manufacturer ⋮ Minimizing late deliveries in a truck loading problem ⋮ A large neighbourhood search algorithm for solving container loading problems ⋮ The multiple container loading problem with loading docks ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ Inbound and outbound flow integration for cross-docking operations ⋮ Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems ⋮ Adaptive large neighborhood search for solving the circle bin packing problem ⋮ Practical constraints in the container loading problem: comprehensive formulations and exact algorithm ⋮ The exact solutions of several types of container loading problems ⋮ Integrating workload smoothing and inventory reduction in three intermodal logistics platforms of a European car manufacturer

Uses Software

• SCIP
• Ts2pack

Cites Work

• A beam search approach to the container loading problem
• The multiple container loading cost minimization problem
• A tree search method for the container loading problem with shipment priority
• The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio
• SCIP: solving constraint integer programs
• Loading plates with non-identical items
• A tabu search algorithm for weakly heterogeneous container loading problems
• Two-dimensional packing problems: a survey
• Solving container loading problems by block arrangement
• Heuristic algorithms for the three-dimensional bin packing problem
• Constraints in container loading -- a state-of-the-art review
• TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
• An improved typology of cutting and packing problems
• A comparative review of 3D container loading algorithms
• Guided Local Search for the Three-Dimensional Bin-Packing Problem
• Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
• A Maximal-Space Algorithm for the Container Loading Problem
• The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
• A Genetic Algorithm for Solving the Container Loading Problem
• Applying spatial representation techniques to the container packing problem
• The Three-Dimensional Bin Packing Problem
• A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
• A hybrid genetic algorithm for the container loading problem

This page was built for publication: A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem