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

Lagrangian Relaxation for the Multiple Constrained Robust Shortest Path Problem

Author

Listed:
  • Yiyong Pan

Abstract

The study focuses on a multiple constrained reliable path problem in which travel time reliability and resource constraints are collectively considered. Nonlinear optimization model is developed to model constrained robust shortest path problem. The dual nature of the proposed problem is deduced based on the Lagrangian duality theory. An efficient algorithm based on Lagrangian dual relaxation is designed to solve constrained robust shortest path problem. An extension problem that considers multiple constraints is discussed. Numerical studies indicate that the proposed algorithm is efficient in terms of obtaining the close-to-optimal solutions within reasonable computational times.

Suggested Citation

  • Yiyong Pan, 2019. "Lagrangian Relaxation for the Multiple Constrained Robust Shortest Path Problem," Mathematical Problems in Engineering, Hindawi, vol. 2019, pages 1-13, June.
    • Handle: RePEc:hin:jnlmpe:3987278
    DOI: 10.1155/2019/3987278
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2019/3987278.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2019/3987278.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2019/3987278?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:3987278. 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.