Abstract:
The standard traffic assignment problem (TAP) is often augmented with additional constraints to address non-standard applications. These models are called TAP with side constraints (TAPSC). Despite the rising significance of TAPSC models, the ability to efficiently solve them to satisfactory precision remains limited in real-world applications. The purpose of this paper is to fill this gap by integrating a recently developed high performance TAP solver, known as the path-based Greedy algorithm, with the augmented Lagrangian multiplier (ALM) method. This paper examines how precisely the subproblems in the ALM method should be solved to optimize the overall convergence performance. It is found that insufficiently converged subproblem solutions sometimes lead to catastrophic failures, although pursuing extremely high precision could also be counterproductive. Accordingly, it is proposed to adjust the precision required to solve the subproblems based on an approximate gap measured by the augmented Lagrangian. Results of numerical experiments show that adaptively adjusting the subproblem precision limit produces a 25% speed-up compared with the algorithm with a fixed limit.
