A multiple-path gradient projection method for solving the logit-based stochastic user equilibrium model

Loading...
Thumbnail Image

Persistent link to this item

Statistics
View Statistics

Journal Title

Journal ISSN

Volume Title

Title

A multiple-path gradient projection method for solving the logit-based stochastic user equilibrium model

Published Date

2020

Publisher

Journal of Transport and Land Use

Type

Article

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.

Description

This article is part of Special Issue: Innovations for Transport Planning in China.

Related to

Replaces

License

Series/Report Number

Funding information

Isbn identifier

Doi identifier

10.5198/jtlu.2020.1600

Previously Published Citation

Suggested citation

Tan, Heqing; Du, Muqing; Yu, Chun-bin. (2020). A multiple-path gradient projection method for solving the logit-based stochastic user equilibrium model. Retrieved from the University Digital Conservancy, 10.5198/jtlu.2020.1600.

Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.