An Improved Pareto Local Search-Based Evolutionary Algorithm for Multi-Objective Shortest-Path Network Counter-Interdiction Problem
Chenghui Mao,
Ronghuan Gao,
Qizhang Luo () and
Guohua Wu
Additional contact information
Chenghui Mao: School of Traffic and Transportation Engineering, Central South University, Changsha 410075, China
Ronghuan Gao: School of Traffic and Transportation Engineering, Central South University, Changsha 410075, China
Qizhang Luo: School of Automation, Central South University, Changsha 410083, China
Guohua Wu: School of Automation, Central South University, Changsha 410083, China
Mathematics, 2025, vol. 13, issue 16, 1-25
Abstract:
Most existing studies on the Shortest-Path Network Interdiction Problem (SPIP) adopt the attacker’s perspective, often overlooking the critical role of defender-oriented strategies. To support proactive defense, this paper introduces a novel problem named the Multi-Objective Shortest-Path Counter-Interdiction Problem (MO-SPCIP). The problem incorporates a backup-based defense strategy from the defender’s viewpoint and addresses the inherent trade-offs among minimizing the shortest path length, minimizing backup resource consumption, and maximizing the attacker’s resource usage. To solve this complex problem, we propose an Improved Pareto Local Search-based Evolutionary Algorithm (IPLSEA). The algorithm integrates several problem-specific components, including a tailored initial solution generation method, a customized solution representation, and specialized genetic operators. In addition, an improved Pareto Local Search (IPLS) is incorporated into the algorithm framework, allowing an adaptive and selective search. To further enhance local refinement, three problem-specific neighborhood search operations are designed and embedded within the Pareto Local Search. The experimental results demonstrate that IPLSEA significantly outperforms state-of-the-art algorithms in terms of its convergence quality and solution diversity, enabling a more robust performance in network counter-interdiction scenarios.
Keywords: network counter-interdiction; backup strategy; multi-objective optimization; evolutionary algorithm (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2025
References: View complete reference list from CitEc
Citations:
Downloads: (external link)
https://www.mdpi.com/2227-7390/13/16/2683/pdf (application/pdf)
https://www.mdpi.com/2227-7390/13/16/2683/ (text/html)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:13:y:2025:i:16:p:2683-:d:1728931
Access Statistics for this article
Mathematics is currently edited by Ms. Emma He
More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().