TRANSIT EQUILIBRIUM ASSIGNMENT - A MODEL AND SOLUTION ALGORITHMS

In this paper we propose a model for the transit equilibrium assignmen t problem (TEAP) and develop two algorithms for its solution. The beha vior of the transit users is modeled by using the concept of hyperpath s (strategies) on an appropriate network (general network) which is ob tained from the road network and the transit lines by a transformation which makes explicit the walk, wait, in-vehicle, transfer and alight arcs. The waiting (generalized) cost is a function of both frequency o f the transit lines and congestion effects due to queues at stops. The TEAP is stated and formulated as a variational inequality problem, in the space of hyperpath flows, and then solved by the linearized Jacob i method and the projection method. We prove the global convergence of these two algorithms for strongly monotone arc cost mappings. The imp lementation of the algorithms and computational experiments are presen ted as well.