skip to main content
10.1145/3144457.3144483acmotherconferencesArticle/Chapter ViewAbstractPublication PagesmobiquitousConference Proceedingsconference-collections
research-article

From Ride-Sourcing to Ride-Sharing through Hot-Spots

Published:07 November 2017Publication History

ABSTRACT

Smartphones have allowed us to make ad-hoc travel arrangements. Ride-sharing is emerging as one of the new types of transportation enabled by smartphone revolution. Ride-sharing aims to alleviate current environmental, social and economical issues many big cities are facing due to low vehicle occupancy rates. Although ride-sharing companies have millions of users around the world, some of them do not offer true ride-sharing but a similar service called ride-sourcing where private car owners provide for-hire rides. Ride-sharing uptake has not been wide due to lack of convenience and incentives. We propose an enhanced ride-sharing model through the inclusion of proper places to meet that we call hot-spots. Hot-spots are shown to increase the convenience by solving the round-trip ride-sharing problem. As we represent our enhanced model through graphs, we introduce a new graph problem that we call Constrained Variable Steiner Tree, which is NP-hard. An effective and readily deployable heuristic solution to this problem is presented which is up to two orders of magnitude faster than the state-of-the-art solution as combinatorial explosion is avoided by the usage of a novel monotonic nondecreasing function.

References

  1. Victorian Department of Transport. Victorian Integrated Survey of Travel and Activity (2009-2010), 2011.Google ScholarGoogle Scholar
  2. K. Aissat and A. Oulamara. Dynamic ride-sharing with intermediate locations. In Computational Intelligence in Vehicles and Transportation Systems (CIVTS), 2014 IEEE Symposium on, pages 36--42. IEEE, 2014.Google ScholarGoogle ScholarCross RefCross Ref
  3. V. Chaube, A. L. Kavanaugh, and M. A. Perez-Quinones. Leveraging social networks to embed trust in rideshare programs. In System Sciences (HICSS), 2010 43rd Hawaii International Conference on, pages 1--8. IEEE, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. S. E. Dreyfus and R. A. Wagner. The Steiner problem in graphs. Networks, 1(3):195--207, 1972.Google ScholarGoogle ScholarCross RefCross Ref
  5. P. Goel, L. Kulik, and K. Ramamohanarao. Optimal pick up point selection for effective ride sharing. IEEE Transactions on Big Data, 2016.Google ScholarGoogle Scholar
  6. M. Olsen. On the complexity of computing optimal private park-and-ride plans. In International Conference on Computational Logistics, pages 73--82. Springer, 2013.Google ScholarGoogle ScholarCross RefCross Ref
  7. OpenStreetMap contributors. Planet dump retrieved from https://planet.osm.org. https://www.openstreetmap.org, 2017.Google ScholarGoogle Scholar
  8. M. Rahman, O. Correa, E. Tanin, L. Kulik, and K. Ramamohanarao. Ride-sharing is about agreeing on a destination. In Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (in press). ACM, 2017. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. M. Stiglic, N. Agatz, M. Savelsbergh, and M. Gradisar. The benefits of meeting points in ride-sharing systems. Transportation Research Part B: Methodological, 82:36--53, 2015.Google ScholarGoogle ScholarCross RefCross Ref
  10. K. Takise, Y. Asano, and M. Yoshikawa. Multi-user routing to single destination with confluence. In Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, page 72. ACM, 2016. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Y. Wang, R. Kutadinata, and S. Winter. Activity-based ridesharing: increasing flexibility by time geography. In Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pages 1:1--1:10. ACM, 2016. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. X. Zhang, Y. Asano, and M. Yoshikawa. Mutually beneficial confluent routing. IEEE Transactions on Knowledge and Data Engineering, 28(10):2681--2696, 2016. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. From Ride-Sourcing to Ride-Sharing through Hot-Spots

    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
    • Published in

      cover image ACM Other conferences
      MobiQuitous 2017: Proceedings of the 14th EAI International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services
      November 2017
      555 pages
      ISBN:9781450353687
      DOI:10.1145/3144457

      Copyright © 2017 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 ACM 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: 7 November 2017

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
      • Research
      • Refereed limited

      Acceptance Rates

      Overall Acceptance Rate26of87submissions,30%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader