A self-adaptive Armijo stepsize strategy with application to traffic assignment models and algorithms
Authors:
- 1 September 2013
- journal article
- research article
- Published by Taylor & Francis in Transportmetrica A: Transport Science
- Vol. 9 (8) , 695-712
Abstract
Stepsize determination is an important component of algorithms for solving several mathematical formulations. In this article, a self-adaptive Armijo strategy is proposed to determine an acceptable stepsize in a more efficient manner. Instead of using a fixed initial stepsize in the original Armijo strategy, the proposed strategy allows the starting stepsize per iteration to be self-adaptive. Both the starting stepsize and the acceptable stepsize are thus allowed to decrease as well as increase by making use of the information derived from previous iterations. This strategy is then applied to three well-known algorithms for solving three traffic equilibrium assignment problems with different complexity. Specifically, we implement this self-adaptive strategy in the link-based Frank–Wolfe algorithm, the route-based disaggregate simplicial decomposition algorithm and the route-based gradient projection algorithm for solving the classical user equilibrium problem, the multinomial logit-based stochastic user equilibrium (MNL SUE) and the congestion-based C-logit SUE problem, respectively. Some numerical results are also provided to demonstrate the efficiency and applicability of the proposed self-adaptive Armijo stepsize strategy implemented in traffic assignment algorithms.Keywords
This publication has 21 references indexed in Scilit:
- A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problemComputers & Operations Research, 2012
- A modified Armijo rule for the online selection of learning rate of the LMS algorithmDigital Signal Processing, 2009
- A Path‐Based Algorithm for the Cross‐Nested Logit Stochastic User Equilibrium Traffic AssignmentComputer-Aided Civil and Infrastructure Engineering, 2009
- EFFECTS OF CHOICE SET SIZE AND ROUTE CHOICE MODELS ON PATH-BASED TRAFFIC ASSIGNMENTTransportmetrica, 2008
- Computational study of state-of-the-art path-based traffic assignment algorithmsMathematics and Computers in Simulation, 2002
- An algorithm for the stochastic user equilibrium problemTransportation Research Part B: Methodological, 1996
- Some developments in equilibrium traffic assignmentTransportation Research Part B: Methodological, 1980
- On Stochastic Models of Traffic AssignmentTransportation Science, 1977
- Minimization of functions having Lipschitz continuous first partial derivativesPacific Journal of Mathematics, 1966
- An algorithm for quadratic programmingNaval Research Logistics Quarterly, 1956