原文传递
MULTICLASS CONTINUOUS-TIME EQUILIBRIUM MODEL FOR DEPARTURE TIME CHOICE ON SINGLE-BOTTLENECK NETWORK.
| 题名： | MULTICLASS CONTINUOUS-TIME EQUILIBRIUM MODEL FOR DEPARTURE TIME CHOICE ON SINGLE-BOTTLENECK NETWORK. |
| 作者： | Van-der-Zijpp-N; Koolstra-K |
| 关键词： | Algorithms-; Bottlenecks-; Choice-models; Costs-; Departure-time; Elastic-demand; Fixed-demand; Peak-hour-traffic; Queuing-; Road-pricing |
| 摘要： | Commuters may react to structural congestion on urban roads and freeways by adjusting their departure time. Single-bottleneck models enable direct insight into the mechanisms of departure time choice. The interaction of user equilibrium departure time choice processes for multiple user classes in continuous time is studied in the situation in which all users have to pass a common bottleneck. The study draws on the bottleneck approach introduced by Vickrey and provides a generic algorithm that solves the departure time choice equilibrium problem given heterogeneous departure time preferences, arbitrary origin-bound and destination-bound rescheduling cost functions, and arbitrary queuing cost functions. For all user classes, the (generalized) queuing costs have a travel duration-dependent component and a travel cost-dependent component. First, a solution is provided for the elastic-demand case. It is shown that the equilibrium departure rates per user class can be calculated directly by calculating the acceptable travel times per user class. Second, a solution is provided for the fixed-demand case. The fixed-demand problem is formulated as a minimization problem that is solved using the Nelder-Mead procedure. The algorithm is illustrated with an example showing the effects of a flat peak-hour road pricing scheme on the departure time choice and total incurred costs per user class. |
| 总页数： | Transportation Research Record. 2002. (1783) pp134-141 (8 Fig., 2 Tab., 16 Ref.) |
| 报告类型： | 科技报告 |
相关文献
- APPLICATION OF STOCHASTIC LEARNING AUTOMATA FOR MODELING DEPARTURE TIME AND ROUTE CHOICE BEHAVIOR.
- LINEAR PROGRAMMING FORMULATIONS FOR SYSTEM OPTIMUM DYNAMIC TRAFFIC ASSIGNMENT WITH ARRIVAL TIME-BASED AND DEPARTURE TIME-BASED DEMANDS.
- COMPUTING FASTEST PATHS IN CONTINUOUS-TIME DYNAMIC NETWORKS WITH PIECEWISE LINEAR LINK TRAVEL-TIME FUNCTIONS.
- ANALYTICAL DYNAMIC NETWORK LOADING PROBLEM: FORMULATION, SOLUTION ALGORITHMS, AND COMPUTER IMPLEMENTATIONS.
- MODELING ROUTE CHOICE BEHAVIOR WITH STOCHASTIC LEARNING AUTOMATA.
- QUASI-CONTINUOUS DYNAMIC TRAFFIC ASSIGNMENT MODEL.
检索历史
应用推荐
