Solving multi-period interdiction via generalized Bender’s decomposition
Solving multi-period interdiction via generalized Bender’s decomposition
复制标题
通过广义本德分解解决多周期拦截问题
DOI：
--
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
A. Ghaffari
中科院分区：
文献类型：
--
作者：
Maryam Soleimani;A. Ghaffari
本文考虑了一种新的制定多时期的网络阻断问题。在该模型中，最大流量的输送和阻断行为发生在多个时段，而阻断资源的预算是有限的。假设当边缘在一个周期中被阻断时，逃避者考虑在随后的周期中检测的风险率。广义Benders分解算法的应用考虑解决由此产生的混合整数非线性规划问题。计算经验表示与预期的合理一致性。
This paper considers a novel formulation of the multi-period network interdiction problem. In this model, delivery of the maximum flow as well as the act of interdiction happens over several periods, while the budget of resource for interdiction is limit. It is assumed that when an edge is interdicted in a period, the evader considers a rate of risk of detection at consequent periods. Application of the generalized Benders decomposition algorithm considers solving the resulting mixed-integer nonlinear programming problem. Computational experiences denote reasonable consistency with expectations.