【摘要】 对计算机网络的拓扑结构进行扩展时 ,经常要解决这样一类优化问题 :在给定预算限制的条件下 ,选择一组连接 ,使带来的利润最大。本文运用模拟退火算法 ,提出了一种解决方案 ,能较快地得到最优解。更多还原

【Abstract】 Topological expansion of a computer network frequently involves an optimization problem of selecting proper links so that they can produce maximum profit within a given budget limit.In this paper,we use a simulated annealing algorithm to solve the problem.The algorithm can get an optimal solution quickly.更多还原