Affiliation:
1. Department of science and technology studies, AJA Command and Staff University, Tehran, Iran
Abstract
Uncertainty is an inherent characteristic of a decision-making process. Occasionally, historical data may be insufficient to accurately estimate the probability distribution suitable for an unknown variable. In these situations, we deal with fuzzy stochastic variables in solving a problem. As a result, decision-makers, particularly those in the military, are confronted with numerous issues. This article discusses the maximum network flow interdiction under fuzzy stochastic hybrid conditions. The capacity of arcs has been treated as a fuzzy stochastic variable in this problem. The primary objective of this paper is to propose a model to the decision-maker that can be used to manage unknown factors in the network. Since this topic is explored concurrently in a stochastic and fuzzy environment, it is impossible to solve it directly. Consequently, three probability-possibility, probability-necessity, and probability-credibility techniques are utilized to transform it into a deterministic state. Eventually, the proposed model?s efficacy is demonstrated by presenting a numerical example.
Publisher
National Library of Serbia
Subject
Management Science and Operations Research
Reference34 articles.
1. L. Bingol, “A lagrangian heuristic for solving network interdiction problem,” in Master’s thesis, Naval Postgraduate School, 2001.
2. C. A. Phillips, “The network inhibition problem,” in Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, 1993, pp. 776-785.
3. J. Salmeron, K. Wood, and R. Baldick, “Analysis of electric grid security under terrorist threat,” IEEE Transactions on power systems, vol. 19, no. 2, pp. 905-912, 2004.
4. N. Assimakopoulos, “A network interdiction model for hospital infection control,” Computers in biology and medicine, vol. 17, no. 6, pp. 413-422, 1987.
5. A. Gutfraind, “New models of interdiction in networked systems,” Phalanx, vol. 44, no. 2, pp. 25-27, 2011.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Extreme Min – Cut Max – Flow Algorithm;International Journal of Applied Metaheuristic Computing;2023-05-05