A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes

DOI10.1111/1475-3995.00404zbMath1087.90062OpenAlexW2028337179MaRDI QIDQ3044033

R. M. Hallah, Mhand Hifi

Publication date: 10 August 2004

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/1475-3995.00404

zbMATH Keywords

heuristicsgenetic algorithmspacking and cuttingsequential placement

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming ⋮ A hybrid approach for packing irregular patterns using evolutionary strategies and neural network ⋮ A dynamic adaptive local search algorithm for the circular packing problem ⋮ An anchorage planning strategy with safety and utilization considerations ⋮ Novel integer linear programming models for the facility layout problem with fixed-size rectangular departments ⋮ An effective heuristic for the two-dimensional irregular bin packing problem ⋮ A literature review on circle and sphere packing problems: models and methodologies ⋮ Generalized hyper-heuristics for solving 2D regular and irregular packing problems ⋮ Packing unequal circles into a strip of minimal length with a jump algorithm ⋮ Adaptive and restarting techniques-based algorithms for circular packing problems ⋮ A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting

Cites Work

• Unnamed Item
• Compaction and separation algorithms for non-convex polygons and their applications
• On genetic algorithms for the packing of polygons
• A genetic algorithm for the set covering problem
• 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
• A typology of cutting and packing problems
• Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints
• Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms