| 图着色问题的蚂蚁算法研究 |
| |
| 引用本文： | 张丽,马良,石丽娜.图着色问题的蚂蚁算法研究[J].上海工程技术大学学报,2009,23(4):328-332. |
| |
| 作者姓名： | 张丽 马良 石丽娜 |
| |
| 作者单位： | 上海工程技术大学,航空运输学院,上海,201620上海理工大学,管理学院,上海,200093 |
| |
| 摘 要： | 随机蚂蚁着色算法是根据蚂蚁算法的搜索机制和反馈功能提出的解决图着色问题的新算法,继承了蚂蚁算法快速收敛以及跳出局部最优解的优良特性,结合传统图着色算法的着色思想,提出了逆序蚂蚁着色算法和贪心蚂蚁着色算法,进一步提高了求解质量,加快了收敛速度.实验结果证明了逆序蚂蚁着色算法和贪心蚂蚁着色算法的优良特性.为了合理选取蚂蚁着色算法参数,进行了大量随机图着色实验分析,得出了关键参数的最佳取值范围.
|
| 关 键 词： | 蚂蚁算法 图着色 分配型组合优化问题 |
Research of Graph Coloring Problem Based on Ant Algorithms |
| |
| ZHANG Li,MA Liang,SHI Li-na.Research of Graph Coloring Problem Based on Ant Algorithms[J].Journal of Shanghai University of Engineering Science,2009,23(4):328-332. |
| |
| Authors: | ZHANG Li MA Liang SHI Li-na |
| |
| Affiliation: | ZHANG Li,MA Liang,SHI Li-na(1.College of Aeronautic Transportation,Shanghai University of Engineering Science,Shanghai 201620,China;2.Business School,University of Shanghai for Science and Technology,Shanghai 200093,China) |
| |
| Abstract: | A new algorithm of graph coloring problem based on searching and feedback mechanism of ant algorithm was proposed,which inherits advantages of the original algorithm.According to the idea of traditional algorithm for graph coloring,two combinatorial algorithms were further proposed.The results show that they have better performance.Then experimental analysis was carried out and the optimal parameter was obtained. |
| |
| Keywords: | ant algorithm graph coloring combinatorial optimization problem |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《上海工程技术大学学报》浏览原始摘要信息 |
|
点击此处可从《上海工程技术大学学报》下载全文 |
|
