A beam search algorithm for the circular packing problem
From MaRDI portal
Publication:960400
DOI10.1016/j.cor.2008.02.003zbMath1177.90330OpenAlexW2066587387MaRDI QIDQ960400
Hakim Akeb, Mhand Hifi, Rym M'Hallah
Publication date: 17 December 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2008.02.003
beam searchdiversificationdichotomous searchcircular packinglocal-position distancemaximum hole degree
Related Items (11)
Heuristic-based energy landscape paving for the circular packing problem with performance constraints of equilibrium ⋮ Adaptive simulated annealing with greedy search for the circle bin packing problem ⋮ Iterated tabu search and variable neighborhood descent for packing unequal circles into a 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 beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan ⋮ A literature review on circle and sphere packing problems: models and methodologies ⋮ Solving a large cutting problem in the glass manufacturing industry ⋮ 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 approach to solve the convex irregular bin packing problem with guillotine guts
Cites Work
- Adaptive algorithms for circular cutting/packing problems
- Packing different-sized circles into a rectangular container
- Curved hexagonal packings of equal disks in a circle
- A beam search algorithm for the load sequencing of outbound containers in port container terminals
- Approximate algorithms for constrained circular cutting problems
- Disk packing for the estimation of the size of a wire bundle
- Reformulation descent applied to circle packing problems
- Job shop scheduling with beam search
- An improved algorithm for the packing of unequal circles within a larger containing circle
- A simulated annealing approach for the circular cutting problem
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
- 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
- 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
- A New Upper Bound for the Cylinder 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
This page was built for publication: A beam search algorithm for the circular packing problem
