IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/541782.html
   My bibliography  Save this article

A Nondominated Genetic Algorithm Procedure for Multiobjective Discrete Network Design under Demand Uncertainty

Author

Listed:
  • Bian Changzhi

Abstract

This paper addresses the multiobjective discrete network design problem under demand uncertainty. The OD travel demands are supposed to be random variables with the given probability distribution. The problem is formulated as a bilevel stochastic optimization model where the decision maker’s objective is to minimize the construction cost, the expectation, and the standard deviation of total travel time simultaneously and the user’s route choice is described using user equilibrium model on the improved network under all scenarios of uncertain demand. The proposed model generates globally near-optimal Pareto solutions for network configurations based on the Monte Carlo simulation and nondominated sorting genetic algorithms II. Numerical experiments implemented on Nguyen-Dupuis test network show trade-offs among construction cost, the expectation, and standard deviation of total travel time under uncertainty are obvious. Investment on transportation facilities is an efficient method to improve the network performance and reduce risk under demand uncertainty, but it has an obvious marginal decreasing effect.

Suggested Citation

  • Bian Changzhi, 2015. "A Nondominated Genetic Algorithm Procedure for Multiobjective Discrete Network Design under Demand Uncertainty," Mathematical Problems in Engineering, Hindawi, vol. 2015, pages 1-8, September.
  • Handle: RePEc:hin:jnlmpe:541782
    DOI: 10.1155/2015/541782
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2015/541782.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2015/541782.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2015/541782?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
    ---><---

    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:hin:jnlmpe:541782. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.