IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v56y2024i2p186-200.html
   My bibliography  Save this article

Reliable network design considering endogenous customers’ choices under probabilistic arc failures

Author

Listed:
  • Pengcheng Dong
  • Yang Liu
  • Qingchun Meng
  • Guodong Yu

Abstract

We consider a reliable network design where the facility location and road ban decisions are jointly optimized to minimize the total expected costs and risks against uncertain exogenous arc-dependent failures and customers’ endogenous interactions. We formulate endogenous customers’ choices by incorporating an expressive measure, Cumulative prospect theory, into the widely used multinomial logit model. Additionally, we use a well-known downside measure, Conditional value-at-risk, for the designer to control integrated risks from exogenous arc failures and endogenous customers’ choices. Accordingly, a mixed-integer trilinear program is developed. To solve the model, we first transform it into a class of mixed-integer linear programs based on the separable structure. Then, a customized branch-and-Benders-cut algorithm is proposed to solve these mixed-integer linear programs. We devise a set of novel valid inequalities based on the endogenous transition of choice probability to strengthen the weak relaxation of the master problem. Moreover, by aggregating the grouping and dual iterations shrinking techniques for solving sub-problems, the branch-and-Benders-cut algorithm can converge within 30 seconds and the whole problem can be solved within 15 minutes for a network with 90 nodes and 149 road segments. Some managerial insights for balancing risk and cost are finally extracted.

Suggested Citation

  • Pengcheng Dong & Yang Liu & Qingchun Meng & Guodong Yu, 2024. "Reliable network design considering endogenous customers’ choices under probabilistic arc failures," IISE Transactions, Taylor & Francis Journals, vol. 56(2), pages 186-200, February.
  • Handle: RePEc:taf:uiiexx:v:56:y:2024:i:2:p:186-200
    DOI: 10.1080/24725854.2023.2209622
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/24725854.2023.2209622
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/24725854.2023.2209622?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.

    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:taf:uiiexx:v:56:y:2024:i:2:p:186-200. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    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.