DC FieldValueLanguage
dc.contributor.authorRistic, Daliboren_US
dc.contributor.authorUrošević, Draganen_US
dc.contributor.authorMladenović, Nenaden_US
dc.contributor.authorTodosijević, Racaen_US
dc.date.accessioned2023-06-05T09:11:58Z-
dc.date.available2023-06-05T09:11:58Z-
dc.date.issued2023-01-01-
dc.identifier.issn1820-0214-
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/5031-
dc.description.abstractThe 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.en_US
dc.publisherComSIS Consortiumen_US
dc.relation.ispartofComputer Science and Information Systemsen_US
dc.rightsAttribution 4.0 International*
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/*
dc.subjectcombinatorial optimization | heuristic algorithms | p-second center problem | variable neighborhood methoden_US
dc.titleSolving the P-Second Center Problem with Variable Neighborhood Searchen_US
dc.typeArticleen_US
dc.identifier.doi10.2298/CSIS210804049R-
dc.identifier.scopus2-s2.0-85149124001-
dc.contributor.affiliationComputer Scienceen_US
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Artsen_US
dc.relation.firstpage95-
dc.relation.lastpage115-
dc.relation.issue1-
dc.relation.volume20-
dc.description.rank~M23-
item.openairetypeArticle-
item.cerifentitytypePublications-
item.fulltextWith Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.grantfulltextopen-
crisitem.author.orcid0000-0003-3607-6704-
crisitem.author.orcid0000-0001-6655-0409-
crisitem.author.orcid0000-0002-9321-3464-
Files in This Item:
File Description SizeFormat
DUrosevic.pdf3.79 MBAdobe PDFView/Open
Show simple item record

Page view(s)

65
checked on May 9, 2024

Download(s)

33
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


This item is licensed under a Creative Commons License Creative Commons