Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems
From MaRDI portal
Publication:2003558
DOI10.1016/j.cor.2019.04.020zbMath1458.90544OpenAlexW2942216620WikidataQ127960247 ScholiaQ127960247MaRDI QIDQ2003558
Everton Fernandes Silva, Tony Wauters, Túlio Ângelo Machado Toffolo
Publication date: 9 July 2019
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2019.04.020
Related Items (12)
Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ A matheuristic framework for the three-dimensional single large object placement problem with practical constraints ⋮ Extracting maximal objects from three-dimensional solid materials ⋮ A new dynamic shape adjustment and placement algorithm for 3D yard allocation problem with time dimension ⋮ Lexicographic optimization for the multi-container loading problem with open dimensions for a shoe manufacturer ⋮ Cutting and packing problems under uncertainty: literature review and classification framework ⋮ Airfreight forwarder's shipment planning: shipment consolidation and containerization ⋮ A large neighbourhood search algorithm for solving container loading problems ⋮ Modeling soft unloading constraints in the multi-drop container loading problem ⋮ Practical constraints in the container loading problem: comprehensive formulations and exact algorithm ⋮ Effective loading in combined vehicle routing and container loading problems
Uses Software
Cites Work
- Unnamed Item
- 2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problems
- A beam search approach to the container loading problem
- A space-indexed formulation of packing boxes into a larger box
- An efficient placement heuristic for three-dimensional rectangular packing
- An analytical model for the container loading problem
- Value considerations in three-dimensional packing -- a heuristic procedure using the fractional knapsack problem
- A MIP-based slicing heuristic for three-dimensional bin packing
- A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem
- 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 MIP approach for some practical packing problems: balancing constraints and tetris-like items
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
- An improved typology of cutting and packing problems
- A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application
- A comparative review of 3D container loading algorithms
- A Maximal-Space Algorithm for the Container Loading Problem
- A global optimization approach for solving three-dimensional open dimension rectangular packing problems
- The Three-Dimensional Bin Packing Problem
- Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems
This page was built for publication: Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems
