IDEAS home Printed from https://ideas.repec.org/h/spr/prochp/978-3-031-56576-2_22.html
   My bibliography  Save this book chapter

Intermodal Matching Algorithm Including Public Transportation and Ride-Hailing

In: Artificial Intelligence Tools and Applications in Embedded and Mobile Systems

Author

Listed:
  • Sven von Höveling

    (Business Information Systems/VLBA)

  • Cedrik Theesen

    (Business Information Systems/VLBA)

  • Anton Butenko

    (Business Information Systems/VLBA)

  • Venkatesh Sasapu

    (Business Information Systems/VLBA)

Abstract

Mobility in traffic is an often discussed topic in a wide variety of forms. In this chapter, we address the mobility of older people in rural areas by presenting a concept for an algorithm that offers intermodal routes between ride-hailing and public transportation. The algorithm is based on a previously published algorithm for ride-sharing that uses isochrones for detour limitation as a key difference to other solutions and that includes a social metric based on individual preferences as well as filters. We add some improvements, public transportation, and especially the mentioned intermodal option. For simplicity and reasoned for the target group, we limit the number of changes between both ride-hailing and public transportation to one. Regarding the pending implementation, some possibilities to reduce the execution time are discussed. The concept and the planned implementation are done within the REMOBIAS project that addresses mobility in rural areas with the help of an interactive assistant.

Suggested Citation

  • Sven von Höveling & Cedrik Theesen & Anton Butenko & Venkatesh Sasapu, 2024. "Intermodal Matching Algorithm Including Public Transportation and Ride-Hailing," Progress in IS, in: Jorge Marx Gómez & Anael Elikana Sam & Devotha Godfrey Nyambo (ed.), Artificial Intelligence Tools and Applications in Embedded and Mobile Systems, pages 251-260, Springer.
    • Handle: RePEc:spr:prochp:978-3-031-56576-2_22
    DOI: 10.1007/978-3-031-56576-2_22
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:prochp:978-3-031-56576-2_22. 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: 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.