论文信息 - Dynamic route choice in a congested transit network with uncertain carriers’ arrival times

Dynamic route choice in a congested transit network with uncertain carriers’ arrival times

The purpose of this paper is to investigate the possibility of exploiting the hyperpath paradigm within the framework of dynamic assignment to model the route choice in a congested transit network, where passengers might encounter queues at transit stops and, thus, are not allowed to board the first approaching carrier of the attractive lines.

Guido Gentile | Michael G.H. Bell | Valentina Trozzi | Achille Fonzone

[1] Lars Relund Nielsen,et al. Route Choice in Stochastic Time-Dependent Networks , 2004 .

[2] P. Robillard,et al. Common Bus Lines , 1975 .

[4] Lorenzo Meschini,et al. A frequency based transit model for dynamic traffic assignment to multimodal networks , 2007 .

[5] S. Pallottino,et al. Hyperpaths and shortest hyperpaths , 1989 .

[6] Lorenzo Meschini,et al. FAST HEURISTICS FOR CONTINUOUS DYNAMIC SHORTEST PATHS AND ALL-OR-NOTHING ASSIGNMENT , 2004 .

[7] Fumitaka Kurauchi,et al. Capacity Constrained Transit Assignment with Common Lines , 2003, J. Math. Model. Algorithms.

[8] Michael Florian,et al. Optimal strategies: A new assignment model for transit networks , 1989 .

[9] Guido Gentile,et al. DYNAMIC HYPERPATHS: THE STOP MODEL , 2009 .

[10] Stefano Pallottino,et al. Equilibrium traffic assignment for large scale transit networks , 1988 .

[11] Ismail Chabini,et al. Discrete Dynamic Shortest Path Problems in Transportation Applications: Complexity and Algorithms with Optimal Run Time , 1998 .