Optimization Models for the Three-Dimensional Container Loading Problem with Practical Constraints
From MaRDI portal
Publication:5270072
DOI10.1007/978-1-4614-4469-5_12zbMath1365.90290OpenAlexW83318670WikidataQ57719441 ScholiaQ57719441MaRDI QIDQ5270072
Denise Sato Yamashita, Leonardo Junqueira, Reinaldo Morabito, Horacio Hideki Yanasse
Publication date: 29 June 2017
Published in: Springer Optimization and Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-4469-5_12
Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (6)
Global optimization for the three-dimensional open-dimension rectangular packing problem ⋮ The static stability of support factor‐based rectangular packings: an assessment by regression analysis ⋮ Solution validator and visualizer for (combined) vehicle routing and container loading problems ⋮ A Modeling-Based Approach for Non-standard Packing Problems ⋮ Exploiting Packing Components in General-Purpose Integer Programming Solvers ⋮ Packing Problems in Space Solved by CPLEX: An Experimental Analysis
Uses Software
Cites Work
- A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach
- MIP-based heuristic for non-standard 3D-packing problems
- 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
- MIP-based approaches for the container loading problem with multi-drop constraints
- Three-dimensional container loading models with cargo stability and load bearing constraints
- A parallel multi-population biased random-key genetic algorithm for a container 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 population heuristic for constrained two-dimensional non-guillotine cutting
- A global optimization point of view to handle non-standard object packing problems
- 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
- An improved typology of cutting and packing problems
- 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
- An Algorithm for Two-Dimensional Cutting Problems
- AN EFFICIENT APPROACH FOR THE THREE-DIMENSIONAL CONTAINER PACKING PROBLEM WITH PRACTICAL CONSTRAINTS
- An AND/OR-graph approach to the container loading 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: Optimization Models for the Three-Dimensional Container Loading Problem with Practical Constraints
