Route Layout Analysis for Express Buses

For a fixed bus route, the path is the fundamental parameter that determines the passenger catchment area, which, via the dispatching policy, determines the timetable and fleet size. However, the path cannot be chosen independent of the other parameters; they have a symbiotic relationship, even though the planning time frames are different ranging from ‘years’ for the path of the route to ‘days’ for the crew schedule. The express route planning problem deals with the optimum selection of the sequence of passenger generators to be served by the planned route. An analytical model is developed to enable minimization of operating cost and costs of passenger access, waiting and travel times. Applications of this model have provided an insight to the relative importance of different cost components. The analytical model first selects an initial trial path for the purpose of comparison and then the optimum path is sought by considering a process of swapping, adding and removing generators or extending the route. Routes based on both grid and non-grid road networks are considered. In particular, non-grid road network based routes have a clear optimum. The cost of access is shown to be the influential parameter with respect to route selection. The insights gained from such analysis are highlighted.

[1]  R B Potts,et al.  Maintaining a bus schedule , 1964 .

[2]  Randy B Machemehl,et al.  Optimal Transit Route Network Design Problem with Variable Transit Demand: Genetic Algorithm Approach , 2006 .

[3]  Margaret O'Mahony,et al.  A Model for Development of Optimized Feeder Routes and Coordinated Schedules—A Genetic Algorithms Approach , 2006 .

[4]  G. F. Newell Dispatching Policies for a Transportation Route , 1971 .

[5]  S. Ranjithan,et al.  The design of bus route systems — An interactive location-allocation approach , 1987 .

[6]  Gregory Gutin,et al.  Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP , 2001, Discret. Appl. Math..

[7]  Ruey Long Cheu,et al.  Simulation evaluation of route-based control of bus operations , 2002 .

[8]  Satish V. Ukkusuri,et al.  Robust Transportation Network Design Under Demand Uncertainty , 2007, Comput. Aided Civ. Infrastructure Eng..

[9]  Michel Gendreau,et al.  A heuristic for the location of a rapid transit line , 2002, Comput. Oper. Res..

[10]  S. C. Wirasinghe RE-EXAMINATION OF NEWELL'S DISPATCHING POLICY AND EXTENSION TO A PUBLIC BUS ROUTE WITH MANY TO MANY TIME-VARYING DEMAND , 1990 .

[11]  Chuntian Cheng,et al.  A Parallel Ant Colony Algorithm for Bus Network Optimization , 2007, Comput. Aided Civ. Infrastructure Eng..

[12]  Steven I-Jy Chien,et al.  GENETIC ALGORITHM APPROACH FOR TRANSIT ROUTE PLANNING AND DESIGN , 2001 .

[13]  Michel Gendreau,et al.  LOCATING A TRANSIT LINE USING TABU SEARCH , 1996 .

[14]  R M Jorgensen,et al.  Solving the Dial-a-Ride problem using genetic algorithms , 2007, J. Oper. Res. Soc..

[15]  John E. Beasley,et al.  A tabu search algorithm for the single vehicle routing allocation problem , 2007, J. Oper. Res. Soc..

[16]  S. C. Wirasinghe,et al.  Optimal schedule design for a transit route with one intermediate time point , 1995 .

[17]  S. C. Wirasinghe,et al.  Spacing of Bus-Stops for Many to Many Travel Demand , 1981 .