Is Dial-a-Ride Bus Reasonable in Large Scale Towns? Evaluation of Usability of Dial-a-Ride Systems by Simulation
Dial-a-ride systems are attracting attention as a new style of transportation systems for urban areas. While it has been reported that such systems improve the usability of bus systems when applied in a small town or area, it is not obvious how and under what conditions the systems are effective in comparison to traditional fixed-route bus systems. We conducted two computer simulations of dial-a-ride and fixed-route systems in order to compare the usability and profitability of both systems. Simulation results indicated that: (1) The usability of the dial-a-ride system with a fixed number of buses drops very quickly when the number of requests(demands) increases. (2) When we increase the number of buses proportionally to the number of demand, the usability of the dial-a-ride system is improved more significantly than that of the fixed-route system. (3) When frequency of demands is sufficiently, the dial-a-ride system is a reasonable solution from the both usability and profitability perspectives.
KeywordsTransportation Research Part Single Vehicle Unit Period Normal Route Route System
Unable to display preview. Download preview PDF.
- 2.Bianco, L., Mingozzi, A., Riccaiardelli, S., Spadoni, M.: Exact and heuristic procedures for the traveling salesman problem with procedence constraints, based on dynamic programming. In: INFOR., vol. 32, pp. 19–31 (1994)Google Scholar
- 3.William, A., Bailey, J., Thomas, D., Clark, J.: A simulation analysis of demand and fleet size effects on taxicab service rates. In: Proceedings of the 19th conference on Winter simulation, pp. 838–844. ACM Press, New York (1987)Google Scholar
- 7.Li, H., Lim, A.: A metaheuristic for the pickup and delivery problem with time windows. In: IEEE International Conference on Tools with Artificial Intelligence, vol. 13, pp. 160–167 (2001)Google Scholar
- 9.Cordeau, J.F., Laporte, G.: A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transportation Research Part B: Methodological (2003)Google Scholar
- 10.Silesia, Z.C.: Parallel simulated annealing for the delivery problem. In: The 9th Euromicro Workshop on Parallel and Distributed Processing, pp. 219–226 (2001)Google Scholar
- 11.Silesia, Z.C.: Parallel simulated annealing for the set-partitioning problem. In: The 8th Euromicro Workshop on Parallel and Distributed Processing, pp. 343–350 (2000)Google Scholar
- 14.Psarfatis, H.N.: Analysis of an o(n2) heuristic for the single vehicle many-to-many euclidean dial-a-ride problem. Transportation Research 17B, 133–145 (1983)Google Scholar
- 15.Psarfaits, H.N.: A exact algorithm for the single vehicle many-to-many dial-aride problem with time windows. Transportation Science 17, 315–357 (1983)Google Scholar
- 16.Psarfaits, H.N.: A dynamic programming solution to the single vehicle manyto- many immediate request dial-a-ride problem. Transportation Science 14, 135–154 (1980)Google Scholar
- 17.Grotschel, M., Hauptmeier, D., Krumke, S., Rambau, J.: Simulation studies for the online dial-a-ride-problem (1999)Google Scholar
- 20.Grotschel, M., Krumke, S.O., Rambau, J.: Online optimization of complex transportation systems (2001)Google Scholar