IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v62y2024i8p2963-2981.html
   My bibliography  Save this article

Modelling driver's reactive strategies in e-hailing platforms: an agent-based simulation model and an approximate analytical model

Author

Listed:
  • Arulanantha Prabu Ponnachiyur Maruthasalam
  • Debjit Roy
  • Prahalad Venkateshan

Abstract

For an e-hailing taxi operation, we analyse a driver's profit-maximising reactive strategy (to either accept or refuse a ride request) in response to the ride request broadcast by the platform. We analyse four operating modes, each of which is a combination of either of two reactive strategies: no refusal and refusal based on proximity, and either of two broadcasting methods. In an operating mode, our objective is to evaluate the expected total profit in a shift. We adopt a two-stage methodology to answer the research questions. In the first stage, we develop an agent-based simulation model to capture the effect of multiple taxis on driver's reactive strategy. Using real trip data, we find that a driver could follow a strategy of refusal based on proximity and earn approximately 25% more than the baseline no refusal strategy. In the second stage, we develop an approximate analytical model for a single taxi operation and compare the performance against the agent-based simulation model. We develop closed-form expressions of the expected total profit for each operating mode and topology of the service region. We find that our approximate analytical model provides an upper bound, and the profit deviation lies within 20% of the agent-based simulation model.

Suggested Citation

  • Arulanantha Prabu Ponnachiyur Maruthasalam & Debjit Roy & Prahalad Venkateshan, 2024. "Modelling driver's reactive strategies in e-hailing platforms: an agent-based simulation model and an approximate analytical model," International Journal of Production Research, Taylor & Francis Journals, vol. 62(8), pages 2963-2981, April.
  • Handle: RePEc:taf:tprsxx:v:62:y:2024:i:8:p:2963-2981
    DOI: 10.1080/00207543.2021.1987554
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2021.1987554
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2021.1987554?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.

    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:taf:tprsxx:v:62:y:2024:i:8:p:2963-2981. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.