自动化学报2005，Vol.31Issue(4)：590-595,6.
求解圆形packing问题的拟人退火算法
A Personified Annealing Algorithm for Circles Packing Problem
摘要
Abstract
Circles packing problem is an NP-hard problem and is difficult to solve. In this paper, a hybrid search strategy for circles packing problem is discussed. A way of generating new configuration is presented by simulating the moving of elastic objects, which can avoid the blindness of simulated annealing search and make iteration process converge fast. Inspired by the life experiences of people,an effective personified strategy to jump out of local minima is given. Based on the simulated annealing idea and personification strategy, an effective personified annealing algorithm for circles packing problem is developed. Numerical experiments on benchmark problem instances show that the proposed algorithm outperforms the best algorithm in the literature.关键词
Packing problem/simulated annealing algorithm/personificationKey words
Packing problem/simulated annealing algorithm/personification分类
信息技术与安全科学引用本文复制引用
张德富,李新..求解圆形packing问题的拟人退火算法[J].自动化学报,2005,31(4):590-595,6.基金项目
Supported by Academician Start-up Fund (X01122) and Technology Innovation Fund of Xiamen University(Y07025) （X01122）
