连续型多通道最速路问题研究
A Study on the Multichannel Quickest Path Problem for Continuous Flow
-
摘要: 研究网络N=(V,A,c,l)上任意两节点间的多通道最速路(MQP)问题.提出MQP 的数学模型,并讨论了其最优解的充要条件.最后得出解的计算公式和一种适于动态网络环 境的MQP算法.Abstract: This paper deals with the multichannel quickest path (MQP) problem between two given nodes in a network N = (V,A,c,l). Mathematical models of MQP problems are presented. Necessary and sufficient conditions of the optimal strategy for solving the models are discussed, and a formulated solution is derived. Based upon the result, a recursive algorithm for the MQP problem in a dynamic network is developed and its usage is shown by an example.
-
计量
- 文章访问数: 2570
- HTML全文浏览量: 99
- PDF下载量: 964
- 被引次数: 0
下载:
