IDEAS home Printed from https://ideas.repec.org/a/taf/rjusxx/v26y2022i1p162-183.html
   My bibliography  Save this article

Recommending taxi routes with an advance reservation – a multi-criteria route planner

Author

Listed:
  • Hsun-Ping Hsieh
  • Fandel Lin

Abstract

In this paper, we propose a multi-criteria route recommendation framework that considers real-time spatial–temporal predictions and traffic network information, aiming to optimize a taxi driver’s profit when considering an advance reservation. Our framework consists of four components. First, we build a grid-based road network graph for modelling traffic network information during the search process. Next, we conduct two prediction modules that adopt advanced deep learning techniques to guide proper search directions in the final planning stage. One module, taxi demand prediction, is used to estimate the pick-up probabilities of passengers in the city. Another one is destination prediction, which can predict the distribution of drop-off probabilities and capture the flow of potential passengers. Finally, we propose J* (J-star) algorithm, which jointly considers pick-up probabilities, drop-off distribution, road network, distance, and time factors based on the attentive heuristic function. Compared with existing route planning methods, the experimental results on a real-world dataset have shown our proposed approach is more effective and robust. Moreover, our designed search scheme in J* can decrease the computing time and make the search process more efficient. To the best of our knowledge, this is the first work that focuses on designing a guiding route, which can increase the income of taxi drivers when they have an advance reservation.

Suggested Citation

  • Hsun-Ping Hsieh & Fandel Lin, 2022. "Recommending taxi routes with an advance reservation – a multi-criteria route planner," International Journal of Urban Sciences, Taylor & Francis Journals, vol. 26(1), pages 162-183, January.
  • Handle: RePEc:taf:rjusxx:v:26:y:2022:i:1:p:162-183
    DOI: 10.1080/12265934.2021.1894474
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/12265934.2021.1894474?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:rjusxx:v:26:y:2022:i:1:p:162-183. 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/rjus20 .

    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.