The aerial fleet refueling problem
MetadataShow full item record
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 (Sn) and applies it to this problem using the JavaTM ObjectOriented 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 JavaTM implementation of the Sn, developed as an essential part of this research, is presented.