The probabilistic p-center problem: Planning service for potential customers
Visualitza/Obre
Cita com:
hdl:2117/106526
Tipus de documentArticle
Data publicació2017-10-16
EditorElsevier
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
This work deals with the probabilistic p-center problem, which aims at minimizing the expected maximum distance between any site with demand and its center, considering that each site has demand with a specific probability. The problem is of interest when emergencies may occur at predefined sites with known probabilities. For this problem we propose and analyze different formulations as well as a Variable Neighborhood Search heuristic. Computational tests are reported, showing the potentials and limits of each formulation, the impact of their enhancements, and the effectiveness of the heuristic.
CitacióMartínez-Merino, L., Albareda-Sambola, M., Rodríguez-Chía, A.M. The probabilistic p-center problem: Planning service for potential customers. "European journal of operational research", 16 Octubre 2017, vol. 262, núm. 2, p. 509-520.
ISSN0377-2217
Versió de l'editorhttp://www.sciencedirect.com/science/article/pii/S0377221717302655
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
160919PpCP1.pdf | 379,5Kb | Visualitza/Obre |