YaBeSH Engineering and Technology Library

    • Journals
    • PaperQuest
    • YSE Standards
    • YaBeSH
    • Login
    View Item 
    •   YE&T Library
    • ASCE
    • Journal of Transportation Engineering, Part A: Systems
    • View Item
    •   YE&T Library
    • ASCE
    • Journal of Transportation Engineering, Part A: Systems
    • View Item
    • All Fields
    • Source Title
    • Year
    • Publisher
    • Title
    • Subject
    • Author
    • DOI
    • ISBN
    Advanced Search
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Archive

    Two-Stage Bicycle Traffic Assignment Model

    Source: Journal of Transportation Engineering, Part A: Systems:;2018:;Volume ( 144 ):;issue: 002
    Author:
    Ryu Seungkyu;Chen Anthony;Su Jacqueline;Choi Keechoo
    DOI: 10.1061/JTEPBS.0000108
    Publisher: American Society of Civil Engineers
    Abstract: Cycling has been considered as a healthy, environmentally friendly, and economical alternative mode of travel to motorized vehicles (especially private motorized vehicles). However, bicycles have often been neglected in the transportation planning and travel demand forecasting modeling processes. The current practice in modeling bicycle trips in a network is either nonexistent or too simplistic. Current practices are simply based on the all-or-nothing (AON) assignment method using single attributes such as distance, safety, or a composite measure of safety multiplied by distance. The purpose of this paper is to develop a two-stage traffic assignment model by considering key factors (or criteria) in cyclist route choice behavior. As an initial effort, the first stage considers two key criteria (distance-related attributes and safety-related attributes) to generate a set of nondominated (or efficient) paths. These two criteria are a composite function of subcriteria. Route distance consists of link distances and intersection turning penalties combined to give the distance-related attribute, while route safety makes use of the bicycle level of service (BLOS) measure developed by the Highway Capacity Manual (HCM) to determine the safety-related attribute. Efficient paths are generated based on the above two key criteria with a biobjective shortest path algorithm. The second stage determines the flow allocation to the set of efficient paths. Several traffic assignment methods are adopted to determine the flow allocations in a network. Numerical experiments are then conducted to demonstrate the two-stage approach for bicycle traffic assignment. Overall, the results of the Winnipeg network demonstrate the applicability of the two-stage bicycle traffic assignment procedure with the flexibility of using different criteria in the first stage to generate efficient paths and different traffic assignment methods in the second stage to allocate flows.
    • Download: (2.432Mb)
    • Show Full MetaData Hide Full MetaData
    • Get RIS
    • Item Order
    • Go To Publisher
    • Statistics

      Two-Stage Bicycle Traffic Assignment Model

    URI
    https://yetl.yabesh.ir/yetl1/handle/yetl/4250251
    Collections
    • Journal of Transportation Engineering, Part A: Systems

    Show full item record

    contributor authorRyu Seungkyu;Chen Anthony;Su Jacqueline;Choi Keechoo
    date accessioned2019-02-26T07:54:56Z
    date available2019-02-26T07:54:56Z
    date issued2018
    identifier otherJTEPBS.0000108.pdf
    identifier urihttp://yetl.yabesh.ir/yetl1/handle/yetl/4250251
    description abstractCycling has been considered as a healthy, environmentally friendly, and economical alternative mode of travel to motorized vehicles (especially private motorized vehicles). However, bicycles have often been neglected in the transportation planning and travel demand forecasting modeling processes. The current practice in modeling bicycle trips in a network is either nonexistent or too simplistic. Current practices are simply based on the all-or-nothing (AON) assignment method using single attributes such as distance, safety, or a composite measure of safety multiplied by distance. The purpose of this paper is to develop a two-stage traffic assignment model by considering key factors (or criteria) in cyclist route choice behavior. As an initial effort, the first stage considers two key criteria (distance-related attributes and safety-related attributes) to generate a set of nondominated (or efficient) paths. These two criteria are a composite function of subcriteria. Route distance consists of link distances and intersection turning penalties combined to give the distance-related attribute, while route safety makes use of the bicycle level of service (BLOS) measure developed by the Highway Capacity Manual (HCM) to determine the safety-related attribute. Efficient paths are generated based on the above two key criteria with a biobjective shortest path algorithm. The second stage determines the flow allocation to the set of efficient paths. Several traffic assignment methods are adopted to determine the flow allocations in a network. Numerical experiments are then conducted to demonstrate the two-stage approach for bicycle traffic assignment. Overall, the results of the Winnipeg network demonstrate the applicability of the two-stage bicycle traffic assignment procedure with the flexibility of using different criteria in the first stage to generate efficient paths and different traffic assignment methods in the second stage to allocate flows.
    publisherAmerican Society of Civil Engineers
    titleTwo-Stage Bicycle Traffic Assignment Model
    typeJournal Paper
    journal volume144
    journal issue2
    journal titleJournal of Transportation Engineering, Part A: Systems
    identifier doi10.1061/JTEPBS.0000108
    page4017079
    treeJournal of Transportation Engineering, Part A: Systems:;2018:;Volume ( 144 ):;issue: 002
    contenttypeFulltext
    DSpace software copyright © 2002-2015  DuraSpace
    نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
    yabeshDSpacePersian
     
    DSpace software copyright © 2002-2015  DuraSpace
    نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
    yabeshDSpacePersian