Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

An Execution Planning Algorithm for Military Airlift

Rajendra S. Solanki and Frank Southworth
Interfaces
Vol. 21, No. 4, Military Applications (Jul. - Aug., 1991), pp. 121-131
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/25061509
Page Count: 11
  • Download ($30.00)
  • Cite this Item
An Execution Planning Algorithm for Military Airlift
Preview not available

Abstract

Execution planning at the military airlift command of the US Air Force involves updating the routes and schedules of aircraft to reflect changing requirements for moving freight and personnel and changing airlift resources. The problem can be characterized as a pickup and delivery problem with time windows and node capacities. The constraints on the capacities of the nodes (airfields) limit the rate at which the aircraft can be serviced and the amount of requirements (tonnage of cargo, number of passengers) that can be loaded and unloaded at an airfield per day. The execution planning algorithm described can be used daily to modify the existing airlift operations plan. An algorithm based on the insertion heuristic was selected for implementation due to its computational feasibility and its capability to absorb complex constraints arising in the execution planning problem. The insertion heuristic has the additional desirable feature of keeping intact as much of the existing schedule as possible.

Page Thumbnails

  • Thumbnail: Page 
[121]
    [121]
  • Thumbnail: Page 
122
    122
  • Thumbnail: Page 
123
    123
  • Thumbnail: Page 
124
    124
  • Thumbnail: Page 
125
    125
  • Thumbnail: Page 
126
    126
  • Thumbnail: Page 
127
    127
  • Thumbnail: Page 
128
    128
  • Thumbnail: Page 
129
    129
  • Thumbnail: Page 
130
    130
  • Thumbnail: Page 
131
    131