Solving the p-second center problem with variable neighborhood search

Computer Science and Information Systems

article

Dalibor Ristić¹  Dragan Urošević¹  Nenad Mladenović³  Raca Todosijević⁴ 

[1] School of Computing, Union University;Mathematical Institute of the Serbian Academy of Sciences and Arts;Khalifa University;Polytechnic University of Hauts-de-France

关键词: variable neighborhood method;    heuristic algorithms;    p-second center problem;    combinatorial optimization;   

DOI  :  10.2298/CSIS210804049R

学科分类：土木及结构工程学

来源: Computer Science and Information Systems

【 摘 要 】

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.

【 授权许可】

CC BY-NC-ND