A least wasted first heuristic algorithm for the rectangular packing problem
From MaRDI portal
Publication:960413
DOI10.1016/j.cor.2008.03.004zbMath1179.90174OpenAlexW1966419424MaRDI QIDQ960413
Lijun Wei, Qingshan Chen, Defu Zhang
Publication date: 17 December 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2008.03.004
Related Items (27)
Sequential heuristic for the two-dimensional bin-packing problem ⋮ A quasi-human algorithm for the two dimensional rectangular strip packing problem: in memory of Prof. Wenqi Huang ⋮ An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem ⋮ An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry ⋮ An effective tabu search approach with improved loading algorithms for the 3L-CVRP ⋮ A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem ⋮ An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation ⋮ A simple randomized algorithm for two-dimensional strip packing ⋮ An exact strip packing algorithm based on canonical forms ⋮ A new heuristic algorithm for the circular packing problem with equilibrium constraints ⋮ A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem ⋮ The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview ⋮ An introduction to the two‐dimensional rectangular cutting and packing problem ⋮ Rectangle packing with a recursive pilot method ⋮ Scheduling inspired models for two-dimensional packing problems ⋮ A skyline heuristic for the 2D rectangular packing and strip packing problems ⋮ A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint ⋮ A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem ⋮ An efficient deterministic heuristic for two-dimensional rectangular packing ⋮ Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem ⋮ Vehicle routing problems with loading constraints: state-of-the-art and future directions ⋮ An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem ⋮ The maximum diversity assortment selection problem ⋮ Integrated optimization of mixed cargo packing and cargo location assignment in automated storage and retrieval systems ⋮ An open space based heuristic for the 2D strip packing problem with unloading constraints ⋮ Exact algorithms for the two-dimensional strip packing problem with and without rotations ⋮ An efficient heuristic algorithm for two-dimensional rectangular packing problem with central rectangle
Cites Work
- A new heuristic algorithm for rectangle packing
- A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
- Heuristic approaches for the two- and three-dimensional knapsack packing problem
- Guillotineable bin packing: A genetic approach
- Packing problems
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
- Heuristics for the container loading problem
- Two-dimensional packing problems: a survey
- An effective quasi-human based heuristic for solving the rectangle packing problem
- A population heuristic for constrained two-dimensional non-guillotine cutting
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- A new heuristic recursive algorithm for the strip rectangular packing problem
- A tabu search algorithm for a two-dimensional non-guillotine cutting problem
- An Exact Approach to the Strip-Packing Problem
- The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- The Three-Dimensional Bin Packing Problem
- A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
This page was built for publication: A least wasted first heuristic algorithm for the rectangular packing problem
