Premium
The Expected Maximum Distance Objective in Facility Location
Author(s) -
Berman Oded,
Drezner Zvi,
Wesolowsky George O.
Publication year - 2003
Publication title -
journal of regional science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.171
H-Index - 79
eISSN - 1467-9787
pISSN - 0022-4146
DOI - 10.1111/j.0022-4146.2003.00318.x
Subject(s) - solver , minimax , 1 center problem , mathematical optimization , computer science , facility location problem , point (geometry) , location allocation , regular polygon , function (biology) , mathematics , geometry , evolutionary biology , biology
In this paper we introduce a new objective function for the minimax location problem. Every demand point generates demand for service with a given probability (during a given period of time) and the objective is to minimize the expected maximum distance. The planar problem is proven to be convex and thus standard solution techniques such as using the Solver in Excel can be applied for its solution. Properties for the problem on the network are proven and an efficient algorithm proposed for its solution.