A New Path-Based Algorithm for Static Traffic Assignment: Nonlinear Complementarity Problem (NCP) Solving Approach

抄録

This paper presents a new path-based algorithm for the static traffic assignment involving in solving the equilibrium conditions as the nonlinear complementarity problems. The algorithm would be a result of two existing path-based algorithms combined together. The nonlinear complementarity problem (NCP) is further developed as the unconstrained minimization problem which has global minima of zero value at all the complementarity problem solutions. In this paper, numerical tests were implemented based on the real network data. The obtained results, comparable with the Bar Gera origin-based algorithms results, show the applicability of the algorithm with the large-scale networks. The discussion, furthermore, on how to improve the computing time of the path-based algorithm is also provided.