Parallel greedy algorithms for packing unequal circles into a strip or a rectangle

Central European Journal of Operations Research

Volumn 17, Issue 4, 2009, Pages 461-477

  Kubach, T ^a   Bortfeldt, A ^a   Gehring, H ^a  

^a UNIVERSITY OF HAGEN   (Germany)

Author keywords

Circles; Greedy method; Knapsack problem; Packing; Parallelization; Strip packing problem

Indexed keywords

EID: 70450225254     PISSN: 1435246X     EISSN: 16139178     Source Type: Journal    
DOI: 10.1007/s10100-009-0103-5     Document Type: Article

References (20)

1. Bortfeldt A, Gehring H (2006) New large benchmark instances for the two-dimensional strip packing problem with rectangular pieces. In: Proceedings of the 39th annual Hawaii international conference of system sciences (HICCS'06) Track 2, p. 30b.
2. Castillo I, Kampas FJ, Pinter JD (2008) Solving circle packing problems by global optimization: numerical results and industrial applications. Eur J Oper Res 191: 786-802.
3. Crainic TG, Toulouse M (2003) Parallel strategies for meta-heuristics. In: Glover F, Kochenberger G (eds) Handbook on metaheuristics. Kluwer Academic Publishers, Boston, pp 475-513.
4. Dowsland KA (1991) Palletisation of cylinders in cases. OR Spektrum 13: 171-172.
5. Fraser HJ, George JA (1994) Integrated container loading software for pulp and paper industry. Eur J Oper Res 77: 466-474.
6. George JA, George JM, Lamer BW (1995) Packing different-sized circles into a rectangular container. Eur J Oper Res 84: 693-712.
7. Gill PE, Murray W, Wright MH (1981) Practical optimization. Academic Press, New York.
8. Graham RL, Lubachevsky BD (1996) Repeated patterns of dense packings of equal disks in a square. Electronic Journal of Combinatorics 3, Report No. 16.
9. Henderson D, Jacobson SH, Johnson AW (2003) The theory and practice of simulated annealing. In: Glover F, Kochenberger G (eds) Handbook on metaheuristics. Kluwer Academic Publishers, Boston, pp 287-319.
10. Hifi M, M'Hallah R (2004) Approximate algorithms for constrained circular cutting problems. Comput Oper Res 31: 675-694.
11. Hifi M, Paschos VTh, Zissimopoulos VA (2004) Simulated annealing approach for the circular cutting problem. Eur J Oper Res 159: 430-448.
12. Huang WQ, Li Y, Gérard S, Li CM, Xu RC (2002) A 'Learning From Human' heuristic for solving unequal circle packing problem. In: Hao JK, Liu BD (eds) Proceedings of the first international workshop on heuristics Beijing, China. Tsinghua University, Beijing, China, pp 39-45.
13. Huang WQ, Li Y, Jurkowiak B, Li CM (2003) A two-level search strategy for packing unequal circles into a circle container. In: Francesca R (ed) Proceedings of principles and practice of Constraint Programming CP2003, Kinsale, Ireland. Lecture Notes in Computer Science, vol 2833. Springer, Berlin, pp 868-872.
14. Huang WQ, Li Y, Akeb H, Li CM (2005) Greedy algorithms for packing unequal circles into a rectangular container. J Oper Res Soc 56: 539-548.
15. Lenstra JK, Rinnooy Kan AHG (1979) Complexity of packing, covering, and partitioning problems. In: Schrijver A (eds) Packing and covering in combinatorics. Mathematisch Centrum, Amsterdam, pp 275-291.
16. Reeves C (2003) Genetic algorithms. In: Glover F, Kochenberger G (eds) Handbook on metaheuristics. Kluwer Academic Publishers, Boston, pp 55-81.
17. SiS Sandra 2005 benchmark suite. SiSoftware. http://www. sisoftware. net, 2005.
18. Stoyan YY, Yaskov G (2004) A mathematical model and a solution method for the problem of placing various-sized circles into a strip. Eur J Oper Res 156: 590-600.
19. Stoyan YY, Yaskow G, Scheithauer G (2003) Packing of various radii solid spheres into a parallelepiped. Cent Eur J Oper Res 11: 389-407.
20. Toth FJ (1953) Lagerungen in der Ebene, auf der Kugel und im Raum. Springer, Berlin.