A New Algorithm for Packing Unequal Disks in a Larger Circle

摘要：

To set unequal disks in a container as small as possible without overlap is a fairly fascinating NPhard task with wide applications. In this paper,we introduced a new method using the techniques of Tabu search,quasi-human basin-hopping strategy,and BFGS method as its basic elements,and illustrated its efficiency by comparing its outcomes of solving some benchmark problems with those of some other new and efficient algorithms.

关键词： Tabu search quasi-human basin-hopping BFGS disks packing NP-hard

作者: Huang Wenqi Zeng Zhizhong Fu Zhanghua Ruchu Xu

作者单位: School of Computer Science and Technology,Huazhong University of Science and Technology,Wuhan,430074,China

会议类型: 国际会议

会议名称: 2011 International Conference on Opto-Electronics Engineering and Information Science(2011光电电子工程与信息科学国际会议 ICOEIS 2011)

会议地点: 西安

会议语种:英文

页码: 2268-2272

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