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

저자
정보 없음
출판사
Hutson Street Press
출판일
20250522
ISBN
9781025129242
ISBN 등록 지역
영어권 (ISBN 978-1)

소개

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.