4.7 Article

Multi-period stochastic covering location problems: Modeling framework and solution approach

Journal

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 268, Issue 2, Pages 432-449

Publisher

ELSEVIER SCIENCE BV
DOI: 10.1016/j.ejor.2018.01.040

Keywords

Location; Covering; Discrete optimization; Multi-period facility location; Lagrangian relaxation

Funding

  1. Spanish Ministerio de Economia y Competitividad [MTM2015-65915-R]
  2. Fundacion Seneca de la Consejeria de Education de la Comunidad Autonoma de la Region de Murcia [19320/PI/14]
  3. Fundacion BBVA, project Cost-sensitive classification. A mathematical optimization approach (COSECLA)
  4. Agencia Estatal de Investigacion (AEI) [MTM2013-46962-C2-2-P, MTM2016-74983-C2-2-R]
  5. European Regional Development's funds (FEDER)
  6. Universidad de Cadiz [UCA/REC02VIT/2014]
  7. Portuguese Science Foundation (FCT-Fundacao para a Ciencia e Tecnologia) [UID/MAT/04561/2013]

Ask authors/readers for more resources

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. (C) 2018 Elsevier B.V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available