An advanced tabu search approach to the dynamic airlift loading problem
- PDF / 1,353,157 Bytes
- 18 Pages / 595.276 x 790.866 pts Page_size
- 113 Downloads / 183 Views
ORIGINAL PAPER
An advanced tabu search approach to the dynamic airlift loading problem August G. Roesener1,3
•
J. Wesley Barnes2
Received: 1 August 2015 / Accepted: 20 June 2016 The Author(s) 2016. This article is published with open access at Springerlink.com
Abstract This research effort presents a tabu search algorithm to solve the dynamic airlift loading problem. Given a set of palletized cargo items which require transportation from an aerial port of embarkation to an aerial port of debarkation within a pre-specified time frame, the dynamic airlift loading problem seeks to partition the pallets into aircraft loads, select an efficient and effective subset of aircraft from available aircraft, and assign the pallets to allowable positions on those aircraft. The dynamic airlift loading problem differs from many partitioning and packing problems described in the literature because, in addition to spatial constraints, factors such as allowable cabin load, balance restrictions, and temporal restrictions on cargo and aircraft are included. The algorithm developed in this research, the dynamic airlift loading problem-tabu search, was tested on a variety of problem instances. Since real-world solutions are hand generated by subject matter experts and no previous
The views expressed are those of the author and do not reflect the official policy or position of the Department of Defense or the US Government. & August G. Roesener [email protected] J. Wesley Barnes [email protected] 1
Department of Operational Sciences, Air Force Institute of Technology, 2950 Hobson Way, Wright Patterson Afb, OH 45433-7765, USA
2
Department of Mechanical Engineering, The University of Texas, 1 University Station, C2200, Austin, TX 78712, USA
3
Present Address: Headquarters Air Mobility Command, 1 Soldier Way, Building 1900 West, Scott Air Force Base, IL 62225, USA
research effort has solved this specific problem, the algorithmic results are compared to compute lower bounds on the number of aircraft trips required. Keywords Tabu search Knapsack Bin packing Military applications Aircraft loading Abbreviations AALPS Automated airlift load planning system ACL Allowable cabin load APOD Aerial port of debarkation APOE Aerial port of embarkation C-5 C-5 galaxy C-17 C-17 globemaster III CB Center of balance DALP Dynamic airlift loading problem DALP-TS Dynamic airlift loading problem-tabu search TPFDD Time-phased force deployment document US United States
1 Introduction Power projection, which is the capability to transport military power in an expeditionary manner, represents a large portion of United States (US) military activities. Transportation of personnel and equipment in this endeavor is the responsibility of the US Transportation Command, whose airlift component is air mobility command [40]. In an average week, US Transportation Command operates in 75 % of the world’s countries, conducting over 1900 air missions [40]. For several years, a consortium between the Air Force Office of Scientific Research, th
Data Loading...
