01046148

Component

https://doi.org/10.3141/2029-09

http://scholar.google.com...suri&publication_year=2007

In transportation engineering, the network design problem (NDP) aims at finding an optimal link improvement in a network for given demand. Although traffic demand is essentially uncertain, many previous studies assumed it to be deterministic. The demand stochasticity is incorporated and formulas are developed for system-optimal (SO) flow stochastic NDP. The SO assumption is justified by comparing results from SO deterministic NDP with those of user-equilibrium NDP. The difference in social cost between the two approaches is found to be less than 5%. Two two-stage stochastic programs with recourse formulations are proposed: one with penalty function and the other without. The main advantage of the first formulation is that a planner can exert better control on improvement by appropriately weighing reduction in the congestion versus improvement costs. The challenge, however, lies in selecting an appropriate penalty function. A nonlinear penalty function is found suitable for the test network studied. The second formulation does not require penalty function but results in a large number of scenarios. Nonanticipativity constraints are introduced in the second formulation to arrive at uniform improvement over all scenarios. Both formulations are solved on a test network. It is found that necessary improvements and the total costs with both models are more than those for average demand.

01089658

English

pp 80-86

2007

Transportation Research Record: Journal of the Transportation Research Board

9780309104562

Print

Figures (3) ; References (23) ; Tables (8)

Costs; Improvements; Stochastic processes; Traffic congestion; Transportation planning; Transportation system management; Travel demand

Network design problem; Stochastic optimization models; Stochastic user equilibrium models; System optimal models; Transportation networks; User equilibrium

Data and Information Technology; Finance; Highways; Planning and Forecasting; I72: Traffic and Transport Planning

TRIS, TRB, ATRI

Feb 8 2007 7:32PM

• Alpha Reliable Network Design Problem
• Doubly Dynamic Traffic Assignment: Simulation Modeling Framework and Experimental Results
• Dynamic Queuing and Spillback in Analytical Multiclass Dynamic Network Loading Model
• Dynamic Traffic Equilibrium: Theoretical and Experimental Network Game Results in Single-Bottleneck Model
• Efficient Implementation of Method of Successive Averages in Simulation-Based Dynamic Traffic Assignment Models for Large-Scale Network Applications
• Exploring User Behavior In Online Network Equilibrium Problems
• Multiple Path–Finding Models Using Kalman Filtering and Space Syntax Techniques
• Optimal Redesign of Dutch Road Network
• Robust Dynamic Continuous Network Design Problem