Opened Access On minimax-regret Huff location models


buscar en

Exportar a
Autor: Bello Garboza, Lenys
Blanquero Bravo, Rafael
Carrizosa Priego, Emilio José
Departamento: Universidad de Sevilla. Departamento de Estadística e Investigación Operativa
Fecha: 2011-01
Publicado en: Computers and Operations Research, 38 (1), 90-97.
Tipo de documento: Artículo
Resumen: We address the following single-facility location problem: a firm is entering into a market by locating one facility in a region of the plane. The demand captured from each user by the facility will be proportional to the users buying power and inversely proportional to a function of the user-facility distance. Uncertainty exists on the buying power (weight) of the users. This is modeled by assuming that a set of scenarios exists, each scenario corresponding to a weight realization. The objective is to locate the facility following the Savage criterion, i.e., the minimax-regret location is sought. The problem is formulated as a global optimization problem with objective written as difference of two convex monotonic functions. The numerical results obtained show that a branch and bound using this new method for obtaining bounds clearly outperforms benchmark procedures.
Cita: Bello Garboza, L., Blanquero Bravo, R. y Carrizosa Priego, E.J. (2011). On minimax-regret Huff location models. Computers and Operations Research, 38 (1), 90-97.
Tamaño: 413.6Kb
Formato: PDF


DOI: 10.1016/j.cor.2010.04.001

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