DC FieldValueLanguage
dc.contributor.authorHansen, Pierreen
dc.contributor.authorMladenović, Nenaden
dc.date.accessioned2020-05-02T16:42:11Z-
dc.date.available2020-05-02T16:42:11Z-
dc.date.issued2008-03-01en
dc.identifier.issn0960-3174en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/2525-
dc.description.abstractA recent comparison of evolutionary, neural network, and scatter search heuristics for solving the p-median problem is completed by (i) gathering or obtaining exact optimal values in order to evaluate errors precisely, and (ii) including results obtained with several variants of a variable neighborhood search (VNS) heuristic. For a first, well-known, series of instances, the average errors of the evolutionary and neural network heuristics are over 10% and more than 1000 times larger than that of VNS. For a second series, this error is about 3% while the errors of the parallel VNS and of a hybrid heuristic are about 0.01% and that of parallel scatter search even smaller.en
dc.publisherSpringer Link-
dc.relation.ispartofStatistics and Computingen
dc.subjectEvolutionary algorithm | Genetic algorithm | Metaheuristics | Neural networks | P-median | Scatter search | Variable neighborhood searchen
dc.titleComplement to a comparative analysis of heuristics for the p-median problemen
dc.typeArticleen
dc.identifier.doi10.1007/s11222-007-9036-9en
dc.identifier.scopus2-s2.0-37249058873en
dc.relation.firstpage41en
dc.relation.lastpage46en
dc.relation.issue1en
dc.relation.volume18en
dc.description.rankM21-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.openairetypeArticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextNo Fulltext-
crisitem.author.orcid0000-0001-6655-0409-
Show simple item record

SCOPUSTM   
Citations

7
checked on Jun 22, 2024

Page view(s)

66
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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