An effective hybrid algorithm for the problem of packing circles into a larger containing circle

Computers and Operations Research

Volumn 32, Issue 8, 2005, Pages 1941-1951

  Zhang, De Fu ^a   Deng, An Sheng ^a  

^a XIAMEN UNIVERSITY   (China)

Author keywords

NP hard; Packing problem; Simulated annealing; Tabu search

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; PACKING; POLYNOMIALS; PROBLEM SOLVING; RELIABILITY;

BLIND SEARCH; NP-HARD; PACKING PROBLEM; TABU SEARCH;

SIMULATED ANNEALING;

EID: 10644297298     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2003.12.006     Document Type: Article

References (20)

1. Garey MR, Johnson DS. Computers and intractability: a guide to the theory of NP-completeness. San Francisco: Freeman; 1979.
2. Hochbaum DS, Maass W. Approximation schemes for covering and packing problems in image processing and VLSI. Journal of the Association for Computing Machinery 1985;1(32):130-6.
3. Huaiqing Wang, Wenqi Huang, Quan Zhang, Dongming Xu. An improved algorithm for the packing of unequal circles within a larger containing circle. European Journal of Operational Research 2002; 141:440-53.
4. Dowsland KA, Dowsland WB. Packing problems. European Journal of Operational Research 1992;56(1):2-14.
5. Lodi A, Martello S, Monaci M. Two-dimensional packing problems: a survey. European Journal of Operational Research 2002;141:241-52.
6. Pisinger D. Heuristics for the container loading problem. European Journal of Operational Research 2002;141:382-92.
7. Fleszar K, Hindi KS. New heuristics for one-dimensional bin-packing. Computers & Operations Research 2002;29:821-39.
8. Dowsland KA. Palletisation of cylinders in cases. Operations Research Spektrum 1991;13:171-2.
9. Fraser' HJ, George JA. Integrated container loading software for pulp and paper industry. European Journal of Operational Research 1994;77:466-674.
10. Lubaehevsky D, Graham RL. Curved hexagonal packing of equal circles in a circle. Discrete & Computational Geometry 1997;18:179-94.
11. George JA, George JM, Lammar BW. Packing different-sized circles into a rectangular container. European Journal of Operational Research 1995;84:693-712.
12. Huang Wenqi, Kang Yan. A heuristic quasi-physical strategy for solving disks packing problem. Simulation Modelling Practice and Theory 2002;10:195-207.
13. Huang Wenqi, Zhan Shuhao. A quasi-physical method for solving packing problem. Acta Mathematicae Applagatae Sinica 1979;2(2):176-80.
14. Huang Wenqi, Xu Ruchu. Two personification strategies for solving circles packing problem. Science in China (Series E) 1999;29(4):347-53.
15. Kirkpatrick S, Gelatt CD, Vecchi MP. Optimization by simulated annealing. Science 1983;220:671-89.
16. Glover F. Tabu search: Part I. ORSA Journal on Computing 1989;11(3):190-206.
17. Glover F, Laguna M. Tabu search. In: Reeves CR, editor. Modern heuristic techniques for combinatorial problems. Oxford: Blackwell; 1993. p. 70-150.
18. Kang Lishan, et al. Non-numerical parallel algorithms: simulated annealing, vol. 1. Moscow: Science Press; 1998.
19. Zhang Defu, Huang Wenqi, Wang Houxiang. Personification annealing algorithm for solving SAT problem. Chinese Journal of Computer 2002;25(2):148-52.
20. Huang Wenqi, Zhang Defu, Wang Houxiang. An algorithm based on tabu search for satisfiability problem. Journal of Computer Science and Technology 2002;17(3):340-6.