Computer Science and Information Systems 2023 Volume 20, Issue 1, Pages: 95-115
https://doi.org/10.2298/CSIS210804049R
Full text (
3789 KB)
Cited by
Solving the p-second center problem with variable neighborhood search
Ristić Dalibor
(School of Computing, Union University, Belgrade, Serbia), dalibor.ristic@outlook.com
Urošević Dragan
(School of Computing, Union University, Belgrade, Serbia + Mathematical Institute of the Serbian Academy of Sciences and Arts, Belgrade, Serbia), durosevic@raf.rs
Mladenović Nenad
(Khalifa University, Abu Dhabi, United Arab Emirates), nenadmladenovic12@gmail.com
Todosijević Raca
(Polytechnic University of Hauts-de-France, Valenciennes, France), racatodosijevic@gmail.com
The p-center problem is a well-known and highly studied problem pertaining to the identification of p of the potential n center locations in such a way as to minimize the maximum distance between the users and the closest center. As opposed to the p-center, the p-second center problem minimizes the maximum sum of the distances from the users to the closest and the second closest centers. In this paper, we propose a new Variable Neighborhood Search based algorithm for solving the p-second center problem. Its performance is assessed on the benchmark instances from the literature. Moreover, to further evaluate the algorithm’s performance, we generated larger instances with 1000, 1500, 2000, and 2500 nodes and instances defined over graphs up to 1000 nodes with different densities. The obtained results clearly demonstrate the effectiveness and efficiency of the proposed algorithm.
Keywords: variable neighborhood method, heuristic algorithms, p-second center problem, combinatorial optimization
Show references
Albareda-Sambola, M., Hinojosa, Y., Marín, A., Puerto, J.: When centers can fail: a close second opportunity. Computers & Operations Research, 62, 145-156. (2015)
Beasley, J. E.: OR-Library: distributing test problems by electronic mail. Journal of the operational research society, 41 (11), 1069-1072. (1990)
Calik, H., Tansel, B. C.: Double bound method for solving the p-center location problem. Computers & Operations Research, 40, 2991-2999. (2013)
Daskin, M. S.: Network and discrete location: models, algorithms, and applications, 2nd edn. Wiley, Hoboken. (2013)
Davidovic, T., Ramljak, D., Selmic, M., Teodorovic, D.: Bee colony optimization for the pcenter problem, Computers and Operations Research, 38, 1367-1376. (2011)
Elloumi, S., Labbé, M., Pochet, Y.: A new formulation and resolution method for the pcenter problem. INFORMS Journal on Computing, 16, 84-94. (2004)
Hakimi, S. L.: Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Operations Research, 13 (3), 462-475. (1965)
Hansen, P., Mladenovic, N.: Variable neighborhood search for the p-median. Location Science, 5 (4), 207-226. (1997)
Hochbaum, D. S., Shmoys, D. B.: A best possible heuristic for the k-center problem. Mathematics of Operations Research, 10 (2), 180-184. (1985)
Ilhan, T., Pınar, M. C.: An efficient exact algorithm for the vertex p-center problem. Technical report, Department of Industrial Engineering, Bilkent University. (2001)
Kariv, O., Hakimi, S. L.: An algorithmic approach to network location problems. I: The p- Centers. SIAM Journal on Applied Mathematics, 37(3), 513-538. (1979)
López-Sánchez, A. D., Sánchez-Oro, J., Hernández-Díaz, A. G.: GRASP and VNS for solving the p-next center problem. Computers and Operations Research, 104, 295-303. (2019)
Minieka, E.: The m-center problem. Society for Industrial and Applied Mathematics, 12(1), 138-139. (1970)
Mladenovic, N., Hansen, P.: Variable neighborhood search. Computers and Operations Research, 24 (11), 1097-1100. (1997)
Mladenovic, N., Labbé, M., Hansen, P.: Solving the p-center problem with tabu search and variable neighborhood search. Networks 42 (1), 48-64. (2003)
Pullan, W.: A memetic genetic algorithm for the vertex p-center problem. Evol Comput, 16 (3), 417-436. (2008)
Ristic, D., Mladenovic, N., Todosijevic, R., Urosevic, D.: Filtered variable neighborhood search method for the p-next center problem. International Journal for Traffic and Transport Engineering, 11 (2), 294 - 309. (2021)