IDEAS home Printed from https://ideas.repec.org/a/ids/ijisen/v40y2022i4p533-550.html
   My bibliography  Save this article

Selecting the robust constrained shortest path under uncertainty

Author

Listed:
  • Sadjad Moradi
  • Nemat Allah Taghi-Nezhad

Abstract

This article deals with the problem of finding a constrained shortest path on a network in which, each arc is introduced by two factors, length and time. Distance parameter is minimised and travel time is limited. Since travel time on a path depends on many factors that are constantly changing, time parameter is considered as a random variable and we assume that it is limited in specified interval. Considering the uncertainty budget, the problem is firstly modelled in the form of a Γ-robust model and then an efficient optimal method is presented to solve the problem for different levels of conservatism so that we can choose the best level of conservatism by comparing the results. The results of the implementation of the solution algorithm on different networks show that it is possible to obtain a reliable route, in which the probability of violation of travel time constraint decreases by increasing the conservatism level. However, as the level of conservatism increases, the length of the optimal robust path increases.

Suggested Citation

  • Sadjad Moradi & Nemat Allah Taghi-Nezhad, 2022. "Selecting the robust constrained shortest path under uncertainty," International Journal of Industrial and Systems Engineering, Inderscience Enterprises Ltd, vol. 40(4), pages 533-550.
    • Handle: RePEc:ids:ijisen:v:40:y:2022:i:4:p:533-550
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=122867
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:ids:ijisen:v:40:y:2022:i:4:p:533-550. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=188 .

    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.