IDEAS home Printed from https://ideas.repec.org/p/arx/papers/1904.07987.html
   My bibliography  Save this paper

Can Mobility-on-Demand services do better after discerning reliability preferences of riders?

Author

Listed:
  • Prateek Bansal
  • Yang Liu
  • Ricardo Daziano
  • Samitha Samaranayake

Abstract

We formalize one aspect of reliability in the context of Mobility-on-Demand (MoD) systems by acknowledging the uncertainty in the pick-up time of these services. This study answers two key questions: i) how the difference between the stated and actual pick-up times affect the propensity of a passenger to choose an MoD service? ii) how an MoD service provider can leverage this information to increase its ridership? We conduct a discrete choice experiment in New York to answer the former question and adopt a micro-simulation-based optimization method to answer the latter question. In our experiments, the ridership of an MoD service could be increased by up to 10\% via displaying the predicted wait time strategically.

Suggested Citation

  • Prateek Bansal & Yang Liu & Ricardo Daziano & Samitha Samaranayake, 2019. "Can Mobility-on-Demand services do better after discerning reliability preferences of riders?," Papers 1904.07987, arXiv.org.
    • Handle: RePEc:arx:papers:1904.07987
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/1904.07987
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Alexandra König & Tabea Bonus & Jan Grippenkoven, 2018. "Analyzing Urban Residents’ Appraisal of Ridepooling Service Attributes with Conjoint Analysis," Sustainability, MDPI, vol. 10(10), pages 1-16, October.
    2. Liu, Yang & Blandin, Sebastien & Samaranayake, Samitha, 2019. "Stochastic on-time arrival problem in transit networks," Transportation Research Part B: Methodological, Elsevier, vol. 119(C), pages 122-138.
    3. repec:cdl:itsdav:qt82w2z91j is not listed on IDEAS
    4. Choudhury, Charisma F. & Yang, Lang & de Abreu e Silva, João & Ben-Akiva, Moshe, 2018. "Modelling preferences for smart modes and services: A case study in Lisbon," Transportation Research Part A: Policy and Practice, Elsevier, vol. 115(C), pages 15-31.
    5. Michel Gendreau & Ola Jabali & Walter Rei, 2016. "50th Anniversary Invited Article—Future Research Directions in Stochastic Vehicle Routing," Transportation Science, INFORMS, vol. 50(4), pages 1163-1173, November.
    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. Enrico Bartolini & Dominik Goeke & Michael Schneider & Mengdie Ye, 2021. "The Robust Traveling Salesman Problem with Time Windows Under Knapsack-Constrained Travel Time Uncertainty," Transportation Science, INFORMS, vol. 55(2), pages 371-394, March.
    2. Papadima, Georgia & Genitsaris, Evangelos & Karagiotas, Ioannis & Naniopoulos, Aristotelis & Nalmpantis, Dimitrios, 2020. "Investigation of acceptance of driverless buses in the city of Trikala and optimization of the service using Conjoint Analysis," Utilities Policy, Elsevier, vol. 62(C).
    3. Danaf, Mazen & Atasoy, Bilge & de Azevedo, Carlos Lima & Ding-Mastera, Jing & Abou-Zeid, Maya & Cox, Nathaniel & Zhao, Fang & Ben-Akiva, Moshe, 2019. "Context-aware stated preferences with smartphone-based travel surveys," Journal of choice modelling, Elsevier, vol. 31(C), pages 35-50.
    4. Marlin W. Ulmer, 2020. "Horizontal combinations of online and offline approximate dynamic programming for stochastic dynamic vehicle routing," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 28(1), pages 279-308, March.
    5. Zhang, Jian & Woensel, Tom Van, 2023. "Dynamic vehicle routing with random requests: A literature review," International Journal of Production Economics, Elsevier, vol. 256(C).
    6. Majid Salavati-Khoshghalb & Michel Gendreau & Ola Jabali & Walter Rei, 2019. "A hybrid recourse policy for the vehicle routing problem with stochastic demands," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(3), pages 269-298, September.
    7. Chen, Lijian & Chiang, Wen-Chyuan & Russell, Robert & Chen, Jun & Sun, Dengfeng, 2018. "The probabilistic vehicle routing problem with service guarantees," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 111(C), pages 149-164.
    8. Florio, Alexandre M. & Gendreau, Michel & Hartl, Richard F. & Minner, Stefan & Vidal, Thibaut, 2023. "Recent advances in vehicle routing with stochastic demands: Bayesian learning for correlated demands and elementary branch-price-and-cut," European Journal of Operational Research, Elsevier, vol. 306(3), pages 1081-1093.
    9. Özarık, Sami Serkan & Lurkin, Virginie & Veelenturf, Lucas P. & Van Woensel, Tom & Laporte, Gilbert, 2023. "An Adaptive Large Neighborhood Search heuristic for last-mile deliveries under stochastic customer availability and multiple visits," Transportation Research Part B: Methodological, Elsevier, vol. 170(C), pages 194-220.
    10. Maaike Hoogeboom & Yossiri Adulyasak & Wout Dullaert & Patrick Jaillet, 2021. "The Robust Vehicle Routing Problem with Time Window Assignments," Transportation Science, INFORMS, vol. 55(2), pages 395-413, March.
    11. Markov, Iliya & Bierlaire, Michel & Cordeau, Jean-François & Maknoon, Yousef & Varone, Sacha, 2018. "A unified framework for rich routing problems with stochastic demands," Transportation Research Part B: Methodological, Elsevier, vol. 114(C), pages 213-240.
    12. Tanja Manders & Elke Klaassen, 2019. "Unpacking the Smart Mobility Concept in the Dutch Context Based on a Text Mining Approach," Sustainability, MDPI, vol. 11(23), pages 1-24, November.
    13. Nadine Kostorz & Eva Fraedrich & Martin Kagerbauer, 2021. "Usage and User Characteristics—Insights from MOIA, Europe’s Largest Ridepooling Service," Sustainability, MDPI, vol. 13(2), pages 1-18, January.
    14. Vit Prochazka & Stein W. Wallace, 2020. "Scenario tree construction driven by heuristic solutions of the optimization problem," Computational Management Science, Springer, vol. 17(2), pages 277-307, June.
    15. Michael Redmond & Ann Melissa Campbell & Jan Fabian Ehmke, 2020. "Data-driven planning of reliable itineraries in multi-modal transit networks," Public Transport, Springer, vol. 12(1), pages 171-205, March.
    16. Majid Salavati-Khoshghalb & Michel Gendreau & Ola Jabali & Walter Rei, 2019. "A Rule-Based Recourse for the Vehicle Routing Problem with Stochastic Demands," Transportation Science, INFORMS, vol. 53(5), pages 1334-1353, September.
    17. Dell’Amico, Mauro & Iori, Manuel & Novellani, Stefano & Subramanian, Anand, 2018. "The Bike sharing Rebalancing Problem with Stochastic Demands," Transportation Research Part B: Methodological, Elsevier, vol. 118(C), pages 362-380.
    18. Alexandre M. Florio & Nabil Absi & Dominique Feillet, 2021. "Routing Electric Vehicles on Congested Street Networks," Transportation Science, INFORMS, vol. 55(1), pages 238-256, 1-2.
    19. Prateek Bansal & Akanksha Sinha & Rubal Dua & Ricardo Daziano, 2019. "Eliciting Preferences of Ridehailing Users and Drivers: Evidence from the United States," Papers 1904.06695, arXiv.org.
    20. Yang, Meng & Ni, Yaodong & Song, Qinyu, 2022. "Optimizing driver consistency in the vehicle routing problem under uncertain environment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:arx:papers:1904.07987. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.