An algorithm for the equilibrium assignment problem with random link times

DOI10.1002/NET.3230120209MaRDI QIDQ3945966zbMATH OpenOpenAlexFDO

Authors Yosef Sheffi, Warren Powell

Publication date 1982

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230120209

zbMATH Keywords

equilibrium assignment problemequivalent minimization formulationflow-dependent random link travel timesproof of convergencerate of convergencesolution algorithmstochastic equilibrium modeltraffic assignment problemuniqueness of solution

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Stochastic programming (90C15) Programming involving graphs or networks (90C35)

Cited in

(23)

• Alternative formulations of a combined trip generation, trip distribution, modal split, and trip assignment model
• Origin-destination demand reconstruction using observed travel time under congested network
• Variable demand and multi-commodity flow in Markovian network equilibrium
• A modified truncated Newton algorithm for the logit-based stochastic user equilibrium problem
• Improving truncated Newton method for the logit-based stochastic user equilibrium problem
• Modeling mode and route similarities in network equilibrium problem with go-green modes
• Applications of sensitivity analysis for probit stochastic network equilibrium
• Markovian traffic equilibrium
• A bi-objective turning restriction design problem in urban road networks
• Stochastic equilibrium assignment with variable demand: theoretical and implementation issues
• Linear programming formulation for strategic dynamic traffic assignment
• A mean-risk model for the traffic assignment problem with stochastic travel times
• Approaches for solving the stochastic equilibrium assignment with variable demand: internal vs. external solution algorithms
• 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
• Computation and application of the paired combinatorial logit stochastic user equilibrium problem
• A dual scheme for traffic assignment problems
• A distributed computing method integrating improved gradient projection for solving stochastic traffic equilibrium problem
• C-Weibit discrete choice model: a path based approach
• Maximizing network throughput under stochastic user equilibrium with elastic demand
• Method of successive weighted averages (MSWA) and self-regulated averaging schemes for solving stochastic user equilibrium problem
• Optimisation of timetable-based, stochastic transit assignment models based on MSA
• A turning restriction design problem in urban road networks

This page was built for publication: An algorithm for the equilibrium assignment problem with random link times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3945966)