Solving circle packing problems by global optimization: numerical results and industrial applications

DOI10.1016/j.ejor.2007.01.054zbMath1156.90013OpenAlexW2029049650MaRDI QIDQ932199

Ignacio Castillo, Frank J. Kampas, János D. Pintér

Publication date: 10 July 2008

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2007.01.054

zbMATH Keywords

global optimization numerical examples industrial applications circle packing problems

Mathematics Subject Classification ID

Continuous location (90B85) Nonconvex programming, global optimization (90C26)

Related Items (68)

Dense packing of congruent circles in free-form non-convex containers ⋮ Packing ellipsoids by nonlinear optimization ⋮ The disruptive anti-covering location problem ⋮ 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 ⋮ Differential evolution methods based on local searches ⋮ 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 ⋮ Survey of quantitative methods in construction ⋮ A stimulus-response-based allocation method for the circle packing problem with equilibrium constraints ⋮ Packing non-identical circles within a rectangle with open length ⋮ Development and calibration of a currency trading strategy using global optimization ⋮ How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results ⋮ Quasi-physical global optimization method for solving the equal circle packing problem ⋮ A nonlinear programming model with implicit variables for packing ellipsoids ⋮ Covering a convex 3D polytope by a minimal number of congruent spheres ⋮ Evolutionary computation solutions to the circle packing problem ⋮ Integrated experimental design and nonlinear optimization to handle computationally expensive models under resource constraints ⋮ A customized branch-and-bound approach for irregular shape nesting ⋮ Packing ovals in optimized regular polygons ⋮ On the unboundedness of facility layout problems ⋮ Numerical optimization methods for packing equal orthogonally oriented ellipses in a rectangular domain ⋮ A literature review on circle and sphere packing problems: models and methodologies ⋮ Numerical methods for constructing suboptimal packings of nonconvex domains with curved boundary ⋮ Rigorous packing of unit squares into a circle ⋮ Packing disks into disks with optimal worst-case density ⋮ Spreading points using gradient and tabu ⋮ Parallel greedy algorithms for packing unequal circles into a strip or a rectangle ⋮ Packing circles into perimeter-minimizing convex hulls ⋮ Approximation schemes for covering and packing problems in image processing and VLSI ⋮ A global optimization point of view to handle non-standard object packing problems ⋮ Iterated dynamic neighborhood search for packing equal circles on a sphere ⋮ Model development and solver demonstrations using randomized test problems ⋮ A heuristic approach for packing identical rectangles in convex regions ⋮ A heuristic for the circle packing problem with a variety of containers ⋮ Benchmarking nonlinear optimization software in technical computing environments ⋮ Integer programming formulations for approximate packing circles in a rectangular container ⋮ Valid constraints for the Point Packing in a Square problem ⋮ Efficiently packing unequal disks in a circle ⋮ Packing unequal circles into a strip of minimal length with a jump algorithm ⋮ Split packing: algorithms for packing circles with optimal worst-case density ⋮ Approximate Packing: Integer Programming Models, Valid Inequalities and Nesting ⋮ Batching-Based Approaches for Optimized Packing of Jobs in the Spatial Scheduling Problem ⋮ Nonlinear optimization with GAMS /LGO ⋮ A general system for heuristic minimization of convex functions over non-convex sets ⋮ Packing circular-like objects in a rectangular container ⋮ Packing equal circles into a circle with circular prohibited areas ⋮ Global Optimization in Practice:State of the Art and Perspectives ⋮ Globally optimized packings of non-uniform size spheres in \(\mathbb {R}^{d}\): a computational study ⋮ Packing circles within ellipses ⋮ Global optimization method for finding dense packings of equal circles in a circle ⋮ Solving the problem of packing equal and unequal circles in a circular container ⋮ One-dimensional nested maximin designs ⋮ Maximizing the sum of radii of balls inscribed in a polyhedral set ⋮ Unnamed Item ⋮ Adaptive large neighborhood search for solving the circle bin packing problem ⋮ Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition ⋮ Recursive circle packing problems ⋮ On tackling reverse convex constraints for non-overlapping of unequal circles ⋮ Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition) ⋮ Repulsion-based p-dispersion with distance constraints in non-convex polygons ⋮ Iterated dynamic thresholding search for packing equal circles into a circular container ⋮ Packing a fixed number of identical circles in a circular container with circular prohibited areas ⋮ Optimized ellipse packings in regular polygons ⋮ Packing Problems in Space Solved by CPLEX: An Experimental Analysis ⋮ A Probability Collectives Approach for Multi-Agent Distributed and Cooperative Optimization with Tolerance for Agent Failure ⋮ Model Development and Optimization for Space Engineering: Concepts, Tools, Applications, and Perspectives ⋮ Linear models for the approximate solution of the problem of packing equal circles into a given domain

Uses Software

Cites Work

This page was built for publication: Solving circle packing problems by global optimization: numerical results and industrial applications