Andere Kunden interessierten sich auch für
![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 Metaheuristic64,99 €![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 €![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 Tabu Search Metaheuristic for the Air Refueling Tanker Assignment Problem]( "A Tabu Search Metaheuristic for the Air Refueling Tanker Assignment Problem")
A Tabu Search Metaheuristic for the Air Refueling Tanker Assignment Problem63,99 €![Implementation of the Metaheuristic Tabu Search in Route Selection for Mobility Analysis Support System]( "Implementation of the Metaheuristic Tabu Search in Route Selection for Mobility Analysis Support System")
Implementation of the Metaheuristic Tabu Search in Route Selection for Mobility Analysis Support System63,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 €![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 Search63,99 €
In this research, we provide a new meta-heuristic, a jump search / tabu search hybrid, for addressing the vehicle routing problem with real-life constraints. A tour construction heuristic creates candidate solutions or jump points for the problem. A tabu search algorithm uses these jump points as starting points for a guided local search. We provide statistical analysis on the performance of our algorithm and compare it to other published algorithms. Our algorithm provides solutions within 10% of the best known solutions to benchmark problems and does so in a fraction of the time required by competing algorithms. The timeliness of the solution is vitally import to the unmanned aerial vehicle (UAV) routing problem. UAVs provide the lion`s share of reconnaissance support for the US military. This reconnaissance mission requires the UAVs to visit hundreds of target areas in a rapidly changing combat environment. Air vehicie operators (AVOs) must prepare a viable mission plan for the UAVs while contending with such real-life constraints as time windows, target priorities, multiple depots, heterogeneous vehicle fleet, and pop-up threats. Our algorithm provides the AVOs with the tools to perform their mission quickly and efficiently.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.