Solving the Multidimensional Multiple Knapsack Problem with Packing Constraints Using Tabu Search - Jonathan M. Romaine
-20% with code BOOKS
30-day return policy
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 ... Full description
You May Also Like
TOP
The Culture Map: Breaking Through the Invisible Boundaries of Global Business
-20% with code BOOKS
In stock
TOP
Atomic Habits: An Easy & Proven Way to Build Good Habits & Break Bad Ones
-20% with code BOOKS
In stock
TOP
The Nord Stream Conspiracy: The Inside Story of the Explosions That Shook the World
-20% with code BOOKS
Out of stock
TOP
Prisoners of Geography: Updated 10th Anniversary Edition: Ten Maps That Tell You Everything You Need To Know About Global Politics
-20% with code BOOKS
In stock at our supplier
TOP
Women Who Run with the Wolves: Myths and Stories of the Wild Woman Archetype
Clarissa Pinkola Estés, Clarissa Pinkola Estes
-20% with code BOOKS
In stock at our supplier
TOP
Sapiens: A Brief History of Humankind
-20% with code BOOKS
In stock at our supplier
TOP
How Democracies Die
Steven Levitsky, Daniel Ziblatt
-20% with code BOOKS
In stock at our supplier
TOP
Classic Football Shirts
Classic Football Shirts, Rory Smith
-20% with code BOOKS
In stock at our supplier
TOP
All about Love: New Visions
-20% with code BOOKS
In stock at our supplier
TOP
The Whole-Brain Child: 12 Revolutionary Strategies to Nurture Your Child's Developing Mind
Daniel J. Siegel, Tina Payne Bryson
-20% with code BOOKS
In stock at our supplier
TOP
Everything I Know About Love: Now a Major BBC One Series
-20% with code BOOKS
In stock
TOP
Braiding Sweetgrass: Indigenous Wisdom, Scientific Knowledge and the Teachings of Plants
-20% with code BOOKS
In stock at our supplier
TOP
The Unabridged Journals of Sylvia Plath
-20% with code BOOKS
In stock at our supplier
TOP
The Year of Magical Thinking
-20% with code BOOKS
In stock at our supplier
TOP
To Kill a Mockingbird. 60th Anniversary Edition
-20% with code BOOKS
In stock at our supplier
TOP
Caliban and the Witch: Women, the Body and Primitive Accumulation
-20% with code BOOKS
In stock at our supplier
TOP
Monsters: What Do We Do with Great Art by Bad People?
-20% with code BOOKS
In stock at our supplier
TOP
Breaking Through: My Life in Science
-20% with code BOOKS
In stock at our supplier
Description
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.
More Information
| Author | Jonathan M. Romaine |
|---|---|
| Publisher | Creative Media Partners, LLC |
| Release year | 2012 |
| Cover type | Softcover |
| EAN | 9781288326570 |