Search and Rescue mission are time-critical and require fast and efficient routing, task allocation and potentially area decomposition to avoid confliction between the aerial vehicles.

We model the problem as a variant of the Team Orienteering Problem and design fast and efficient a greedy and local search heuristics to generate high quality routes to ensure that the high-priority areas a covered.