摘要
本文提出一个求解图Ｋ划分难题的模拟进化退火模型。该模型将模拟退火和模拟进化方法相结合，实现了多目标并行寻优策略。理论分析和实验结果表明，模拟进化退火模型的性能更优，解的优化程度更高。
In this paper, a si mulated cvo lutionary annealing model for graph K partitioning is presented. Combining the simulated annealing and method of the simulated evolution, the proposed model im p lements a parallel strategy for multiobjective optimization, Both the theoretica l analysis and running results show that simulated evolution annealing has bette r performance and optimization result than simulated annealing.
出处
《微机发展》
1998年第3期6-9,共4页
Microcomputer Development
关键词
图划分
模拟进化退火
组合优化
随机算法
Graph Partitioning
Simulated Evolution Annealing(SEA)
Combination Optimization
