摘要
<正> 一、引言 设N=(V,A)为一个有限、简单、无向的连通网络,其顶点集为V,连杆集为A。 设U={u_1,u_2,…,u_p}V,每个u_i对应一个定义在N中点集上的函数d_i(i=1,2,…,p),其定义如下: 这里d(x,u_i)表示x与u_i之间在网络中的最短距离(即连接x与u_i的任一条最短路径的长度)。 我们的问题是求x~*N,使每个函数d(x,u_i)在x~*都取“极小”值(i=1,2,…,p)。这显然是一个多目标决策问题。
On the problem of location on network,the concept of 'efficient points on a network' was first introduced by P.Hanson.In this paper we try to define superior-efficient points in set of efficient points.In general.their range is more narrow than that of efficient points.Also they have more outstanding characteristic of efficient points ,thus they can provide exact information for decider .In the case of tree network , some properties of superior efficient points will be discussed and an algorithm will be given in this paper.
出处
《系统工程理论与实践》
EI
CSCD
北大核心
1992年第3期7-11,共5页
Systems Engineering-Theory & Practice
关键词
网络
优势有效点
选址
Location problem,Network,Tree .Incident link,Adjacent vertex.
