| Article ID: | iaor1989975 |
| Country: | United Kingdom |
| Volume: | 30 |
| Issue: | 10 |
| Start Page Number: | 491 |
| End Page Number: | 494 |
| Publication Date: | Oct 1989 |
| Journal: | Traffic Engineering and Control |
| Authors: | De Cea Ch. Joaquin, Fernandez L.J. Enrique |
| Keywords: | networks |
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.