Solving multifacility Huff location models on networks using metaheuristic and exact approaches

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.