A global search framework for practical three-dimensional packing with variable carton orientations
From MaRDI portal
Publication:1761175
DOI10.1016/j.cor.2011.12.007zbMath1251.90018OpenAlexW2014060518MaRDI QIDQ1761175
Yong Wu, Yaohua He, Robert de Souza
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10072/44199
Related Items (4)
Packing non-identical circles within a rectangle with open length ⋮ Solving packing problems by a distributed global optimization algorithm ⋮ Three-stage heuristic algorithm for three-dimensional irregular packing problem ⋮ A comparative review of 3D container loading algorithms
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A hybrid placement strategy for the three-dimensional strip packing problem
- A new heuristic algorithm for cuboids packing with no orientation constraints
- Heuristic approaches for the two- and three-dimensional knapsack packing problem
- Three-dimensional bin packing problem with variable bin height
- Loading plates with non-identical items
- An analytical model for the container loading problem
- Genetic algorithm crossover operators for ordering applications
- A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint
- A parallel multi-population biased random-key genetic algorithm for a container loading problem
- Measuring instance difficulty for combinatorial optimization problems
- A comparative evaluation of heuristics for container loading
- Heuristics for the container loading problem
- Heuristic algorithms for the three-dimensional bin packing problem
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
- The distributor's three-dimensional pallet-packing problem: a human intelligence-based heuristic approach
- 3-D container packing heuristics
- An improved typology of cutting and packing problems
- A heuristic for the three-dimensional strip packing problem
- Guided Local Search for the Three-Dimensional Bin-Packing Problem
- A Tree Search Algorithm for Solving the Container Loading Problem
- Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
- A Parallel Genetic Algorithm for Solving the Container Loading Problem
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- An Optimization Algorithm for the Ordered Open-End Bin-Packing Problem
- The Ordered Open-End Bin-Packing Problem
- A Genetic Algorithm for Solving the Container Loading Problem
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- The Three-Dimensional Bin Packing Problem
- Loading Multiple Pallets
- Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems
- A hybrid genetic algorithm for the container loading problem
This page was built for publication: A global search framework for practical three-dimensional packing with variable carton orientations
