IDEAS home Printed from https://ideas.repec.org/p/cdl/itsdav/qt8np1r2zx.html
   My bibliography  Save this paper

BikewaySim and Complete Paths Networks are Expected to Improve Modeling of Bicycle Activity and Route Choice

Author

Listed:
  • Passmore, Reid
  • Watkins, Kari E.
  • Guensler, Randall

Abstract

Many cities are focused on increasing bicycle use through development of infrastructure such as bicycle lanes and multi-use paths. Traditionally, travel demand models (TDMs) are used to evaluate the demand for (and impact of) proposed transportation projects. However, the vast majority of TDMs cannot be used to evaluate the impact of bicycle projects. Improved TDMs are needed to help estimate the impacts of new bicycle projects on cycling activity and prioritize the construction of the most beneficial bicycle projects with limited transportation department resources. To more accurately model bicycle travel, preference-based route assignments are needed. Researchers at the Georgia Institute of Technology created a semi-automated process for developing an all-streets network to be used in TDM applications. The researchers combined detailed roadway characteristic information from three different transportation networks in GIS shapefile format and used BikewaySim, Georgia Tech’s newly developed shortest-path calculator for cycling trips, to compare shortest-path routing on the newly created all-streets network versus the simplified TDM network for a 12-square-mile study area in Atlanta. View the NCST Project Webpage

Suggested Citation

  • Passmore, Reid & Watkins, Kari E. & Guensler, Randall, 2022. "BikewaySim and Complete Paths Networks are Expected to Improve Modeling of Bicycle Activity and Route Choice," Institute of Transportation Studies, Working Paper Series qt8np1r2zx, Institute of Transportation Studies, UC Davis.
    • Handle: RePEc:cdl:itsdav:qt8np1r2zx
    as

    Download full text from publisher

    File URL: https://www.escholarship.org/uc/item/8np1r2zx.pdf;origin=repeccitec
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    Engineering; Bikeways; Routes and routing; Shortest path algorithms; Travel time;
    All these keywords.

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:cdl:itsdav:qt8np1r2zx. 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: Lisa Schiff (email available below). General contact details of provider: https://edirc.repec.org/data/itucdus.html .

    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.