D. R. Santos Peñate, C. M. Campos Rodríguez, J. A. Moreno Pérez
We consider a discrete competitive location problem where two players sequentially enter the market and compete to provide goods or services which are assumed to be essential. The customer choice rule is defined as a possibility function. For each customer, an S-shaped function is used to share the demand among competitors when the difference in distances to the competing firms is small. The binary rule is a borderline case of this kind of function. Using linear programming formulations for this bi-level optimization problem, a solution procedure which incorporates a kernel search heuristic is presented. The proposed solution approach is illustrated with some computational results obtained for different S-shaped customer choice rules. The results obtained with an exact algorithm and the heuristic procedure are compared.
Palabras clave / Keywords: competitive location, sequential location problem, bi-level problem, linear programming, kernel search
Programado
Sesión GT04-2: Localización (GELOCA-2). Organizador: Antonio Manuel Rodríguez Chía
29 de mayo de 2018 17:00
Sala 3
