IDEAS home Printed from https://ideas.repec.org/a/taf/transp/v35y2012i5p545-559.html
   My bibliography  Save this article

Hierarchical network-based equilibrium model and algorithm for a mixed-traffic urban transport system

Author

Listed:
  • Bingfeng Si
  • Ming Zhong
  • Liang Gao
  • Ziyou Gao

Abstract

Many equilibrium models and algorithms based on homogeneous motorized traffic have been devised to model urban transport systems in developed countries, but they are inadequate when it comes to represent mixed-traffic urban transport systems, including automobiles, transit, bicycles, and pedestrians, in developing countries such as China or India. In these cases, traffic flow on a road segment is an aggregated result of travellers' combined mode/route choices and corresponding interactions. Therefore, a special assignment model and algorithm are needed for modeling these distinct behaviors. In this article, the structure of a mixed-traffic urban transport system is analyzed and then expanded and represented using a hierarchical network model based on graph theory. Based on the analysis of travelers' combined mode/route choices, generalized travel cost functions and link impedance functions for different modes are formulated, where the interferences between different modes on the same road segments are taken into account. Due to the ‘asymmetric’ nature of these functions, a variational inequality model is proposed to represent the equilibrium assignment problem in a mixed-traffic urban transport system. The corresponding solution algorithm is also presented. Finally, a numerical example is provided to illustrate the practicality of the proposed model and algorithm.

Suggested Citation

  • Bingfeng Si & Ming Zhong & Liang Gao & Ziyou Gao, 2012. "Hierarchical network-based equilibrium model and algorithm for a mixed-traffic urban transport system," Transportation Planning and Technology, Taylor & Francis Journals, vol. 35(5), pages 545-559, March.
  • Handle: RePEc:taf:transp:v:35:y:2012:i:5:p:545-559
    DOI: 10.1080/03081060.2012.693268
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/03081060.2012.693268?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:transp:v:35:y:2012:i:5:p:545-559. 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/GTPT20 .

    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.