An effective quasi-human based heuristic for solving the rectangle packing problem
From MaRDI portal
Publication:1847202
DOI10.1016/S0377-2217(02)00129-7zbMath1081.90615OpenAlexW1966217755MaRDI QIDQ1847202
S.-C. Lau, Gilbert H. Young, C. K. Wong, Wenqi Huang, Yu-Liang Wu
Publication date: 17 November 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00129-7
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (27)
A population heuristic for constrained two-dimensional non-guillotine cutting ⋮ Solving the maximum vertex weight clique problem via binary quadratic programming ⋮ An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry ⋮ A tabu search algorithm for a two-dimensional non-guillotine cutting problem ⋮ Efficient implementations of construction heuristics for the rectilinear block packing problem ⋮ An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation ⋮ Packing unequal rectangles and squares in a fixed size circular container using formulation space search ⋮ An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem ⋮ A new heuristic algorithm for rectangle packing ⋮ A reference length approach for the 3D strip packing problem ⋮ A new iterative-doubling greedy-lookahead algorithm for the single container loading problem ⋮ An EDA for the 2D knapsack problem with guillotine constraint ⋮ Rectangle packing with a recursive pilot method ⋮ A NEW HEURISTIC ALGORITHM FOR CONSTRAINED RECTANGLE-PACKING PROBLEM ⋮ A skyline heuristic for the 2D rectangular packing and strip packing problems ⋮ A new quasi-human algorithm for solving the packing problem of unit equilateral triangles ⋮ A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem ⋮ A least wasted first heuristic algorithm for the rectangular packing problem ⋮ An efficient deterministic heuristic for two-dimensional rectangular packing ⋮ Improved local search algorithms for the rectangle packing problem with general spatial costs ⋮ A new heuristic recursive algorithm for the strip rectangular packing problem ⋮ An efficient, effective, and robust decoding heuristic for metaheuristics-based layout optimization ⋮ A fast implementation for the 2D/3D box placement problem ⋮ The maximum diversity assortment selection problem ⋮ Optimization of the distribution of small scale linear Fresnel reflectors on roofs of urban buildings ⋮ A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces ⋮ An efficient heuristic algorithm for two-dimensional rectangular packing problem with central rectangle
Cites Work
- Unnamed Item
- Optimization by Simulated Annealing
- Cutting stock problems and solution procedures
- On genetic algorithms for the packing of polygons
- An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- A mathematic-physical approach to the satisfiability problem
- An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Approximation schemes for covering and packing problems in image processing and VLSI
- Multidimensional binary search trees used for associative searching
- `` Strong NP-Completeness Results
- Practical Automatic Placement for Standard-Cell Integrated Circuits
- Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
This page was built for publication: An effective quasi-human based heuristic for solving the rectangle packing problem
