多目标路由问题要求极小化网络带宽资源消耗 ,它与图论中 NP完全的 Steiner问题等价 ,不存在多项式时间算法 ,只能采用近似算法或启发式算法 .进化算法是一类有效求解优化问题的新算法 .应用进化算法中的进化规划方法 ,求解 Steiner问题 ,提出了一种新的多目标路由算法 .仿真结果显示 ,该算法性能高于启发式方法 Multi-objective routing problem requires minimization of network bandwidth resource consumption, which is equivalent to the NP complete Steiner problem in graph theory, there is no polynomial time algorithm, only approximate algorithm or heuristic algorithm.Evolutionary algorithm is a kind of effective solution optimization A new algorithm of multi-objective routing is proposed by applying the evolutionary programming method in evolutionary algorithm to solve Steiner’s problem.The simulation results show that the proposed algorithm has higher performance than the heuristic method