Isodistant points in competitive network facility locatio

• Blas Pelegrín ^[1] ; Rafael Suárez-Vega ^[2] ; Saúl Cano ^[1]
  1. [1] Universidad de Murcia

     Universidad de Murcia

     Murcia, España

     
  2. [2] Universidad de Las Palmas de Gran Canaria

     Universidad de Las Palmas de Gran Canaria

     Gran Canaria, España

     
• Localización: Top, ISSN-e 1863-8279, ISSN 1134-5764, Vol. 20, Nº. 3, 2012, págs. 639-660
• Idioma: inglés
• Enlaces
  • Texto completo (pdf)
• Resumen

  • An isodistant point is any point on a network which is located at a predetermined distance from some node. For some competitive facility location problems on a network, it is verified that optimal (or near-optimal) locations are found in the set of nodes and isodistant points (or points in the vicinity of isodistant points). While the nodes are known, the isodistant points have to be determined for each problem. Surprisingly, no algorithm has been proposed to generate the isodistant points on a network. In this paper, we present a variety of such problems and propose an algorithm to find all isodistant points for given threshold distances associated with the nodes. The number of isodistant points is upper bounded by nm, where n and m are the number of nodes and the number of edges, respectively. Computational experiments are presented which show that isodistant points can be generated in short run time and the number of such points is much smaller than nm. Thus, for networks of moderate size, it is possible to find optimal (or near-optimal) solutions through the Integer Linear Programming formulations corresponding to the discrete version of such problems, in which a finite set of points are taken as location candidates.