A multiple-path gradient projection method for solving the logit-based stochastic user equilibrium model
Open Access
- 28 January 2020
- journal article
- research article
- Published by Center for Transportation Studies in Journal of Transport and Land Use
- Vol. 13 (1) , 539-558
Abstract
This paper proposes a path-based algorithm for solving the well-known logit-based stochastic user equilibrium (SUE) problem in transportation planning and management. Based on the gradient projection (GP) method, the new algorithm incorporates a novel multiple-path gradient approach to generate the descent direction in consideration of many paths existing in every single origin-destination (O-D) pair. To apply the path-based algorithm, the SUE problem is reformulated as a variational inequality (VI), and a working path set is predetermined. The numerical experiments are conducted on the Winnipeg network where a large number of paths are provided. The results show the multiple-path gradient projection algorithm outperforms the original GP method. Three different step size strategies, including the fixed step size, self-regulated averaging and self-adaptive Armijo’s strategies, are involved to draw a more general conclusion. Also, the effects of the path number on computational performance are analyzed. The multiple-path gradient projection (MGP) method converges much faster than the GP method when the path set size gets large.Keywords
This publication has 29 references indexed in Scilit:
- A framework for and empirical study of algorithms for traffic assignmentComputers & Operations Research, 2015
- A modified gradient projection algorithm for solving the elastic demand traffic assignment problemComputers & Operations Research, 2014
- Computation and application of the paired combinatorial logit stochastic user equilibrium problemComputers & Operations Research, 2014
- A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problemComputers & Operations Research, 2012
- Method of Successive Weighted Averages (MSWA) and Self-Regulated Averaging Schemes for Solving Stochastic User Equilibrium ProblemNetworks and Spatial Economics, 2007
- An algorithm for the stochastic user equilibrium problemTransportation Research Part B: Methodological, 1996
- Projected Dynamical Systems and Variational Inequalities with Applications1996
- Algorithms for solving fisk's stochastic traffic assignment modelTransportation Research Part B: Methodological, 1991
- Some developments in equilibrium traffic assignmentTransportation Research Part B: Methodological, 1980
- A probabilistic multipath traffic assignment model which obviates path enumerationTransportation Research, 1971