A heuristic quasi-physical strategy for solving disks packing problem

Simulation Modelling Practice and Theory

Volumn 10, Issue 3-4, 2002, Pages 195-207

  Wenqi, Huang ^a,b   Yan, Kang ^a,b  

^a HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

^b INSTITUTE OF SOFTWARE   (China)

Author keywords

NP hard; Packing problem; Quasi physical method; Simulated annealing

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; ELASTICITY; ENGINEERING RESEARCH; HEURISTIC PROGRAMMING; PACKING; PROBLEM SOLVING; SIMULATED ANNEALING;

NP HARD; PACKING PROBLEM; QUASI-PHYSICAL METHODS;

DISKS (STRUCTURAL COMPONENTS);

EID: 1642319350     PISSN: 1569190X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1569-190X(02)00099-0     Document Type: Article

References (35)

1. Boll D.W., Donovan J., Graham R.L., Lubachevsky B.D. Improving dense packings of equal disks in a square. The Electronic Journal of Combinatorics. 7:2000;R46.
2. Croft T., Falconer K.J., Guy R.K. Unsolved Problem in Geometry. 1991;Springer Verlag, New York.
3. Dowsland K.A. Palletisation of cylinders in cases. OR Spektrum. 13:1991;171-172.
4. K.A. Dowsland, W.B. Dowsland, Optimal and heuristic solutions to packing problems - The state of the art, Working Paper EBMS/21, University of Wales, Swansea, 1990.
5. Dowsland K.A., Dowsland W.B. Packing problems. European Journal of Operational Research. 56(1):1992;2-14.
6. Fejes Töth G. Handbook of Discrete and Computational Geometry. 1997;CRC Press, Boca Raton.
7. Fodor F. The densest packing of 19 congruent circles in a circle. Geometriae Dedicata. 74:1999;139-145.
8. Fraser H.J., George J.A. Integrated container loading software for pulp and paper industry. European Journal of Operational Research. 77(3):1994;466-474.
9. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979;Freeman, San Francisco.
10. Graham R.L., Lubachevsky B.D. Repeated patterns of dense packings of equal disks in a square. The Electronic Journal of Combinatorics. 3:1996;1-16.
11. Haessler R.W., Sweeney P.E. Cutting stock problems and solution procedures. European journal of Operational Research. 54:1991;141-150.
12. Hochbaum D.S., Maass W. Approximation schemes for covering and packing problems in image processing and VLSI. Journal of the Association for Computing Machinery. 23(1):1985;130-136.
13. Hopper E., Turton B.C.H. Application of genetic algorithms to packing problems. - A review Proceedings of the 2nd On-line World Conference on Soft Computing in Engineering Design and Manufacturing, London, Great Britain. 1998;279-288.
14. Wenqi H. A quasi-physical method for solving covering problem { } - An approach to treating NP-hard problem Journal of Computer. 8:1989;610-616.
15. Wenqi H. Quasi-physical and quasi-social method for tackling NP-hard problems. Proceedings of the International Workshop on Discrete Mathematics and Algorithms, Guangzhou, China. 1994;89-91.
16. Wenqi H., Liang C. A quasi-physical method for solving the dispatch problem concerning space utilization. Science in China Series A. 3:1991;325-331.
17. Wenqi H., Renchao J. The quasi-physical personification algorithm for solving SAT problem { } - Solar Science in China Series E. 42(5):1999;483-489.
18. Wenqi H., Ruchu X. Two personification strategies for solving circles packing problem. Science in China Series E. 29(4):1999;347-353.
19. Wenqi H., Shuhao Z. A quasi-physical method for solving packing problems. Acta Mathematicae Applagatae Sinica. 2(2):1979;176-180.
20. Isermann H. Heurisitiken zur Lösung, des zweidi-mensionalen Packproblems für RundgefäBe. OR Spektrum. 13:1991;213-223.
21. John A.G., Jennifer M.G., Bruce W.L. Packing different-sized circles into a rectangular container. European Journal of Operational Research. 84:1995;693-712.
22. Landau L.D., Lifschitz E.M. Field Theory. 1959;People's Educational, Beijing.
23. Landau L.D., Lifschitz E.M. Mechanics. 1976;Pergamon, Oxford.
24. Wei L., Wenqi H. A physico-mathematical method for solving conjunctive normal form satisfiability problem. Science in China Series A. 24(11):1994;1208-1216.
25. Lubachevsky B.D., Graham R.L. Curved hexagonal packing of equal circles in a circle. Discrete & Computational Geometry. 18:1997;179-194.
26. Lubachevsky B.D., Stillinger F.H. Geometric properties of random circle packings. Journal of Statistical Physics. 60:1990;561-583.
27. Maranas C.D., Floudas C.A., Pardalos P.M. New results in the packing of equal circles in a square. Discrete Mathematics. 142:1995;287-293.
28. Melissen H. Densest packing of six equal circles in a square. Elemente der Mathematik. 49:1994;27-31.
29. Melissen J.B.M. Densest packings for congruent circles in an equilateral triangle. American Mathematical Monthly. 100:1993;916-925.
30. Melissen J.B.M. Densest packing of eleven congruent disks in a disk. Geometriae Dedicata. 50:1994;15-25.
31. Melissen J.B.M. Optimal packings of eleven equal circles in an equilateral triangle. Acta Mathematica Hungarica. 65:1994;389-393.
32. Melissen J.B.M., Schuur P.C. Packing 16, 17 or 18 circles in an equilateral triangle. Discrete Mathematics. 145:1995;333-342.
33. Reis G.E. Dense packings of equal disks within a disk. Mathematics Magazine. 48:1975;33-37.
34. Schaer J. The densest packing of nine disks in a square. Canadian Mathematical Bulletin. 8:1965;273-277.
35. Wille L.T. Closest packing in curved space by simulated annealing. J. Physics. A.: Mathematics. General. 20(1):1987;1211-1218.