DC FieldValueLanguage
dc.contributor.authorIlić, Aleksandaren
dc.contributor.authorUrošević, Draganen
dc.contributor.authorBrimberg, Jacken
dc.contributor.authorMladenović, Nenaden
dc.date.accessioned2020-05-01T20:13:56Z-
dc.date.available2020-05-01T20:13:56Z-
dc.date.issued2010-10-16en
dc.identifier.issn03772217en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/1794-
dc.description.abstractWe present a new general variable neighborhood search approach for the uncapacitated single allocation p-hub median problem in networks. This NP hard problem is concerned with locating hub facilities in order to minimize the traffic between all origin-destination pairs. We use three neighborhoods and efficiently update data structures for calculating new total flow in the network. In addition to the usual sequential strategy, a new nested strategy is proposed in designing a deterministic variable neighborhood descent local search. Our experimentation shows that general variable neighborhood search based heuristics outperform the best-known heuristics in terms of solution quality and computational effort. Moreover, we improve the best-known objective values for some large Australia Post and PlanetLab instances. Results with the new nested variable neighborhood descent show the best performance in solving very large test instances.en
dc.publisherElsevier-
dc.relationSerbian Ministry of Science and Environmental Protection, Grant 144007-
dc.relation.ispartofEuropean Journal of Operational Researchen
dc.subjectDiscrete location | Nested variable neighborhood descent | p-Hub median | Variable neighborhood searchen
dc.titleA general variable neighborhood search for solving the uncapacitated single allocation p-hub median problemen
dc.typeArticleen
dc.identifier.doi10.1016/j.ejor.2010.02.022en
dc.identifier.scopus2-s2.0-77950459586en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage289en
dc.relation.lastpage300en
dc.relation.issue2en
dc.relation.volume206en
dc.description.rankM21a-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.openairetypeArticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextNo Fulltext-
crisitem.author.orcid0000-0003-3607-6704-
crisitem.author.orcid0000-0001-6655-0409-
Show simple item record

SCOPUSTM   
Citations

131
checked on Jun 21, 2024

Page view(s)

56
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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