%0 Journal Article
%T A Study on the Multichannel Quickest Path Problem for Continuous Flow<br>连续型多通道最速路问题研究
%A Dai Jianshe
%A Wang Shuning
%A Yang Xiaoyin
%A <br>戴建设
%A 王书宁
%A 杨小茵
%J 自动化学报
%D 1995
%I 
%X This paper deals with the multichannel quickest path (MoP) problem between two given nodes in a network N = (V,A,c,1). 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.
%K Systems engineering
%K network analysis
%K multichannel quickest path
%K time-critical issues<br>网络分析
%K 多通道最速路
%K 网络运送
%K 数学模型
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=E76622685B64B2AA896A7F777B64EB3A&aid=C8718D5BBCF0499C68EB5FC101DD1326&yid=BBCD5003575B2B5F&vid=659D3B06EBF534A7&iid=38B194292C032A66&sid=6826CBE9C80ACB20&eid=5D8C08279A19B0D4&journal_id=0254-4156&journal_name=自动化学报&referenced_num=3&reference_num=0