Author： Wang Q. Batta R. Rump C.M.
Publisher： Springer Publishing Company
ISSN： 0254-5330
Source： Annals of Operations Research, Vol.111, Iss.1-4, 2002-03, pp. : 17-34
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
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.
Related content
New Algorithms for Facility Location Problems on the Real Line
Algorithmica, Vol. 69, Iss. 2, 2014-06 ,pp. :
Access to resources
Recommend
Primal–Dual Algorithms for Connected Facility Location Problems
Algorithmica, Vol. 40, Iss. 4, 2004-09 ,pp. :
The Stochastic Location-Assignment Problem on a Tree
Annals of Operations Research, Vol. 136, Iss. 1, 2005-04 ,pp. :