| 注册
首页|期刊导航|计算机工程与应用|一种基于格的蚁群算法

一种基于格的蚁群算法

袁培燕

计算机工程与应用2011,Vol.47Issue(11):43-45,3.
计算机工程与应用2011,Vol.47Issue(11):43-45,3.DOI:10.3778/j.issn.1002-8331.2011.11.013

一种基于格的蚁群算法

Grid based ant colony algorithm.

袁培燕1

作者信息

  • 1. 河南师范大学,物理与信息工程学院,河南,新乡,453007
  • 折叠

摘要

Abstract

To the problem of easily immersing into local search for ant colony algorithm, a grid based strategy is introduced. The space has been divided into n small portions,and then based on random strategy,m ants are put into n squares separately. For each of the square,the ants in a square are placed on different nodes based on random strategy again. Simulation results show that the grid based strategy accelerates the convergence of ant colony algorithm without sacrificing the best answer.

关键词

蚁群算法//性能评价/旅行商问题

Key words

ant colony algorithm/grid/performance evaluation/Traveling Salesman Problem(TSP)

分类

信息技术与安全科学

引用本文复制引用

袁培燕..一种基于格的蚁群算法[J].计算机工程与应用,2011,47(11):43-45,3.

基金项目

河南省教育厅自然科学基金资助项目(No.2009B520016) (No.2009B520016)

河南师范大学青年科学基金资助项目(No.2008qk06). (No.2008qk06)

计算机工程与应用

OACSCDCSTPCD

1002-8331

访问量0
|
下载量0
段落导航相关论文