• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
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

Paperback

Technology & EngineeringGeneral ComputersGeneral Education

ISBN10: 1249592518
ISBN13: 9781249592518
Publisher: Biblioscholar
Published: Oct 9 2012
Pages: 70
Weight: 0.24
Height: 0.15 Width: 6.14 Depth: 9.21
Language: English

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.

Also in

General Education