| 应用思维进化计算求解顶点着色问题 |
| |
| 引用本文： | 陈培军,曾建潮. 应用思维进化计算求解顶点着色问题[J]. 太原科技大学学报, 2004, 25(3): 165-169 |
| |
| 作者姓名： | 陈培军 曾建潮 |
| |
| 作者单位： | 太原重型机械学院系统仿真与计算机应用研究所,太原,030024 |
| |
| 基金项目： | 国家自然科学基金资助(编号:60174002)，山西省青年科学基金资助(编号:20031031) |
| |
| 摘 要： | 应用思维进化计算求解顶点着色问题,给出求解给定图的色数、最小着色的算法。介绍了顶点着色问题的编码与解码方法、特征、信息矩阵的概念,从而应用思维进化计算的趋同和异化求解该问题。实验结果表明该算法是求解顶点着色问题的一种新的有效算法。
|
| 关 键 词： | 顶点着色 色数 最小着色 思维进化计算 非数值优化 |
| 文章编号： | 1000-159X(2004)03-0165-05 |
| 修稿时间： | 2003-03-21 |
Solving of Vertex Coloring Problem with Mind Evolutionary Computation |
| |
| CHEN Pei-jun,ZENG Jian-chao. Solving of Vertex Coloring Problem with Mind Evolutionary Computation[J]. Journal of Taiyuan University of Science and Technology, 2004, 25(3): 165-169 |
| |
| Authors: | CHEN Pei-jun ZENG Jian-chao |
| |
| Abstract: | Mind evolutionary computation is used in solving vertex coloring problem. A new algorithm of chromatic number and minimal coloring of a given graph is given. An simple and operable method of coding and decoding is designed for vertex coloring problem. A series of concepts, for example character ,information matrix, are introduced. So vertex coloring problem is solved with similartaxis and dissimilation of mind evolutionary computation. The experimental results also show that it is an effective method in sdving vertex coloring problem. |
| |
| Keywords: | vertex coloring chromatic number minimal coloring mind evolutionary computation non-numeric optimization |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
