The problem of the network flow interdiction

	The problem of the network flow interdiction
International Journal of Nonlinear Analysis and Applications
مقاله 6، دوره 15، شماره 2، اردیبهشت 2024، صفحه 63-70 اصل مقاله (352.76 K)
نوع مقاله: Research Paper
شناسه دیجیتال (DOI): 10.22075/ijnaa.2022.26063.3213
نویسنده
Razieh Keshavarzi^*
Department of Mathematics, Faculty of Basic Sciences, Shahrekord Branch, Islamic Azad University, Shahrekord, Iran
چکیده
In this paper, we state the problem of the network flow interdiction in a set of initial and destination nodes so that each initial is capable of only delivering products to certain pre-determined destinations. The network user’s purpose is to deliver the highest value of flow from the sources to the sinks and the network interdictor’s purpose is to reduce the highest value of flow being used. In this paper, the networks flow interdiction in multi-source and multi-sink conditions are addressed in a way that the parameters of arc capacity are trapezoidal fuzzy sets.
کلیدواژه‌ها
Interdiction problem؛ network flow؛ fuzzy sets؛ simplex method؛ ranking function؛ duality؛ bi-level programming؛ decomposition
مراجع

آمار تعداد مشاهده مقاله: 19,411 تعداد دریافت فایل اصل مقاله: 12,993

پیوندهای مفید

آمار