Using iterated local search for efficiently packing unequal disks in a larger circle

摘要：

　　Packing unequal disks in a container as small as possible without mutual overlap is a NP-hard problem with a plenty of real world applications.In this paper,we introduced iterated local search to tackle with this problem,and using Critical Element Guided Perturbation (CEGP) strategy to jump out the local minimal,and using BFGS method to get each neighborhood optimized in local search procedure.Experiments showed its efficiency by breaking several world records of a set of benchmark.

关键词： iterated local search Critical Element Guided Perturbation basin-hopping BFGS disks packing NP-hard

作者: Wenqi Huang Zhizhong Zeng Ruchu Xu Zhanghua Fu

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

会议类型: 国际会议

会议名称: the 2012 International Conference on Frontiers of Advanced Materials and Engineering Technology (2012年先进材料与工程技术国际会议(FAMET 2012))

会议地点: 厦门

会议语种:英文

页码: 1477-1481

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