00968472

Component

https://doi.org/10.3141/1857-14

http://scholar.google.com...ulos&publication_year=2003

The efficiency and robustness of different real-time dynamic origin-destination (O-D) matrix adjustment algorithms were investigated when implemented in large-scale transportation networks. The proposed algorithms produce time-dependent O-D trip matrices based on the maximum-entropy trip departure times with simulated and actual observed link flows. Implementation of the algorithms, which are coupled with a quasi-dynamic traffic assignment model, indicated their convergent behavior and their potential for handling realistic urban-scale network problems in terms of both accuracy and computational time. The main factors influencing the numerical performance of each algorithm were identified and analyzed. Their relative efficiency was found to be particularly dependent on the level at which the assigned flows approximate the observed link flows. These results may provide insights into the suitability of each algorithm for diverse application domains, including freeways, small networks, and large-scale urban networks, where a different quality of O-D information is usually available.

This paper appears in Transportation Research Record No. 1857, Transportation Network Modeling 2003.

English

p. 117-127

2003

Transportation Research Record

0309085942

Figures (2) ; References (22) ; Tables (7)

Accuracy; Algorithms; Matrices (Mathematics); Origin and destination; Real time information; Time dependence

Computational time; Link flows; Quasi-dynamic traffic assignment model; Urban networks

Highways; Planning and Forecasting; I72: Traffic and Transport Planning

TRIS, TRB, ATRI

Jan 5 2004 12:00AM

• ALTERNATIVE QUASI-NEWTON METHODS FOR CAPACITATED USER EQUILIBRIUM ASSIGNMENT
• FORECASTING TRAFFIC FLOW CONDITIONS IN AN URBAN NETWORK: COMPARISON OF MULTIVARIATE AND UNIVARIATE APPROACHES
• IMPACT OF TRAVEL TIME MODELS ON QUALITY OF REAL-TIME ROUTING INSTRUCTIONS
• MEAN-VARIANCE MODEL FOR THE BUILD-OPERATE-TRANSFER SCHEME UNDER DEMAND UNCERTAINTY
• MODELING INTEGRATED LANE-CHANGING BEHAVIOR
• MULTICOMMODITY MAXIMAL COVERING NETWORK DESIGN PROBLEM FOR PLANNING CRITICAL ROUTES FOR EARTHQUAKE RESPONSE
• OPTIMAL TOLL DESIGN IN SECOND-BEST LINK-BASED CONGESTION PRICING
• OPTIMIZATION OF MULTIPLE-ROUTE FEEDER BUS SERVICE: APPLICATION OF GEOGRAPHIC INFORMATION SYSTEMS
• REAL-TIME OPTIMIZATION MODEL FOR DYNAMIC SCHEDULING OF TRANSIT OPERATIONS
• ROUTING PROFILE UPDATING STRATEGIES FOR ONLINE HYBRID DYNAMIC TRAFFIC ASSIGNMENT OPERATION
• SIMULTANEOUS OPTIMIZATION FORMULATION OF A DISCRETE-CONTINUOUS TRANSPORTATION SYSTEM
• SOLVING THE OVERLAPPING PROBLEM IN ROUTE CHOICE WITH PAIRED COMBINATORIAL LOGIT MODEL
• STUDY OF SOLUTION APPROACH FOR DYNAMIC VEHICLE ROUTING PROBLEMS WITH REAL-TIME INFORMATION