Tasuta kohaletoimetamine tellimustele üle 29 €
  • check 10+ miljonit raamatut
  • check Uued tooted iga päev
  • check Meid usaldab üle 1 miljoni kliendi
  • check Hea hind ja allahindlused
  • check Tarne üle kogu Euroopa

Solving the Multidimensional Multiple Knapsack Problem with Packing Constraints Using Tabu Search - Jonathan M. Romaine

inglise keel
2012-11-21
62,98 € 104,96 €

-40% koodiga BOOKS

Lõppenud

30-päevane tagastamisõigus

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 are ... Täielik kirjeldus

Võib-olla meeldib sulle ka

Kirjeldus

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.

Lisateave

Autor Jonathan M. Romaine
Kirjastaja Creative Media Partners, LLC
Väljalaskeaasta 2012
Kaanetüüp Pehme kaanega
EAN 9781288326570
Kirjuta oma arvustus
Te vaatate: Solving the Multidimensional Multiple Knapsack Problem with Packing Constraints Using Tabu Search
Teie hinnang:

Goodreads'i arvustused

62,98 € 104,96 €