IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v326y2025i2p234-254.html
   My bibliography  Save this article

Reliable pathfinding problems for a correlated network: A linear programming problem in a hypergraph

Author

Listed:
  • Uchida, Kenetsu
  • Wang, Yifan
  • Tani, Ryuichi

Abstract

This study addresses the NP-hard reliable path problem, which seeks the path with minimum travel cost in correlated road networks, formulated as mean-variance (m-v) and mean-standard deviation (m-s) shortest path problems. This study proposes a novel approach that transforms these nonlinear binary integer programming models into standard linear programming (LP) problems using structure-preserving linearization and graph transformation techniques. The resulting LP formulations guarantee global optimality, overcoming the computational challenges of real-world networks. Numerical experiments on real-world networks demonstrate that the proposed method efficiently identifies the globally optimal path, matching the performance of exact methods like branch-and-bound while offering greater model flexibility. These findings provide a scalable and robust framework for reliable path selection in complex transportation networks.

Suggested Citation

  • Uchida, Kenetsu & Wang, Yifan & Tani, Ryuichi, 2025. "Reliable pathfinding problems for a correlated network: A linear programming problem in a hypergraph," European Journal of Operational Research, Elsevier, vol. 326(2), pages 234-254.
    • Handle: RePEc:eee:ejores:v:326:y:2025:i:2:p:234-254
    DOI: 10.1016/j.ejor.2025.04.046
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221725003455
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2025.04.046?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.

    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:eee:ejores:v:326:y:2025:i:2:p:234-254. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.