网络划分优化的退火遗传算法  

A Genetic Algorithm for Optimal Network Segmentation Based on Annealing Selection

作　　者：邹玲[1] 石冰心[1] 

机构地区：[1]华中理工大学电子与信息工程系

出　　处：《华中理工大学学报》1999年第3期62-64,97,共4页Journal of Huazhong University of Science and Technology

基　　金：国家九五重点科技攻关项目

摘　　要：通过将退火机制引入遗传算法的选择运算中，提高了收敛速度，克服了传统遗传算法容易早熟的问题，较好地解决了网络划分优化问题．The annealing mechanism is introduced to the selection operation of genetic algorithm for increasing the convergent speed and overcoming the premature problem found frequently in traditional genetic algorithm. The optimization of network segmentation is solved conveniently. The experiment study shows that the algorithm is effective for the optimization of network segmentation.

关 键 词：网络划分 遗传算法 模拟退火 组合优化 网络拓扑 

分 类 号：O224[理学—运筹学与控制论]