Abstract
We study a general class of multilevel uncapacitated p-location problems in which the selection of links between levels of facilities is part of the decision process. We propose an exact algorithm based on a Benders reformulation to solve large-scale instances of the general problem and some well-known particular cases. We exploit the network flow structure of the reformulation to efficiently generate Pareto-optimal cuts. We perform extensive computational experiments to assess the performance of several different variants of the Benders algorithm. Results obtained on benchmark instances with up to 3,000 customers, 250 potential facilities, and four levels confirm its efficiency.
| Original language | English |
|---|---|
| Pages (from-to) | 1085-1106 |
| Number of pages | 22 |
| Journal | Transportation Science |
| Volume | 53 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 1 Jan 2019 |
Funding
Funding: This research was partly funded by the Canadian Natural Sciences and Engineering Research Council [Grants 418609-2012 and 2015-06189] and the Fonds de Recherche du Québec–Nature et Technologies [Grant 2014-NC-172906]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2018.0868.
Keywords
- Benders decomposition
- Multilevel facility location
- Network design
- Pareto-optimal cuts
ASJC Scopus subject areas
- Civil and Structural Engineering
- Transportation