Mohlo by se vám také líbit

Více informací o knize Solving the Multidimensional Multiple Knapsack Problem with Packing Constraints Using Tabu Search

• Parametry knihy
• Anotace
• Oblíbené z jiného soudku

Nákupem získáte 150 bodů

Anotace knihy

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.

Parametry knihy

Zařazení knihy Knihy v angličtině Society & social sciences Education

• Plný název: Solving the Multidimensional Multiple Knapsack Problem with Packing Constraints Using Tabu Search
• Autor: Jonathan M Romaine
• Jazyk: Angličtina
• Vazba: Brožovaná
• Počet stran: 106
• EAN: 9781288326570
• ISBN: 9781288326570
• ID: 08243795
• Nakladatelství: Biblioscholar
• Hmotnost: 224 g
• Rozměry: 188 × 245 × 11 mm
• Datum vydání: 21. November 2012

Oblíbené z jiného soudku

---

---

---