Abstract
This paper proposes a dynamic programming algorithm for the NRCSRP with multiple crews. This algorithm also improves the existing algorithm for the problem with a single crew.
Highlights
The recent paper Duque, Dolinskaya, and Sorensen [2] considers a scheduling problem of a repair crew in emergency relief network
Let G = (V, E) be an undirected connected graph with V = Vd ∪ Vr ∪ {0}, where set E contains all undirected edges in the network and Vd is the set of demand nodes, Vr is the set of damaged nodes to repair and 0 is the depot node where the relief supplies are positioned and from which the repair crew initially departs
A travel time ti,j is defined for each edge ei,j to represent the travel time required by the repair crew to traverse on it
Summary
The recent paper Duque, Dolinskaya, and Sorensen [2] considers a scheduling problem of a repair crew in emergency relief network. Each of the damaged roads is represented as a node in the middle of its corresponding link. Each damage node j represents the locations where the work of the repair crew is needed. Such nodes have a repair time sj that represents the time the repair crew spends on its first visit.
Sign-in/Register to view highlights & summary 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 callMore From: Journal of Industrial & Management Optimization
Disclaimer: 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.
