Date of Award
Master of Science
Department of Operational Sciences
T. Glenn Bailey, PhD
An instance of the geometric knapsack problem occurs in air lift loading where a set of cargo must be chosen to pack in a given fleet of aircraft. This paper demonstrates a new heuristic to solve this problem in a reasonable amount of time with a higher quality solution then previously reported in literature. We also report a new tabu search heuristic to solve geometric knapsack problems.
DTIC Accession Number
Chocolaad, Christopher A., "Solving Geometric Knapsack Problems using Tabu Search Heuristics" (1998). Theses and Dissertations. 5598.