A simple randomized algorithm for two-dimensional strip packing
From MaRDI portal
Publication:339530
DOI10.1016/j.cor.2012.05.001zbMath1349.90726OpenAlexW2027553310MaRDI QIDQ339530
Shuangyuan Yang, Weiguo Ye, Shui-hua Han
Publication date: 11 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.05.001
Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)
Related Items (7)
A hybrid algorithm based on variable neighbourhood for the strip packing problem ⋮ An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem ⋮ An effective shaking procedure for 2D and 3D strip packing problems ⋮ An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation ⋮ VCS: A new heuristic function for selecting boxes in the single container loading problem ⋮ Rectangle packing with a recursive pilot method ⋮ An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem
Cites Work
- Unnamed Item
- A skyline heuristic for the 2D rectangular packing and strip packing problems
- A squeaky wheel optimisation methodology for two-dimensional strip packing
- Reactive GRASP for the strip-packing problem
- A least wasted first heuristic algorithm for the rectangular packing problem
- Exact algorithms for the two-dimensional strip packing problem with and without rotations
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
- Packing problems
- On genetic algorithms for the packing of polygons
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
- An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
- A typology of cutting and packing problems
- Two-dimensional packing problems: a survey
- Exhaustive approaches to 2D rectangular perfect packings
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- A new heuristic recursive algorithm for the strip rectangular packing problem
- An improved typology of cutting and packing problems
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- An Exact Approach to the 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
- An Improved Heuristic Recursive Strategy Based on Genetic Algorithm for the Strip Rectangular Packing Problem
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- Two-Dimensional Finite Bin-Packing Algorithms
- Orthogonal Packings in Two Dimensions
- An Algorithm for Two-Dimensional Cutting Problems
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- 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
- Data set generation for rectangular placement problems
This page was built for publication: A simple randomized algorithm for two-dimensional strip packing
