An open space based heuristic for the 2D strip packing problem with unloading constraints
From MaRDI portal
Publication:2310581
DOI10.1016/j.apm.2019.01.022zbMath1462.90115OpenAlexW2914485204WikidataQ128539942 ScholiaQ128539942MaRDI QIDQ2310581
Jian Huang, Lijun Wei, Huibing Cheng, Yong-sheng Wang
Publication date: 6 April 2020
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2019.01.022
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (6)
The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview ⋮ Exact approaches for the unconstrained two-dimensional cutting problem with defects ⋮ Cargo securing under multi-drop and axle weight constraints ⋮ A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows ⋮ Two-dimensional knapsack-block packing problem ⋮ An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem
Cites Work
- Heuristics for the strip packing problem with unloading constraints
- A skyline heuristic for the 2D rectangular packing and strip packing problems
- Fast heuristic for constrained homogenous T-shape cutting patterns
- A least wasted first heuristic algorithm for the rectangular packing problem
- Exact algorithms for the two-dimensional strip packing problem with and without rotations
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation
- A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints
- An efficient deterministic heuristic for two-dimensional rectangular packing
- Three-stage heuristic algorithm for three-dimensional irregular packing problem
- Two-dimensional strip packing with unloading constraints
- New resolution algorithm and pretreatments for the two-dimensional bin-packing problem
- Two Dimensional Strip Packing with Unloading Constraints
- An Exact Approach to the Strip-Packing Problem
- An Exact Algorithm for the Two-Dimensional Orthogonal Packing Problem with Unloading Constraints
- 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
- Orthogonal Packings in Two Dimensions
- An Algorithm for Two-Dimensional Cutting Problems
- The Three-Dimensional Bin Packing Problem
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- Erratum: A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
This page was built for publication: An open space based heuristic for the 2D strip packing problem with unloading constraints
