Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/157737
Authors: 
Roesener, August G.
Barnes, J. Wesley
Year of Publication: 
2016
Citation: 
[Journal:] Logistics Research [ISSN:] 1865-0368 [Volume:] 9 [Year:] 2016 [Issue:] 1 [Pages:] 1-18
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 research effort has solved this specific problem, the algorithmic results are compared to compute lower bounds on the number of aircraft trips required.
Subjects: 
Tabu search
Knapsack
Bin packing
Military applications
Aircraft loading
Persistent Identifier of the first edition: 
Creative Commons License: 
http://creativecommons.org/licenses/by/4.0/
Document Type: 
Article
Appears in Collections:

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.