Multi-period stochastic covering location problems: Modeling framework and solution approach
arXiv:2403.07785 · doi:10.1016/j.ejor.2018.01.040
Abstract
This paper introduces a very general discrete covering location model that accounts for uncertainty and time-dependent aspects. A MILP formulation is proposed for the problem. Afterwards, it is observed that most of the models existing in the literature related with covering location can be considered as particular cases of this formulation. In order to tackle large instances of this problem a Lagrangian relaxation based heuristic is developed. A computational study is addressed to check the potentials and limits of the formulation and some variants proposed for the problem, as well as to evaluate the heuristic. Finally, different measures to report the relevance of considering a multi-period stochastic setting are studied.
Cited by in corpus (6)
- Upgrading edges in the maximal covering location problem
- Minmax regret maximal covering location problems with edge demands
- On the complexity of the upgrading version of the maximal covering location problem
- Multi-product maximal covering second-level facility location problem
- Edge downgrades in the maximal covering location problem
- Dynamic Facility Location under Cumulative Customer Demand