The Bi-Objective Shortest Path Network Interdiction Problem: Subgraph Algorithm and Saturation Property
Critical network defense and attack problems, usually modeled as network interdiction, is of great significance. It is of great interest from the interdictor's view to study saturation property of resource allocations. This paper presents a bi-objective shortest path network interdiction model...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2020-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9152986/ |
id |
doaj-7423cd95a1044d0c861858ca4b78d1fb |
---|---|
record_format |
Article |
spelling |
doaj-7423cd95a1044d0c861858ca4b78d1fb2021-03-30T04:13:29ZengIEEEIEEE Access2169-35362020-01-01814653514654710.1109/ACCESS.2020.30129639152986The Bi-Objective Shortest Path Network Interdiction Problem: Subgraph Algorithm and Saturation PropertyKaiming Xiao0https://orcid.org/0000-0002-3172-7072Cheng Zhu1Weiming Zhang2Xiangyu Wei3https://orcid.org/0000-0002-1504-2137Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology, Changsha, ChinaScience and Technology on Information Systems Engineering Laboratory, National University of Defense Technology, Changsha, ChinaScience and Technology on Information Systems Engineering Laboratory, National University of Defense Technology, Changsha, ChinaScience and Technology on Information Systems Engineering Laboratory, National University of Defense Technology, Changsha, ChinaCritical network defense and attack problems, usually modeled as network interdiction, is of great significance. It is of great interest from the interdictor's view to study saturation property of resource allocations. This paper presents a bi-objective shortest path network interdiction model with node interdiction, in which the interdictor seeks to interdict a set of nodes in the network that is Pareto-optimal with respect to two objectives, i.e., maximization of shortest path length and minimization of resources cost. A novel subgraph sequence algorithm is developed to identify the efficient frontier through a sequence of single-objective problems. Novel subgraph decomposition algorithms are proposed to solve single-objective problems. Features and time complexity of those problems and algorithms are analyzed. Moreover, to make a trade-off between the resource investment and the interdiction performance, the definition and the computing method of saturation point are introduced in this paper. Both simulated grid network and real-world transportation network data are used to evaluate the performance of algorithms in numerical experiments. The results show that the subgraph sequence algorithm can achieve the optimal Pareto-frontier of this bi-objective problem effectively.https://ieeexplore.ieee.org/document/9152986/Network interdictionshortest pathsbilevel programmingbi-objective optimizationBenders decompositioninterdiction saturation |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Kaiming Xiao Cheng Zhu Weiming Zhang Xiangyu Wei |
spellingShingle |
Kaiming Xiao Cheng Zhu Weiming Zhang Xiangyu Wei The Bi-Objective Shortest Path Network Interdiction Problem: Subgraph Algorithm and Saturation Property IEEE Access Network interdiction shortest paths bilevel programming bi-objective optimization Benders decomposition interdiction saturation |
author_facet |
Kaiming Xiao Cheng Zhu Weiming Zhang Xiangyu Wei |
author_sort |
Kaiming Xiao |
title |
The Bi-Objective Shortest Path Network Interdiction Problem: Subgraph Algorithm and Saturation Property |
title_short |
The Bi-Objective Shortest Path Network Interdiction Problem: Subgraph Algorithm and Saturation Property |
title_full |
The Bi-Objective Shortest Path Network Interdiction Problem: Subgraph Algorithm and Saturation Property |
title_fullStr |
The Bi-Objective Shortest Path Network Interdiction Problem: Subgraph Algorithm and Saturation Property |
title_full_unstemmed |
The Bi-Objective Shortest Path Network Interdiction Problem: Subgraph Algorithm and Saturation Property |
title_sort |
bi-objective shortest path network interdiction problem: subgraph algorithm and saturation property |
publisher |
IEEE |
series |
IEEE Access |
issn |
2169-3536 |
publishDate |
2020-01-01 |
description |
Critical network defense and attack problems, usually modeled as network interdiction, is of great significance. It is of great interest from the interdictor's view to study saturation property of resource allocations. This paper presents a bi-objective shortest path network interdiction model with node interdiction, in which the interdictor seeks to interdict a set of nodes in the network that is Pareto-optimal with respect to two objectives, i.e., maximization of shortest path length and minimization of resources cost. A novel subgraph sequence algorithm is developed to identify the efficient frontier through a sequence of single-objective problems. Novel subgraph decomposition algorithms are proposed to solve single-objective problems. Features and time complexity of those problems and algorithms are analyzed. Moreover, to make a trade-off between the resource investment and the interdiction performance, the definition and the computing method of saturation point are introduced in this paper. Both simulated grid network and real-world transportation network data are used to evaluate the performance of algorithms in numerical experiments. The results show that the subgraph sequence algorithm can achieve the optimal Pareto-frontier of this bi-objective problem effectively. |
topic |
Network interdiction shortest paths bilevel programming bi-objective optimization Benders decomposition interdiction saturation |
url |
https://ieeexplore.ieee.org/document/9152986/ |
work_keys_str_mv |
AT kaimingxiao thebiobjectiveshortestpathnetworkinterdictionproblemsubgraphalgorithmandsaturationproperty AT chengzhu thebiobjectiveshortestpathnetworkinterdictionproblemsubgraphalgorithmandsaturationproperty AT weimingzhang thebiobjectiveshortestpathnetworkinterdictionproblemsubgraphalgorithmandsaturationproperty AT xiangyuwei thebiobjectiveshortestpathnetworkinterdictionproblemsubgraphalgorithmandsaturationproperty AT kaimingxiao biobjectiveshortestpathnetworkinterdictionproblemsubgraphalgorithmandsaturationproperty AT chengzhu biobjectiveshortestpathnetworkinterdictionproblemsubgraphalgorithmandsaturationproperty AT weimingzhang biobjectiveshortestpathnetworkinterdictionproblemsubgraphalgorithmandsaturationproperty AT xiangyuwei biobjectiveshortestpathnetworkinterdictionproblemsubgraphalgorithmandsaturationproperty |
_version_ |
1724182203161640960 |