A hybrid algorithm based on variable neighbourhood for the strip packing problem
DOI10.1007/S10878-016-0036-6zbMATH Open1354.90123OpenAlexW2427605495WikidataQ57569978 ScholiaQ57569978MaRDI QIDQ306099FDOQ306099
Authors: Defu Zhang, Yuxin Che, Furong Ye, Yain-Whar Si, 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
Recommendations
- A hybrid metaheuristic for the two-dimensional strip packing problem
- Tabu search with consistent neighbourhood for strip packing
- A branch and bound algorithm for the strip packing problem
- Variable neighbourhood search for the variable sized bin packing problem
- Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
- A hybrid heuristic algorithm for the 2D variable-sized bin packing problem
- A variable neighborhood descent approach for the two-dimensional bin packing problem
- A hybrid placement strategy for the three-dimensional strip packing problem
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Exact algorithms for the two-dimensional strip packing problem with and without rotations
- An improved typology of cutting and packing problems
- Variable neighborhood search
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Two-dimensional packing problems: a survey
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- 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
- A block-based layer building approach for the 2D guillotine strip packing problem
- Two-Dimensional Finite Bin-Packing Algorithms
- An Algorithm for Two-Dimensional Cutting Problems
- A skyline heuristic for the 2D rectangular packing and strip packing problems
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
- Heuristics for the variable sized bin-packing problem
- A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem
- Two-dimensional strip packing with unloading constraints
- 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
- A simple randomized algorithm for two-dimensional strip packing
- One-dimensional heuristics adapted for two-dimensional rectangular strip packing
- A new heuristic algorithm for rectangle packing
- Reactive GRASP for the strip-packing problem
Cited In (3)
This page was built for publication: A hybrid algorithm based on variable neighbourhood for the strip packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q306099)
