|
Bus Transit has long been the most important public transportation mode in Tanwan however, due to the routes are not so well-designed on the basis of any scientific methodology, the netowork performance for the bus system is usually poor which results in low level-of-service for the Bus transit passengers. This paper presents five heuristic algorithms for bus routes alignment-by using the traffic assignment concetpts and network analysis theories, They are circular-route sweeping algorithm,noncircular-route sweeping algorithm, circular-route simples algorithm, noncircular-route simlpex algorithm and noncircularroute direct algorithm to evaluate the network performance resulted from these five algorithm, five indices are defined and a numerical example is illustrated in this paper. It is shown that the network performance is better for the circular-route than that for the noncircular-route, and the sweep algorithtm has the best network performance while the direct algorithm has the worst result. In order to demonstrate the applicability of these algorithm, an application of circular-route simplex algorithm to Taipei City Bus network design is presented as well.
|