DC FieldValueLanguage
dc.contributor.authorGrohmann, Sanjaen
dc.contributor.authorUrošević, Draganen
dc.contributor.authorCarrizosa, Emilioen
dc.contributor.authorMladenović, Nenaden
dc.date.accessioned2020-05-01T20:13:53Z-
dc.date.available2020-05-01T20:13:53Z-
dc.date.issued2017-02-01en
dc.identifier.issn0305-0548en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/1771-
dc.description.abstractIn this paper we consider multifacility Huff facility location problem on networks. First, we introduce a slight modification of the existing mixed integer nonlinear mathematical model and confirm its validity by using the solver for nonlinear optimization, KNITRO. Second, since the problem is NP-hard, we develop three methods that are based on three metaheuristic principles: Variable Neighborhood Search, Simulated Annealing, and Multi-Start Local Search. Based on extensive computational experiments on large size instances (up to 800 customers and 100 potential facilities), it appears that VNS based heuristic outperforms the other two proposed methods.en
dc.publisherElsevier-
dc.relationMathematical Modelas and Optimization Methods on Large-Scale Systems-
dc.relation.ispartofComputers and Operations Researchen
dc.subjectCompetitive location | Location | Metaheuristics | Networks | Variable Neighborhood Searchen
dc.titleSolving multifacility Huff location models on networks using metaheuristic and exact approachesen
dc.typeArticleen
dc.identifier.doi10.1016/j.cor.2016.03.005en
dc.identifier.scopus2-s2.0-85000605931en
dc.relation.firstpage537en
dc.relation.lastpage546en
dc.relation.volume78en
dc.description.rankM21-
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-
crisitem.project.projectURLhttp://www.mi.sanu.ac.rs/novi_sajt/research/projects/174010e.php-
crisitem.project.fundingProgramDirectorate for Engineering-
crisitem.project.openAireinfo:eu-repo/grantAgreement/NSF/Directorate for Engineering/1740103-
Show simple item record

SCOPUSTM   
Citations

10
checked on Jun 15, 2024

Page view(s)

76
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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