Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 245, Issue 3, Pages 656-666Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ejor.2015.03.049
Keywords
Reliable facility location; Integer programming
Funding
- Junta de Andalucia\FEDER [FQM-5849]
- MICINN, Spain [MTM2010-19576-C02-01, MTM2013-46962-C2-1-P]
- Spanish Ministry of Economy and Competitiveness
- ERDF funds [MTM2012-36163-C06-05]
Ask authors/readers for more resources
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. (C) 2015 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available