01128652

Component

https://doi.org/10.3141/2090-05

http://scholar.google.com...hony&publication_year=2009

Traditionally, game theoretic approaches to measuring transport network reliability have relied on the outcome of a game played between network users seeking to minimize their travel costs and an origin–destination–specific (O-D–specific) demon that seeks the opposite by damaging links in the network. This problem assumes the presence of only one demon in each O-D pair and assumes the capacity reduction to be 50% if the link is selected for damage by one or more O-D–specific demons. The game is typically expressed as a path-based formulation, which is computationally intensive since the formulation requires path enumeration. With relaxation of the assumptions on the O-D–specific nature of the demons and the capacity reduction, a link-based multiple network demon formulation is proposed by the nonlinear complementarity problem approach, in which each demon is free to select any link to damage. Within this framework, the effects of the proposed model on total expected network cost and reliability measures are examined, and specific examples demonstrate the paradoxical phenomenon that if one adds a road to a network, then all travelers may be worse off for total expected network cost or travel time reliability. Overall, the results indicate the importance of assumptions used to total expected network cost and reliability measures and provide some insights into the problem of ignoring these paradoxical phenomena in reliable and robust network design.

01135938

09-1258

English

pp 42-50

2009

Transportation Research Record: Journal of the Transportation Research Board

9780309126090

Print

Figures (1) ; References (21) ; Tables (2)

Game theory; Network links; Origin and destination; Travel costs; Travel time

Braess' Paradox

Capacity reduction; Network design; Network reliability; Travel time reliability

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

TRIS, TRB

Jan 30 2009 5:28PM

• A New Look at Projected Gradient Method for Equilibrium Assignment
• Application of Reactive Tabu Search for Combined Dynamic User Equilibrium and Traffic Signal Optimization Problem
• Calibration of Dynamic Traffic Assignment Models with Point-to-Point Traffic Surveillance
• Dynamic Pricing with Heterogeneous Users: Gap-Driven Solution Approach for Bicriterion Dynamic User Equilibrium Problem
• Evaluation and Design of Transport Network Capacity Under Demand Uncertainty
• Freight Transportation Network Design Problem for Maximizing Throughput Under Uncertainty
• Multimodal Mesoscopic Approach in Modeling Pedestrian Evacuation
• Pareto Optimal Multiobjective Optimization for Robust Transportation Network Design Problem
• Real-Time Control of Buses in a Transit Corridor Based on Vehicle Holding and Boarding Limits
• Reliable System-Optimal Network Design: Convex Mean–Variance Model with Implicit Chance Constraints
• Robust Approach to Discrete Network Designs with Demand Uncertainty