skip to main content
10.1145/3678717.3691314acmconferencesArticle/Chapter ViewAbstractPublication PagesgisConference Proceedingsconference-collections
research-article

Revisiting the Bus Stop Problem in Road Networks

Published: 22 November 2024 Publication History

Abstract

We revisit an interesting route planning problem introduced by Reza, Ali and Cheema [15] that we call the Bus Stop Problem (BSP). Given a road network and a set of agents with individual start and goal positions, find an appropriate start and stop position for a bus such that the agents reach their goals as fast as possible (by taking the bus). We show how this problem can be solved optimally by a modification of Dijkstra's algorithm, substantially improving and simplifying the approaches suggested in [15]. Furthermore, we consider multiple objective functions and discuss a natural generalization of the BSP that can be solved efficiently as well.

References

[1]
Dor Atzmon, Jiaoyang Li, Ariel Felner, Eliran Nachmani, Shahaf Shperberg, Nathan Sturtevant, and Sven Koenig. [n.d.]. Multi-Directional Heuristic Search. International Joint Conference on Artificial Intelligence (IJCAI) ([n. d.]). https://doi.org/10.24963/ijcai.2020/562
[2]
Lu Chen, Qilu Zhong, Xiaokui Xiao, Yunjun Gao, Pengfei Jin, and Christian S. Jensen. 2018. Price-and-Time-Aware Dynamic Ridesharing. In 2018 IEEE 34th International Conference on Data Engineering (ICDE). 1061--1072. https://doi.org/10.1109/ICDE.2018.00099
[3]
Edsger W Dijkstra et al. 1959. A note on two problems in connexion with graphs. Numerische mathematik 1, 1 (1959), 269--271.
[4]
Andrés Fielbaum. 2022. Optimizing a vehicle's route in an on-demand ridesharing system in which users might walk. Journal of Intelligent Transportation Systems 26, 4 (2022), 432--447. https://doi.org/10.1080/15472450.2021.1901225 arXiv:https://doi.org/10.1080/15472450.2021.1901225
[5]
Andres Fielbaum, Xiaoshan Bai, and Javier Alonso-Mora. 2021. On-demand ridesharing with optimized pick-up and drop-off walking locations. Transportation Research Part C: Emerging Technologies 126 (2021), 103061. https://doi.org/10.1016/j.trc.2021.103061
[6]
Michael L Fredman and Robert Endre Tarjan. 1987. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM (JACM) 34, 3 (1987), 596--615.
[7]
Çağri Koç, Gilbert Laporte, and İlknur Tükenmez. 2020. A review of vehicle routing with simultaneous pickup and delivery. Computers & Operations Research 122 (2020), 104987.
[8]
Lei Li, Mengxuan Zhang, Wen Hua, and Xiaofang Zhou. 2020. Fast Query Decomposition for Batch Shortest Path Processing in Road Networks. In 2020 IEEE 36th International Conference on Data Engineering (ICDE). 1189--1200. https://doi.org/10.1109/ICDE48307.2020.00107
[9]
Rong-Hua Li, Lu Qin, Jeffrey Xu Yu, and Rui Mao. 2016. Optimal Multi-Meeting-Point Route Search. IEEE Transactions on Knowledge and Data Engineering 28, 3 (2016), 770--784. https://doi.org/10.1109/TKDE.2015.2492554
[10]
Zhidan Liu, Zengyang Gong, Jiangzhou Li, and Kaishun Wu. 2020. Mobility-Aware Dynamic Taxi Ridesharing. In 2020 IEEE 36th International Conference on Data Engineering(ICDE). 961--972. https://doi.org/10.1109/ICDE48307.2020.00088
[11]
Hossain Mahmud, Ashfaq Mahmood Amin, Mohammed Eunus Ali, Tanzima Hashem, and Sarana Nutanong. 2013. A group based approach for path queries in road networks. In Advances in Spatial and Temporal Databases: 13th International Symposium, SSTD 2013, Munich, Germany, August 21-23, 2013. Proceedings 13. Springer, 367--385.
[12]
OpenStreetMap contributors. 2024. Planet dump retrieved from https://planet.osm.org. https://www.openstreetmap.org.
[13]
Erhun özkan and Amy R Ward. 2020. Dynamic matching for real-time ride sharing. Stochastic Systems 10, 1 (2020), 29--70.
[14]
Zhiwei (Tony) Qin, Hongtu Zhu, and Jieping Ye. 2022. Reinforcement learning for ridesharing: An extended survey. Transportation Research Part C: Emerging Technologies 144 (2022), 103852. https://doi.org/10.1016/j.trc.2022.103852
[15]
Radi Muhammad Reza, Mohammed Eunus Ali, and Muhammad Aamir Cheema. 2017. The Optimal Route and Stops for a Group of Users in a Road Network. In Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (Redondo Beach, CA, USA) (SIGSPATIAL '17). Association for Computing Machinery, New York, NY, USA, Article 4, 10 pages. https://doi.org/10.1145/3139958.3140061
[16]
Amirmahdi Tafreshian, Neda Masoud, and Yafeng Yin. 2020. Frontiers in service science: Ride matching for peer-to-peer ride sharing: A review and future directions. Service Science 12, 2--3 (2020), 44--60.

Index Terms

  1. Revisiting the Bus Stop Problem in Road Networks

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    SIGSPATIAL '24: Proceedings of the 32nd ACM International Conference on Advances in Geographic Information Systems
    October 2024
    743 pages
    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].

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 22 November 2024

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. Collective Travel Planning
    2. Multi-agent Route Planning
    3. Optimal Route and Stops
    4. Ride Sharing
    5. Road Networks
    6. Traveling Salesperson Problem

    Qualifiers

    • Research-article
    • Research
    • Refereed limited

    Conference

    SIGSPATIAL '24
    Sponsor:

    Acceptance Rates

    SIGSPATIAL '24 Paper Acceptance Rate 37 of 122 submissions, 30%;
    Overall Acceptance Rate 257 of 1,238 submissions, 21%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • 0
      Total Citations
    • 30
      Total Downloads
    • Downloads (Last 12 months)30
    • Downloads (Last 6 weeks)18
    Reflects downloads up to 14 Jan 2025

    Other Metrics

    Citations

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media