A. Torrejón Valenzuela, M. Á. Pozo Montaño, J. Puerto Albandoz
We propose the Ordered Median Tree Location Problem (OMT). The OMT is a single-allocation facility location problem where p facilities must be placed on a network connected by a non-directed tree. The objective is to minimize the sum of the ordered weighted averaged allocation costs plus the sum of the costs of connecting the facilities in the tree. We present different MILP formulations for the OMT based on properties of the Minimum Spanning Tree Problem and the ordered median optimization. Given that ordered median hub location problems are difficult to solve we have improved the OMT solution performance by introducing covering variables. In addition, we propose a Benders decomposition algorithm to approach the OMT. We establish an empirical comparison between these new formulations and we also provide enhancements that together with a proper formulation allow to solve medium size instances on general random graphs.
Palabras clave: Combinatorial optimization, Minimum Spanning Tree, Ordered Median
Programado
GT01 Localización IV. Discrete Location
8 de junio de 2022 16:00
A15
