Bounding the inefficiency of the reliability-based continuous network design problem under cost recovery

DOI10.1007/s11067-019-09478-1OpenAlexW2979948945WikidataQ126983663 ScholiaQ126983663MaRDI QIDQ2005923

W. Y. Szeto, Anny B. Wang

Publication date: 8 October 2020

Published in: Networks and Spatial Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11067-019-09478-1

zbMATH Keywords

price of anarchyinefficiencyreliability-based user equilibriumtransport network design problem

Mathematics Subject Classification ID

Calculus of variations and optimal control; optimization (49-XX) Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Inefficiency of logit-based stochastic user equilibrium in a traffic network under ATIS
• A reliability-based stochastic traffic assignment model for network with multiple user classes under uncertainty in demand
• Robust improvement schemes for road networks under demand uncertainty
• Bounding the inefficiency of logit-based stochastic user equilibrium
• The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands.
• On the uniqueness of user equilibrium flow with speed limit
• Non-expected route choice model under risk on stochastic traffic networks
• Day-to-day assignment models and traffic dynamics under information provision
• Reliability-based user equilibrium in a transport network under the effects of speed limits and supply uncertainty
• A review of urban transportation network design problems
• The multiobjective equilibrium network design problem revisited: A simulated annealing approach
• On the price of anarchy for non-atomic congestion games under asymmetric cost maps and elastic demands
• How bad is selfish routing?
• Selfish Routing in Capacitated Networks