.png){kind=icon}
返回
A schedule-based assignment model with explicit capacity constraints for congested transit networks
.png){kind=icon}
PRE
AI
DOI：10.1016/j.trc.2011.02.007.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a schedule-based dynamic assignment model for transit networks, which takes into account congestion through explicit vehicle capacity constraints. The core of this assignment model is the use of a joint choice model for departure times, stops and runs that defines a space-time path in which users decide to leave at a given time, to access the network at a given stop and to board a given run to reach their destination. The assignment model is defined through a dynamic process approach in which the within-day network loading procedure allocates users on each transit run according to user choice and to the residual capacity of vehicles arriving at stops. The proposed model, albeit general, is specified for frequent users, who constitute a particularly congestion-sensitive class of users. Finally, an application to a real-size test network (part of the Naples transit network in southern Italy) is illustrated in order to test the proposed approach and show the ability of the modelling framework to assess congestion effects on transit networks. (C) 2011 Elsevier Ltd. All rights reserved.
Keyword:
Transit networks
Schedule-based
Dynamic assignment
Congestion
Capacity constraints
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.9
论文数:
4.9K
被引数:
3.2W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容