A Greedy Multiple-Knapsack Heuristic for Solving Air Mobility Command's Intratheater Airlift Problem - Couverture souple

Zeisler, Nicholas J

 
9781249456537: A Greedy Multiple-Knapsack Heuristic for Solving Air Mobility Command's Intratheater Airlift Problem
Couverture souple
ISBN 10 : 1249456533 ISBN 13 : 9781249456537
Editeur : Biblioscholar, 2012

Synopsis

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.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Éditeur
Biblioscholar
Date d'édition
2012
Langue
anglais
ISBN 10 
1249456533
ISBN 13 
9781249456537
Reliure
Broché
Nombre de pages
58
Coordonnées du fabricant
non disponible
Personne responsable
non disponible