A MODEL FOR TARGETING STRIKES IN AN LOC NETWORK

Abstract

The paper presents a computer model for developing and evaluating a targeting strategy against an opposing force's lines of communication (LOC). The aim is to obtain the greatest reduction in enemy throughput and the greatest time and cost of repair. The network arcs (road, rail, or waterway segments or transshipment points) are characterized by beginning and ending nodes, upper and lower bounds, interdicted and uninterdicted unit flow costs, repair times and costs, and the probabilities that attempted strikes are successful. The model is programmed in daily cycles, with the user specifying number of days and strikes. Strikes are targeted one by one. At the end of each strike, total LOC throughput and costs are printed out; if desired, a detailed status report and/or a profile of total flow versus user cost are also output. The FORTRAN program is thoroughly self-documented.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1969
Accession Number
AD0700033

Entities

People

  • M. J. Ondrasek
  • R. D. Wollmer

Organizations

  • RAND Corporation

Tags

Communities of Interest

  • Air Platforms
  • Autonomy
  • Cyber

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Alphanumeric Data
  • Computer Programming
  • Computer Programs
  • Computers
  • Interdiction
  • Kill Probabilities
  • Mathematics
  • Numbers
  • Probability
  • Targeting
  • Targets
  • Throughput
  • Transportation
  • United States
  • Waterways

Readers

  • Computer Networking
  • Military History / Militaries and War Studies
  • Operations Research