Abstract

. In this paper we develop an algorithm for solving a version of the (static) traffic equilibrium problem in which the cost incurred on each path is not simply the sum of the costs on the arcs that constitute that path. The method we describe is based on the recent NE/SQP algorithm, a fast and robust technique for solving nonlinear complementarity problems. Finally, we present an example that illustrates both the importance of using nonadditive costs and the effectiveness of the NE/SQP method. 1 Introduction In modeling (static) traffic equilibria, researchers have generally made use of what is known as the additive model. In this approach, the path costs faced by users of the traffic network are simply the sum of the arc costs for all the arcs on the path in question. While this modeling assumption is computationally attractive, it is not appropriate in a variety of realistic and important situations. Gabriel and Bernstein [8] provide several examples in which nonadditivity is more a...

Citations