IDEAS home Printed from https://ideas.repec.org/a/taf/raagxx/v114y2024i8p1668-1680.html
   My bibliography  Save this article

The Flow Termini Coverage Model for Locating Bike-Sharing Stations

Author

Listed:
  • Hung-Chi Liu
  • Daoqin Tong
  • Michael Kuby

Abstract

As of 2022, more than 1,900 cities around the world had implemented bike-sharing systems (BSSs) with docking stations. Because there is a limit on how far most people are willing to walk to and from BSS stations, maximal coverage models have been a popular approach to optimizing dock station locations. Existing maximal coverage models, however, mainly evaluate demand coverage based on proximity to individual stations without considering the fact that BSS users must have dock stations convenient to both their pickup and drop-off sites. Given this, traditional single-node maximal coverage models might not locate stations to maximize the number of complete-able trips and will also tend to overestimate the coverage of demand. This study proposes a flow termini coverage model (FTCM) to locate BSS stations by considering the flow-based BSS usage demands and network connectivity. The model is tested on the Youbike system in Taipei, one of the most heavily used dock-station BSSs worldwide. This study compares the FTCM with both the traditional single-station maximal coverage model and Taipei’s official planning strategy. Results suggest that the FTCM consistently covers more origin–destination trips, especially in areas with unbalanced BSS usage. We also provide discussion on the cost–benefit trade-offs for transportation planners to choose the most appropriate modeling approaches. The FTCM could also be adapted to optimizing micromobility hubs for parking dockless shared bikes and e-scooters.

Suggested Citation

  • Hung-Chi Liu & Daoqin Tong & Michael Kuby, 2024. "The Flow Termini Coverage Model for Locating Bike-Sharing Stations," Annals of the American Association of Geographers, Taylor & Francis Journals, vol. 114(8), pages 1668-1680, September.
  • Handle: RePEc:taf:raagxx:v:114:y:2024:i:8:p:1668-1680
    DOI: 10.1080/24694452.2024.2313495
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/24694452.2024.2313495?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:raagxx:v:114:y:2024:i:8:p:1668-1680. 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/raag .

    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.