Dynamic Modeling of Safe Routes

Toyon Research Corporation proposes to develop a Safe Route Planning Tool with embedded algorithms and models which will rapidly compute near-optimal routes and schedules for supply convoys, taking into account dynamically changing conditions and logistic constraints. We utilize a discrete directed graph with dynamic edge costs that represent a degree of danger by incorporating time-varying factors such as threats, traffic, neighborhood hostility, and time of day. The algorithms combine a dynamic shortest-path algorithm with a flexible, combinatorial optimization algorithm to solve for the best convoy schedules. During our Phase I effort, we developed and tested the concept using a Ramadi-Falluja use case. In Phase II, we will advance the algorithms to address multi-convoy scheduling, equipment allocation, and synchronization with surveillance assets. We will deliver the tool as a stand-alone application and develop and demonstrate the capability as a Web Service application.