ABSTRACT
This paper develops a route generation model for the transit network design problem. The generation of a large candidate route set is a preliminary step in the optimization of network design, which has a significant influence on its quality. Existing methods for route generation are widely based on variations of shortest path algorithms, generating fast routes between high demand centers. The idea of the proposed model is to form routes on corridor links, with high overall demand, in order to strengthen the service attractiveness. The suggested model form two types of routes: the commonly used shortest path and path that pass through high demand corridors. The model is compared to a shortest path method, and show a higher coverage of the network, producing a wider variety of routes, including links that combine multiple demands.
