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
国际会议
厦门
英文
1477-1481
2012-01-04(万方平台首次上网日期,不代表论文的发表时间)