Optimal Routing of Military Convoys through a Road Network

Abstract

To wage a successful campaign, military units and materiel must be in position by the designated time. This thesis models the problem of moving military units and materiel in convoys through a road network as mathematical programming models. In particular, two models, linear and integer, are investigated. Both models belong to the class of multicommodity, dynamic transshipment network problems. Based on prototypic GAMS implementations, they provide essentially the same answer. However, the linear model is easier to construct, takes less time to solve and allows for more flexible convoy routing.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1991
Accession Number
ADA241933

Entities

People

  • Dong K. Lee

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • Weapons Technologies

DTIC Thesaurus Topics

  • Abstracts
  • Air Force
  • Commodities
  • Computer Programming
  • Emergency Egress
  • Equations
  • Flow Network
  • Graphs
  • Integer Programming
  • Linear Programming
  • Mathematical Programming
  • Military Doctrine
  • Operations Research
  • Statistics
  • Technical Information Centers
  • Transportation
  • Vehicles

Readers

  • Maritime Security/Maritime Homeland Security
  • Military History / Militaries and War Studies
  • Operations Research