An effective shaking procedure for 2D and 3D strip packing problems
From MaRDI portal
Publication:336597
DOI10.1016/j.cor.2013.05.017zbMath1348.90558OpenAlexW1986248211MaRDI QIDQ336597
Jannes Verstichel, Tony Wauters, Greet vanden Berghe
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.05.017
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (3)
Heuristic-based energy landscape paving for the circular packing problem with performance constraints of equilibrium ⋮ Upper bounds for heuristic approaches to the strip packing problem ⋮ Effective loading in combined vehicle routing and container loading problems
Cites Work
- Unnamed Item
- A simple randomized algorithm for two-dimensional strip packing
- A hybrid placement strategy for the three-dimensional strip packing problem
- A squeaky wheel optimisation methodology for two-dimensional strip packing
- The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio
- Reactive GRASP for the strip-packing problem
- A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem
- Guillotineable bin packing: A genetic approach
- Packing problems
- An iterative scheduling technique for resource-constrained project scheduling
- On genetic algorithms for the packing of polygons
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- A typology of cutting and packing problems
- Heuristics for the container loading problem
- Two-dimensional packing problems: a survey
- Bidirectional best-fit heuristic for orthogonal rectangular strip packing
- An improved typology of cutting and packing problems
- A heuristic for the three-dimensional strip packing 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
- Orthogonal Packings in Two Dimensions
- Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- One-dimensional heuristics adapted for two-dimensional rectangular strip packing
This page was built for publication: An effective shaking procedure for 2D and 3D strip packing problems
