An action-space-based global optimization algorithm for packing circles into a square container
From MaRDI portal
Publication:337511
DOI10.1016/j.cor.2014.12.010zbMath1348.90542OpenAlexW2043887731MaRDI QIDQ337511
Kun He, Chenkai Yang, Menglong Huang
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
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)
Related Items (6)
Adaptive simulated annealing with greedy search for the circle bin packing problem ⋮ A formulation space search heuristic for packing unequal circles in a fixed size circular container ⋮ 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 ⋮ A stimulus-response-based allocation method for the circle packing problem with equilibrium constraints ⋮ Adaptive large neighborhood search for solving the circle bin packing problem
Uses Software
Cites Work
- Quasi-physical global optimization method for solving the equal circle packing problem
- Packing unequal circles using formulation space search
- Global optimization method for finding dense packings of equal circles in a circle
- Greedy vacancy search algorithm for packing equal circles in a square
- Parallel greedy algorithms for packing unequal circles into a strip or a rectangle
- An efficient placement heuristic for three-dimensional rectangular packing
- On the limited memory BFGS method for large scale optimization
- Solving the problem of packing equal and unequal circles in a circular container
- Packing different-sized circles into a rectangular container
- Curved hexagonal packings of equal disks in a circle
- An efficient deterministic heuristic for two-dimensional rectangular packing
- A simulated annealing approach for the circular cutting problem
- A mathematical model and a solution method for the problem of placing various-sized circles into a strip
- Iterated tabu search for the circular open dimension problem
- PERM for solving circle packing problem
- New heuristics for packing unequal circles into a circular container
- Greedy algorithms for packing unequal circles into a rectangular container
This page was built for publication: An action-space-based global optimization algorithm for packing circles into a square container
