IDEAS home Printed from https://ideas.repec.org/a/wly/jnljam/v2014y2014i1n876260.html

Capacity Expansion and Reliability Evaluation on the Networks Flows with Continuous Stochastic Functional Capacity

Author

Listed:
  • F. Hamzezadeh
  • H. Salehi Fathabadi

Abstract

In many systems such as computer network, fuel distribution, and transportation system, it is necessary to change the capacity of some arcs in order to increase maximum flow value from source s to sink t, while the capacity change incurs minimum cost. In real‐time networks, some factors cause loss of arc’s flow. For example, in some flow distribution systems, evaporation, erosion or sediment in pipes waste the flow. Here we define a real capacity, or the so‐called functional capacity, which is the operational capacity of an arc. In other words, the functional capacity of an arc equals the possible maximum flow that may pass through the arc. Increasing the functional arcs capacities incurs some cost. There is a certain resource available to cover the costs. First, we construct a mathematical model to minimize the total cost of expanding the functional capacities to the required levels. Then, we consider the loss of flow on each arc as a stochastic variable and compute the system reliability.

Suggested Citation

  • F. Hamzezadeh & H. Salehi Fathabadi, 2014. "Capacity Expansion and Reliability Evaluation on the Networks Flows with Continuous Stochastic Functional Capacity," Journal of Applied Mathematics, John Wiley & Sons, vol. 2014(1).
  • Handle: RePEc:wly:jnljam:v:2014:y:2014:i:1:n:876260
    DOI: 10.1155/2014/876260
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2014/876260
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2014/876260?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. R. K. Ahuja & James B. Orlin, 1989. "A Fast and Simple Algorithm for the Maximum Flow Problem," Operations Research, INFORMS, vol. 37(5), pages 748-759, October.
    2. Jun Xiao & Guo-qiang Zu & Xiao-xu Gong & Cheng-shan Wang, 2014. "Model and Topological Characteristics of Power Distribution System Security Region," Journal of Applied Mathematics, Hindawi, vol. 2014, pages 1-13, July.
    3. Ahuja, R. K. & Batra, J. L. & Gupta, S. K. & Punnen, A. P., 1996. "Optimal expansion of capacitated transshipment networks," European Journal of Operational Research, Elsevier, vol. 89(1), pages 176-184, February.
    4. Jun Xiao & Guo-qiang Zu & Xiao-xu Gong & Cheng-shan Wang, 2014. "Model and Topological Characteristics of Power Distribution System Security Region," Journal of Applied Mathematics, John Wiley & Sons, vol. 2014(1).
    5. Yeh, Wei-Chang, 2005. "A new approach to evaluate reliability of multistate networks under the cost constraint," Omega, Elsevier, vol. 33(3), pages 203-209, June.
    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. Song, Chenhui & Xiao, Jun & Zu, Guoqiang & Hao, Ziyuan & Zhang, Xinsong, 2021. "Security region of natural gas pipeline network system: Concept, method and application," Energy, Elsevier, vol. 217(C).
    2. Cancela, Héctor & Petingi, Louis, 2007. "Properties of a generalized source-to-all-terminal network reliability model with diameter constraints," Omega, Elsevier, vol. 35(6), pages 659-670, December.
    3. Niu, Yi-Feng & Yan, Yi-Fan & Xu, Xiu-Zhen, 2026. "A new MC-based method for the resource-constrained multi-distribution multi-state flow network reliability optimization problem," Reliability Engineering and System Safety, Elsevier, vol. 265(PA).
    4. Qi Zeng & Xiu-Zhen Xu, 2016. "Assessing the Reliability of a Multistate Logistics Network under the Transportation Cost Constraint," Discrete Dynamics in Nature and Society, John Wiley & Sons, vol. 2016(1).
    5. van de Leensel, R.L.J.M. & Flippo, O.E. & Koster, Arie M.C.A. & Kolen, A.W.J., 1996. "A dynamic programming algorithm for the local access network expansion problem," Research Memorandum 027, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    6. Jiang, Xun & Zhou, Yue & Ming, Wenlong & Wu, Jianzhong, 2023. "Feasible operation region of an electricity distribution network," Applied Energy, Elsevier, vol. 331(C).
    7. Yi-Kuei Lin & Cheng-Fu Huang, 2016. "Reliability evaluation according to a routing scheme for multi-state computer networks under assured accuracy rate," Annals of Operations Research, Springer, vol. 244(1), pages 221-240, September.
    8. Lin, Yi-Kuei & Yeh, Cheng-Ta, 2012. "Determining the optimal double-component assignment for a stochastic computer network," Omega, Elsevier, vol. 40(1), pages 120-130, January.
    9. Lin, Yi-Kuei, 2007. "Performance evaluation for the logistics system in case that capacity weight varies from arcs and types of commodity," International Journal of Production Economics, Elsevier, vol. 107(2), pages 572-580, June.
    10. Huynh Tuong, Nguyen & Soukhal, Ameur, 2010. "Due dates assignment and JIT scheduling with equal-size jobs," European Journal of Operational Research, Elsevier, vol. 205(2), pages 280-289, September.
    11. Dorit S. Hochbaum & Anna Chen, 2000. "Performance Analysis and Best Implementations of Old and New Algorithms for the Open-Pit Mining Problem," Operations Research, INFORMS, vol. 48(6), pages 894-914, December.
    12. Niu, Yi-Feng & Song, Yi-Fan & Xu, Xiu-Zhen & Zhao, Xia, 2022. "Efficient reliability computation of a multi-state flow network with cost constraint," Reliability Engineering and System Safety, Elsevier, vol. 222(C).
    13. Majid Taghavi & Kai Huang, 2016. "A multi‐stage stochastic programming approach for network capacity expansion with multiple sources of capacity," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(8), pages 600-614, December.
    14. Antonio Sedeño‐Noda & Carlos González‐Martín, 2000. "A O(nm log(U/n)) time maximum flow algorithm," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(6), pages 511-520, September.
    15. Xiao, Jun & Zu, Guoqiang & Wang, Ying & Zhang, Xinsong & Jiang, Xun, 2020. "Model and observation of dispatchable region for flexible distribution network," Applied Energy, Elsevier, vol. 261(C).
    16. Yi-Kuei Lin & Chih-Li Pan, 2016. "Data transmission reliability evaluation of a stochastic computer network through minimal paths with a retransmission mechanism," Journal of Risk and Reliability, , vol. 230(6), pages 551-560, December.
    17. E. M. U. S. B. Ekanayake & W. B. Daundasekara & S. P. C. Perera, 2022. "New Approach to Obtain the Maximum Flow in a Network and Optimal Solution for the Transportation Problems," Modern Applied Science, Canadian Center of Science and Education, vol. 16(1), pages 1-30, February.
    18. Gary R. Waissi, 1993. "A new polynomial algorithm for maximum value flow with an efficient parallel implementation," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(3), pages 393-414, April.
    19. Kozyra, Paweł Marcin, 2023. "The usefulness of (d,b)-MCs and (d,b)-MPs in network reliability evaluation under delivery or maintenance cost constraints," Reliability Engineering and System Safety, Elsevier, vol. 234(C).
    20. Xu, Xiu-Zhen & Zhou, Run-Hui & Wu, Guo-Lin & Niu, Yi-Feng, 2024. "Evaluating the transmission distance-constrained reliability for a multi-state flow network," Reliability Engineering and System Safety, Elsevier, vol. 244(C).

    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:jnljam:v:2014:y:2014:i:1:n:876260. 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://onlinelibrary.wiley.com/journal/4185 .

    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.