Skip to main content
Springer Nature Link
Log in

Scalability of Dial-a-Ride Systems—A Case Study to Assess Utilities of Ubiquitous Mass User Support

  • Conference paper
Massively Multi-Agent Systems I (MMAS 2004)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3446))

Included in the following conference series:

  • 534 Accesses

Abstract

Evaluation of scalability and usability of dial-a-ride systems is reported as a case study to assess utilities of ubiquitous mass user support. One of applications of ubiquitous and multi-agent systems is transportation system in urban area. While multi-agent and ubiquitous systems are considered to support next-generation social systems, it is not clear how it provides advantage in usability and benefit. We will show a result of comparison between dial-a-ride bus systems, one of possible multi-agent application of transportation systems, and traditional fixed-route bus systems.

We conduct experiments of various situation and show how the advantage of dial-a-ride is robust to the variation of social conditions. For example, when many demands occur from/to a certain point like railway stations or shopping centers, improvement of usability of dial-a-ride systems is better than one of fixed-route systems so that a break-even point between the two systems is reduced. This means that dial-a-ride systems are useful even in ’rush-hour’. Through these experiments, we will figure out the conditions where multi-agent like systems have advantage against traditional systems.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. 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)

    Google Scholar 

  2. 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)

    Article  MathSciNet  Google Scholar 

  3. 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, 32th edn., pp. 19–31 (1994)

    Google Scholar 

  4. 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)

    Article  MATH  MathSciNet  Google Scholar 

  5. 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)

    Article  MATH  Google Scholar 

  6. 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, vol. 2136, p. 487. Springer, Heidelberg (2001)

    Chapter  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 

  8. Noda, I., Ohta, M., Shinoda, K., Kumada, Y., Nakashima, H.: Evaluation of usability of dial-a-ride systems by social simulation. In: Proc. of Fourth International Workshop on Multi-Agent-Based Simulation, July 2003, pp. 139–152 (2003)

    Google Scholar 

  9. 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)

    Article  MATH  MathSciNet  Google Scholar 

  10. 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 

  11. 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 

  12. Savelsbergh, M.W.P., Sol, M.: The general pickup and delivery program. Transportation Science 29(1), 17–29 (1995)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Information Technology Research Institute, AIST, 2-41-6 Aomi, Koto-ku, Tokyo, 135-0064, Japan

    Noda Itsuki

Authors
  1. Noda Itsuki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Social Informatics, Kyoto University, 606-8501, Kyoto, Japan

    Toru Ishida

  2. Graduate School of Library and Information Science, University of Illinois at Urbana-Champaign, 61801, Urbana, IL, USA

    Les Gasser

  3. Future University - Hakodate, 116-2 Kameda-Nakanocho, Hakodate, 041-8655, Hokkaido, Japan

    Hideyuki Nakashima

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Itsuki, N. (2005). Scalability of Dial-a-Ride Systems—A Case Study to Assess Utilities of Ubiquitous Mass User Support. In: Ishida, T., Gasser, L., Nakashima, H. (eds) Massively Multi-Agent Systems I. MMAS 2004. Lecture Notes in Computer Science(), vol 3446. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11512073_24

Download citation

  • DOI: https://doi.org/10.1007/11512073_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26974-8

  • Online ISBN: 978-3-540-31889-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics