Robustness of the off-line a priori stochastic dynamic traffic assignment solution for on-line operations

被引:14
|
作者
Peeta, S [1 ]
Zhou, C [1 ]
机构
[1] Purdue Univ, Sch Civil Engn, W Lafayette, IN 47907 USA
关键词
on-line dynamic traffic assignment; stochasticity; a priori optimization; robustness;
D O I
10.1016/S0968-090X(99)00023-6
中图分类号
U [交通运输];
学科分类号
08 ; 0823 ;
摘要
This paper focuses on the off-line stochastic dynamic traffic assignment (DTA) problem as part of a hybrid framework that combines off-line and on-line strategies to solve the on-line DTA problem. The primary concept involves the explicit recognition of stochasticity in O-D demand and/or network supply conditions to determine a robust off-line a priori solution that serves as the initial solution on-line. This strategy ensures that the computationally intensive components, which exploit historical data, are executed off-line while circumventing the need for very accurate on-line O-D demand forecast models. Thereby, efficient on-line reactive strategies could be used to address unfolding traffic conditions. The paper investigates the robustness of the off-line a priori DTA solution under plausible on-line situations. The results illustrate the superiority of the a priori solution over the currently used mean O-D demand-based solution for on-line route guidance applications. (C) 2000 Elsevier Science Ltd. All rights reserved.
引用
收藏
页码:281 / 303
页数:23
相关论文
共 50 条
  • [1] A priori stochastic dynamic traffic assignment for on-line operations under information systems
    Peeta, S
    Zhou, C
    TRANSPORTATION SYSTEMS 1997, VOLS 1-3, 1997, : 639 - 644
  • [2] Stochastic quasi-gradient algorithm for the off-line stochastic dynamic traffic assignment problem
    Peeta, S
    Zhou, C
    TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2006, 40 (03) : 179 - 206
  • [3] Is the Notion of Divisible On-Line/Off-Line Signatures Stronger than On-Line/Off-Line Signatures?
    Au, Man Ho
    Susilo, Willy
    Mu, Yi
    PROVABLE SECURITY, PROCEEDINGS, 2009, 5848 : 129 - 139
  • [4] On-line versus off-line computation in dynamic text compression
    DeAgostino, S
    Storer, JA
    INFORMATION PROCESSING LETTERS, 1996, 59 (03) : 169 - 174
  • [5] Divisible On-Line/Off-Line Signatures
    Gao, Chong-zhi
    Wei, Baodian
    Xie, Dongqing
    Tang, Chunming
    TOPICS IN CRYPTOLOGY - CT-RSA 2009, PROCEEDINGS, 2009, 5473 : 148 - +
  • [6] Integrating Off-line and On-line Schedulers
    Rasconi, Riccardo
    Policella, Nicola
    Cesta, Amedeo
    ECAI 2006, PROCEEDINGS, 2006, 141 : 845 - 846
  • [7] On-line/off-line digital signatures
    Even, S
    Goldreich, O
    Micali, S
    JOURNAL OF CRYPTOLOGY, 1996, 9 (01) : 35 - 67
  • [8] PHENIX on-line and off-line computing
    Adler, SS
    Chujo, T
    Desmond, EJ
    Ewell, L
    Ghosh, TK
    Haggerty, JS
    Ichihara, T
    Jacak, BV
    Johnson, SC
    Kehayias, HJ
    Lauret, J
    Maguire, CF
    Messer, M
    Mioduszewski, S
    Mitchell, JT
    Morrison, DP
    Ojha, ID
    Pinkenburg, CH
    Pollack, M
    Pope, K
    Purschke, ML
    Sorensen, S
    Sourikova, I
    Thomas, TL
    Velkovsky, M
    Watanabe, Y
    Witzig, C
    Yokkaichi, S
    Zajc, WA
    NUCLEAR INSTRUMENTS & METHODS IN PHYSICS RESEARCH SECTION A-ACCELERATORS SPECTROMETERS DETECTORS AND ASSOCIATED EQUIPMENT, 2003, 499 (2-3): : 593 - 602
  • [9] Evaluation of a simulation-based dynamic traffic assignment model in off-line use
    Mahut, M
    Florian, M
    Tremblay, N
    ITSC 2004: 7TH INTERNATIONAL IEEE CONFERENCE ON INTELLIGENT TRANSPORTATION SYSTEMS, PROCEEDINGS, 2004, : 1028 - 1032
  • [10] On-line three-dimensional packing problems: A review of off-line and on-line solution approaches
    Ali, Sara
    Ramos, Antonio Galrao
    Carravilla, Maria Antonia
    Oliveira, Jose Fernando
    COMPUTERS & INDUSTRIAL ENGINEERING, 2022, 168