The single facility location problem with average-distances

• C. Valero Franco ^[1] ; A.M. Rodríguez-Chía ^[1] ; I. Espejo Miranda ^[1]
  1. [1] Universidad de Cádiz

     Universidad de Cádiz

     Cádiz, España

     
• Localización: Top, ISSN-e 1863-8279, ISSN 1134-5764, Vol. 16, Nº. 1, 2008, págs. 164-194
• Idioma: inglés
• Enlaces
  • Texto completo (pdf)
• Resumen

  • This paper considers a location problem in ℝ n , where the demand is not necessarily concentrated at points but it is distributed in hypercubes following a Uniform probability distribution. The goal is to locate a service facility minimizing the weighted sum of average distances (measured with ℓ p norms) to these demand hypercubes. In order to do that, we present an iterative scheme that provides a sequence converging to an optimal solution of the problem for p∈[1,2]. For the planar case, analytical expressions of this iterative procedure are obtained for p=2 and p=1, where two different approaches are proposed. The paper ends with a computational analysis of the proposed methodology, comparing its efficiency with a standard minimizer.