An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container

DOI10.1016/j.cor.2017.12.002zbMath1391.90519arXiv1611.02323OpenAlexW2605866974MaRDI QIDQ1651580

Hui Ye, Kun He, Zhengli Wang, Jing-Fa Liu

Publication date: 12 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1611.02323

zbMATH Keywords

circle packingneighborhood structurequasi-humancontainer shrinking strategyquasi-physical

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Combinatorial aspects of packing and covering (05B40)

Related Items (3)

Adaptive simulated annealing with greedy search for the circle bin packing problem ⋮ Adaptive large neighborhood search for solving the circle bin packing problem ⋮ Iterated dynamic thresholding search for packing equal circles into a circular container

Uses Software

• L-BFGS

Cites Work

• Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container
• An action-space-based global optimization algorithm for packing circles into a square container
• Packing unequal circles using formulation space search
• Global optimization method for finding dense packings of equal circles in a circle
• A hybrid beam search looking-ahead algorithm for the circular packing problem
• On the limited memory BFGS method for large scale optimization
• Efficiently packing unequal disks in a circle
• Solving circle packing problems by global optimization: numerical results and industrial applications
• A beam search algorithm for the circular packing problem
• Solving the problem of packing equal and unequal circles in a circular container
• The densest packing of 19 congruent circles in a circle
• Densest packings of eleven congruent circles in a circle
• Dense packings of congruent circles in a circle
• The densest packing of 13 congruent circles in a circle
• Approximate algorithms for constrained circular cutting problems
• The densest packing of 12 congruent circles in a circle
• Heuristic-based energy landscape paving for the circular packing problem with performance constraints of equilibrium
• Reformulation descent applied to circle packing problems
• An improved algorithm for the packing of unequal circles within a larger containing circle
• Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
• Iterated tabu search for the circular open dimension problem
• An effective hybrid algorithm for the problem of packing circles into a larger containing circle
• PERM for solving circle packing problem
• New heuristics for packing unequal circles into a circular container
• Strip generation algorithms for constrained two-dimensional two-staged cutting problems
• A dynamic adaptive local search algorithm for the circular packing problem
• Disk Packing in a Square: A New Global Optimization Approach
• Dense Packing of Equal Circles within a Circle
• Global Optimization in Geometry — Circle Packing into the Square
• Greedy algorithms for packing unequal circles into a rectangular container
• Der Mindestabstand von n in der Einheitskreisscheibe gelegenen Punkten
• Packing Cylinders into Cylindrical Containers
• Packing of 14, 16, 17 and 20 Circles in a Circle
• Discrete and Computational Geometry

This page was built for publication: An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container