Repositorio de producción científica de la Universidad de Sevilla

Maximal covering location problems on networks with regional demand

Opened Access Maximal covering location problems on networks with regional demand


buscar en

Exportar a
Autor: Blanquero Bravo, Rafael
Carrizosa Priego, Emilio José
Gazdag-Tóth, Boglárka
Departamento: Universidad de Sevilla. Departamento de Estadística e Investigación Operativa
Fecha: 2016-10
Publicado en: Omega, 64, 77-85.
Tipo de documento: Artículo
Resumen: Covering problems are well studied in the Operations Research literature under the assumption that both the set of users and the set of potential facilities are finite. In this paper we address the following variant, which leads to a Mixed Integer Nonlinear Program (MINLP): locations of p facilities are sought along the edges of a network so that the expected demand covered is maximized, where demand is continuously distributed along the edges. This MINLP has a combinatorial part (which edges of the network are chosen to contain facilities) and a continuous global optimization part (once the edges are chosen, which are the optimal locations within such edges). A branch and bound algorithm is proposed, which exploits the structure of the problem: specialized data structures are introduced to successfully cope with the combinatorial part, inserted in a geometric branch and bound. Computational results are presented, showing the appropriateness of our procedure to solve covering prob...
[Ver más]
Cita: Blanquero Bravo, R., Carrizosa Priego, E.J. y Gazdag-Tóth, B. (2016). Maximal covering location problems on networks with regional demand. Omega, 64, 77-85.
Tamaño: 317.4Kb
Formato: PDF


DOI: 10.1016/

Ver versión del editor

Mostrar el registro completo del ítem

Esta obra está bajo una Licencia Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 Internacional

Este registro aparece en las siguientes colecciones