Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2207.05478 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915143483392000 |
|---|---|
| author | Pozo, Miguel A. Puerto, Justo Torrejon, Alberto |
| author_facet | Pozo, Miguel A. Puerto, Justo Torrejon, Alberto |
| contents | In this paper, 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 rather difficult to solve we have improved the OMT solution performance by introducing covering variables in a valid reformulation plus developing two pre-processing phases to reduce the size of this formulations. 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2207_05478 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | An extended version of the Ordered Median Tree Location Problem including appendices and detailed computational results Pozo, Miguel A. Puerto, Justo Torrejon, Alberto Discrete Mathematics Optimization and Control 90C27, 90B80 G.2.1 In this paper, 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 rather difficult to solve we have improved the OMT solution performance by introducing covering variables in a valid reformulation plus developing two pre-processing phases to reduce the size of this formulations. 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. |
| title | An extended version of the Ordered Median Tree Location Problem including appendices and detailed computational results |
| topic | Discrete Mathematics Optimization and Control 90C27, 90B80 G.2.1 |
| url | https://arxiv.org/abs/2207.05478 |