A hybrid algorithm based on variable neighbourhood for the strip packing problem
From MaRDI portal
Publication:306099
DOI10.1007/s10878-016-0036-6zbMath1354.90123OpenAlexW2427605495WikidataQ57569978 ScholiaQ57569978MaRDI QIDQ306099
Yain-Whar Si, Furong Ye, Defu Zhang, Yuxin Che, Stephen C. H. Leung
Publication date: 31 August 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-016-0036-6
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- A block-based layer building approach for the 2D guillotine strip packing problem
- A simple randomized algorithm for two-dimensional strip packing
- A skyline heuristic for the 2D rectangular packing and strip packing problems
- A new heuristic algorithm for rectangle packing
- Reactive GRASP for the strip-packing problem
- A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
- Heuristics for the variable sized bin-packing problem
- Exact algorithms for the two-dimensional strip packing problem with and without rotations
- Variable neighborhood search
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem
- Two-dimensional packing problems: a survey
- Two-dimensional strip packing with unloading constraints
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems
- Dynamic reduction heuristics for the rectangle packing area minimization 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
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Two-Dimensional Finite Bin-Packing Algorithms
- An Algorithm for Two-Dimensional Cutting Problems
- 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: A hybrid algorithm based on variable neighbourhood for the strip packing problem
