最大容量路的扩张问题研究  

Research on Expansion of Maximum Capacity Path

作　　者：刘耕[1] Liu Geng(School of Economics&Management,China University of Geosciences,Wuhan 430074,China)

机构地区：[1]中国地质大学经济管理学院,湖北武汉430074

出　　处：《物流技术》2020年第7期94-96,共3页Logistics Technology

摘　　要：针对在发生紧急情况对网络进行改造时,往往需要从起点到终点找到一条最大容量路,以便尽可能快地运输物资的情况,研究了有向网络中最大容量路的容量扩张问题,分别讨论了网络扩张中的弧改进、点扩张、弧改进和点改进相结合三种方式,建立了统一的数学模型,将其转化为最短路问题进行求解,并进行了算例分析,该研究具有较强的现实意义和实用价值。Aiming at the situation that when a network is required to be transformed in response to an emergency,it is often necessary to find a maximum capacity path from the starting point to the end point in order to deliver materials as quickly as possible,this paper studied the capacity expansion problem of the maximum capacity path in a directed network,and discussed the arc improvement,point expansion,and arc-point combination methods for network expansion.Next it established a unified mathematical model,converted it into a shortest path problem,and demonstrated its solution through a numerical example.

关 键 词：容量扩张 最大容量路 有向网络 最短路 

分 类 号：F252.2[经济管理—国民经济]