基于时延-容量转换的网络路径优选研究  

Research on Paths Optimization in Network Using Delay-Capacity Conversion Method

作　　者：黄泽汉[1,2] 谭跃进[1] 吕欣[1] 

机构地区：[1]国防科技大学信息系统与管理学院,湖南长沙410073 [2]海军工程大学管理工程系,湖北武汉430033

出　　处：《管理工程学报》2009年第3期111-114,共4页Journal of Industrial Engineering and Engineering Management

基　　金：国家自然科学基金资助项目(70501032)

摘　　要：应急救灾、军事作战过程中需要进行大规模的物资调度,受运输网络容量的限制,保障物资需要在网络单元处等待并逐步转运,导致传输时延随物资数量的变化而呈现不确定性。本文在详细分析描述保障网络传输机制的基础上,提出一种基于网络时延-容量转换的建模方法,建立最小时延网络路径优选模型,并改进Dijkstra算法求解网络最优路径,最后应用算例验证模型正确性及算法有效性。large-scale support material must be scheduled by logistics support network in disaster relief operations and military operations. However, support material may be transported through a unit in turn because of its＇ constrained capacity, which causes the transfer delay changing with the quantity of the given material. This paper analyzes and describes the transportation mechanism of the network, a kind of modeling method is proposed based on delay -capacity conversion. Then, a path selection optimization model with minimal delay is designed, and the optimal route can be figured out by a modified Dijkstra algorithm. Finally, an example is given to validate the validity of the model and the feasibility of this algorithm.

关 键 词：物流保障网络 时延-容量转换 路径优选 

分 类 号：F157[经济管理—世界经济]