A Note on the Complexity of Dijkstra's Algorithm for Graphs with Weighted Vertices
IEEE Transactions on Computers
| Hi-index | 0.00 |
The Canadian Forces carries out search and rescue operations in Canada at the request of the Canadian Government. An important component of such planning is asset positioning. In order to understand how to best position assets such as helicopters, an appropriate distance measure between assets and incidents needs to be used. In this paper, we propose a heuristic algorithm to compute the shortest distance measure between an asset and an incident including refuelling stops. We call the distance between two points (origin, destination and refuelling stations) a helicopter hop. We compare results obtained using our algorithm to Dijkstra's celebrated search and discuss the advantages and disadvantages of using our method based on real world data.