Efficiently Packing Circles into a Larger Containing Circle

摘要：

The circles packing problem consists in placing a set of circles into a larger containing circle without overlap. The objective is to determine the smallest radius of the containing circle as well as the coordinates of the center of each given circle. Lacking powerful optimization method is the key obstacle to solve this problem. A novel heuristic global optimization method, energy landscape paving (ELP) which combines core ideas from energy surface deformation and taboo search, is introduced. By giving some critical revisions to the ELP method and incorporating new configuration update strategy into it, an improved energy landscape paving (IELP) algorithm is put forward for the circles packing problem. The effectiveness of the algorithm is demonstrated through a set of typical instances taken from the literature.

作者: Jingfa Liu Yali Wang Jinji Pan

作者单位: School of Computer and Software Nanjing University of Information Science and Technology Nanjing 210 School of Electronic & Information Engineering,Nanjing University of Information Science and Technol

会议类型: 国际会议

会议名称: The Second International Conference on High Performance Computing and Applications(第二届高性能计算及应用国际会议)

会议地点: 上海

会议语种:英文

页码: 250-256

在线出版日期: 2009-08-10（万方平台首次上网日期，不代表论文的发表时间）