Parallel greedy algorithms for packing unequal circles into a strip or a rectangle
From MaRDI portal
Publication:623818
DOI10.1007/s10100-009-0103-5zbMath1204.90083MaRDI QIDQ623818
T. Kubach, Hermann Gehring, Andreas Bortfeldt
Publication date: 8 February 2011
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-009-0103-5
Related Items
Optimal circle covering problems and their applications, A formulation space search heuristic for packing unequal circles in a fixed size circular container, An action-space-based global optimization algorithm for packing circles into a square container, An anchorage planning strategy with safety and utilization considerations, High density packings of equal circles in rectangles with variable aspect ratio, A memetic algorithm to pack unequal circles into a square, Packing non-identical circles within a rectangle with open length, Packing unequal circles into a strip of minimal length with a jump algorithm, Recursive circle packing problems
Cites Work
- Unnamed Item
- Unnamed Item
- Optimising the palletisation of cylinders in cases
- Solving circle packing problems by global optimization: numerical results and industrial applications
- Packing different-sized circles into a rectangular container
- Integrated container loading software for pulp and paper industry
- Packing of various radii solid spheres into a parallelepiped.
- Approximate algorithms for constrained circular cutting problems
- 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
- Genetic Algorithms
- The Theory and Practice of Simulated Annealing
- Parallel Strategies for Meta-Heuristics
- Greedy algorithms for packing unequal circles into a rectangular container
