“If the fool would persist in his folly he would become wise.” - William Blake
After a lot of hard work, we can now present the final results, published in Computers and Operations Research of the “The Ordered Tree Location Problem” - Miguel A. Pozo, Justo Puerto and Alberto Torrejón
But what are the implications of our work…?
Location problems allow us to optimize the allocation of resources, where to locate the bus stop, where to locate the supermarket, where we should go to vote, which hospital should we go,… One way to generalise all these location problems is through ordered optimization. Through ordered optimization we attend many ways of locating these resources, for example, trying to consider fair criteria. Trying to ensure that the most disadvantaged in the allocation are not so damaged by compensating them in the objective function.
In particular, in this paper we deal with the Discrete Ordered Median Problem (DOMP), which explores facility location ranking clients by allocation cost. By means of a ordered approach many objective functions can be modeled.
While this problem has been well studied, there was still something missing… What if we need the resources to be connected to each other? This is, what if we need hospitals to have an internal network that connects them, or if supermarkets need the distances that connects them to be optimal as well?
This was the question that laid the foundation for our research. In this way, we complete the literature of the DOMP which was missing.
The results can be found in…
