| 基于拓扑处理的Logit型网络加载算法 |
| |
| 引用本文： | 李军,辛松歆,蔡铭.基于拓扑处理的Logit型网络加载算法[J].中国公路学报,2005,18(4):87-90. |
| |
| 作者姓名： | 李军 辛松歆 蔡铭 |
| |
| 作者单位： | 中山大学,智能交通研究中心,广东,广州,510275 |
| |
| 基金项目： | 教育部留学回国人员科研启动基金项目(30100-4105442)，广东省科技攻关项目(2002B60112) |
| |
| 摘 要： | 针对均衡交通分配问题,提出了一种基于拓扑处理来改进DIAL算法中合理路径的定义并求解Logit型网络加载模型的新算法。当道路网络存在环路时,算法根据从节点到讫点的阻抗的降序来删除节点上游没有遍历的路段,从而将有环网络变为无环网络并根据拓扑排序确定的节点计算顺序来计算路段权重和流量。对于无环网络,新算法可以得到与理论值完全一致的结果;对有环网络,可以减少DIAL算法中非合理路径的数目。计算实例表明:新算法可降低DIAL算法中合理路径定义过于严格所带来的误差。
|
| 关 键 词： | 交通工程 Logit型网络加载 拓扑排序 DIAL算法 |
| 文章编号： | 1001-7372（2005）04-0087-04 |
| 收稿时间： | 2005-01-26 |
| 修稿时间： | 2005年1月26日 |
Algorithm for logit network loading problem based on topological sorting |
| |
| LI Jun,XIN Song-xin,CAI Ming.Algorithm for logit network loading problem based on topological sorting[J].China Journal of Highway and Transport,2005,18(4):87-90. |
| |
| Authors: | LI Jun XIN Song-xin CAI Ming |
| |
| Institution: | ITS Research Center, Sun Yat-sen University, Guangzhou 510275, China |
| |
| Abstract: | Authors presented a new algorithm for logit network loading problem to improve the definition of reasonable routes in DIAL's algorithm based on topological sorting.The new algorithm excluded all routes with cycles by removing certain links from loops in descending values of shortest nodal travel time to destination.Then,authors calculated the link weights and flows according to topological order.It produced the theoretical results for networks without loops,and could reduce the number of non-reasonable routes for networks with loops.Numerical examples show that the new algorithm can reduce errors induced by the strict definition of reasonable routes in DIAL's algorithm. |
| |
| Keywords: | traffic engineering logit network loading topological sorting DIAL's algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
