A dynamic adaptive local search algorithm for the circular packing problem
From MaRDI portal
Publication:2643959
DOI10.1016/j.ejor.2005.11.069zbMath1135.90037OpenAlexW1966220861MaRDI QIDQ2643959
Publication date: 27 August 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.11.069
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (11)
Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container ⋮ A formulation space search heuristic for packing unequal circles in a fixed size circular container ⋮ An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container ⋮ A memetic algorithm to pack unequal circles into a square ⋮ A literature review on circle and sphere packing problems: models and methodologies ⋮ Approximation schemes for covering and packing problems in image processing and VLSI ⋮ Adaptive beam search lookahead algorithms for the circular packing problem ⋮ A beam search algorithm for the circular packing problem ⋮ Adaptive large neighborhood search for solving the circle bin packing problem ⋮ Near optimal minimal convex hulls of disks ⋮ Iterated dynamic thresholding search for packing equal circles into a circular container
Cites Work
- Unnamed Item
- Optimising the palletisation of cylinders in cases
- Cutting and packing. Special issue
- Packing different-sized circles into a rectangular container
- Curved hexagonal packings of equal disks in a circle
- Dense packings of congruent circles in a circle
- Approximate algorithms for constrained circular cutting problems
- Reformulation descent applied to circle packing problems
- An improved algorithm for the packing of unequal circles within a larger containing circle
- Two-dimensional packing problems: a survey
- A simulated annealing approach for the circular cutting problem
- Repeated patterns of dense packings of equal disks in a square
- An effective hybrid algorithm for the problem of packing circles into a larger containing circle
- An improved typology of cutting and packing problems
- A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes
- Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints
This page was built for publication: A dynamic adaptive local search algorithm for the circular packing problem
