The multiple server location problem

O Berman and Z Drezner ()
Additional contact information
O Berman: University of Toronto
Z Drezner: California State University-Fullerton

Journal of the Operational Research Society, 2007, vol. 58, issue 1, 91-99

Abstract: Abstract In this paper, we introduce the Multiple Server location problem. A given number of servers are to be located at nodes of a network. Demand for these servers is generated at each node, and a subset of nodes need to be selected for locating one or more servers in each. There is no limit on the number of servers that can be established at each node. Each customer at a node selects the closest server (with demand divided equally when the closest distance is measured to more than one node). The objective is to minimize the sum of the travel time and the average time spent at the server, for all customers. The problem is formulated and analysed. Results using heuristic solution procedures: descent, simulated annealing, tabu search and a genetic algorithm are reported. The problem turns out to be a very difficult combinatorial problem when the total demand is very close to the total capacity of the servers.

Keywords: ATM machines; location; queuing; servers (search for similar items in EconPapers)
Date: 2007
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (13)

Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2602126 Abstract (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:pal:jorsoc:v:58:y:2007:i:1:d:10.1057_palgrave.jors.2602126

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

DOI: 10.1057/palgrave.jors.2602126

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().