Optimization Online


The Facility Location Problem with Bernoulli Demands

Maria Albareda-Sambola(maria.albareda***at***upc.edu)
Elena Fernandez(e.fernandez***at***upc.edu)
Francisco Saldanha-da-Gama(fsgama***at***fc.ul.pt)

Abstract: In this paper we address a discrete capacitated facility location problem in which customers have Bernoulli demands. The problem is formulated as a two-stage stochastic program. The goal is to define an a priori solution for the location of the facilities and for the allocation of customers to the operating facilities that minimize the expected value of the recourse function. A closed form is presented for the recourse function and an approximation is proposed for situations in which it can not be evaluated exactly. The stochastic assignment problem resulting from setting the operating facilities is studied and a procedure is proposed to approximate its optimal solution. We formulate the capacitated facility location problem with Bernoulli demands under perfect information and, finally, we propose a heuristic to find an a priori solution. Computational results are presented for the homogeneous case.

Keywords: Stochastic Programming, Location

Category 1: Stochastic Programming


Download: [PDF]

Entry Submitted: 08/25/2008
Entry Accepted: 08/25/2008
Entry Last Modified: 08/25/2008

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society