A Temporal Domain Decomposition Algorithmic Scheme for Large-Scale Dynamic Traffic Assignment

作     者：Eric J.Nava Yi-Chang Chiu 

作者机构：Department of Civil Engineering and Engineering MechanicsUniversity of Arizona1209 E 2nd St.TucsonAZUSA 

出 版 物：《International Journal of Transportation Science and Technology》 (交通科学与技术(英文))

年 卷 期：2012年第1卷第1期

页      面：1-24页

学科分类：0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 

主　　题：dynamic traffic assignment method of isochronal vehicle assignment simulation computational efficiency large scale 

摘      要：With emergent interest of Simulation-Based Dynamic Traffic Assignment(SBDTA)in the field of transportation network modeling,deployment of SBDTA models for traffic operations and transportation planning have increased significantly in recent *** parallel,research and development of innovative approaches of the SBDTA model have enhanced the quality of both the assignment component,i.e,improvement of convergence quality of the Dynamic User Equilibrium(DUE)problem,and the traffic simulation ***,computational requirement remains to be one of the great challenges for DTA implementations on large-scale networks with a long analysis *** paper presents a temporal decomposition scheme for large spatial-and temporal-scale dynamic traffic assignment,in which the entire analysis period is divided into *** assignment is performed sequentially in each Epoch,thus improving the model scalability and confining the peak run-time memory requirement regardless of the total analysis period.A proposed self-turning scheme adaptively searches for the run-time-optimal Epoch setting during iterations regardless of the characteristics of the modeled *** numerical experiments confirm the promising performance of the proposed algorithmic schemes.