提出了一种基于模拟退火法的时延约束最小代价组播路由算法(SADLMA)。首先,本算法使用Dijkstra第K最短路算法建立了从源节点到每个目的节点的候选集.然后生成了相应的邻居结构。当温度下降时,根据接收概率从邻居结构里把新解选择出来,并且代替旧解。仿真试验表明本算法对实际网络是有效的。 A delay-constrained minimum cost multicast routing algorithm (SADLMA) based on simulated annealing is proposed. First of all, this algorithm uses Dijkstra Kth shortest path algorithm to establish the candidate set from the source node to each destination node, and then generates the corresponding neighbor structure. When the temperature drops, the new solution is selected from the neighborhood structure according to the reception probability, and the old solution is replaced. Simulation results show that this algorithm is effective for the actual network.