Sequential heuristic for the two-dimensional bin-packing problem
From MaRDI portal
Publication:2629597
DOI10.1016/j.ejor.2014.06.032zbMath1339.90278OpenAlexW2022454676MaRDI QIDQ2629597
Yi-Ping Cui, Tianbing Tang, Yaodong Cui
Publication date: 6 July 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.06.032
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (14)
A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints ⋮ A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem ⋮ Triple-solution approach for the strip packing problem with two-staged patterns ⋮ An introduction to the two‐dimensional rectangular cutting and packing problem ⋮ Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization ⋮ Finished-vehicle transporter routing problem solved by loading pattern discovery ⋮ A heuristic for the skiving and cutting stock problem in paper and plastic film industries ⋮ Necessity and complexity of order picking routing optimisation based on pallet loading features ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ A sequential value correction heuristic for a bi-objective two-dimensional bin-packing ⋮ Number of bins and maximum lateness minimization in two-dimensional bin packing ⋮ Sequential value correction heuristic for the two-dimensional cutting stock problem with three-staged homogenous patterns ⋮ Hybrid approach for the two-dimensional bin packing problem with two-staged patterns ⋮ A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem
Cites Work
- Unnamed Item
- A heuristic for solving large bin packing problems in two and three dimensions
- Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts
- Heuristic for the rectangular strip packing problem with rotation of items
- A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
- Recent advances on two-dimensional bin packing problems
- Two-stage general block patterns for the two-dimensional cutting problem
- A least wasted first heuristic algorithm for the rectangular packing problem
- An agent-based approach to the two-dimensional guillotine bin packing problem
- A lower bound for the non-oriented two-dimensional bin packing problem
- A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems.
- The two-dimensional finite bin packing problem. II: New lower and upper bounds
- Two-dimensional packing problems: a survey
- A goal-driven approach to the 2D bin packing and variable-sized bin packing problems
- New lower bounds for the three-dimensional orthogonal bin packing problem
- Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
- A new lower bound for the non-oriented two-dimensional bin-packing problem
- New resolution algorithm and pretreatments for the two-dimensional bin-packing problem
- Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting
- HEURISTICS WITH STOCHASTIC NEIGHBORHOOD STRUCTURES FOR TWO-DIMENSIONAL BIN PACKING AND CUTTING STOCK PROBLEMS
- Two-Dimensional Finite Bin-Packing Algorithms
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- The Three-Dimensional Bin Packing Problem
- One-dimensional heuristics adapted for two-dimensional rectangular strip packing
This page was built for publication: Sequential heuristic for the two-dimensional bin-packing problem
