Solving Geometric Knapsack Problems using Tabu Search Heuristics

Author

Christopher A. Chocolaad

Date of Award

3-1998

Document Type

Thesis

Degree Name

Master of Science

Department

Department of Operational Sciences

First Advisor

T. Glenn Bailey, PhD

Abstract

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.

AFIT Designator

AFIT-GOR-ENS-98M-05

DTIC Accession Number

ADA342612

Recommended Citation

Chocolaad, Christopher A., "Solving Geometric Knapsack Problems using Tabu Search Heuristics" (1998). Theses and Dissertations. 5598.
https://scholar.afit.edu/etd/5598