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 Problem61,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 Application60,99 €![Dynamic Unmanned Aerial Vehicle Routing with a Java-Encoded Reactive Tabu Search Metaheuristic]( "Dynamic Unmanned Aerial Vehicle Routing with a Java-Encoded Reactive Tabu Search Metaheuristic")
Dynamic Unmanned Aerial Vehicle Routing with a Java-Encoded Reactive Tabu Search Metaheuristic60,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 Problem60,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 €![Solving the Multidimensional Multiple Knapsack Problem with Packing Constraints Using Tabu Search]( "Solving the Multidimensional Multiple Knapsack Problem with Packing Constraints Using Tabu Search")
Solving the Multidimensional Multiple Knapsack Problem with Packing Constraints Using Tabu Search60,99 €![A Tabu Search Approach to the Weapons Assignment Model]( "A Tabu Search Approach to the Weapons Assignment Model")
A Tabu Search Approach to the Weapons Assignment Model60,99 €
Scheduling an air campaign is a time and labor intensive task. Exacerbating this task is the fact that combat planners still make use of manual methods to accomplish much of this daunting but critical effort. While some work has been done to automate the process, the heuristics used generate schedules that must undergo major modifications before they are "flyable." Combat planners, therefore, distrust the results and use the automated features of the software sparingly. An additional problem arises due to the lag time between the publication of the Air Tasking Order (ATO) and the start of the ATO day. During this time period conditions in the dynamic battlespace can, and often do, change (aircraft break, runways may be damaged, close air support requests come in, for example). The execution software currently in use will do a validation check against the current conditions, but yields no options for replanning. This research explores the use of tabu search (TS) to determine "good" solutions for the initial air campaign plan. It extends previous work by including air-tasking priorities.