An algorithm for the equilibrium assignment problem with random link times
From MaRDI portal
Publication:3945966
DOI10.1002/net.3230120209zbMath0485.90082OpenAlexW1972180777MaRDI QIDQ3945966
Warren B. Powell, Yosef Sheffi
Publication date: 1982
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230120209
rate of convergenceuniqueness of solutionsolution algorithmproof of convergencetraffic assignment problemequilibrium assignment problemstochastic equilibrium modelequivalent minimization formulationflow-dependent random link travel times
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Stochastic programming (90C15)
Related Items
Linear programming formulation for strategic dynamic traffic assignment ⋮ Modeling mode and route similarities in network equilibrium problem with go-green modes ⋮ Variable demand and multi-commodity flow in Markovian network equilibrium ⋮ Exploring trust region method for the solution of logit-based stochastic user equilibrium problem ⋮ Solving the logit-based stochastic user equilibrium problem with elastic demand based on the extended traffic network model ⋮ Stochastic equilibrium assignment with variable demand: theoretical and implementation issues ⋮ Method of successive weighted averages (MSWA) and self-regulated averaging schemes for solving stochastic user equilibrium problem ⋮ Computation and application of the paired combinatorial logit stochastic user equilibrium problem ⋮ Optimisation of timetable-based, stochastic transit assignment models based on MSA ⋮ Approaches for solving the stochastic equilibrium assignment with variable demand: internal vs. external solution algorithms ⋮ Applications of sensitivity analysis for probit stochastic network equilibrium ⋮ Markovian traffic equilibrium ⋮ A dual scheme for traffic assignment problems ⋮ Origin-destination demand reconstruction using observed travel time under congested network ⋮ A turning restriction design problem in urban road networks ⋮ Maximizing network throughput under stochastic user equilibrium with elastic demand ⋮ A modified truncated Newton algorithm for the logit-based stochastic user equilibrium problem ⋮ A bi-objective turning restriction design problem in urban road networks ⋮ Improving truncated Newton method for the logit-based stochastic user equilibrium problem ⋮ Alternative formulations of a combined trip generation, trip distribution, modal split, and trip assignment model ⋮ A Mean-Risk Model for the Traffic Assignment Problem with Stochastic Travel Times
