DC FieldValueLanguage
dc.contributor.authorMladenović, Nenaden_US
dc.contributor.authorTodosijević, Racaen_US
dc.contributor.authorUrošević, Draganen_US
dc.contributor.authorRatli, Mustaphaen_US
dc.date.accessioned2022-01-18T15:53:17Z-
dc.date.available2022-01-18T15:53:17Z-
dc.date.issued2022-03-
dc.identifier.issn0305-0548-
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/4765-
dc.description.abstractThe topic of this paper is the Capacitated Dispersion Problem (CDP). To solve the problem, variable neighborhood search (VNS) based heuristics are proposed. The proposed heuristics are Basic VNS, General VNS and General Skewed VNS. Their performances are assessed on the benchmark instances from the literature and compared against the state-of-the-art ones. Comparing to the state-of-the-art results, it turns out that Basic VNS is able to provide competitive results, while General VNS and General Skewed VNS advance the state-of-the-art results by establishing 57 new best-known solutions on the data set of 100 instances. Twenty nine new best-known solutions are solely due to the proposed General Skewed VNS.en_US
dc.publisherElsevieren_US
dc.relationAdvanced artificial intelligence techniques for analysis and design of system components based on trustworthy BlockChain technology - AI4TrustBCen_US
dc.relation.ispartofComputers and Operations Researchen_US
dc.subjectCapacitated Dispersion Problem | Combinatorial optimization | Heuristics | Variable neighborhood searchen_US
dc.titleSolving the Capacitated Dispersion Problem with variable neighborhood search approaches: From basic to skewed VNSen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.cor.2021.105622-
dc.identifier.scopus2-s2.0-85122526372-
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Artsen_US
dc.contributor.affiliationComputer Scienceen_US
dc.relation.firstpage105622-
dc.relation.volume139-
dc.description.rank~M21-
item.openairetypeArticle-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.grantfulltextnone-
crisitem.author.orcid0000-0001-6655-0409-
crisitem.author.orcid0000-0002-9321-3464-
crisitem.author.orcid0000-0003-3607-6704-
crisitem.project.projectURLhttp://www.mi.sanu.ac.rs/novi_sajt/research/projects/AI4TrustBC/description.php-
crisitem.project.projectURLhttp://www.mi.sanu.ac.rs/novi_sajt/research/projects/AI4TrustBC/participants.php-
Show simple item record

SCOPUSTM   
Citations

9
checked on Jun 16, 2024

Page view(s)

160
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.