| 拥挤型网络的路流组合及模型求解的搜索法 |
| |
| 引用本文： | 张子刚,叶荫宇.拥挤型网络的路流组合及模型求解的搜索法[J].华中科技大学学报(自然科学版),1994(9). |
| |
| 作者姓名： | 张子刚 叶荫宇 |
| |
| 作者单位： | 华中理工大学工商管理学院 |
| |
| 摘 要： | 证明了一个路流组合定理并由此而给出了一个求解网络选址两级模型的算法，讨论了网络的Ｂｒａｅｓｓ性及其在网络规划中的应用前景。
|
| 关 键 词： | 网络选址 拥挤型网络 用户平衡流 Braess佯谬 |
The Convex Combination of Flows on the Path of a Congested Network and a Search Algorithm for a Kind of Network Site Selection Model |
| |
| Zhang Zigang, Ye Yinyu.The Convex Combination of Flows on the Path of a Congested Network and a Search Algorithm for a Kind of Network Site Selection Model[J].JOURNAL OF HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY.NATURE SCIENCE,1994(9). |
| |
| Authors: | Zhang Zigang Ye Yinyu |
| |
| Institution: | Zhang Zigang; Ye Yinyu |
| |
| Abstract: | The theorem of convex combination of flows on the path of a congested network isproved and a search algorithm for a two-level network site selection model is presented.TheBraess Paradox in a congested network and the prospects of its application in network plan-ning are discussed. |
| |
| Keywords: | network site selection congested network convex combination Braess Para-dox |
| 本文献已被 CNKI 等数据库收录！ |
