TY - JOUR
T1 - Lateness minimization in pairwise connectivity restoration problems
AU - Averbakh, Igor
AU - Pereira, Jordi
N1 - Funding Information:
History: Accepted by Karen Aardal, Area Editor for Design and Analysis of Algorithms. Funding: The research of Igor Averbakh was supported by the Discovery Grant [238234-2012-RGPIN] from the Natural Sciences and Engineering Research Council of Canada (NSERC). SupplementalMaterial: The online appendix is available at https://doi.org/10.1287/ijoc.2017.0796.
Publisher Copyright:
© 2018, INFORMS.
PY - 2018
Y1 - 2018
N2 - A network is given whose edges need to be constructed (or restored after a disaster). The lengths of edges represent the required construction/restoration times given available resources, and one unit of length of the network can be constructed per unit of time. All points of the network are accessible for construction at any time. For each pair of vertices, a due date is given. It is required to find a construction schedule that minimizes the maximum lateness of all pairs of vertices, where the lateness of a pair is the difference between the time when the pair becomes connected by an already constructed path and the pair's due date.We introduce the problem and analyze its structural properties, present a mixed-integer linear programming formulation, develop a number of lower bounds that are integrated in a branch-and-bound algorithm, and discuss results of computational experiments both for instances based on randomly generated networks and for instances based on 2010 Chilean earthquake data.
AB - A network is given whose edges need to be constructed (or restored after a disaster). The lengths of edges represent the required construction/restoration times given available resources, and one unit of length of the network can be constructed per unit of time. All points of the network are accessible for construction at any time. For each pair of vertices, a due date is given. It is required to find a construction schedule that minimizes the maximum lateness of all pairs of vertices, where the lateness of a pair is the difference between the time when the pair becomes connected by an already constructed path and the pair's due date.We introduce the problem and analyze its structural properties, present a mixed-integer linear programming formulation, develop a number of lower bounds that are integrated in a branch-and-bound algorithm, and discuss results of computational experiments both for instances based on randomly generated networks and for instances based on 2010 Chilean earthquake data.
KW - Combinatorial Optimization
KW - Integrated Network Design And Scheduling
KW - Network Construction
KW - Network Restoration
KW - Networks: Scheduling
KW - Programming: Branch And Bound
UR - http://www.scopus.com/inward/record.url?scp=85055187723&partnerID=8YFLogxK
U2 - 10.1287/ijoc.2017.0796
DO - 10.1287/ijoc.2017.0796
M3 - Article
AN - SCOPUS:85055187723
SN - 1091-9856
VL - 30
SP - 522
EP - 538
JO - INFORMS Journal on Computing
JF - INFORMS Journal on Computing
IS - 3
ER -