Three-dimensional container loading models with cargo stability and load bearing constraints

DOI10.1016/j.cor.2010.07.017zbMath1251.90240OpenAlexW2081338766WikidataQ57719469 ScholiaQ57719469MaRDI QIDQ1761946

Denise Sato Yamashita, Leonardo Junqueira, Reinaldo Morabito

Publication date: 15 November 2012

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2010.07.017

zbMATH Keywords

combinatorial optimizationmathematical modelingcutting and packing problemsthree-dimensional container loading

Mathematics Subject Classification ID

Integer programming (90C10) Case-oriented studies in operations research (90B90) Discrete location and assignment (90B80)

Related Items (48)

Logistic constraints in container loading problems: the impact of complete shipment conditions ⋮ A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints ⋮ A global optimization approach for solving three-dimensional open dimension rectangular packing problems ⋮ Global optimization for the three-dimensional open-dimension rectangular packing problem ⋮ An extension of Queiroz and Miyazawa's method for vertical stability in two-dimensional packing problems to deal with horizontal stability ⋮ A heuristic algorithm for container loading of pallets with infill boxes ⋮ A hybrid approach for the vehicle routing problem with three-dimensional loading constraints ⋮ Sharing loading costs for multi compartment vehicles ⋮ VCS: A new heuristic function for selecting boxes in the single container loading problem ⋮ Solving a large multicontainer loading problem in the car manufacturing industry ⋮ The load-balanced multi-dimensional bin-packing problem ⋮ A data-driven approach for mixed-case palletization with support ⋮ A matheuristic framework for the three-dimensional single large object placement problem with practical constraints ⋮ A beam search algorithm for the biobjective container loading problem ⋮ An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts ⋮ An efficient method for the three-dimensional container loading problem by forming box sizes ⋮ The static stability of support factor‐based rectangular packings: an assessment by regression analysis ⋮ A mixed‐integer linear model for the multiple heterogeneous knapsack problem with realistic container loading constraints and bins' priority ⋮ The container loading problem with cargo stability: a study on support factors, mechanical equilibrium and grids ⋮ A large neighbourhood search algorithm for solving container loading problems ⋮ The multiple container loading problem with loading docks ⋮ Оптимизация загрузки упорядоченной совокупности летательных аппаратов ⋮ Modeling soft unloading constraints in the multi-drop container loading problem ⋮ A multistart biased‐randomized algorithm for solving a three‐dimensional case picking problem with real‐life constraints ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ A space-indexed formulation of packing boxes into a larger box ⋮ The three-dimensional knapsack problem with balancing constraints ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ Exploiting Packing Components in General-Purpose Integer Programming Solvers ⋮ Product packing and stacking under uncertainty: a robust approach ⋮ A tailored two-phase constructive heuristic for the three-dimensional multiple bin size bin packing problem with transportation constraints ⋮ Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems ⋮ MIP-based approaches for the container loading problem with multi-drop constraints ⋮ Order and static stability into the strip packing problem ⋮ Vehicle routing problems with loading constraints: state-of-the-art and future directions ⋮ The pallet loading problem: three-dimensional bin packing with practical constraints ⋮ Grids for cutting and packing problems: a study in the 2D knapsack problem ⋮ Adaptive large neighborhood search for solving the circle bin packing problem ⋮ Practical constraints in the container loading problem: comprehensive formulations and exact algorithm ⋮ The forgotten sons: warehousing systems for brick-and-mortar retail chains ⋮ A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application ⋮ Weight distribution in container loading: a case study ⋮ A comparative review of 3D container loading algorithms ⋮ The exact solutions of several types of container loading problems ⋮ An AIMMS-based decision-making model for optimizing the intelligent stowage of export containers in a single bay ⋮ An optimization model for the vehicle routing problem with practical three-dimensional loading constraints ⋮ Optimization Models for the Three-Dimensional Container Loading Problem with Practical Constraints ⋮ Constraints in container loading -- a state-of-the-art review

Cites Work

• An integrated approach to the vehicle routing and container loading problems
• A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach
• Weight distribution considerations in container loading
• An analytical model for the container loading problem
• Allowing for weight considerations in container loading
• An exact algorithm for general, orthogonal, two-dimensional knapsack problems
• An efficient approach for the multi-pallet loading problem
• A typology of cutting and packing problems
• Heuristics for the container loading problem
• Solving container loading problems by block arrangement
• An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container
• A bottleneck assignment approach to the multiple container loading problem
• A population heuristic for constrained two-dimensional non-guillotine cutting
• Neighborhood structures for the container loading problem: a VNS implementation
• A caving degree approach for the single container loading problem
• Three-dimensional packing of items with limited load bearing strength
• 3-D container packing heuristics
• An improved typology of cutting and packing problems
• A heuristic for the three-dimensional strip packing problem
• A Maximal-Space Algorithm for the Container Loading Problem
• A greedy search for the three-dimensional bin packing problem: the packing static stability case
• A Parallel Genetic Algorithm for Solving the Container Loading Problem
• A parallel hybrid local search algorithm for the container loading problem
• Container loading with multi-drop constraints
• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• A Method for Solving Container Packing for a Single Size of Box
• An Algorithm for Two-Dimensional Cutting Problems
• Approximate algorithms for the container loading problem
• The Three-Dimensional Bin Packing Problem
• AN EFFICIENT APPROACH FOR THE THREE-DIMENSIONAL CONTAINER PACKING PROBLEM WITH PRACTICAL CONSTRAINTS
• An L-approach for packing (ℓ, w)-rectangles into rectangular and L-shaped pieces
• A distributed global optimization method for packing problems
• An AND/OR-graph approach to the container loading problem
• Loading Multiple Pallets
• An effective recursive partitioning approach for the packing of identical rectangles in a rectangle
• Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem
• Multistage Cutting Stock Problems of Two and More Dimensions
• A hybrid genetic algorithm for the container loading problem

This page was built for publication: Three-dimensional container loading models with cargo stability and load bearing constraints