This is a AIR FORCE INST OF TECH WRIGHT-PATTERSONAFB OH report procured by the Pentagon and made available for public release. It has been reproduced in the best form available to the Pentagon. It is not spiral-bound, but rather assembled with Velobinding in a soft, white linen cover. The Storming Media report number is A526163. The abstract provided by the Pentagon follows: This paper presents a methodology for solving military aircraft load- scheduling problems modeled as a multidimensional multiple knapsack problem, Because of the computational time associated with applying conventional algorithms to this type of problem, we employ tabu search to determine how much cargo a heterogeneous group of aircraft can carry. This study extends the previous work of Chocolaad in two areas. First, we modify Chocolaad's algorithms to solve the multiple (rather than the single) knapsack problem under the constraints he defmed for the Airlift Loading Problem. Second, we drop his assumption of a homogeneous group of aircraft. We validate our model by confirming its solutions with cargo loadmasters, and comparing the performance of our algorithm with the benchmark ALM.
Book Description
Product Details
Would you like to update product info or give feedback on images?
|
Customer Reviews
|
There are no customer reviews yet.
|
|||
|
Video reviews
|
Tag this product(What's this?)Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items. |
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
