γ-Robust facility relocation problem

Gino J. Lim and Ayse Durukan Sonmez

European Journal of Operational Research, 2013, vol. 229, issue 1, 67-74

Abstract: In this paper, we consider relocating facilities, where we have demand changes in the network. Relocations are performed by closing some of the existing facilities from low demand areas and opening new ones in newly emerging areas. However, the actual changes of demand are not known in advance. Therefore, different scenarios with known probabilities are used to capture such demand changes. We develop a mixed integer programming model for facility relocation that minimizes the expected weighted distance while making sure that relative regret for each scenario is no greater than γ. We analyzed the problem structure and developed a Lagrangian Decomposition Algorithm (LDA) to expedite the solution process. Numerical experiments are carried out to show the performance of LDA against the exact solution method.

Keywords: Facility relocation; Uncertainty; p-Median (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221713001665
Full text for ScienceDirect subscribers only

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:eee:ejores:v:229:y:2013:i:1:p:67-74

DOI: 10.1016/j.ejor.2013.02.033

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().