Advanced Search
MyIDEAS: Login to save this article or follow this journal

Optimal Path Problems with Second-Order Stochastic Dominance Constraints

Contents:

Author Info

  • Yu Nie

    ()

  • Xing Wu
  • Tito Homem-de-Mello
Registered author(s):

    Abstract

    This paper studies optimal path problems integrated with the concept of second order stochastic dominance. These problems arise from applications where travelers are concerned with the trade off between the risks associated with random travel time and other travel costs. Risk-averse behavior is embedded by requiring the random travel times on the optimal paths to stochastically dominate that on a benchmark path in the second order. A general linear operating cost is introduced to combine link- and path-based costs. The latter, which is the focus of the paper, is employed to address schedule costs pertinent to late and early arrival. An equivalent integer program to the problem is constructed by transforming the stochastic dominance constraint into a finite number of linear constraints. The problem is solved using both off-the-shelf solvers and specialized algorithms based on dynamic programming (DP). Although neither approach ensures satisfactory performance for general large-scale problems, the numerical experiments indicate that the DP-based approach provides a computationally feasible option to solve medium-size instances (networks with several thousand links) when correlations among random link travel times can be ignored. Copyright Springer Science+Business Media, LLC 2012

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://hdl.handle.net/10.1007/s11067-011-9167-6
    Download Restriction: Access to full text is restricted to subscribers.

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Bibliographic Info

    Article provided by Springer in its journal Networks and Spatial Economics.

    Volume (Year): 12 (2012)
    Issue (Month): 4 (December)
    Pages: 561-587

    as in new window
    Handle: RePEc:kap:netspa:v:12:y:2012:i:4:p:561-587

    Contact details of provider:
    Web page: http://www.springerlink.com/link.asp?id=106607

    Related research

    Keywords: Optimal path problem; Stochastic dominance; Dynamic programming; Integer programming;

    References

    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
    as in new window
    1. Miller-Hooks, Elise & Mahmassani, Hani, 2003. "Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks," European Journal of Operational Research, Elsevier, vol. 146(1), pages 67-82, April.
    2. Carraway, Robert L. & Morin, Thomas L. & Moskowitz, Herbert, 1990. "Generalized dynamic programming for multicriteria optimization," European Journal of Operational Research, Elsevier, vol. 44(1), pages 95-104, January.
    3. Harry Markowitz, 1952. "Portfolio Selection," Journal of Finance, American Finance Association, vol. 7(1), pages 77-91, 03.
    4. Hadar, Josef & Russell, William R., 1971. "Stochastic dominance and diversification," Journal of Economic Theory, Elsevier, vol. 3(3), pages 288-305, September.
    5. Milton Friedman & L. J. Savage, 1948. "The Utility Analysis of Choices Involving Risk," Journal of Political Economy, University of Chicago Press, vol. 56, pages 279.
    6. Rothschild, Michael & Stiglitz, Joseph E., 1970. "Increasing risk: I. A definition," Journal of Economic Theory, Elsevier, vol. 2(3), pages 225-243, September.
    7. Current, J. R. & Re Velle, C. S. & Cohon, J. L., 1985. "The maximum covering/shortest path problem: A multiobjective network design and routing formulation," European Journal of Operational Research, Elsevier, vol. 21(2), pages 189-199, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as in new window

    Cited by:
    1. ManWo Ng & Hong Lo, 2013. "Regional Air Quality Conformity in Transportation Networks with Stochastic Dependencies: A Theoretical Copula-Based Model," Networks and Spatial Economics, Springer, vol. 13(4), pages 373-397, December.
    2. Chen, Peng & Nie, Yu (Marco), 2013. "Bicriterion shortest path problem with a general nonadditive cost," Transportation Research Part B: Methodological, Elsevier, vol. 57(C), pages 419-435.
    3. Shahabi, Mehrdad & Unnikrishnan, Avinash & Boyles, Stephen D., 2013. "An outer approximation algorithm for the robust shortest path problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 58(C), pages 52-66.

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:kap:netspa:v:12:y:2012:i:4:p:561-587. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) or (Christopher F. Baum).

    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.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.