Algorithms for a Facility Location Problem with Stochastic Customer Demand and Immobile Servers

Qian Wang, Rajan Batta and Christopher Rump

Annals of Operations Research, 2002, vol. 111, issue 1, 17-34

Abstract: This paper studies a facility location problem with stochastic customer demand and immobile servers. Motivated by applications to locating bank automated teller machines (ATMs) or Internet mirror sites, these models are developed for situations in which immobile service facilities are congested by stochastic demand originating from nearby customer locations. Customers are assumed to visit the closest open facility. The objective of this problem is to minimize customers' total traveling cost and waiting cost. In addition, there is a restriction on the number of facilities that may be opened and an upper bound on the allowable expected waiting time at a facility. Three heuristic algorithms are developed, including a greedy-dropping procedure, a tabu search approach and an ε-optimal branch-and-bound method. These methods are compared computationally on a bank location data set from Amherst, New York. Copyright Kluwer Academic Publishers 2002

Keywords: facility location; queueing; heuristics; tabu search; branch and bound (search for similar items in EconPapers)
Date: 2002
References: Add references at CitEc
Citations: View citations in EconPapers (34)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1020961732667 (text/html)
Access to full text is restricted to subscribers.

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:spr:annopr:v:111:y:2002:i:1:p:17-34:10.1023/a:1020961732667

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1020961732667

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().