کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
478526 | 1446105 | 2011 | 8 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Global optimization method for finding dense packings of equal circles in a circle
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
This paper considers the problem of finding the densest packing of N (N = 1, 2, …) equal circles in a circle. This problem is perhaps the most classical packing problem. It is also a natural and challenging test system for evaluating various global optimization methods. We propose a quasi-physical global optimization method by simulating two kinds of movements of N elastic disks: smooth movement driven by elastic pressures and abrupt movement driven by strong repulsive forces and attractive forces. The algorithm is tested on the instances of N = 1, 2, … , 200. Using the best-known record of the radius of the container as an upper bound, we find 63 new packings better than the best-known ones reported in literature.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 210, Issue 3, 1 May 2011, Pages 474–481
Journal: European Journal of Operational Research - Volume 210, Issue 3, 1 May 2011, Pages 474–481
نویسندگان
Wenqi Huang, Tao Ye,