Engineering Commons^™

Solving Geometric Knapsack Problems Using Tabu Search Heuristics, Christopher A. Chocolaad

Theses and Dissertations

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.