Solving Multifacility Huff Location Models on Networks Using Variable Neighborhood Search and Multi-Start Local Search Metaheuristics

DOI10.1016/j.endm.2012.10.017zbMath1268.90161OpenAlexW1968725901MaRDI QIDQ2840763

Dragan Urošević, Nenad Mladenović, Sanja Roksandić, Emilio Carrizosa

Publication date: 23 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://idus.us.es/handle//11441/107138

zbMATH Keywords

networkglobal optimizationfacility locationvariable neighborhood searchHuff modelmulti-start local search

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (3)

\(p\)-facility Huff location problem on networks ⋮ Solving multifacility Huff location models on networks using metaheuristic and exact approaches ⋮ Fast metaheuristics for the discrete \((r|p)\)-centroid problem

Cites Work

• On locating new facilities in a competitive environment
• Solving the Huff-based competitive location model on a network with link-based demand
• Variable neighborhood search: Principles and applications

This page was built for publication: Solving Multifacility Huff Location Models on Networks Using Variable Neighborhood Search and Multi-Start Local Search Metaheuristics