Lateness Minimization in Pairwise Connectivity Restoration Problems
Averbakh
I
author
Pereira
J
author
2018
English
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.
combinatorial optimization
networks: scheduling
programming: branch and bound
network restoration
network construction
integrated network design and scheduling
WOS:000449096000008
exported from refbase (show.php?record=924), last updated on Thu, 01 Aug 2019 16:52:07 -0400
text
files/924_Averbakh+Pereira2018.pdf
10.1287/ijoc.2017.0796
Averbakh+Pereira2018
Informs Journal On Computing
INFORMS J. Comput.
2018
Informs
continuing
periodical
academic journal
30
3
522
538
1091-9856