LIBRARIES A Methodology for Bus Network Design

This thesis develops a methodology for solving the bus network design problem (BNDP) in which one seeks to determine the best configuration of bus routes and their frequencies, given information on the bus transit demand, the street network, the available resources and the operational constraints. The proposed methodology follows a heuristic approach and consists of two main components- route generation (RG) and vehicle allocation (VA)- that are implemented in a single automated design procedure. The proposed methodology addresses the principal shortcomings of previous heuristic approaches to the BNDP and is characterized by its ability to (1) incorporate the fleet size constraint within the route generation process, (2) identify the major trip patterns in the demand matrix for guidance in the route configuration, and (3) solve the BNDP using a general network design or a transit center network design. The RG procedure is based on the concept of route skeletons which consist of three nodes- two termini and one intermediate node- that are expanded into full routes by means of nodal insertions. RG creates one route at a time and estimates the number of buses required on the network after each route is generated. If the vehicle estimate is les