TRANSIT ASSIGNMENT TO MINIMAL ROUTES: AN EFFICIENT NEW ALGORITHM
John Andrews, J E Fernandez Larranaga · Traffic engineering & control · 1988
The mathematical formulation of the transit assignment problem to minimal routes is presented. Then, an efficient solution algorithm is derived which dramatically reduces the execution time when compared with the traditional Chriqui and Robillard's algorithm and its heuristic simplifications