Heuristic Solutions to the Facility Location Problem with General Bernoulli Demands

Maria Albareda-Sambola (), Elena Fernández () and Francisco Saldanha-da-Gama ()
Additional contact information
Maria Albareda-Sambola: Universitat Politècnica de Catalunya, Departament d’Estadística i Investigació Operativa, 08222 Terrassa, Spain
Elena Fernández: Universitat Politècnica de Catalunya, Departament d’Estadística i Investigació Operativa, 08034 Barcelona, Spain; Barcelona Graduate School of Mathematics (BGSMath), 08193 Bellaterra, Barcelona, Spain
Francisco Saldanha-da-Gama: Universidade de Lisboa, Faculdade de Ciências, Departamento de Estatística e Investigação Operacional e Centro de Matemática, Aplicações Fundamentais e Investigação Operacional, 1749-016 Lisboa, Portugal

INFORMS Journal on Computing, 2017, vol. 29, issue 4, 737-753

Abstract: In this paper, a heuristic procedure is proposed for the facility location problem with general Bernoulli demands. This is a discrete facility location problem with stochastic demands that can be formulated as a two-stage stochastic program with recourse. In particular, facility locations and customer assignments must be decided here and now, i.e., before knowing the customers who will actually require to be served. In a second stage, service decisions are made according to the actual requests. The heuristic proposed consists of a greedy randomized adaptive search procedure followed by a path relinking. The heterogeneous Bernoulli demands make prohibitive the computational effort for evaluating feasible solutions. Thus the expected cost of a feasible solution is simulated when necessary. The results of extensive computational tests performed for evaluating the quality of the heuristic are reported, showing that high-quality feasible solutions can be obtained for the problem in fairly small computational times.

Keywords: discrete facility location; Bernoulli demands; GRASP; path relinking (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
https://doi.org/10.1287/ijoc.2017.0755 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:orijoc:v:29:y:2017:i:4:p:737-753

Access Statistics for this article

More articles in INFORMS Journal on Computing from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().