• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Solving the Multidimensional Multiple Knapsack Problem With Packing Constraints Using Tabu Search

Solving the Multidimensional Multiple Knapsack Problem With Packing Constraints Using Tabu Search

Hardcover

Business GeneralAviationProgramming

ISBN10: 1025123964
ISBN13: 9781025123967
Publisher: Hutson Street Press
Published: May 22 2025
Pages: 104
Weight: 0.72
Height: 0.31 Width: 6.14 Depth: 9.21
Language: English

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.

1 different editions

Also available

Also from

Romaine, Jonathan M.

Also in

Business General