The reliable p-median problem with at-facility service
Visualitza/Obre
Cita com:
hdl:2117/28343
Tipus de documentArticle
Data publicació2015-09-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 paper deals with a discrete facility location model where service is provided at the facility sites. It is assumed that facilities can fail and customers do not have information on failures before reaching them. As a consequence, they may need to visit more than one facility, following an optimized search scheme, in order to get service. The goal of the problem is to locate p facilities in order to minimize the expected total travel cost. The paper presents two alternative mathematical programming formulations for this problem and proposes a matheuristic based on a network flow model to provide solutions to it. The computational burden of the presented formulations is tested and compared on a test-bed of instances.
CitacióAlbareda-Sambola, M.; Hinojosa , Y.; Puerto Albandoz, J. The reliable p-median problem with at-facility service. "European journal of operational research", 16 Setembre 2015, vol. 245, núm. 3, p. 656-666.
ISSN0377-2217
Versió de l'editorhttp://www.sciencedirect.com/science/article/pii/S0377221715002714
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
AHP_EJOR2015.pdf | 506,2Kb | Visualitza/Obre |