计算机应用 ›› 2005, Vol. 25 ›› Issue (05): 1019-1021.DOI: 10.3724/SP.J.1087.2005.1019

• 人工智能与仿真 • 上一篇    下一篇

平面布局的蚁群算法

鲁强，陈明   

  1. 为提高平面布局的优化结果和效率,使用蚁群算法作为平面布局优化算法。在算法中定义B* tree结构来描述布局空间,定义模块布局利用率作为信息素,使得占用面积小的局部模块之间的依赖关系加强,引入蚁群的变异特征来加快算法的收敛效率。通过试验表明,蚁群算法同模拟退火算法相比,在解决硬模块(hardmodule)的平面布局问题时,能够得到较优化布局的结果和较快的运行效率。
  • 出版日期:2005-05-01 发布日期:2005-05-01
  • 基金资助:

    国家自然科学基金资助项目(60072006)

Ant colony algorithm for floorplan

LU Qiang, CHEN Ming   

  1. Department of Computer Science and Technology, University of Petroleum(Beijing)
  • Online:2005-05-01 Published:2005-05-01

PDF

摘要： To increase the optimization result and efficiency in floorplan, ant colony algorithm was used as optimization algorithm of floorplan. In this algorithm, the B*-tree structure was defined to describe the structure of layout, the utilization efficiency of modules was defined to be pheromone which strenthened the dependency relationship of partial modules that occupy less area, and mutation scheme was employed to improve the efficiency of convergence. Through experiments, ant colony algorithm can get better result and efficiency than simulate annealing algorithm in the flooplan of hard modules.

关键词: 蚁群算法, 平面布局, B*-tree

Abstract: To increase the optimization result and efficiency in floorplan, ant colony algorithm was used as optimization algorithm of floorplan. In this algorithm, the B*-tree structure was defined to describe the structure of layout, the utilization efficiency of modules was defined to be pheromone which strenthened the dependency relationship of partial modules that occupy less area, and mutation scheme was employed to improve the efficiency of convergence. Through experiments, ant colony algorithm can get better result and efficiency than simulate annealing algorithm in the flooplan of hard modules.

Key words: ant colony algorithm, floorplan, B*-tree

中图分类号: 

版权所有 © 2021 四川计算机应用杂志社有限公司
蜀ICP备 05010208 号-3　新出网证(川)字026号
技术支持：北京玛格泰克科技发展有限公司
访问总数：
今日访问：