Adaptive beam search lookahead algorithms for the circular packing problem

DOI10.1111/J.1475-3995.2009.00745.XMaRDI QIDQ3002543zbMATH OpenOpenAlexFDO

Authors Hakim Akeb, Mhand Hifi, Rym M'Hallah

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

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

Recommendations

• A beam search algorithm for the circular packing problem
• A hybrid beam search looking-ahead algorithm for the circular packing problem
• Beam search and non-linear programming tools for the circular packing problem
• A dynamic adaptive local search algorithm for the circular packing problem
• Adaptive algorithms for circular cutting/packing problems

Cites work

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

Cited in

(13)

• Adaptive algorithms for circular cutting/packing problems
• Adaptive large neighborhood search for solving the circle bin packing problem
• Adaptive simulated annealing with greedy search for the circle bin packing problem
• Adaptive and restarting techniques-based algorithms for circular packing problems
• A dynamic adaptive local search algorithm for the circular packing problem
• 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
• Solving the circular open dimension problem by using separate beams and look-ahead strategies
• A filtered beam search based heuristic algorithm for packing unit circles into a circular container
• Solution-hashing search based on layout-graph transformation for unequal circle packing
• A hybrid beam search looking-ahead algorithm for the circular packing problem
• Beam search and non-linear programming tools for the circular packing problem
• A beam search algorithm for the circular packing problem

This page was built for publication: Adaptive beam search lookahead algorithms for the circular packing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3002543)