Beam search and non-linear programming tools for the circular packing problem
Summary: This article studies the circular packing problem (CPP) which consists of packing \(n\) circles of known radii into the smallest containing circle \(\mathbb C\). The objective is to determine the coordinates of the centres of the circles as well as the radius of \(\mathbb C\). CPP, which is a variant of the 2D open-dimension problem, embeds two extremely difficult problems: a pure continuous optimisation problem and a combinatorial one. This article provides experimental proof that the continuous and combinatorial aspects of the problem should not be tackled independently, and need to be considered simultaneously. Specifically, it proposes two beam search algorithms. The first algorithm is a two-stage approach. Stage one uses a filtered beam search to identify the best ordering of the circles whereas stage two uses a recovering beam search along with non-linear optimisation to find the best position of each circle given the ordering identified during stage one. The second algorithm embeds both searches into a single search tree where each level has two sublevels: sublevel one applies a filtered beam search to identify the circle to be packed whereas sublevel two applies a recovering beam search along with non-linear optimisation to identify its position. The computational results further show that the second algorithm obtains very good results.
- A beam search algorithm for the circular packing problem
- Adaptive beam search lookahead algorithms for the circular packing problem
- A hybrid beam search looking-ahead algorithm for the circular packing problem
- A beam search implementation for the irregular shape packing problem
- A beam search approach to solve the convex irregular bin packing problem with guillotine guts
- Formulation Space Search for Circle Packing Problems
- Solving circle packing problems by global optimization: numerical results and industrial applications
- Mixed-integer DC programming based algorithms for the circular packing problem
- Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container
- A local search-based method for sphere packing problems
- A beam search approach to solve the convex irregular bin packing problem with guillotine guts
- Evolutionary computation solutions to the circle packing problem
- Adaptive and restarting techniques-based algorithms for circular packing problems
- A dynamic adaptive local search algorithm for the circular packing problem
- Packing unit spheres into a cube using VNS
- Adaptive beam search lookahead algorithms for the circular packing problem
- Solving the circular open dimension problem by using separate beams and look-ahead strategies
- A literature review on circle and sphere packing problems: models and methodologies
- A hybrid beam search looking-ahead algorithm for the circular packing problem
- A beam search algorithm for the circular packing problem
This page was built for publication: Beam search and non-linear programming tools for the circular packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q843379)
