The Expected Maximum Distance Objective in Facility Location Academic Article uri icon

  •  
  • Overview
  •  
  • Research
  •  
  • Identity
  •  
  • Additional Document Info
  •  
  • View All
  •  

abstract

  • 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. Copyright Blackwell Publishing, Inc. 2003

publication date

  • November 2003