A reference length approach for the 3D strip packing problem
From MaRDI portal
Publication:1926699
DOI10.1016/j.ejor.2012.01.039zbMath1253.90142OpenAlexW2147816005MaRDI QIDQ1926699
Wenbin Zhu, Lijun Wei, Andrew E. B. Lim, Wee-Chong Oon
Publication date: 29 December 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2012.01.039
Related Items (5)
A block-based layer building approach for the 2D guillotine strip packing problem ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ An overview of population-based algorithms for multi-objective optimisation ⋮ A bidirectional building approach for the 2D constrained guillotine knapsack packing problem ⋮ An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem
Cites Work
- Unnamed Item
- Unnamed Item
- A hybrid placement strategy for the three-dimensional strip packing problem
- Reactive GRASP for the strip-packing problem
- Exact algorithms for the two-dimensional strip packing problem with and without rotations
- Weight distribution considerations in container loading
- Exact algorithms for the guillotine strip cutting/packing problem.
- An efficient approach for the multi-pallet loading problem
- Heuristics for the container loading problem
- An effective quasi-human based heuristic for solving the rectangle packing problem
- Bidirectional best-fit heuristic for orthogonal rectangular strip packing
- Neighborhood structures for the container loading problem: a VNS implementation
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- New heuristics for packing unequal circles into a circular container
- A new heuristic recursive algorithm for the strip rectangular packing problem
- An improved typology of cutting and packing problems
- A heuristic for the three-dimensional strip packing problem
- An Exact Approach to the Strip-Packing Problem
- A Tree Search Algorithm for Solving the Container Loading Problem
- Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
- A Maximal-Space Algorithm for the Container Loading Problem
- A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem
- The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
- An asymptotic approximation algorithm for 3D-strip packing
- Orthogonal Packings in Two Dimensions
- Loading Multiple Pallets
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- Greedy algorithms for packing unequal circles into a rectangular container
- A hybrid genetic algorithm for the container loading problem
This page was built for publication: A reference length approach for the 3D strip packing problem
