A hybrid heuristic algorithm for the 2D variable-sized bin packing problem
From MaRDI portal
Publication:296697
DOI10.1016/j.ejor.2014.03.049zbMath1338.90217OpenAlexW2070817017WikidataQ57569999 ScholiaQ57569999MaRDI QIDQ296697
Defu Zhang, Xiangxiang Zeng, Hoong Chuin Lau, Yain-Whar Si, Shaohui Hong
Publication date: 23 June 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.03.049
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (7)
A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints ⋮ Variable neighborhood search for quadratic multiple constraint variable sized bin-packing problem ⋮ A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem ⋮ A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem ⋮ A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem
Cites Work
- Unnamed Item
- A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems
- Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts
- Average-case analysis of cutting and packing in two dimensions
- A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
- Recent advances on two-dimensional bin packing problems
- An agent-based approach to the two-dimensional guillotine bin packing problem
- A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem
- A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
- LP models for bin packing and cutting stock problems
- Algorithms for the variable sized bin packing problem
- A population heuristic for constrained two-dimensional non-guillotine cutting
- A goal-driven approach to the 2D bin packing and variable-sized bin packing problems
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- The two-dimensional bin packing problem with variable bin sizes and costs
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- An Exact Approach to the Strip-Packing Problem
- Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
- Two-Dimensional Finite Bin-Packing Algorithms
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- Data set generation for rectangular placement problems
This page was built for publication: A hybrid heuristic algorithm for the 2D variable-sized bin packing problem
