00821018

Component

https://doi.org/10.3141/1771-25

http://scholar.google.com...avar&publication_year=2001

An algorithm operating on a new and compact representation of link exit times to solve the one-to-all fastest path problem in dynamic networks is presented. The new space-efficient representation that exploits the first-in, first-out property of link travel times in dynamic networks is developed. The algorithm is described, and its working on a simple network is presented. The algorithm directly operates on bit streams of data representing time-dependent link travel times and performs logical operations on 0 and 1 bits only. computational results are presented for large dynamic networks. The ideas behind the development of this algorithm are extendable to the development of algorithms operating at the bit level to solve other variants of dynamic shortest path problems and other dynamic network flow problems. These developments then open new research possibilities in the development of solution algorithms for dynamic network problems.

This paper appears in Transportation Research Record No. 1771, Transportation Network Modeling 2001.

English

p. 201-208

2001

Transportation Research Record

0309072298

Figures (9) ; References (16) ; Tables (1)

Algorithms; Network links; Shortest path algorithms; Time dependence; Travel time

Bit streams; Dynamic networks

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

TRIS, TRB, ATRI

Dec 13 2001 12:00AM

• ACCELERATING STRATEGIES AND COMPUTATIONAL STUDIES OF THE FRANK-WOLFE ALGORITHM FOR THE TRAFFIC ASSIGNMENT PROBLEM
• ADVANCES IN DISCRETE-TIME DYNAMIC DATA REPRESENTATION WITH APPLICATIONS TO INTELLIGENT TRANSPORTATION SYSTEMS
• ANALYTICAL DYNAMIC NETWORK LOADING PROBLEM: FORMULATION, SOLUTION ALGORITHMS, AND COMPUTER IMPLEMENTATIONS
• ASSESSING FINANCIAL FEASIBILITY OF A BUILD-OPERATE-TRANSFER PROJECT UNDER UNCERTAIN DEMAND
• ASSESSING PERFORMANCE RELIABILITY OF ROAD NETWORKS UNDER NONRECURRENT CONGESTION
• ASSIGNMENT MODELS FOR LOCAL TRUCKLOAD TRUCKING PROBLEMS WITH STOCHASTIC SERVICE TIMES AND TIME WINDOW CONSTRAINTS
• CALIBRATION AND PATH DYNAMICS ISSUES IN MICROSCOPIC SIMULATION FOR ADVANCED TRAFFIC MANAGEMENT AND INFORMATION SYSTEMS
• COMBINED REVEALED AND STATED PREFERENCE NESTED LOGIT ACCESS AND MODE CHOICE MODEL FOR MULTIPLE MASS TRANSIT TECHNOLOGIES
• COMPARISON OF THREE METHODS FOR DYNAMIC NETWORK LOADING
• COMPUTER VISION DETECTION SYSTEM FOR NETWORK MODEL VALIDATION
• COMPUTING FASTEST PATHS IN CONTINUOUS-TIME DYNAMIC NETWORKS WITH PIECEWISE LINEAR LINK TRAVEL-TIME FUNCTIONS
• DECISION SUPPORT SYSTEM FOR SNOW EMERGENCY VEHICLE ROUTING: ALGORITHMS AND APPLICATION
• DEMAND MATRIX ADJUSTMENT FOR MULTIMODAL FREIGHT NETWORKS
• DESIGN AND IMPLEMENTATION OF PARALLEL DYNAMIC SHORTEST PATH ALGORITHMS FOR INTELLIGENT TRANSPORTATION SYSTEMS APPLICATIONS
• DYNAMIC TRIP ASSIGNMENT-SIMULATION MODEL FOR INTERMODAL TRANSPORTATION NETWORKS
• EFFECTS OF FLOW UPDATE STRATEGIES ON IMPLEMENTATION OF THE FRANK-WOLFE ALGORITHM FOR THE TRAFFIC ASSIGNMENT PROBLEM
• ESTIMATION OF ORIGIN-DESTINATION DEMAND FOR DYNAMIC ASSIGNMENT WITH SIMULTANEOUS ROUTE AND DEPARTURE TIME CHOICE
• EVALUATION WITH TRAFFIC ASSIGNMENT UNDER DEMAND UNCERTAINTY
• GENETIC ALGORITHM FOR THE TIME-DEPENDENT VEHICLE ROUTING PROBLEM
• LEAST EXPECTED TIME HYPERPATHS IN STOCHASTIC, TIME-VARYING MULTIMODAL NETWORKS
• MODELING OF NONLINEAR STOCHASTIC DYNAMIC TRAFFIC FLOW
• ORIGIN-DESTINATION MATRICES ESTIMATED WITH A GENETIC ALGORITHM FROM LINK TRAFFIC COUNTS
• PARAMETRIC EVALUATION FOR ROUTE GUIDANCE SYSTEMS WITH ANALYSIS OF SUSTAINABLE DRIVER COMPLIANCE
• SOLUTION ALGORITHM FOR COMBINED INTERREGIONAL COMMODITY FLOW AND TRANSPORTATION NETWORK MODEL WITH LINK CAPACITY CONSTRAINTS
• STOCHASTIC DYNAMIC NETWORK DESIGN PROBLEM
• TRANSIT VEHICLE ARRIVAL PREDICTION: ALGORITHM AND LARGE-SCALE IMPLEMENTATION