Time-Dependent Restoration Routing Problem: An Efficient Initial Solution
ORCID
Saei: https://orcid.org/0000-0001-8125-435X; Tajik: https://orcid.org/0000-0002-9481-7307
MSU Affiliation
James Worth Bagley College of Engineering; Department of Industrial and Systems Engineering
Creation Date
2026-06-01
Abstract
We propose a time-dependent variant of the restoration routing problem scheduling restoration tasks for each crew given a limited time horizon. The model provides a feasible initial solution for real-world restoration crew routing problems. We also acknowledge the effect of topological characteristics on the network resilience enhancement during the restoration process.
Publication Date
8-25-2022
Publication Title
Findings
Publisher
Findings Press
Creative Commons License
This work is licensed under a Creative Commons Attribution-Share Alike 4.0 International License.
Rights
© 2022 The Author(s)
Recommended Citation
Saei, Saviz, and Nazanin Tajik. 2022. “Time-Dependent Restoration Routing Problem: An Efficient Initial Solution.” Findings, August. https://doi.org/10.32866/001c.37396.
