摘要
本文运用无向图多划分优化的方法研究计算机网络k-划分优化问题,结合问题本身的特点,设计了一种启发式遗传算法,从适应度函数设计、遗传操作算子以及参数选取等方面对经典遗传算法进行了改进,实验研究验证了算法的正确性和高效性。
In this paper, the method of multi - way undirected graph partitioning is applied to analyze the problem of k - way networks partitioning optimization , and an improved genetic algorithm is presented in accordance with the characteristics of the problem. Improvement has been made in the following three aspects: the definition of fitness function, the genetic operators and the selection of parameters.The validity and efficiency of the algorithm have been verified by experimental results of a case in point.
出处
《计算机应用与软件》
CSCD
北大核心
2002年第10期43-46,共4页
Computer Applications and Software
关键词
计算机网络
k-划分优化
遗传算法
无向图
Genetic algorithm Computer networks k - way partitioning optimization Undirected graph
