### Abstract

This paper explores the convoy quickest-path interdiction problem (CQPI). In this problem, an interdictor or attacker uses limited offensive resources to attack components of a road network (i.e., road segments or intersections) to maximally delay a ground convoy transiting between specified origin and destination nodes in the network. The convoy’s commander, or defender, routes the convoy on a quickest path, which determines a convoy’s instantaneous speed by the convoy’s length, network characteristics (e.g., topology, speed limits), and by doctrine. After defining this new convoy quickest-path (CQP) problem, we develop an A* search algorithm for its solution. Finally, assuming a binary interdiction model in which an interdicted network component becomes impassable, we note the CQPI is NP-hard and show how to solve instances using a decomposition algorithm that solves CQP subproblems to evaluate tentative interdiction plans.

Original language | English |
---|---|

Pages (from-to) | 5-17 |

Number of pages | 13 |

Journal | Military Operations Research |

Volume | 23 |

Issue number | 2 |

DOIs | |

Publication status | Published - 2018 Jan 1 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Civil and Structural Engineering
- Mechanical Engineering
- Management Science and Operations Research

### Cite this

*Military Operations Research*,

*23*(2), 5-17. https://doi.org/10.5711/1082598323205

}

*Military Operations Research*, vol. 23, no. 2, pp. 5-17. https://doi.org/10.5711/1082598323205

**Optimal interdiction of a ground convoy.** / Oh, Dong Hwan; Kevin Wood, R.; Lee, Young Hoon.

Research output: Contribution to journal › Article

TY - JOUR

T1 - Optimal interdiction of a ground convoy

AU - Oh, Dong Hwan

AU - Kevin Wood, R.

AU - Lee, Young Hoon

PY - 2018/1/1

Y1 - 2018/1/1

N2 - This paper explores the convoy quickest-path interdiction problem (CQPI). In this problem, an interdictor or attacker uses limited offensive resources to attack components of a road network (i.e., road segments or intersections) to maximally delay a ground convoy transiting between specified origin and destination nodes in the network. The convoy’s commander, or defender, routes the convoy on a quickest path, which determines a convoy’s instantaneous speed by the convoy’s length, network characteristics (e.g., topology, speed limits), and by doctrine. After defining this new convoy quickest-path (CQP) problem, we develop an A* search algorithm for its solution. Finally, assuming a binary interdiction model in which an interdicted network component becomes impassable, we note the CQPI is NP-hard and show how to solve instances using a decomposition algorithm that solves CQP subproblems to evaluate tentative interdiction plans.

AB - This paper explores the convoy quickest-path interdiction problem (CQPI). In this problem, an interdictor or attacker uses limited offensive resources to attack components of a road network (i.e., road segments or intersections) to maximally delay a ground convoy transiting between specified origin and destination nodes in the network. The convoy’s commander, or defender, routes the convoy on a quickest path, which determines a convoy’s instantaneous speed by the convoy’s length, network characteristics (e.g., topology, speed limits), and by doctrine. After defining this new convoy quickest-path (CQP) problem, we develop an A* search algorithm for its solution. Finally, assuming a binary interdiction model in which an interdicted network component becomes impassable, we note the CQPI is NP-hard and show how to solve instances using a decomposition algorithm that solves CQP subproblems to evaluate tentative interdiction plans.

UR - http://www.scopus.com/inward/record.url?scp=85053024845&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85053024845&partnerID=8YFLogxK

U2 - 10.5711/1082598323205

DO - 10.5711/1082598323205

M3 - Article

AN - SCOPUS:85053024845

VL - 23

SP - 5

EP - 17

JO - Military Operations Research

JF - Military Operations Research

SN - 0275-5823

IS - 2

ER -