Optimal Routing of Battle Group VERTREP Assets

Abstract

During battle group operations ships regularly require the transfer of material and personnel. The VERTREP of personnel and high priority cargoes is accomplished by logistics helicopter. This study describes an implicit enumeration algorithm to schedule the delivery route for a single helicopter. The algorithm employs a depth first search technique to solve the multiple constraint, multiple time window routing problem. Several fathoming techniques are demonstrated and computational results for eleven ship battle groups are presented.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1990
Accession Number
ADA237101

Entities

People

  • Thomas W. Smith

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • Ground and Sea Platforms

DTIC Thesaurus Topics

  • Algorithms
  • California
  • Classification
  • Combat Readiness
  • Computers
  • Correlation Analysis
  • Demographic Cohorts
  • Helicopters
  • Logistics
  • Materials
  • Mathematical Programming
  • Operations Research
  • Replenishment
  • Scheduling (Production)
  • Security
  • Travel Time
  • Vehicles

Readers

  • Aerospace logistics and air mobility.
  • Sensor Fusion and Tracking Systems.
  • Theoretical Analysis.