A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
DOI10.1287/OPRE.1060.0293zbMATH Open1167.90623OpenAlexW2158380317MaRDI QIDQ3392005FDOQ3392005
Graham Kendall, Glenn Whitwell, R. S. R. Hellier, Edmund K. 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)
Cited In (33)
- Artificial intelligence application in production scheduling problem systematic literature review: bibliometric analysis, research trend, and knowledge taxonomy
- Irregular packing: MILP model based on a polygonal enclosure
- Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry
- A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems
- Complete and robust no-fit polygon generation for the irregular stock cutting problem
- Solving the irregular strip packing problem via guided local search for overlap minimization
- A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes
- A beam search implementation for the irregular shape packing problem
- Mathematical justification of a heuristic for statistical correlation of real-life time series
- An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
- Phi-functions for 2D objects formed by line segments and circular arcs
- Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem
- Jostling for position: local improvement for irregular cutting patterns
- A clique covering MIP model for the irregular strip packing problem
- Mathematical model and efficient algorithms for object packing problem
- Mixed-integer programming models for nesting problems
- Raster penetration map applied to the irregular packing problem
- Decomposition algorithm for geometric objects in 2D packing and cutting problems
- Algorithms for nesting with defects
- An iteratively doubling local search for the two-dimensional irregular bin packing problem with limited rotations
- Efficient implementations of construction heuristics for the rectilinear block packing problem
- A customized branch-and-bound approach for irregular shape nesting
- An effective heuristic for the two-dimensional irregular bin packing problem
- A hybrid beam search looking-ahead algorithm for the circular packing problem
- Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming
- 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
- A fully general, exact algorithm for nesting irregular shapes
- An improved best-fit heuristic for the orthogonal strip packing problem
- A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation
- Irregular stock cutting system based on AutoCAD
- On solving multiobjective bin packing problems using evolutionary particle swarm optimization
- An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry
Uses Software
Recommendations
- An effective heuristic for the two-dimensional irregular bin packing problem π π
- Heuristics for the two-dimensional irregular bin packing problem with limited rotations π π
- Efficient local search heuristics for packing irregular shapes in two-dimensional heterogeneous bins π π
- An efficient deterministic heuristic for two-dimensional rectangular packing π π
- Title not available (Why is that?) π π
- Generalized hyper-heuristics for solving 2D regular and irregular packing problems π π
- A Search-Based Heuristic For The Two-Dimensional Bin-Packing Problem π π
- A NEW HEURISTIC ALGORITHM FOR CONSTRAINED RECTANGLE-PACKING PROBLEM π π
- Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints π π
- An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem π π
This page was built for publication: A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3392005)