节点文献
一类随机变权网络最短路问题及其动态规划算法
A Kind of Shortest Path Problem of Stochastic Weight-Varing Network and Its Dynamic Programming Algorithm
【摘要】 本文考察一类有向随机变权网络最短路问题,提出了一个动态规划近似算法,并讨论了该模型在邮件铁路运送中的实际应用。对于多种交通工具联合运输的复杂网络问题,本文应用大系统理论的递阶分解方法,讨论了一个两级动态规划处理方法。
【Abstract】 A kind of shortest path problem of stochastic weight-raring network is studied in this paper, and its dynamic programming alogorithm is offered. Then the application of the model to the mails’ railway transportation system is considered. As to the complex transportation network problem arising from multiple traffic tools a two-level dynamic programming approximate algorithm based on the recursive decomposition method of large scale system theory is discussed.
【关键词】 随机变权网络;
最短路问题;
动态规划算法;
【Key words】 Stochatic weight-varing network; Shortest path problem; Dynamic programming algorithm;
【Key words】 Stochatic weight-varing network; Shortest path problem; Dynamic programming algorithm;
- 【文献出处】 系统工程理论方法应用 ,Systems Engineering-Theory Methodology Application , 编辑部邮箱 ,1993年03期
- 【被引频次】6
- 【下载频次】201