摘要
计算机网络结构拓扑扩展时 ,经常要解决这样一类优化问题 :在给定预算限制下 ,选择一组连接 ,使带来的利润最大。本文依据模拟退火技术和遗传算法 ,提出了一种混合遗传算法 。
The topological expansion of a network frequently involves the optimization problem of selecting proper links so that they can produce maximum profit within a given budget limit. In this paper, we give a hybrid genetic algorithm, based on simulated annealing and genetic algorithms. The algorithm can get an optimal solution quickly.
出处
《计算机工程与科学》
CSCD
2002年第3期3-4,共2页
Computer Engineering & Science
