| 求解圆形packing问题的拟人退火算法 |
| |
| 引用本文： | 张德富,李新.求解圆形packing问题的拟人退火算法[J].自动化学报,2005,31(4):590-595. |
| |
| 作者姓名： | 张德富 李新 |
| |
| 作者单位： | 1.School of Information Science and Technology, Xiamen University, Xiamen 361005 |
| |
| 基金项目： | SupportedbyAcademicianStart-upFund(X01122)andTechnologyInnovationFundofXiamenUniversity(Y07025) |
| |
| 摘 要： | 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 personification |
| 收稿时间： | 2004-2-24 |
| 修稿时间： | 2004年2月24日 |
A Personified Annealing Algorithm for Circles Packing Problem |
| |
| ZHANG De-fu,LI Xin.A Personified Annealing Algorithm for Circles Packing Problem[J].Acta Automatica Sinica,2005,31(4):590-595. |
| |
| Authors: | ZHANG De-fu LI Xin |
| |
| Affiliation: | 1.School of Information Science and Technology, Xiamen University, Xiamen 361005 |
| |
| 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. |
| |
| Keywords: | Packing problem simulated annealing algorithm personification |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《自动化学报》浏览原始摘要信息 |
|
点击此处可从《自动化学报》下载全文 |
