A Greedy Multiple-knapsack Heuristic For Solving Air Mobility Command's Intratheater Airlift Problem

by Air Force Institute Of Technology (u.s.)

2021-01-04 02:09:49

This research develops a methodology using a greedy heuristic to solve Air Mobility Command's intratheater airlift scenario as a multiple knapsack problem. The objective is to maximize throughput in a theater given a vehicle mixture and assignment sc... Read more
This research develops a methodology using a greedy heuristic to solve Air Mobility Command's intratheater airlift scenario as a multiple knapsack problem. The objective is to maximize throughput in a theater given a vehicle mixture and assignment scheme. The model allows for a heterogeneous, user defined vehicle mix in a theater consisting of up to five bed down locations and up to seven forward operating locations. First, we preprocess routes, eliminating the large number of unattractive route choices in the problem. Then using a greedy heuristic, we select routes and assign them to aircraft located at any or all of the bed down locations. The model is tested by measuring the utilization rate of the vehicles as well as the maximum throughput of the scenario and the equality of distribution to the receiving bases. Less

Book Details

File size9.69 X 7.44 X 0.12 in
Print pages60
PublisherBiblioScholar
Publication date September 21, 2012
LanguageEnglish
ISBN9781249456537

Compare Prices

Store Availability Book Format Condition Price
Indigo Books & Music In Stock Paperback Paperback Buy CAD 59.00
Indigo Books & MusicIn Stock
Format
Paperback
Condition
Paperback
Buy CAD 59.00
Available Discount
No Discount available

Join us and get access to all
your favourite books

Sign up for free and start exploring thousands of eBooks today.

Sign up for free