赋有权向量网络的2-范数意义下的最短路

THE SHORTEST RATH UNDER,2-NORMS NETWORK WITH WEIGHTED VECTOR

本文从资源的平衡消耗问题出发,提出了赋有权向量网络的2—范数意义下的最短路概念,讨论了算法,并以城市交通问题为例,说明了算法在多目标决策中的应用。

This paper takes the balance of resource consumption as background, and introduces the concept of the Shortest Path based on 2-Norm in a directed network, each arc of which is associated with weighted Vectors. The algorithm is also discussed. Finally, an example is given, which shows how to use this algorithm in the Multi-Objective Programming