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

Solving the median problem with continuous demand on a network

Opened Access Solving the median problem with continuous demand on a network

Citas

buscar en

Estadísticas
Icon
Exportar a
Autor: Blanquero Bravo, Rafael
Carrizosa Priego, Emilio José
Departamento: Universidad de Sevilla. Departamento de Estadística e Investigación Operativa
Fecha: 2013-12
Publicado en: Computational Optimization and Applications, 56 (3), 723-734.
Tipo de documento: Artículo
Resumen: Where to locate one or several facilities on a network so as to minimize the expected users-closest facility transportation cost is a problem well studied in the OR literature under the name of median problem. In the median problem users are usually identified with nodes of the network. In many situations, however, such assumption is unrealistic, since users should be better considered to be distributed also along the edges of the transportation network. In this paper we address the median problem with demand distributed along edges and nodes. This leads to a globaloptimization problem, which can be solved to optimality by means of a branch-and-bound with DC bounds. Our computational experience shows that the problem is solved in short time even for large instances.
Cita: Blanquero Bravo, R. y Carrizosa Priego, E.J. (2013). Solving the median problem with continuous demand on a network. Computational Optimization and Applications, 56 (3), 723-734.
Tamaño: 354.4Kb
Formato: PDF

URI: http://hdl.handle.net/11441/47868

DOI: 10.1007/s10589-013-9574-3

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