skip to main content
research-article
Open Access

Empty Vehicle Redistribution with Time Windows in Autonomous Taxi Systems

Authors Info & Claims
Published:03 January 2021Publication History
Skip Abstract Section

Abstract

In this article, we investigate empty vehicle redistribution algorithms with time windows for personal rapid transit or autonomous station-based taxi services, from a passenger service perspective. We present an Index Based Redistribution Time Limited algorithm that improves upon existing algorithms by incorporating expected passenger arrivals and predicted waiting times limitations. We evaluate 17 variations of algorithms on a test case in Stockholm, Sweden. The results show that the combination of Send The Nearest and Index Based Redistribution Time Limited algorithms provides promising results for both Poisson arrivals and real demand, outperforming the other tested methods, in terms of passenger waiting time and number of passengers not served within their time windows.

References

  1. Ingmar Andréasson. 2003. Reallocation of empty personal rapid transit vehicles en route. Transportation Research Record 1838 (2003), 36--41.Google ScholarGoogle Scholar
  2. Tatiana Babicheva, Wilco Burghout, Ingmar Andréasson, and Nadege Faul. 2018. Empty vehicle redistribution and fleet-size in autonomous taxi systems. IET Intelligent Transport Systems 13, 4 (2018), 677--682.Google ScholarGoogle Scholar
  3. Tatiana Babicheva, Wilco Burghout, Ingmar Andréasson, and Nadege Faul. 2018. The matching problem of empty vehicle redistribution in autonomous taxi systems. Procedia Computer Science 130 (2018), 119--125.Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Tatiana Babicheva, Wilco Burghout, Ingmar Andréasson, and Nadege Faul. 2018. The matching problem of empty vehicle redistribution in autonomous taxi systems. Procedia Computer Science 130 (2018), 119--125.Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Gary S. Becker. 1965. A theory of the allocation of time. Economic Journal 75, 299 (1965), 493--517.Google ScholarGoogle ScholarCross RefCross Ref
  6. Michael G. H. Bell and K. I. Wong. 2005. A rolling horizon approach to the optimal dispatching of taxis. In Proceedings of the 16th International Symposium on Transportation and Traffic Theory: Flow, Dynamics, and Human Interaction. 629--648.Google ScholarGoogle Scholar
  7. Maria Börjesson and Jonas Eliasson. 2014. Experiences from the Swedish value of time study. Transportation Research Part A: Policy and Practice 59 (2014), 144--158.Google ScholarGoogle ScholarCross RefCross Ref
  8. Leo Breiman. 1963. The Poisson tendency in traffic distribution. Annals of Mathematical Statistics 34, 1 (1963), 308--311.Google ScholarGoogle ScholarCross RefCross Ref
  9. Wilco Burghout. 2004. A Note on the Number of Replication Runs in Stochastic Traffic Simulation Models. Unpublished Report. Centre for Traffic Research, Stockholm, Sweden.Google ScholarGoogle Scholar
  10. Wilco Burghout, Pierre Jean Rigole, and Ingmar Andréasson. 2015. Impacts of shared autonomous taxis in a metropolitan area. In Proceedings of the 94th Annual Meeting of the Transportation Research Board.Google ScholarGoogle Scholar
  11. Nicolas Chiabaut and Christine Buisson. 2009. Replications in stochastic traffic flow models: Incremental method to determine sufficient number of runs. In Traffic and Granular Flow ’07. Springer, 35--44.Google ScholarGoogle Scholar
  12. Allan C. DeSerpa. 1971. A theory of the economics of time. Economic Journal 81, 324 (1971), 828--846.Google ScholarGoogle ScholarCross RefCross Ref
  13. Martin Desrochers, Jacques Desrosiers, and Marius Solomon. 1992. A new optimization algorithm for the vehicle routing problem with time windows. Operations Research 40, 2 (1992), 342--354.Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Alan W. Evans. 1972. On the theory of the valuation and allocation of time. Scottish Journal of Political Economy 19, 1 (1972), 1--17.Google ScholarGoogle ScholarCross RefCross Ref
  15. Daniel J. Fagnant and Kara M. Kockelman. 2018. Dynamic ride-sharing and fleet sizing for a system of shared autonomous vehicles in Austin, Texas. Transportation 45 (2018), 143--158.Google ScholarGoogle ScholarCross RefCross Ref
  16. Ezzeddine Fatnassi, Olfa Chebbi, and Jouhaina Chaouachi. 2017. Dealing with the empty vehicle movements in personal rapid transit system with batteries constraints in a dynamic context. Journal of Advanced Transportation 2017 (2017), Article 8512728.Google ScholarGoogle Scholar
  17. Richard Gilbert and Anthony Perl. 2007. Grid-connected vehicles as the core of future land-based transport systems. Energy Policy 35, 5 (2007), 3053--3060.Google ScholarGoogle Scholar
  18. Kyle Guan, Joseph Kakande, and Junho Cho. 2016. On deploying encryption solutions to provide secure transport-as-a-service (TaaS) in core and metro networks. In Proceedings of the 42nd European Conference on Optical Communication (ECOC’16). 1--3.Google ScholarGoogle Scholar
  19. Robert Hendershot. 1975. Morgantown Personal Rapid Transit System, System Operation Description Manual. Technical Report. M-PRT-1-1. Boeing Aerospace.Google ScholarGoogle Scholar
  20. Lars Hultkrantz and Reza Mortazavi. 2001. Anomalies in the value of travel-time changes. Journal of Transport Economics and Policy 35, 2 (2001), 285--299.Google ScholarGoogle Scholar
  21. Sergio R. Jara-Díaz. 2008. Allocation and valuation of travel time savings. Handbook of Transport Modelling 2 (2008), 363--379.Google ScholarGoogle Scholar
  22. Shenggong Ji. 2019. A deep reinforcement learning-enabled dynamic redeployment system for mobile ambulances. In Proceedings of the ACM on Interactive, Mobile, Wearable, and Ubiquitous Technologies, Vol. 3.1 (2019), 15. ACM, New York, NY.Google ScholarGoogle Scholar
  23. Alvina Kek, Ruey Cheu, and Miaw Chor. 2006. Relocation simulation model for multiple-station shared-use vehicle systems. Transportation Research Record 1986 (2006), 81--88.Google ScholarGoogle ScholarCross RefCross Ref
  24. John D. Lees-Miller. 2016. Minimising average passenger waiting time in personal rapid transit systems. Annals of Operations Research 236, 2 (2016), 405--424.Google ScholarGoogle ScholarCross RefCross Ref
  25. Yexin Li, Zheng Yu, and Yang Qiang. 2019. Efficient and effective express via contextual cooperative reinforcement learning. In Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, New York, NY.Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Thomas E. Lisco. 1968. Value of Commuters Travel Time: A Study in Urban Transportation. Technical Report. Highway Research Record.Google ScholarGoogle Scholar
  27. Phathinan Thaithatkul, Toru Seo, Takahiko Kusakabe, and Yasuo Asakura. 2016. Simulation approach for investigating dynamics of passenger matching problem in smart ridesharing system. In Proceedings of the International Symposium of Transport Simulation and the International Workshop on Traffic Data Collection and Its Standardisation.Google ScholarGoogle Scholar
  28. William G. Waters. 1994. The value of travel time savings and the link with income: Implications for public project evaluation. International Journal of Transport Economics 21, 3 (1994), 243--253.Google ScholarGoogle Scholar
  29. Yale Z. Wong, David A. Hensher, and Corinne Mulley. 2017. Emerging transport technologies and the modal efficiency framework: A case for mobility as a service (MaaS). In Proceedings of the 15th International Conference on Competition and Ownership in Land Passenger Transport.Google ScholarGoogle Scholar
  30. Zhe Xu. 2018. Large-scale order dispatch in on-demand ride-hailing platforms: A learning and planning approach.. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, New York, NY.Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Empty Vehicle Redistribution with Time Windows in Autonomous Taxi Systems

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in

          Full Access

          • Published in

            cover image ACM/IMS Transactions on Data Science
            ACM/IMS Transactions on Data Science  Volume 2, Issue 1
            Survey Paper, Special Issue on Urban Computing and Smart Cities and Regular Paper
            February 2021
            167 pages
            ISSN:2691-1922
            DOI:10.1145/3446658
            Issue’s Table of Contents

            Copyright © 2021 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 3 January 2021
            • Accepted: 1 August 2020
            • Revised: 1 June 2020
            • Received: 1 June 2019
            Published in tds Volume 2, Issue 1

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • research-article
            • Research
            • Refereed

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader

          HTML Format

          View this article in HTML Format .

          View HTML Format