Modelling Strategic Strikes against Transportation Networks

Abstract

We present deterministic and probabilistic models for the analysis of strategic strikes against transportation networks. The deterministic models use integer programming to solve problems on single and multicommodity networks. The aims of a network interdictor are (1) to minimize the maximum network flow with a fixed amount of interdiction resources, or (2) to minimize the total effort and mission turnaround time if given sufficient resources to stop the flow completely. In the case of a multicommodity network, the interdictor also aims to utilize minimum resources to achieve a disconnecting, set which severs the paths connecting all sources to their respective sinks. In the probabilistic model, arc capacity is not a factor and the objective of a single interdictor is to minimize the probability of infiltration by a single evader through a network while the objective of the evader is just the opposite.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1991
Accession Number
ADA246898

Entities

People

  • Kok-hua Loh

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • Air Platforms
  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Air Force
  • Aircrafts
  • Algorithms
  • Ammunition
  • Classification
  • Computer Programming
  • Computer Programs
  • Flow Network
  • Linear Programming
  • Logistics
  • Military Organizations
  • Operations Research
  • Probabilistic Models
  • Probability
  • Security
  • Supply Depots
  • Transportation

Fields of Study

  • Computer science

Readers

  • Aerospace logistics and air mobility.
  • Computational Modeling and Simulation
  • Distributed Systems and Data Platform Development