Efficient Repair Scheduling Strategy of a Multi-Source Lifeline Network Using Constrained Spanning Forest

Pre-disaster programs, especially for seismic hazards, are necessary to quickly recover the services of a lifeline network. In the case of a multi-source (or multi-root) water lifeline network, an efficient repair schedule must be implemented immediately after an earthquake to assist in post-disaste...

Full description

Saved in:
Bibliographic Details
Main Authors: Garciano, Lessandro Estelito, Garciano, Agnes, Tolentino, Mark Anthony C, Carandang, Abraham Matthew
Format: text
Published: Archīum Ateneo 2019
Subjects:
Online Access:https://archium.ateneo.edu/mathematics-faculty-pubs/55
https://www.geomatejournal.com/sites/default/files/articles/49-54-8201-Garciano-Nov-2019-63g.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Ateneo De Manila University
id ph-ateneo-arc.mathematics-faculty-pubs-1054
record_format eprints
spelling ph-ateneo-arc.mathematics-faculty-pubs-10542020-03-09T01:35:22Z Efficient Repair Scheduling Strategy of a Multi-Source Lifeline Network Using Constrained Spanning Forest Garciano, Lessandro Estelito Garciano, Agnes Tolentino, Mark Anthony C Carandang, Abraham Matthew Pre-disaster programs, especially for seismic hazards, are necessary to quickly recover the services of a lifeline network. In the case of a multi-source (or multi-root) water lifeline network, an efficient repair schedule must be implemented immediately after an earthquake to assist in post-disaster activities as well as to minimize the subsequent health problems caused by the lack of potable water supply. As such water lifeline operators must establish restoration strategies especially if the supply of water comes from different sources and spatially distributed. For a single-source water network, Horn’s algorithm can be used to determine an optimal restoration strategy. However, a variation of this algorithm is necessary in order to allow simultaneous repairs at any given time for a multiple-source lifeline water network. In this research, the authors employ a constrained spanning forest (CSF) algorithm to decompose the network into trees rooted at each source. After the decomposition, Horn’s algorithm is used to determine the optimal restoration strategy for each tree in the network with the objective of minimizing a penalty value. Restoration of each node in the spanning forest is carried in sequence according to availability of the crew and allows simultaneous jobs to be done on consecutive arcs in the sequence. 2019-01-01T08:00:00Z text https://archium.ateneo.edu/mathematics-faculty-pubs/55 https://www.geomatejournal.com/sites/default/files/articles/49-54-8201-Garciano-Nov-2019-63g.pdf Mathematics Faculty Publications Archīum Ateneo Water lifeline Horn’s algorithm Constrained spanning forest Emergency and Disaster Management Mathematics
institution Ateneo De Manila University
building Ateneo De Manila University Library
continent Asia
country Philippines
Philippines
content_provider Ateneo De Manila University Library
collection archium.Ateneo Institutional Repository
topic Water lifeline
Horn’s algorithm
Constrained spanning forest
Emergency and Disaster Management
Mathematics
spellingShingle Water lifeline
Horn’s algorithm
Constrained spanning forest
Emergency and Disaster Management
Mathematics
Garciano, Lessandro Estelito
Garciano, Agnes
Tolentino, Mark Anthony C
Carandang, Abraham Matthew
Efficient Repair Scheduling Strategy of a Multi-Source Lifeline Network Using Constrained Spanning Forest
description Pre-disaster programs, especially for seismic hazards, are necessary to quickly recover the services of a lifeline network. In the case of a multi-source (or multi-root) water lifeline network, an efficient repair schedule must be implemented immediately after an earthquake to assist in post-disaster activities as well as to minimize the subsequent health problems caused by the lack of potable water supply. As such water lifeline operators must establish restoration strategies especially if the supply of water comes from different sources and spatially distributed. For a single-source water network, Horn’s algorithm can be used to determine an optimal restoration strategy. However, a variation of this algorithm is necessary in order to allow simultaneous repairs at any given time for a multiple-source lifeline water network. In this research, the authors employ a constrained spanning forest (CSF) algorithm to decompose the network into trees rooted at each source. After the decomposition, Horn’s algorithm is used to determine the optimal restoration strategy for each tree in the network with the objective of minimizing a penalty value. Restoration of each node in the spanning forest is carried in sequence according to availability of the crew and allows simultaneous jobs to be done on consecutive arcs in the sequence.
format text
author Garciano, Lessandro Estelito
Garciano, Agnes
Tolentino, Mark Anthony C
Carandang, Abraham Matthew
author_facet Garciano, Lessandro Estelito
Garciano, Agnes
Tolentino, Mark Anthony C
Carandang, Abraham Matthew
author_sort Garciano, Lessandro Estelito
title Efficient Repair Scheduling Strategy of a Multi-Source Lifeline Network Using Constrained Spanning Forest
title_short Efficient Repair Scheduling Strategy of a Multi-Source Lifeline Network Using Constrained Spanning Forest
title_full Efficient Repair Scheduling Strategy of a Multi-Source Lifeline Network Using Constrained Spanning Forest
title_fullStr Efficient Repair Scheduling Strategy of a Multi-Source Lifeline Network Using Constrained Spanning Forest
title_full_unstemmed Efficient Repair Scheduling Strategy of a Multi-Source Lifeline Network Using Constrained Spanning Forest
title_sort efficient repair scheduling strategy of a multi-source lifeline network using constrained spanning forest
publisher Archīum Ateneo
publishDate 2019
url https://archium.ateneo.edu/mathematics-faculty-pubs/55
https://www.geomatejournal.com/sites/default/files/articles/49-54-8201-Garciano-Nov-2019-63g.pdf
_version_ 1722366533885231104