IDEAS home Printed from https://ideas.repec.org/a/spr/snopef/v2y2021i3d10.1007_s43069-021-00076-x.html
   My bibliography  Save this article

Improved Bounds for Revenue Maximization in Time-Limited Online Dial-a-Ride

Author

Listed:
  • Ananya D. Christman

    (Middlebury College)

  • Christine Chung

    (Connecticut College)

  • Nicholas Jaczko

    (Middlebury College)

  • Tianzhi Li

    (Middlebury College)

  • Scott Westvold

    (Middlebury College)

  • Xinyue Xu

    (Middlebury College)

  • David Yuen

Abstract

In the Online Dial-a-Ride Problem (OLDARP), a server travels to serve requests for rides. We consider a variant where each request specifies a source, destination, release time, and revenue that is earned for serving the request. The goal is to maximize the total revenue earned within a given time limit. We first prove that no non-preemptive deterministic online algorithm can be guaranteed to earn more than half the revenue earned by opt. We then investigate the segmented best path (sbp) algorithm of [1]. The previously established lower and upper bounds for the competitive ratio of sbp are 4 and 6, respectively, under reasonable assumptions about the input instance. We eliminate the gap by proving that the competitive ratio is 5 (under the same assumptions) and also prove that this bound is tight. When revenues are uniform, we prove that sbp has competitive ratio 4. Next we provide a competitive analysis of sbp on complete bipartite graphs. We then consider this problem on the uniform metric and revisit the bp algorithm of [1]; we provide an instance where the algorithm's competitive ratio is unbounded. We conclude with experimental results that suggest that sbp would be effective if applied in practice.

Suggested Citation

  • Ananya D. Christman & Christine Chung & Nicholas Jaczko & Tianzhi Li & Scott Westvold & Xinyue Xu & David Yuen, 2021. "Improved Bounds for Revenue Maximization in Time-Limited Online Dial-a-Ride," SN Operations Research Forum, Springer, vol. 2(3), pages 1-38, September.
    • Handle: RePEc:spr:snopef:v:2:y:2021:i:3:d:10.1007_s43069-021-00076-x
    DOI: 10.1007/s43069-021-00076-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s43069-021-00076-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s43069-021-00076-x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Ananya Christman & William Forcier & Aayam Poudel, 2018. "From theory to practice: maximizing revenues for on-line dial-a-ride," Journal of Combinatorial Optimization, Springer, vol. 35(2), pages 512-529, February.
    2. Yves Molenbruch & Kris Braekers & An Caris, 2017. "Typology and literature review for dial-a-ride problems," Annals of Operations Research, Springer, vol. 259(1), pages 295-325, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Daniel Y. Mo & H. Y. Lam & Weikun Xu & G. T. S. Ho, 2020. "Design of Flexible Vehicle Scheduling Systems for Sustainable Paratransit Services," Sustainability, MDPI, vol. 12(14), pages 1-18, July.
    2. MELIS, Lissa & SÖRENSEN, Kenneth, 2021. "The real-time on-demand bus routing problem: What is the cost of dynamic requests?," Working Papers 2021003, University of Antwerp, Faculty of Business and Economics.
    3. Molenbruch, Yves & Braekers, Kris & Caris, An, 2017. "Benefits of horizontal cooperation in dial-a-ride services," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 107(C), pages 97-119.
    4. Itani, Alaa & Klumpenhouwer, Willem & Shalaby, Amer & Hemily, Brendon, 2024. "Guiding principles for integrating on-demand transit into conventional transit networks: A review of literature and practice," Transport Policy, Elsevier, vol. 147(C), pages 183-197.
    5. Lian, Ying & Lucas, Flavien & Sörensen, Kenneth, 2024. "Prepositioning can improve the performance of a dynamic stochastic on-demand public bus system," European Journal of Operational Research, Elsevier, vol. 312(1), pages 338-356.
    6. Schulz, Arne & Pfeiffer, Christian, 2024. "Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems," European Journal of Operational Research, Elsevier, vol. 312(2), pages 456-472.
    7. Masmoudi, Mohamed Amine & Hosny, Manar & Demir, Emrah & Genikomsakis, Konstantinos N. & Cheikhrouhou, Naoufel, 2018. "The dial-a-ride problem with electric vehicles and battery swapping stations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 392-420.
    8. Tal Grinshpoun & Elad Shufan & Hagai Ilani & Vadim Levit & Haya Brama, 2023. "Graph representation of the fixed route dial-a-ride problem," Journal of Scheduling, Springer, vol. 26(5), pages 479-495, October.
    9. (Edward) Kim, Myungseob & Levy, Joshua & Schonfeld, Paul, 2019. "Optimal zone sizes and headways for flexible-route bus services," Transportation Research Part B: Methodological, Elsevier, vol. 130(C), pages 67-81.
    10. Jodeau, Jean & Absi, Nabil & Chevrier, Rémy & Feillet, Dominique, 2024. "The rail-road Dial-a-Ride problem," European Journal of Operational Research, Elsevier, vol. 318(2), pages 486-499.
    11. Mina Roohnavazfar & Seyed Hamid Reza Pasandideh, 2022. "Decomposition algorithm for the multi-trip single vehicle routing problem with AND-type precedence constraints," Operational Research, Springer, vol. 22(4), pages 4253-4285, September.
    12. Sharif Azadeh, Sh. & Atasoy, Bilge & Ben-Akiva, Moshe E. & Bierlaire, M. & Maknoon, M.Y., 2022. "Choice-driven dial-a-ride problem for demand responsive mobility service," Transportation Research Part B: Methodological, Elsevier, vol. 161(C), pages 128-149.
    13. Rossana Cavagnini & Valentina Morandi, 2021. "Implementing Horizontal Cooperation in Public Transport and Parcel Deliveries: The Cooperative Share-A-Ride Problem," Sustainability, MDPI, vol. 13(8), pages 1-20, April.
    14. Ho, Sin C. & Szeto, W.Y. & Kuo, Yong-Hong & Leung, Janny M.Y. & Petering, Matthew & Tou, Terence W.H., 2018. "A survey of dial-a-ride problems: Literature review and recent developments," Transportation Research Part B: Methodological, Elsevier, vol. 111(C), pages 395-421.
    15. Dong, Xiaotong & Chow, Joseph Y.J. & Waller, S. Travis & Rey, David, 2022. "A chance-constrained dial-a-ride problem with utility-maximising demand and multiple pricing structures," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    16. Zhang, Li & Liu, Zhongshan & Yu, Lan & Fang, Ke & Yao, Baozhen & Yu, Bin, 2022. "Routing optimization of shared autonomous electric vehicles under uncertain travel time and uncertain service time," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 157(C).
    17. Husemann, Michael & Lahrs, Lennart & Stumpf, Eike, 2023. "The impact of dispatching logic on the efficiency of Urban Air Mobility operations," Journal of Air Transport Management, Elsevier, vol. 108(C).
    18. MELIS, Lissa & SÖRENSEN, Kenneth, 2020. "The on-demand bus routing problem: A large neighborhood search heuristic for a dial-a-ride problem with bus station assignment," Working Papers 2020005, University of Antwerp, Faculty of Business and Economics.
    19. Danijela Đorić & Yan Cimon & Igor Crevits & Said Hanafi & Raca Todosijević, 2020. "The location and routing models applicable to the transport of persons with disabilities," Post-Print hal-03199178, HAL.
    20. Kohar, Amit & Jakhar, Suresh Kumar & Agarwal, Yogesh K., 2023. "Strong cutting planes for the capacitated multi-pickup and delivery problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 176(C).

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:snopef:v:2:y:2021:i:3:d:10.1007_s43069-021-00076-x. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.