2.845

2023影响因子

(CJCR)

  • 中文核心
  • EI
  • 中国科技核心
  • Scopus
  • CSCD
  • 英国科学文摘

留言板

尊敬的读者、作者、审稿人, 关于本刊的投稿、审稿、编辑和出版的任何问题, 您可以本页添加留言。我们将尽快给您答复。谢谢您的支持!

姓名
邮箱
手机号码
标题
留言内容
验证码

求解圆形packing问题的拟人退火算法

张德富 李新

张德富, 李新. 求解圆形packing问题的拟人退火算法. 自动化学报, 2005, 31(4): 590-595.
引用本文: 张德富, 李新. 求解圆形packing问题的拟人退火算法. 自动化学报, 2005, 31(4): 590-595.
ZHANG De-Fu, LI Xin. A Personified Annealing Algorithm for Circles Packing Problem. ACTA AUTOMATICA SINICA, 2005, 31(4): 590-595.
Citation: ZHANG De-Fu, LI Xin. A Personified Annealing Algorithm for Circles Packing Problem. ACTA AUTOMATICA SINICA, 2005, 31(4): 590-595.

求解圆形packing问题的拟人退火算法

详细信息
    通讯作者:

    张德富

A Personified Annealing Algorithm for Circles Packing Problem

More Information
    Corresponding author: ZHANG De-Fu
  • 摘要: 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.
  • 加载中
计量
  • 文章访问数:  3014
  • HTML全文浏览量:  64
  • PDF下载量:  1285
  • 被引次数: 0
出版历程
  • 收稿日期:  2004-02-24
  • 修回日期:  2005-02-15
  • 刊出日期:  2005-07-20

目录

    /

    返回文章
    返回