This paper designs models for the network interdiction problem. The interdiction problem under study has two contradicting goals: disrupting the network to minimize the profit of one set of agents, while as much as possible preserve the profit of another set of agents. Three bi-objective optimization methods are employed to form the optimal objectives. Also, we develop two formulations (MILP and multi-stage LP) used to deal with congestion cost which is a piecewise cost function. A numerical instance is also presented to better illustrate those models.
Accepté le :
DOI : 10.1051/ro/2017050
Keywords: Bi-objective optimization interdiction, network flows
Chen, Yan 1 ; Guo, Cheng 1 ; Yu, Shenghan 1
@article{RO_2019__53_2_461_0,
author = {Chen, Yan and Guo, Cheng and Yu, Shenghan},
title = {Bi-objective optimization models for network interdiction},
journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
pages = {461--472},
year = {2019},
publisher = {EDP Sciences},
volume = {53},
number = {2},
doi = {10.1051/ro/2017050},
zbl = {1430.90540},
language = {en},
url = {https://www.numdam.org/articles/10.1051/ro/2017050/}
}
TY - JOUR AU - Chen, Yan AU - Guo, Cheng AU - Yu, Shenghan TI - Bi-objective optimization models for network interdiction JO - RAIRO - Operations Research - Recherche Opérationnelle PY - 2019 SP - 461 EP - 472 VL - 53 IS - 2 PB - EDP Sciences UR - https://www.numdam.org/articles/10.1051/ro/2017050/ DO - 10.1051/ro/2017050 LA - en ID - RO_2019__53_2_461_0 ER -
%0 Journal Article %A Chen, Yan %A Guo, Cheng %A Yu, Shenghan %T Bi-objective optimization models for network interdiction %J RAIRO - Operations Research - Recherche Opérationnelle %D 2019 %P 461-472 %V 53 %N 2 %I EDP Sciences %U https://www.numdam.org/articles/10.1051/ro/2017050/ %R 10.1051/ro/2017050 %G en %F RO_2019__53_2_461_0
Chen, Yan; Guo, Cheng; Yu, Shenghan. Bi-objective optimization models for network interdiction. RAIRO - Operations Research - Recherche Opérationnelle, Tome 53 (2019) no. 2, pp. 461-472. doi: 10.1051/ro/2017050
, , , , Multi-objective Stochastic Programming Approach for Supply Chain Design Considering Risk. Inter. J. Production Econ. 116 (2008) 129–138.
, , An Integrated Model for Location-inventory Problem With Random Disruptions, in Proc. of International Conference on Computers & Industrial Engineering (2009) 687–703.
, , , On the Power of Randomization in Network Interdiction. Oper. Res. Lett. 44.1 (2016) 114–120. | Zbl
, , Using Mixed-integer Programming to Solve Power Grid Blackout Problems. Discrete Optimiz. 4 (2007) 115–141. | Zbl
, , , An Exact ε-constraint Method for Bi-objective Combinatorial Optimization Problems: Application to the Traveling Salesman Problem With Profit. Eur. J. Oper. Res. 194 (2009) 39–50. | Zbl
, , , , Network-based Accessibility Measures for Vulnerability Analysis of Degradable Transportation Networks. Networks Spatial Econ. 7 (2007) 241–256. | Zbl
, , , An Implicit Optimization Approach for Survivable Network Design, in Proc. of IEEE Network Science Workshop (2011).
, , General Network Design: a Unified View of Combined Location and Network Design Problems. Eur. J. Oper. Res. 212 (2011) 518–528.
, , , An Inventory-location Model: Formulation, Solution Algorithm and Computational Results. Ann. Oper. Res. 110 (2002) 83–106. | Zbl
, , Models for Reliable Supply Chain Network Design. Critical Infrastructure: Reliability and Vulnerability, Springer Nature Switzerland (2007) pp. 257–289.
, , , Multi-objective Supply Chain Network Design Under Uncertainty Using Robust Global Programming Approach, in Proc. of the 2015 International Conference on Operations Excellence and Service Engineering, Orlando, Florida, USA (2015).
, , , Mohammadi, A Multi-objective Reliable Programming Model for Disruption in Supply Chain. Manag. Sci. Lett. 3 (2013) 1467–1478.
, Removing Arcs From a Network. Oper. Res. 12 (1964) 934–940. | Zbl
, Deterministic Network Interdiction. Math. Comput. Model. 17 (1993) 1–18. | Zbl
Cité par Sources :





