IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v63y2015i6p1512-1527.html
   My bibliography  Save this article

Single Commodity Stochastic Network Design Under Probabilistic Constraint with Discrete Random Variables

Author

Listed:
  • András Prékopa

    (Rutgers Center for Operations Research, Piscataway, New Jersey 08854)

  • Merve Unuvar

    (IBM T. J. Watson Research Center, Yorktown Heights, New York 10598)

Abstract

Single commodity networks are considered, where demands at the nodes are random. The problem is to find minimum cost optimal built in capacities at the nodes and arcs subject to the constraint that all demands should be met on a prescribed probability level (reliability constraint) and some deterministic constraints should be satisfied. The reliability constraint is formulated in terms of the Gale–Hoffman feasibility inequalities, but their number is reduced by elimination technique. The concept of a p -efficient point is used in a smart way to convert and then relax the problem into an LP. The p -efficient points are simultaneously generated with the solution of the LP. The joint distribution of the demands is used to obtain the p -efficient points for all stochastic inequalities that were not eliminated and the solution of a multiple choice knapsack problem is used to generate p -efficient points. The model can be applied to planning in interconnected power systems, flood control networks, design of shelter and road capacities in evacuation, parking lot capacities, financial networks, cloud computing system design, etc. Numerical examples are presented.

Suggested Citation

  • András Prékopa & Merve Unuvar, 2015. "Single Commodity Stochastic Network Design Under Probabilistic Constraint with Discrete Random Variables," Operations Research, INFORMS, vol. 63(6), pages 1512-1527, December.
    • Handle: RePEc:inm:oropre:v:63:y:2015:i:6:p:1512-1527
    DOI: 10.1287/opre.2015.1434
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2015.1434
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.2015.1434?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. 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.
    2. Lejeune, Miguel & Noyan, Nilay, 2010. "Mathematical programming approaches for generating p-efficient points," European Journal of Operational Research, Elsevier, vol. 207(2), pages 590-600, December.
    3. Pisinger, David, 1995. "A minimal algorithm for the multiple-choice knapsack problem," European Journal of Operational Research, Elsevier, vol. 83(2), pages 394-410, June.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Tibor Szkaliczki, 2025. "Solution Methods for the Multiple-Choice Knapsack Problem and Their Applications," Mathematics, MDPI, vol. 13(7), pages 1-35, March.
    2. Elçi, Özgün & Noyan, Nilay, 2018. "A chance-constrained two-stage stochastic programming model for humanitarian relief network design," Transportation Research Part B: Methodological, Elsevier, vol. 108(C), pages 55-83.

    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. Christensen, Tue R.L. & Labbé, Martine, 2015. "A branch-cut-and-price algorithm for the piecewise linear transportation problem," European Journal of Operational Research, Elsevier, vol. 245(3), pages 645-655.
    2. Shuaian Wang & Dan Zhuge & Lu Zhen & Chung-Yee Lee, 2021. "Liner Shipping Service Planning Under Sulfur Emission Regulations," Transportation Science, INFORMS, vol. 55(2), pages 491-509, March.
    3. M Hifi & M Michrafy, 2006. "A reactive local search-based algorithm for the disjunctively constrained knapsack problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(6), pages 718-726, June.
    4. Sbihi, Abdelkader, 2010. "A cooperative local search-based algorithm for the Multiple-Scenario Max-Min Knapsack Problem," European Journal of Operational Research, Elsevier, vol. 202(2), pages 339-346, April.
    5. Tue R. L. Christensen & Kim Allan Andersen & Andreas Klose, 2013. "Solving the Single-Sink, Fixed-Charge, Multiple-Choice Transportation Problem by Dynamic Programming," Transportation Science, INFORMS, vol. 47(3), pages 428-438, August.
    6. Dauzère-Pérès, Stéphane & Hassoun, Michael, 2020. "On the importance of variability when managing metrology capacity," European Journal of Operational Research, Elsevier, vol. 282(1), pages 267-276.
    7. Michel, S. & Perrot, N. & Vanderbeck, F., 2009. "Knapsack problems with setups," European Journal of Operational Research, Elsevier, vol. 196(3), pages 909-918, August.
    8. Edmonds, Lawryn & Derby, Melanie & Hill, Mary & Wu, Hongyu, 2021. "Coordinated operation of water and electricity distribution networks with variable renewable energy and distribution locational marginal pricing," Renewable Energy, Elsevier, vol. 177(C), pages 1438-1450.
    9. Darinka Dentcheva & Gabriela Martinez, 2012. "Augmented Lagrangian method for probabilistic optimization," Annals of Operations Research, Springer, vol. 200(1), pages 109-130, November.
    10. Xiaodi Bai & Jie Sun & Xiaojin Zheng, 2021. "An Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization Problems," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 1056-1069, July.
    11. 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.
    12. Wishon, Christopher & Villalobos, J. Rene, 2016. "Robust efficiency measures for linear knapsack problem variants," European Journal of Operational Research, Elsevier, vol. 254(2), pages 398-409.
    13. Higgins Michael J. & Rivest Ronald L. & Stark Philip B., 2011. "Sharper p-Values for Stratified Election Audits," Statistics, Politics and Policy, De Gruyter, vol. 2(1), pages 1-37, October.
    14. Tibor Szkaliczki, 2025. "Solution Methods for the Multiple-Choice Knapsack Problem and Their Applications," Mathematics, MDPI, vol. 13(7), pages 1-35, March.
    15. Faqiry, M. Nazif & Edmonds, Lawryn & Wu, Hongyu & Pahwa, Anil, 2020. "Distribution locational marginal price-based transactive day-ahead market with variable renewable generation," Applied Energy, Elsevier, vol. 259(C).
    16. Furini, Fabio & Ljubić, Ivana & Sinnl, Markus, 2017. "An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem," European Journal of Operational Research, Elsevier, vol. 262(2), pages 438-448.
    17. Maxime C. Cohen & Swati Gupta & Jeremy J. Kalas & Georgia Perakis, 2020. "An Efficient Algorithm for Dynamic Pricing Using a Graphical Representation," Production and Operations Management, Production and Operations Management Society, vol. 29(10), pages 2326-2349, October.
    18. Kateryna Czerniachowska, 2022. "A genetic algorithm for the retail shelf space allocation problem with virtual segments," OPSEARCH, Springer;Operational Research Society of India, vol. 59(1), pages 364-412, March.
    19. Kaiyue Zheng & Laura A. Albert, 2019. "Interdiction models for delaying adversarial attacks against critical information technology infrastructure," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(5), pages 411-429, August.
    20. Kyungmin Kim & Minseok Song, 2022. "Energy-Saving SSD Cache Management for Video Servers with Heterogeneous HDDs," Energies, MDPI, vol. 15(10), pages 1-16, May.

    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:inm:oropre:v:63:y:2015:i:6:p:1512-1527. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.