A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
From MaRDI portal
Publication:3392005
DOI10.1287/opre.1060.0293zbMath1167.90623OpenAlexW2158380317MaRDI QIDQ3392005
Graham Kendall, G. Whitwell, R. S. R. Hellier, Edmund Kieran Burke
Publication date: 13 August 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/bcf468a832d61b81df8259409746853e89845e35
Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Algorithms in computer science (68W99)
Related Items (29)
A hybrid approach for packing irregular patterns using evolutionary strategies and neural network ⋮ Optimisation of fault-tolerant fabric-cutting schedules using genetic algorithms and fuzzy set theory ⋮ Efficient implementations of construction heuristics for the rectilinear block packing problem ⋮ Complete and robust no-fit polygon generation for the irregular stock cutting problem ⋮ A clique covering MIP model for the irregular strip packing problem ⋮ An effective heuristic for the two-dimensional irregular bin packing problem ⋮ A customized branch-and-bound approach for irregular shape nesting ⋮ An iteratively doubling local search for the two-dimensional irregular bin packing problem with limited rotations ⋮ Algorithms for nesting with defects ⋮ Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming ⋮ On solving multiobjective bin packing problems using evolutionary particle swarm optimization ⋮ Phi-functions for 2D objects formed by line segments and circular arcs ⋮ Decomposition algorithm for geometric objects in 2D packing and cutting problems ⋮ Irregular stock cutting system based on AutoCAD ⋮ A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems ⋮ A fully general, exact algorithm for nesting irregular shapes ⋮ A beam search implementation for the irregular shape packing problem ⋮ Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem ⋮ Mathematical model and efficient algorithms for object packing problem ⋮ A hybrid beam search looking-ahead algorithm for the circular packing problem ⋮ Mixed-integer programming models for nesting problems ⋮ Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry ⋮ Raster penetration map applied to the irregular packing problem ⋮ Mathematical justification of a heuristic for statistical correlation of real-life time series ⋮ Solving the irregular strip packing problem via guided local search for overlap minimization ⋮ An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem ⋮ An improved best-fit heuristic for the orthogonal strip packing problem ⋮ Irregular packing: MILP model based on a polygonal enclosure ⋮ A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation
Uses Software
This page was built for publication: A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
