IDEAS home Printed from https://ideas.repec.org/h/spr/lnopch/978-3-031-92575-7_39.html
   My bibliography  Save this book chapter

Analyzing Public Transport Accessibility: Incorporating Last-Mile Connectivity in a Weighted Directed Graph Model

Author

Listed:
  • Lukas Spengler

    (SWK E2 Institute for Energy Technology and Energy Management, University of Applied Sciences Niederrhein)

  • Marc Gennat

    (SWK E2 Institute for Energy Technology and Energy Management, University of Applied Sciences Niederrhein)

Abstract

The issue of the last-mile in public transportation is crucial to its attractiveness and utilization, and thus represents one of the most significant challenges of the mobility transition in rural and urban areas. This contribution introduces a mathematical model represented as a directed and weighted graph to simulate public transit networks. The model is enhanced by incorporating edges that represent the last-mile connections between transit stops and final destinations, addressing a critical gap in accessibility. These edges are assigned weights that vary based on the travel resistance, as evaluated using the established methodology for the standardized evaluation of transport infrastructure investments. The methodology specifies a modal split proportion for public transit on a given route and computing the maximum allowable travel resistance as the objective function under specified constraints. This framework addresses the fundamental question of how the travel resistance of the last-mile should be in order to achieve a desired modal shift towards public transit.

Suggested Citation

  • Lukas Spengler & Marc Gennat, 2025. "Analyzing Public Transport Accessibility: Incorporating Last-Mile Connectivity in a Weighted Directed Graph Model," Lecture Notes in Operations Research,, Springer.
  • Handle: RePEc:spr:lnopch:978-3-031-92575-7_39
    DOI: 10.1007/978-3-031-92575-7_39
    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
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;

    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:lnopch:978-3-031-92575-7_39. 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.