An action-space-based global optimization algorithm for packing circles into a square container

DOI10.1016/J.COR.2014.12.010MaRDI QIDQ337511zbMATH OpenOpenAlexFDO

Authors Kun He, Menglong Huang, Chenkai Yang

Publication date 10 November 2016

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

Full work available at URL https://doi.org/10.1016/j.cor.2014.12.010

zbMATH Keywords

action spacebasin-hoppingcircle packingglobal optimization

Mathematics Subject Classification ID

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

Recommendations

• Packing unequal circles using formulation space search
• 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
• scientific article; zbMATH DE number 1748533

Cites work

• A mathematical model and a solution method for the problem of placing various-sized circles into a strip
• A simulated annealing approach for the circular cutting problem
• An efficient deterministic heuristic for two-dimensional rectangular packing
• An efficient placement heuristic for three-dimensional rectangular packing
• Curved hexagonal packings of equal disks in a circle
• Global optimization method for finding dense packings of equal circles in a circle
• Greedy algorithms for packing unequal circles into a rectangular container
• Greedy vacancy search algorithm for packing equal circles in a square
• Iterated tabu search for the circular open dimension problem
• New heuristics for packing unequal circles into a circular container
• On the limited memory BFGS method for large scale optimization
• Packing different-sized circles into a rectangular container
• Packing unequal circles using formulation space search
• Parallel greedy algorithms for packing unequal circles into a strip or a rectangle
• PERM for solving circle packing problem
• Quasi-physical global optimization method for solving the equal circle packing problem
• Solving the problem of packing equal and unequal circles in a circular container

Cited in

(10)

• 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
• Adaptive large neighborhood search for solving the circle bin packing problem
• Adaptive simulated annealing with greedy search for the circle bin packing problem
• A stimulus-response-based allocation method for the circle packing problem with equilibrium constraints
• A formulation space search heuristic for packing unequal circles in a fixed size circular container
• Quasi-physical global optimization method for solving the equal circle packing problem
• Global optimization method for finding dense packings of equal circles in a circle
• Solution-hashing search based on layout-graph transformation for unequal circle packing
• Solving circle packing problems by global optimization: numerical results and industrial applications

Describes a project that uses

Uses Software

• packomania
• L-BFGS

This page was built for publication: An action-space-based global optimization algorithm for packing circles into a square container

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