An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems

DOI10.1007/978-3-642-02026-1_12MaRDI QIDQ3637060zbMATH OpenOpenAlexFDO

Authors Yonglei Yao, Yu Zheng, Guocheng Zhou, Jing-Fa Liu, Huantong Geng

Publication date 7 July 2009

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02026-1_12

zbMATH Keywords

circular packingcombinatorial optimizationenergy landscape pavinggradient descent methodspherical packing

Mathematics Subject Classification ID

Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Quasicrystals and aperiodic tilings in discrete geometry (52C23) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial optimization (90C27)

Recommendations

• Heuristic-based energy landscape paving for the circular packing problem with performance constraints of equilibrium
• 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
• A heuristic for the circle packing problem with a variety of containers
• Minimizing the object dimensions in circle and sphere packing problems

Cited in

(13)

• Optimal packing configuration design with finite-circle method
• Optimized packing multidimensional hyperspheres: a unified approach
• Minimizing the object dimensions in circle and sphere packing problems
• A heuristic algorithm for a packing problem of equal spheres in a sphere
• A formulation space search heuristic for packing unequal circles in a fixed size circular container
• Packing unequal spheres into various containers
• Packing congruent hyperspheres into a hypersphere
• Packing equal circles into a circle with circular prohibited areas
• A probability collectives approach for multi-agent distributed and cooperative optimization with tolerance for agent failure
• Algorithms of optimal ball packing into ellipsoids
• A literature review on circle and sphere packing problems: models and methodologies
• A heuristic for the circle packing problem with a variety of containers
• An efficient solution space exploring and descent method for packing equal spheres in a sphere

This page was built for publication: An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems

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