A SEPARATION BASED OPTIMIZATION APPROACH TO DYNAMIC MAXIMAL COVERING LOCATION PROBLEMS WITH SWITCHED STRUCTURE
Compartir este ítem
Fecha
2021Autor
Azhmyakov V
Fernández-Gutiérrez J.P
Verriest E.I
Pickl S.W.
Citación
Metadatos
Mostrar el registro completo del ítemResumen
This paper extends a newly developed computational optimization approach to a specific class of Maximal Covering Location Problems (MCLPs) with a switched dynamic structure. Most of the results obtained for the conventional MCLP address the “static” case where an optimal decision is determined on a fixed time-period. In our contribution we consider a dynamic MCLP based optimal decision making and propose an effective computational method for the numerical treatment of the switched-type Dynamic Maximal Covering Location Problem (DMCLP). A generic geometrical structure of the constraints under consideration makes it possible to separate the originally given dynamic optimization problem and reduce it to a specific family of relative simple auxiliary problems. The generalized Separation Method (SM) for the DMCLP with a switched structure finally leads to a computational solution scheme. The resulting numerical algorithm also includes the classic Lagrange relaxation. We present a rigorous formal analysis of the DMCLP optimization methodology and also discuss computational aspects. The proposed SM based algorithm is finally applied to a practically oriented example, namely, to an optimal design of a (dynamic) mobile network configuration. © 2021. All Rights Reserved.
Colecciones
- Indexados Scopus [1632]