The Aerial Fleet Refueling Problem

Abstract

The deployment stage of the Aerial Fleet Refueling Problem (AFRP) for Air Mobility Command (AMC), Scott AFB, IL is efficiently solved using a Group Theoretic Tabu Search (GTTS). The GTTS uses the Symmetric Group on n-letters (S(n)) and applies it to this problem using the Java(TM) Object-Oriented Programming (OOP) language. The GTTS approach is sufficiently robust to be applied to other problem areas at AMC including the employment stage of the AFRP as well as the deployment and employment stages of the Airlift Problem. In the appendices, a brief description of the Java(TM) implementation of the S(n), developed as an essential part of this research, is presented.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 2001
Accession Number
ADA395243

Entities

People

  • Victor Wiley

Organizations

  • University of Texas at Austin

Tags

Communities of Interest

  • Air Platforms
  • Energy and Power Technologies
  • Ground and Sea Platforms
  • Human Systems
  • Weapons Technologies

DTIC Thesaurus Topics

  • Air Force
  • Aircrafts
  • Airframes
  • Computer Programming
  • Computer Science
  • Computers
  • Linear Programming
  • Logistics
  • Mathematical Programming
  • Object Oriented Programming
  • Object-Oriented Programming Language
  • Operations Research
  • Optimization
  • Refueling In Flight
  • Spreadsheet Software
  • Tanker Aircraft
  • Unmanned Aerial Vehicles

Fields of Study

  • Computer science

Readers

  • Aerospace logistics and air mobility.
  • Database Systems and Applications
  • Operations Research