Traffic equilibrium with a continuously distributed bound on travel weights: the rise of range anxiety and mental account
DOI10.1007/s10479-018-2990-0zbMath1411.90071OpenAlexW2886373759WikidataQ129428523 ScholiaQ129428523MaRDI QIDQ1730667
Xing Wu, Chi Xie, Stephen D. Boyles
Publication date: 6 March 2019
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-018-2990-0
electric vehiclesnetwork equilibriumrange anxietymental accountroad tollsstochastic weight limittraffic assignment with side constraints
Convex programming (90C25) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20) Environmental economics (natural resource models, harvesting, pollution, etc.) (91B76)
Related Items (1)
Cites Work
- Unnamed Item
- Solving multi-objective traffic assignment
- Existence and computation of optimal tolls in multiclass network equilibrium problems
- Estimation of the most likely equilibrium traffic queueing pattern in a capacity constrained network
- Cost versus time equilibrium over a network
- A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation
- Potential impact of recharging plug-in hybrid electric vehicles on locational marginal prices
- Efficiency and fairness of system-optimal routing with user constraints
- A Full Analytical Implementation of the PARTAN/Frank–Wolfe Algorithm for Equilibrium Assignment
- Tolling Analysis with Bi-objective Traffic Assignment
- Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network Programs
- An efficient implementation of the “partan” variant of the linear approximation method for the network equilibrium problem
- The Traffic Equilibrium Problem with Nonadditive Path Costs
- A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network
- Network-Optimized Road Pricing: Part II: Algorithms and Examples
- Network-Optimized Road Pricing: Part I: A Parable and a Model
- System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion
- Finding the K Shortest Loopless Paths in a Network
- Bicriterion Traffic Assignment: Basic Theory and Elementary Algorithms
This page was built for publication: Traffic equilibrium with a continuously distributed bound on travel weights: the rise of range anxiety and mental account