arrow
Return

The multiple server center location problem

delete2008-03-29
delete36
PRE
AI
R
Robert Aboolian *
O
Oded Berman
Z
Zvi Drezner
DOI:10.1007/s10479-008-0341-2delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
In this paper, we introduce the multiple server center location problem. p servers are to be located at nodes of a network. Demand for services of these servers is located at each node, and a subset of nodes are to be chosen to locate one or more servers in each. Each customer selects the closest server. The objective is to minimize the maximum time spent by any customer, including travel time and waiting time at the server sites. The problem is formulated and analyzed. Results for heuristic solution approaches are reported.
Keywords:
ALLOCATION
MODELS

Journal

Annals of Operations Research cover
Annals of Operations Research
IF:
4.5
Papers:
8.0K
Citations:
2.1W

Organization

California State University System cover
California State University System
Scholars:
2.8W
Papers: 2.4W
Citations: 457
California State University, San Marcos cover
California State University, San Marcos
Scholars:
318
Papers: 286
Citations: 720
U
university of toronto
Scholars:
14.7W
Papers: 12.0W
Citations: 165
researcher View more organizations