Fort Stewart shortest path analysis of debris cleanup options
Walliser, Michael Anthony
MetadataShow full item record
Several heuristic algorithms are developed to find the fastest set of routes in order for a fleet of cleanup crews to clear hurricane-related debris from the road network at Fort Stewart near Savannah, Georgia. The road network is divided into priority levels such that each level must be completely cleared before work can begin on the next level. The problem is similar to the Hierarchical Chinese Postman Problem and the Capacitated Arc Routing Problem. It presents a unique challenge, however, in that each road must be cleared before it can be used for transport. Rule-based heuristics, adaptations of local beam search, and genetic algorithms are tested in various combinations with each other to build solutions. Results are evaluated based on the time required to clear the entire network of debris. The best solutions are generated by using a combination of all three of the aforementioned heuristics.