TRANSIT ASSIGNMENT TO MINIMAL ROUTES: AN EFICIENT NEW ALGORITHM

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