Abstract
This paper studies the Coverage Location Problem with Interconnected Facilities (CPIF). It belongs to the family of Facility Location Problems, but being more realistic to nowadays situations as surveillance, or natural disaster control. This problem aims at locating a set of interconnected facilities to minimize the number of demand points that are not covered by the selected facilities. Two facilities are considered as interconnected if the distance between them is smaller than or equal to a predefined distance, while a facility covers a demand point if the distance to it is smaller than a certain threshold. The wide variety of real-world applications that fit into this model makes them attractive for designing an algorithm able to solve the problem efficiently. To this end, a metaheuristic algorithm based on the Fixed Set Search framework is implemented. The proposed algorithm will be able to provide high-quality solutions in short computational times, being competitive with the state-of-the-art.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Balinski, M.L.: Integer programming: methods, uses, computations. Manag. Sci. 12(3), 253–313 (1965)
Cherkesly, M., Landete, M., Laporte, G.: Median and covering location problems with interconnected facilities. Comput. Oper. Res. 107, 1–18 (2019)
Jovanovic, R., Tuba, M., Voß, S.: Fixed set search applied to the traveling salesman problem. In: Blesa Aguilera, M.J., Blum, C., Gambini Santos, H., Pinacho-Davidson, P., Godoy del Campo, J. (eds.) HM 2019. LNCS, vol. 11299, pp. 63–77. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-05983-5_5
Jovanovic, R., Voß, S.: Fixed Set Search Applied to the Minimum Weighted Vertex Cover Problem. In: Kotsireas, I., Pardalos, P., Parsopoulos, K.E., Souravlias, D., Tsokas, A. (eds.) SEA 2019. LNCS, vol. 11544, pp. 490–504. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-34029-2_31
Jovanovic, R., Voß, S.: Fixed set search application for minimizing the makespan on unrelated parallel machines with sequence-dependent setup times. Appl. Soft Comput. 110, 107521 (2021)
López-Sánchez, A.D., Sánchez-Oro, J., Laguna, M.: A new scatter search design for multiobjective combinatorial optimization with an application to facility location. INFORMS J. Comput. 33(2), 629–642 (2020)
Martín, R., Cavero, S.: rmartinsanta/mork: v0.11 (2022)
Srinidhi, N.N., Kumar, S.M.D., Venugopal, K.R.: Network optimizations in the internet of things: a review. Eng. Sci. Technol. Int. J. 22(1), 1–21 (2019)
Acknowledgments
The authors acknowledge support from the Spanish Ministry of Ciencia, Innovación y Universidades under grant ref. PID2021-125709OA-C22 and PID2021-126605NB-I00, Comunidad de Madrid and Fondos Estructurales of the European Union with grant references S2018/TCS-4566, Y2018/EMT-5062, the Spanish Ministry of Economía, Industria y Competitividad through Projects PID2019-104263RB-C41, and from Junta de Andalucía, FEDER-UPO Research & Development Call, reference number UPO-1263769.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Lozano-Osorio, I., Sánchez-Oro, J., Martínez-Gavara, A., López-Sánchez, A.D., Duarte, A. (2023). An Efficient Fixed Set Search for the Covering Location with Interconnected Facilities Problem. In: Di Gaspero, L., Festa, P., Nakib, A., Pavone, M. (eds) Metaheuristics. MIC 2022. Lecture Notes in Computer Science, vol 13838. Springer, Cham. https://doi.org/10.1007/978-3-031-26504-4_37
Download citation
DOI: https://doi.org/10.1007/978-3-031-26504-4_37
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-26503-7
Online ISBN: 978-3-031-26504-4
eBook Packages: Computer ScienceComputer Science (R0)