Abstract

In this work we present a two-stage approach for designing rapid transit networks. It is basedon another approach that we described elsewhere. In the first stage, the stations and links to beconstructed are selected by solving an integer linear programming model that maximizes anestimation of the number of trips through the rapid transit network. In the second stage, a set oflines is generated by utilizing a greedy heuristic procedure that, taking into consideration thetransfers that should be made by the users to arrive at their destinations, attempts to maximizea more accurate estimation for the number of trips. This new estimation is done by meansof a modification of the well-known Floyd-Warshall algorithm. The main contributions area novel way of computing the expected number of trips by making use of the results from asurvey amongst the potential users of the rapid transit network, as well as the contemplationof the possibility of linking certain pairs of station locations by more than one line. Somecomputational experiments on several randomly generated instances are also reported.

Item Type:

Working Paper or Technical Report

Uncontrolled Keywords:

Station and link location, Line designing, Shortest route, Transfer, Degree of a node, Greedy heuristic procedure