Shortest path network interdiction with asymmetric information

Networks - Tập 52 Số 3 - Trang 133-140 - 2008
Halil İ. Bayrak1, Matthew D. Bailey2
1Industrial Engineering Department, University of Pittsburgh, Pittsburgh, Pennsylvania 15261
2Management Department, Bucknell University, Lewisburg, PA 17837

Tóm tắt

AbstractWe consider an extension of the shortest path network interdiction problem. In this problem an evader attempts to minimize the length of the shortest path between the origin and the destination in a network, while an interdictor attempts to maximize the length of this shortest path by interdicting network arcs using limited resources. We consider the case where there is asymmetric information, i.e., the evader and the interdictor have different levels of information about the network. We formulate this problem as a nonlinear mixed integer program and show that this formulation can be converted to a linear mixed integer program. Computational results demonstrate improvements in the objective function values over the shortest path network interdiction problem with symmetric information. © 2008 Wiley Periodicals, Inc. NETWORKS, 2008

Từ khóa


Tài liệu tham khảo

10.1109/TAC.1984.1103455

10.1109/TPWRS.2005.846198

10.1016/j.orl.2005.05.002

10.1007/BF01580720

10.1016/0305-0548(82)90007-7

10.1287/mnsc.30.8.1004

10.1016/0305-0548(82)90006-5

10.1007/s10288-005-0071-0

10.1287/opre.46.2.184

10.1109/TPWRS.2004.831269

10.1007/BF01584329

10.1002/nav.3800250412

10.1002/nav.20079

Hemmecke R., 2002, Network interdiction and stochastic integer programming, 69

10.1002/net.10039

10.1007/BF00939562

10.1016/j.ejor.2003.08.040

10.1287/mnsc.47.5.709.10479

10.1111/j.1468-0262.2002.00444.x

10.1002/nav.3800170302

10.1023/A:1023047900333

Pan F., 2002, Network interdiction and stochastic integer programming, 1

10.1109/TEVC.2005.856204

10.1007/BF01096458

10.1007/BF02191670

10.1287/opre.43.2.243

10.1007/BF01096412

10.1287/opre.12.6.934

10.1016/0895-7177(93)90236-R

Thông tin
Thông tin xuất bản

Networks

Tập 52 Số 3

133-140

Thông tin tác giả