Volume 53, Number 2, April-June 2019
|Page(s)||461 - 472|
|Published online||26 April 2019|
Bi-objective optimization models for network interdiction
Department of Industrial Engineering and Operations Research, Columbia University, New York, USA.
2 Data Science Institute, Columbia University, New York USA.
* Corresponding author: firstname.lastname@example.org
Accepted: 11 June 2017
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.
Mathematics Subject Classification: 90Cxx
Key words: Bi-objective optimization interdiction / network flows
© EDP Sciences, ROADEF, SMAI 2019
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.