LOCALIZACIÓN EN UNA RED CON PATRÓN DE ELECCIÓN DEFINIDO POR UNA DISTANCIA UMBRAL

Abstract

We consider the facility location problem on a network for an entering firm, in competition with other already established facilities, with the objective of market share maximization. The consumers choose the facility from which they obtain a maximum utility (binary preference). If a consumer obtains the maximum utility from a preexisting center and a new one, a proportion of his demand is captured by the new facility. The location candidates are the nodes and the points in the edges of the network. If the highest utility is obtained from a facility located to a distance within a certain threshold from the customer, it is proved that the set of candidates to optimal solution is a finite set of points in the network. A procedure to generate the candidates to optimal location is given and a formulation as a mixed integer linear programming problem is presented. A sensitivity analysis related to the proportion, the number of preexisting facilities and the number of new facilities, applied to the Region of Murcia (Spain), is shown.