L. Anton-Sanchez, B. G.-Tóth, J. Fernández, J. L. Redondo, P. M. Ortigosa

A chain wants to expand its presence in a given geographical area of the plane, where it already owns some existing facilities. The available budget can be invested in opening one new facility and/or modifying the qualities of the existing chain-owned facilities. The chain can also close some of its existing facilities in order to invest the money formerly devoted to them to its other facilities or to the new one. In order to decide the location and quality of the new facility (in case it is finally open) as well as the new qualities for the existing chain-owned facilities, a mixed-integer nonlinear programming (MINLP) problem is formulated, whose objective is to maximize the profit obtained by the chain. A heuristic algorithm, which includes a ranking procedure, is proposed to cope with this problem.

Keywords: Facility location, Competition, Quality, MINLP, Heuristic


GT1-3 Location
September 3, 2019  6:30 PM
I3L8. Georgina Blanes building

Other papers in the same session

Formulaciones para el problema de la mediana ordenada discreto con capacidades

I. Espejo Miranda, J. Puerto Albandoz, A. M. Rodríguez Chía

Prize-collecting Location Routing on Trees

J. Aráoz, E. Fernández Areizaga, M. Muñoz Márquez

Wildfires containment and location of limited resources: A continuous approach

M. Marcos Pérez, J. A. Mesa López-Colmenar, F. A. Ortega Riejos

Cookie policy

We use cookies in order to be able to identify and authenticate you on the website. They are necessary for the correct functioning of it, and therefore they can not be disabled. If you continue browsing the website, you are agreeing with their acceptance, as well as our Privacy Policy.

Additionally, we use Google Analytics in order to analyze the website traffic. They also use cookies and you can accept or refuse them with the buttons below.

You can read more details about our Cookie Policy and our Privacy Policy.