Home
Location with preferences

Sergio García Quiles
Departamento de Estadística
Universidad Carlos III
This e-mail address is being protected from spam bots, you need JavaScript enabled to view it

  • Abstract
    Many location problems assume that, once facilities have been located, customers will be allocated to the closest open facility. However, this is not guaranteed by the model and, as a consequence, must be explicitly imposed by adding some closest assignment constraints. Moreover, the concept of "closest" is easily extended to the one of "most preferred". In this paper, several classical closest assignment constraints appeared in the literature are analyzed. Then, a model which considers location with most preferred allocation is stated: the Simple Plant Location problem with Order. Finally, some valid inequalities which strengthen this formulation are shown.
  • Keywords: Location, Simple Plant Location Problem, preferences.
  • AMS Subject classifications: 90C11, 90B80.
  • PDF PDF (511.68 kB)