Shortest path network interdiction with asymmetric uncertainty

Author:

Punla‐Green She'ifa Z.123ORCID,Mitchell John E.1ORCID,Gearhart Jared L.34ORCID,Hart William E.35ORCID,Phillips Cynthia A.36ORCID

Affiliation:

1. Department of Mathematical Sciences Rensselaer Polytechnic Institute Troy New York USA

2. Sandia National Laboratories Livermore California USA

3. Operations Research The MITRE Corporation McLean Virginia USA

4. Operations Research and Computational Analysis Department Sandia National Laboratories Livermore California USA

5. Discrete Math and Optimization Department Sandia National Laboratories Livermore California USA

6. Advanced Science & Technology Division Sandia National Laboratories Livermore California USA

Abstract

AbstractThis paper considers an extension of the shortest path network interdiction problem that incorporates robustness to account for parameter uncertainty. The shortest path interdiction problem is a game of two players with conflicting agendas and capabilities: an evader, who traverses the arcs of a network from a source node to a sink node using a path of shortest length, and an interdictor, who maximizes the length of the evader's shortest path by interdicting arcs on the network. It is usually assumed that the parameters defining the network are known exactly by both players. We consider the situation where the evader assumes the nominal parameter values while the interdictor uses robust optimization techniques to account for parameter uncertainty or sensor degradation. We formulate this problem as a nonlinear mixed‐integer semi‐infinite bilevel program and show that it can be converted into a mixed‐integer linear program with a second order cone constraint. We use random geometric networks and transportation networks to perform computational studies and demonstrate the unique decision strategies that our variant produces. Solving the shortest path interdiction problem with asymmetric uncertainty protects the interdictor from investing in a strategy that hinges on key interdictions performing as promised. It also provides an alternate strategy that mitigates the risk of these worst‐case possibilities.

Funder

U.S. Department of Energy

Publisher

Wiley

Subject

Computer Networks and Communications,Hardware and Architecture,Information Systems,Software

Reference37 articles.

1. Shortest path network interdiction with asymmetric information

2. Robust Optimization

3. Robust optimization for emergency logistics planning: Risk mitigation in humanitarian relief supply chains

4. R.BentandP.Van Hentenryck.Regrets only! Online stochastic optimization under time constraints Proceedings of the 19th National Conference on Artifical intelligence California San Jose.2004501–506.

5. Robust and Adaptive Network Flows

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3