Andere Kunden interessierten sich auch für
![A Group Theoretic Tabu Search Methodology for Solving the Theater Distribution Vehicle Routing and Scheduling Problem]( "A Group Theoretic Tabu Search Methodology for Solving the Theater Distribution Vehicle Routing and Scheduling Problem")
A Group Theoretic Tabu Search Methodology for Solving the Theater Distribution Vehicle Routing and Scheduling Problem63,99 €![An Advanced Tabu Search Approach to Solving the Mixed Payload Airlift Load Planning Problem]( "An Advanced Tabu Search Approach to Solving the Mixed Payload Airlift Load Planning Problem")
An Advanced Tabu Search Approach to Solving the Mixed Payload Airlift Load Planning Problem64,99 €![A Greedy Multiple-Knapsack Heuristic for Solving Air Mobility Command's Intratheater Airlift Problem]( "A Greedy Multiple-Knapsack Heuristic for Solving Air Mobility Command's Intratheater Airlift Problem")
A Greedy Multiple-Knapsack Heuristic for Solving Air Mobility Command's Intratheater Airlift Problem64,99 €![A Combined Adaptive Tabu Search and Set Partitioning Approach for the Crew Scheduling Problem with an Air Tanker Crew Application]( "A Combined Adaptive Tabu Search and Set Partitioning Approach for the Crew Scheduling Problem with an Air Tanker Crew Application")
A Combined Adaptive Tabu Search and Set Partitioning Approach for the Crew Scheduling Problem with an Air Tanker Crew Application64,99 €![A Hybrid Jump Search and Tabu Search Metaheuristic for the Unmanned Aaerial Vehicle Routing Problem]( "A Hybrid Jump Search and Tabu Search Metaheuristic for the Unmanned Aaerial Vehicle Routing Problem")
A Hybrid Jump Search and Tabu Search Metaheuristic for the Unmanned Aaerial Vehicle Routing Problem60,99 €![A Reactive Tabu Search Metaheuristic Extension of the Air Refueling Tanker Assignment Problem]( "A Reactive Tabu Search Metaheuristic Extension of the Air Refueling Tanker Assignment Problem")
A Reactive Tabu Search Metaheuristic Extension of the Air Refueling Tanker Assignment Problem63,99 €![A Group Theoretic Tabu Search Approach to the Traveling Salesman Problem]( "A Group Theoretic Tabu Search Approach to the Traveling Salesman Problem")
A Group Theoretic Tabu Search Approach to the Traveling Salesman Problem63,99 €
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.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.