摘要
用组合图论法构造道路网络的赋权有向图,分析路网结构的均衡性,确定造成路网不均衡的关键路段.利用网络可行流的平衡关系,以流等价和点守恒原则为约束条件,建立网络最大流模型.根据最大流最小割定理,用割集矩阵法求网络的最大流.网络流量最大时,那些流量饱和的路段即为关键路段.增加关键路段的通行能力,即可增加路网的通行能力.
Following the combination graph theory, a road network was described as a weighted discrete graph to analyze the structural equilibrium of the road network and recognize the critical links that cause non-equilibrium of the road network. A maximum-flow model was derived based on equilibrium of feasible flows in the network, and the model is subjected to the flow equivalence and point conservation. The maximum flows of the links in the network are determined through cutset matrix based on the max-flow min-cut theorem. The critical links are those with saturated flows. Increasing the traffic capabilities of the critical links will increase that of the road network.
出处
《西南交通大学学报》
EI
CSCD
北大核心
2009年第2期284-288,共5页
Journal of Southwest Jiaotong University
基金
国家自然科学基金资助项目(50778142)
关键词
路网
最大流
割集
优化
均衡
road network
maximum flow
cutset
optimization
equivalence
