Abstract
Dial-a-ride systems attract great attentions as a style of new transportation systems for urban areas. While it is reported that such systems improve usability of bus systems when applied in a small town or area, it is not obvious how and under what conditions the system are reasonable in comparison to traditional fixed-route bus systems. We conducted several computer simulations of dial-a-ride and fixed-route systems to compare usability and profitability of both systems. Simulation results indicated that: (1) Usability of the dial-a-ride system with a fixed number of buses drops very quickly when the number of demands increases. (2) When we increase the number of buses proportionally to the number of demands, the usability of the dial-a-ride system is improved more significantly than the fixed-route system. (3) When frequency of demands is sufficiently large, the dial-a-ride system offers a reasonable solution from both usability and profitability perspectives.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ascheuer, N., Krumke, S.O., Rambau, J.: Online dial-a-ride problems: Minimizing the completion time. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol. 1770, pp. 639–650. Springer, Heidelberg (2000)
Bailey Jr., W.A., Clark Jr., T.D.: 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)
Bodin, L.D., Golden, B.L., Assad, A., Ball, M.O.: Routing and scheduling of vehicles and crews: the state of the art. Computers and Operation Research 10, 63–211 (1983)
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)
Feuerstein, E., Stougie, L.: On-line single-server dial-a-ride problems. Theoretical Computer Science 268(1), 91–105 (2001)
Grotschel, M., Hauptmeier, D., Krumke, S., Rambau, J.: Simulation studies for the online dial-a-ride-problem (1999)
Grotschel, M., Krumke, S.O., Rambau, J.: Online optimization of complex transportation systems (2001)
Haghani, A., Banihashemi, M.: Heuristic approaches for solving large-scale bus transit vehicle scheduling problem with route time constraints. Transportation Research Part A: Policy and Practice 36(4), 309–333 (2002)
Hauptmeier, D., Krumke, S.O., Rambau, J.: The online dial-a-ride problem under reasonable load. In: Bongiovanni, G., Petreschi, R., Gambosi, G. (eds.) CIAC 2000. LNCS, vol. 1767, pp. 125–133. Springer, Heidelberg (2000)
Hauptmeier, D., Krumke, S.O., Rambau, J., Wirth, H.C.: Euler is standing in line dial-a-ride problems with precedence-constraints. Discrete Applied Mathematics 113(1), 87–107 (2001)
Healy, P., Moll, R.: A new extension of local search applied to the dial-a-ride problem. European Journal of Operations Research 83, 83–104 (1995)
Horn, M.E.T.: Multi-modal and demand-responsive passenger transport systems: a modelling framework with embedded control systems. Transportation Research Part A: Policy and Practice 36(2), 167–188 (2002)
Krumke, S.O., de Paepe, W.E., Poensgen, D., Stougie, L.: News from the online traveling repairman. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol. 2136, p. 487. Springer, Heidelberg (2001)
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)
Lipmann, M., Lu, X., de Paepe, W.E., Sitters, R.A., Stougie, L.: On-line dial-a-ride problems under a restricted information model. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 674–685. Springer, Heidelberg (2002)
Psarfaits, H.N.: A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transportation Science 14, 135–154 (1980)
Psarfaits, H.N.: A exact algorithm for the single vehicle many-to-many dial-a-ride problem with time windows. Transportation Science 17, 315–357 (1983)
Psarfatis, H.N.: Analysis of an o(n 2) heuristic for the single vehicle manyto- many euclidean dial-a-ride problem. Transportation Research 17B, 133–145 (1983)
Ruland, K.S., Rodin, E.Y.: The pickup and delivery problem: faces and branch-and-cut algorithm. Computers Math. Applic. 33(12), 1–13 (1997)
Silesia, Z.C.: Parallel simulated annealing for the setpartitioning problem. In: The 8th Euromicro Workshop on Parallel and Distributed Processing, pp. 343–350 (2000)
Silesia, Z.C.: Parallel simulated annealing for the delivery problem. In: The 9th Euromicro Workshop on Parallel and Distributed Processing, pp. 219–226 (2001)
Savelsbergh, M.W.P., Sol, M.: The general pickup and delivery program. Transportation Science 29(1), 17–29 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Noda, I., Ohta, M., Shinoda, K., Kumada, Y., Nakashima, H. (2003). Evaluation of Usability of Dial-a-Ride Systems by Social Simulation. In: Hales, D., Edmonds, B., Norling, E., Rouchier, J. (eds) Multi-Agent-Based Simulation III. MABS 2003. Lecture Notes in Computer Science(), vol 2927. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24613-8_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-24613-8_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20736-8
Online ISBN: 978-3-540-24613-8
eBook Packages: Springer Book Archive