IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v63y2016i6p479-491.html
   My bibliography  Save this article

The probability of the existence of a feasible flow in a stochastic transportation network

Author

Listed:
  • Jia Shu
  • Haiqing Heng

Abstract

Stochastic transportation networks arise in various real world applications, for which the probability of the existence of a feasible flow is regarded as an important performance measure. Although the necessary and sufficient condition for the existence of a feasible flow represented by an exponential number of inequalities is a well‐known result in the literature, the computation of the probability of all such inequalities being satisfied jointly is a daunting challenge. The state‐of‐the‐art approach of Prékopa and Boros, Operat Res 39 (1991) 119–129 approximates this probability by giving its lower and upper bounds using a two‐part procedure. The first part eliminates all redundant inequalities and the second gives the lower and upper bounds of the probability by solving two well‐defined linear programs with the inputs obtained from the first part. Unfortunately, the first part may still leave many non‐redundant inequalities. In this case, it would be very time consuming to compute the inputs for the second part even for small‐sized networks. In this paper, we first present a model that can be used to eliminate all redundant inequalities and give the corresponding computational results for the same numerical examples used in Prékopa and Boros, Operat Res 39 (1991) 119–129. We also show how to improve the lower and upper bounds of the probability using the multitree and hypermultitree, respectively. Furthermore, we propose an exact solution approach based on the state space decomposition to compute the probability. We derive a feasible state from a state space and then decompose the space into several disjoint subspaces iteratively. The probability is equal to the sum of the probabilities in these subspaces. We use the 8‐node and 15‐node network examples in Prékopa and Boros, Operat Res 39 (1991) 119–129 and the Sioux‐Falls network with 24 nodes to show that the space decomposition algorithm can obtain the exact probability of these classical examples efficiently. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 479–491, 2016

Suggested Citation

  • Jia Shu & Haiqing Heng, 2016. "The probability of the existence of a feasible flow in a stochastic transportation network," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(6), pages 479-491, September.
    • Handle: RePEc:wly:navres:v:63:y:2016:i:6:p:479-491
    DOI: 10.1002/nav.21714
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.21714
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.21714?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
    ---><---

    References listed on IDEAS

    as
    1. Mabel C. Chou & Geoffrey A. Chua & Chung-Piaw Teo & Huan Zheng, 2011. "Process Flexibility Revisited: The Graph Expander and Its Applications," Operations Research, INFORMS, vol. 59(5), pages 1090-1105, October.
    2. T. L. Magnanti & R. T. Wong, 1984. "Network Design and Transportation Planning: Models and Algorithms," Transportation Science, INFORMS, vol. 18(1), pages 1-55, February.
    3. András Prékopa & Endre Boros, 1991. "On the Existence of a Feasible Flow in a Stochastic Transportation Network," Operations Research, INFORMS, vol. 39(1), pages 119-129, February.
    4. Chin‐Chia Jane & Yih‐Wenn Laih, 2012. "Evaluating cost and reliability integrated performance of stochastic logistics systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(7), pages 577-586, October.
    5. Xuan Wang & Jiawei Zhang, 2015. "Process Flexibility: A Distribution-Free Bound on the Performance of k -Chain," Operations Research, INFORMS, vol. 63(3), pages 555-571, June.
    6. William C. Jordan & Stephen C. Graves, 1995. "Principles on the Benefits of Manufacturing Process Flexibility," Management Science, INFORMS, vol. 41(4), pages 577-594, April.
    7. David Simchi-Levi & Yehua Wei, 2012. "Understanding the Performance of the Long Chain and Sparse Designs in Process Flexibility," Operations Research, INFORMS, vol. 60(5), pages 1125-1141, October.
    8. Tianhu Deng & Zuo-Jun Max Shen, 2013. "Process Flexibility Design in Unbalanced Networks," Manufacturing & Service Operations Management, INFORMS, vol. 15(1), pages 24-32, April.
    9. Terry L. Friesz & Hsun-Jung Cho & Nihal J. Mehta & Roger L. Tobin & G. Anandalingam, 1992. "A Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints," Transportation Science, INFORMS, vol. 26(1), pages 18-26, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Zhen Xu & Hailun Zhang & Jiheng Zhang & Rachel Q. Zhang, 2020. "Online Demand Fulfillment Under Limited Flexibility," Management Science, INFORMS, vol. 66(10), pages 4667-4685, October.
    2. Cong Shi & Yehua Wei & Yuan Zhong, 2019. "Process Flexibility for Multiperiod Production Systems," Operations Research, INFORMS, vol. 67(5), pages 1300-1320, September.
    3. Xi Chen & Tengyu Ma & Jiawei Zhang & Yuan Zhou, 2019. "Optimal Design of Process Flexibility for General Production Systems," Operations Research, INFORMS, vol. 67(2), pages 516-531, March.
    4. Xi Chen & Jiawei Zhang & Yuan Zhou, 2015. "Optimal Sparse Designs for Process Flexibility via Probabilistic Expanders," Operations Research, INFORMS, vol. 63(5), pages 1159-1176, October.
    5. Zhenzhen Yan & Sarah Yini Gao & Chung Piaw Teo, 2018. "On the Design of Sparse but Efficient Structures in Operations," Management Science, INFORMS, vol. 64(7), pages 3421-3445, July.
    6. Timothy C. Y. Chan & Douglas Fearing, 2019. "Process Flexibility in Baseball: The Value of Positional Flexibility," Management Science, INFORMS, vol. 65(4), pages 1642-1666, April.
    7. Timothy C. Y. Chan & Daniel Letourneau & Benjamin G. Potter, 2022. "Sparse flexible design: a machine learning approach," Flexible Services and Manufacturing Journal, Springer, vol. 34(4), pages 1066-1116, December.
    8. Antoine Désir & Vineet Goyal & Yehua Wei & Jiawei Zhang, 2016. "Sparse Process Flexibility Designs: Is the Long Chain Really Optimal?," Operations Research, INFORMS, vol. 64(2), pages 416-431, April.
    9. Shixin Wang & Xuan Wang & Jiawei Zhang, 2021. "A Review of Flexible Processes and Operations," Production and Operations Management, Production and Operations Management Society, vol. 30(6), pages 1804-1824, June.
    10. Xuan Wang & Jiawei Zhang, 2015. "Process Flexibility: A Distribution-Free Bound on the Performance of k -Chain," Operations Research, INFORMS, vol. 63(3), pages 555-571, June.
    11. Rujeerapaiboon, Napat & Zhong, Yuanguang & Zhu, Dan, 2023. "Resilience of long chain under disruption," European Journal of Operational Research, Elsevier, vol. 309(2), pages 597-615.
    12. Mabel C. Chou & Geoffrey A. Chua & Huan Zheng, 2014. "On the Performance of Sparse Process Structures in Partial Postponement Production Systems," Operations Research, INFORMS, vol. 62(2), pages 348-365, April.
    13. Arash Asadpour & Xuan Wang & Jiawei Zhang, 2020. "Online Resource Allocation with Limited Flexibility," Management Science, INFORMS, vol. 66(2), pages 642-666, February.
    14. Jingui Xie & Yiming Fan & Mabel C. Chou, 2017. "Flexibility design in loss and queueing systems: efficiency of k-chain configuration," Flexible Services and Manufacturing Journal, Springer, vol. 29(2), pages 286-308, June.
    15. Dipankar Bose & A. K. Chatterjee & Samir Barman, 2016. "Towards dominant flexibility configurations in strategic capacity planning under demand uncertainty," OPSEARCH, Springer;Operational Research Society of India, vol. 53(3), pages 604-619, September.
    16. Chua, Geoffrey A. & Chen, Shaoxiang & Han, Zhiguang, 2016. "Hub and Chain: Process Flexibility Design in Non-Identical Systems Using Variance Information," European Journal of Operational Research, Elsevier, vol. 253(3), pages 625-638.
    17. Guodong Lyu & Wang-Chi Cheung & Mabel C. Chou & Chung-Piaw Teo & Zhichao Zheng & Yuanguang Zhong, 2019. "Capacity Allocation in Flexible Production Networks: Theory and Applications," Management Science, INFORMS, vol. 65(11), pages 5091-5109, November.
    18. Philip Kaminsky & Yang Wang, 2019. "Multi-period process flexibility with inventory," Flexible Services and Manufacturing Journal, Springer, vol. 31(4), pages 833-893, December.
    19. Perraudat, Antoine & Dauzère-Pérès, Stéphane & Vialletelle, Philippe, 2022. "Robust tactical qualification decisions in flexible manufacturing systems," Omega, Elsevier, vol. 106(C).
    20. Shixin Wang, 2023. "The Power of Simple Menus in Robust Selling Mechanisms," Papers 2310.17392, arXiv.org, revised Sep 2024.

    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:wly:navres:v:63:y:2016:i:6:p:479-491. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc 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 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.