Adaptive beam search lookahead algorithms for the circular packing problem

DOI10.1111/j.1475-3995.2009.00745.xzbMath1220.90103OpenAlexW1983812591MaRDI QIDQ3002543

Rym M'Hallah, Hakim Akeb, Mhand Hifi

Publication date: 20 May 2011

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

Full work available at URL: https://doi.org/10.1111/j.1475-3995.2009.00745.x

zbMATH Keywords

binary searchmaximum hole degree

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container ⋮ Approximation schemes for covering and packing problems in image processing and VLSI

Cites Work

• A beam search algorithm for the circular packing problem
• Disk packing for the estimation of the size of a wire bundle
• Reformulation descent applied to circle packing problems
• An improved algorithm for the packing of unequal circles within a larger containing circle
• Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
• An effective hybrid algorithm for the problem of packing circles into a larger containing circle
• Minimizing the object dimensions in circle and sphere packing problems
• Adaptive and restarting techniques-based algorithms for circular packing problems
• New heuristics for packing unequal circles into a circular container
• An improved typology of cutting and packing problems
• A dynamic adaptive local search algorithm for the circular packing problem
• Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints
• Greedy algorithms for packing unequal circles into a rectangular container