4 research outputs found
On the complexity of the upgrading version of the Maximal Covering Location Problem
In this article, we study the complexity of the upgrading version of the maximal covering location problem with edge length modifications on networks. This problem is NP-hard on general networks. However, in some particular cases, we prove that this problem is solvable in polynomial time. The cases of star and path networks combined with different assumptions for the model parameters are analysed. In particular, we obtain that the problem on star networks is solvable in (Formula presented.) time for uniform weights and NP-hard for non-uniform weights. On paths, the single facility problem is solvable in (Formula presented.) time, while the (Formula presented.) -facility problem is NP-hard even with uniform costs and upper bounds (maximal upgrading per edge), as well as, integer parameter values. Furthermore, a pseudo-polynomial algorithm is developed for the single facility problem on trees with integer parameters.</p
The Flood Mitigation Problem in a Road Network
Natural disasters are highly complex and unpredictable. However, long-term
planning and preparedness activities can help to mitigate the consequences and
reduce the damage. For example, in cities with a high risk of flooding,
appropriate roadway mitigation can help reduce the impact of floods or high
waters on transportation systems. Such communities could benefit from a
comprehensive assessment of mitigation on road networks and identification of
the best subset of roads to mitigate. In this study, we address a pre-disaster
planning problem that seeks to strengthen a road network against flooding. We
develop a network design problem that maximizes the improvement in
accessibility and travel times between population centers and healthcare
facilities subject to a given budget. We provide techniques for reducing the
problem size to help make the problem tractable. We use cities in the state of
Iowa in our computational experiments.Comment: 40 pages, 8 figures, 21 table
Upgrading edges in the maximal covering location problem
We study the upgrading version of the maximal covering location problem with edge length modifications on networks. This problem aims at locating p facilities on the vertices (of the network) so as to maximise coverage, considering that the length of the edges can be reduced at a cost, subject to a given budget. Hence, we have to decide on: the optimal location of p facilities and the optimal edge length reductions. This problem is NP-hard on general graphs. To solve it, we propose three different mixed-integer formulations and a preprocessing phase for fixing variables and removing some of the constraints. Moreover, we strengthen the proposed formulations including valid inequalities. Finally, we compare the three formulations and their corresponding improvements by testing their performance over different datasets. © 2022 The Author(s