Open Access. Powered by Scholars. Published by Universities.®
Operations Research, Systems Engineering and Industrial Engineering Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering
Solving Geometric Knapsack Problems Using Tabu Search Heuristics, Christopher A. Chocolaad
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.
An Airlift Hub-And-Spoke Location-Routing Model With Time Windows: Case Study Of The Conus-To-Korea Airlift Problem, David W. Cox
An Airlift Hub-And-Spoke Location-Routing Model With Time Windows: Case Study Of The Conus-To-Korea Airlift Problem, David W. Cox
Theses and Dissertations
Traditionally, the United States Air Force's Air Mobility Command (AMC) has used the concept of direct delivery to airlift cargo and passengers from a point of embarkation to a point of debarkation. This study develops an alternative hub-and-spoke combined location-routing integer linear programming prototype model, and uses this model to determine what advantages a hub-and-spoke system offers, and in which scenarios it is better-suited than the direct delivery method. Additionally, the analysis suggests that the C-17 may be better-suited, in certain airlift situations, for theater airlift versus strategic (direct delivery) airlift. The model features the following elements: time windows, cargo …