A skyline heuristic for the 2D rectangular packing and strip packing problems
From MaRDI portal
Publication:421662
DOI10.1016/j.ejor.2011.06.022zbMath1237.90213OpenAlexW2028971691MaRDI QIDQ421662
Wenbin Zhu, Lijun Wei, Wee-Chong Oon, Andrew E. B. Lim
Publication date: 14 May 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.2011.06.022
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (22)
A block-based layer building approach for the 2D guillotine strip packing problem ⋮ A hybrid evolutionary algorithm for the two-dimensional packing problem ⋮ A hybrid algorithm based on variable neighbourhood for the strip packing problem ⋮ A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints ⋮ Adaptive simulated annealing with greedy search for the circle bin packing problem ⋮ A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem ⋮ Logic based Benders' decomposition for orthogonal stock cutting problems ⋮ An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation ⋮ A simple randomized algorithm for two-dimensional strip packing ⋮ Combinatorial Benders' Cuts for the Strip Packing Problem ⋮ The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview ⋮ A new dynamic shape adjustment and placement algorithm for 3D yard allocation problem with time dimension ⋮ An introduction to the two‐dimensional rectangular cutting and packing problem ⋮ Dual-neighborhood iterated local search for routing and wavelength assignment ⋮ Modelling and heuristically solving many-to-many heterogeneous vehicle routing problem with cross-docking and two-dimensional loading constraints ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ Exact solution techniques for two-dimensional cutting and packing ⋮ Queue-constrained packing: a vehicle ferry case study ⋮ An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem ⋮ Upper bounds for heuristic approaches to the strip packing problem ⋮ The maximum diversity assortment selection problem ⋮ An open space based heuristic for the 2D strip packing problem with unloading constraints
Cites Work
- A general framework for bounds for higher-dimensional orthogonal packing problems.
- The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio
- New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
- A new heuristic algorithm for rectangle packing
- Reactive GRASP for the strip-packing problem
- A least wasted first heuristic algorithm for the rectangular packing problem
- A branch and bound algorithm for the strip packing problem
- Exact algorithms for the two-dimensional strip packing problem with and without rotations
- Some experiments with simulated annealing techniques for packing problems
- Exact algorithms for the guillotine strip cutting/packing problem.
- 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
- An effective quasi-human based heuristic for solving the rectangle packing problem
- Bidirectional best-fit heuristic for orthogonal rectangular strip packing
- Exhaustive approaches to 2D rectangular perfect packings
- A new constraint programming approach for the orthogonal packing problem
- A new exact method for the two-dimensional bin-packing problem with fixed orientation
- A new lower bound for the non-oriented two-dimensional bin-packing problem
- 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
- A new exact method for the two-dimensional orthogonal packing problem
- A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
- 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 Exact Algorithm for the Two-Dimensional Strip-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
- 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
- Unnamed Item
This page was built for publication: A skyline heuristic for the 2D rectangular packing and strip packing problems
