IDEAS home Printed from https://ideas.repec.org/a/taf/transr/v31y2011i6p743-768.html
   My bibliography  Save this article

Transport Network Design Problem under Uncertainty: A Review and New Developments

Author

Listed:
  • Anthony Chen
  • Zhong Zhou
  • Piya Chootinan
  • Seungkyu Ryu
  • Chao Yang
  • S. Wong

Abstract

This paper aims to provide a state-of-the-art review of the transport network design problem (NDP) under uncertainty and to present some new developments on a bi-objective-reliable NDP (BORNDP) model that explicitly optimizes the capacity reliability and travel time reliability under demand uncertainty. Both are useful performance measures that can describe the supply-side reliability and demand-side reliability of a road network. A simulation-based multi-objective genetic algorithm solution procedure, which consists of a traffic assignment algorithm, a genetic algorithm, a Pareto filter, and a Monte-Carlo simulation, is developed to solve the proposed BORNDP model. A numerical example based on the capacity enhancement problem is presented to demonstrate the tradeoff between capacity reliability and travel time reliability in the NDP.

Suggested Citation

  • Anthony Chen & Zhong Zhou & Piya Chootinan & Seungkyu Ryu & Chao Yang & S. Wong, 2011. "Transport Network Design Problem under Uncertainty: A Review and New Developments," Transport Reviews, Taylor & Francis Journals, vol. 31(6), pages 743-768.
    • Handle: RePEc:taf:transr:v:31:y:2011:i:6:p:743-768
    DOI: 10.1080/01441647.2011.589539
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01441647.2011.589539
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01441647.2011.589539?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:transr:v:31:y:2011:i:6:p:743-768. 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/TTRV20 .

    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.