A memetic algorithm to pack unequal circles into a square
From MaRDI portal
Publication:1651582
DOI10.1016/j.cor.2017.09.013zbMath1391.90539OpenAlexW2755269989MaRDI QIDQ1651582
Publication date: 12 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2017.09.013
Nonconvex programming, global optimization (90C26) Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)
Related Items (3)
A stimulus-response-based allocation method for the circle packing problem with equilibrium constraints ⋮ An opposition-based memetic algorithm for the maximum quasi-clique problem ⋮ Iterated dynamic neighborhood search for packing equal circles on a sphere
Uses Software
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
- A literature review on circle and sphere packing problems: models and methodologies
- A hybrid metaheuristic approach to solving the UBQP problem
- Parallel greedy algorithms for packing unequal circles into a strip or a rectangle
- A hybrid beam search looking-ahead algorithm for the circular packing problem
- A population-based approach for hard global optimization problems based on dissimilarity measures
- 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
- Packing different-sized circles into a rectangular container
- Integrated container loading software for pulp and paper industry
- Approximate algorithms for constrained circular cutting problems
- An efficient deterministic heuristic for two-dimensional rectangular packing
- An improved algorithm for the packing of unequal circles within a larger containing circle
- A mathematical model and a solution method for the problem of placing various-sized circles into a strip
- 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
- Packing unequal circles into a strip of minimal length with a jump algorithm
- PERM for solving circle packing problem
- Adaptive and restarting techniques-based algorithms for circular packing problems
- New heuristics for packing unequal circles into a circular container
- Dynamic reduction heuristics for the rectangle packing area minimization problem
- An improved typology of cutting and packing problems
- A dynamic adaptive local search algorithm for the circular packing problem
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Basin filling algorithm for the circular packing problem with equilibrium behavioral constraints
- Greedy algorithms for packing unequal circles into a rectangular container
This page was built for publication: A memetic algorithm to pack unequal circles into a square
