 The discrete p-center location problem with upgradingLaura Anton-Sanchez, Mercedes Landete and Francisco Saldanha-da-Gama Omega, 2023, vol. 119, issue C Abstract: In this paper, different upgrading strategies are investigated in the context of the p-center problem. The possibility of upgrading a set of connections to different centers is considered as well as the possibility of upgrading entire centers, i.e., all connections made to them. Two variants for these perspectives are analyzed: in the first, there is a limit on the number of connections or centers that can be upgraded; in the second, an existing budget is assumed for the same purpose. Different mixed-integer linear programming models are introduced for those problems as well as data-driven lower and upper bounds. In most cases, an optimal solution can be obtained within an acceptable computing time using an off-the-shelf solver. Nevertheless, this is not the case for one particular family of problems. This motivated the development of a math-heuristic seeking high-quality feasible solutions in that specific case. Extensive computational experiments are reported highlighting the relevance of upgrading connections or centers in the context of the p-center problem. Keywords: Discrete facility location; p-center; Connection upgrading; Center upgrading; MILP models (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:jomega:v:119:y:2023:i:c:s0305048323000580 Ordering information: This journal article can be ordered from DOI: 10.1016/j.omega.2023.102894 Access Statistics for this article Omega is currently edited by B. Lev More articles in Omega from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.