摘要
提出了一种求解图K划分NP难题的模拟进化随机算法模型,对模型的结构、解的精度、随机优化策略与模拟退火算法进行对比研究,并且给出仿真结果和性能分析。
In this paper, a model for solving graph Kpartitioning NP is presented. The characteristics of the model such as model complexity, accuracy of solution, stochastic optimization strategy are investigated and compared with those of simulated annealing. Experimental results and performance analysis are illustrated.
出处
《郑州纺织工学院学报》
1998年第2期77-81,共5页
Journal of Zhengzhou Textile Institute
关键词
随机算法
模拟进化
模拟退火
图划分
stochastic algorithm, simulated evolution, simulated annealing, graph partitioning