New heuristics for packing unequal circles into a circular container
From MaRDI portal
Publication:2489278
DOI10.1016/j.cor.2005.01.003zbMath1086.90063OpenAlexW1973279432MaRDI QIDQ2489278
Yu Li, Ruchu Xu, Wenqi Huang, Chu-Min Li
Publication date: 16 May 2006
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.01.003
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Adaptive simulated annealing with greedy search for the circle bin packing problem, Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container, 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 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 literature review on circle and sphere packing problems: models and methodologies, A reference length approach for the 3D strip packing problem, Approximation schemes for covering and packing problems in image processing and VLSI, PERM for solving circle packing problem, Adaptive beam search lookahead algorithms for the circular packing problem, Efficient approaches for furnace loading of cylindrical parts, A beam search algorithm for the circular packing problem, Adaptive and restarting techniques-based algorithms for circular packing problems, Global optimization method for finding dense packings of equal circles in a circle, Adaptive large neighborhood search for solving the circle bin packing problem, Recursive circle packing problems
Cites Work
- Unnamed Item
- Optimising the palletisation of cylinders in cases
- Packing different-sized circles into a rectangular container
- Complexity results for scheduling chains on a single machine
- Integrated container loading software for pulp and paper industry
- Dense packings of congruent circles in a circle
- Approximate algorithms for constrained circular cutting problems
- 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
- Approximation schemes for covering and packing problems in image processing and VLSI
- Dense Packing of Equal Circles within a Circle
- Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints
