Abstract
This research represents a novel application of operations research methodology to a form of a hierarchical open vehicle routing problem. In our case study, a road network was divided into priority sets such that each set needed to be completely addressed before work could begin on the next. Rule-based heuristics and adaptations of local beam search heuristics were tested in various combinations, viable solutions were developed, and results were evaluated based on the time required to clear the entire road network of storm-generated debris. The results were also compared against a theoretical lower bound on the time required to clear all roads. The best routes were generated using a combination of constant time beam search and a rule-based heuristic, 12.4% greater than the lower bound, yet understandable for the case study area that contained numerous dead-ends and disconnected road priority sets.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
