Competitive Multifacility Location on Networks: the (r∣Xp)‐Medianoid Problem |
| |
| Authors: | Rafael Suárez&#;Vega Dolores R Santos&#;Peñate Pablo Dorta&#;González |
| |
| Institution: | Departamento de Métodos Cuantitativos en Economía y Gestión, Universidad de Las Palmas de Gran Canaria, Campus de Tafira, Facultad de Ciencias Económicas y Empresariales, 35017 Las Palmas de Gran Canaria, Spain; Departamento de Métodos Cuantitativos en Economía y Gestión, Universidad de Las Palmas de Gran Canaria, Campus de Tafira, Facultad de Ciencias Económicas y Empresariales, 35017 Las Palmas de Gran Canaria, Spain; Departamento de Métodos Cuantitativos en Economía y Gestión, Universidad de Las Palmas de Gran Canaria, Campus de Tafira, Facultad de Ciencias Económicas y Empresariales, 35017 Las Palmas de Gran Canaria, Spain |
| |
| Abstract: | Abstract. We investigate the ( r ∣ X p )‐medianoid problem for networks. This is a competitive location problem that consists of determining the locations of r facilities belonging to a firm in order to maximize its market share in a space where a competitor is already operating with p facilities. We consider six scenarios resulting from the combination of three customer choice rules (binary, partially binary, and proportional) with two types of services (essential and unessential).
Known discretization results about the existence of a solution for the set of nodes are extended. Some examples and computational experience using heuristic algorithms are presented. |
| |
| Keywords: | |
|
|
