Authors: Grohmann, Sanja
Urošević, Dragan 
Carrizosa, Emilio
Mladenović, Nenad 
Title: Solving multifacility Huff location models on networks using metaheuristic and exact approaches
Journal: Computers and Operations Research
Volume: 78
First page: 537
Last page: 546
Issue Date: 1-Feb-2017
Rank: M21
ISSN: 0305-0548
DOI: 10.1016/j.cor.2016.03.005
In 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.
Keywords: Competitive location | Location | Metaheuristics | Networks | Variable Neighborhood Search
Publisher: Elsevier
Project: Mathematical Modelas and Optimization Methods on Large-Scale Systems 

Show full item record


checked on May 22, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




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