.png){kind=icon}
返回
Bi and tri-objective optimization in the deterministic network interdiction problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ress.2010.03.008.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Solution approaches to the deterministic network interdiction problem have previously been developed for optimizing a single figure-of-merit of the network configuration (i.e. flow that can be transmitted between a source node and a sink node for a fixed network design) under constraints related to limited amount of resources available to interdict network links. These approaches work under the assumption that: (1) nominal capacity of each link is completely reduced when interdicted and (2) there is a single criterion to optimize. This paper presents a newly developed evolutionary algorithm that for the first time allows solving multi-objective optimization models for the design of network interdiction strategies that take into account a variety of figures-of-merit. The algorithm provides an approximation to the optimal Pareto frontier using: (a) techniques in Monte Carlo simulation to generate potential network interdiction strategies, (b) graph theory to analyze strategies' maximum source-sink flow and (c) an evolutionary search that is driven by the probability that a link will belong to the optimal Pareto set. Examples for different sizes of networks and network behavior are used throughout the paper to illustrate and validate the approach. (C) 2010 Elsevier Ltd. All rights reserved.
Keyword:
Network
Interdiction
Evolutionary
Optimization
Multi-objective
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
R
IF:
11
论文数:
9.0K
被引数:
4.2W
机构
引用论文
Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
PREAI
分享收藏A screening methodology for the identification and ranking of infrastructure vulnerabilities due to terrorism.png)
RISK ANALYSIS
RISK ANALYSISIF3.3
PREAI
分享收藏
查看更多内容