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

DOI10.1016/j.cor.2016.03.005zbMath1391.90378OpenAlexW2300564671MaRDI QIDQ1652125

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

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

metaheuristicsnetworkslocationvariable neighborhood searchcompetitive location

Mathematics Subject Classification ID

Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (2)

A discrete competitive facility location model with proportional and binary rules sequentially applied ⋮ Robust model for discrete competitive facility location problem with the uncertainty of customer behaviors

Uses Software

• KNITRO

Cites Work

• Optimization by Simulated Annealing
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• A multi-start global minimization algorithm with dynamic search trajectories
• On locating new facilities in a competitive environment
• Solving the Huff-based competitive location model on a network with link-based demand
• Solving Multifacility Huff Location Models on Networks Using Variable Neighborhood Search and Multi-Start Local Search Metaheuristics
• Search Methodologies
• Practical Optimization
• The Location of Emergency Service Facilities
• Variable neighborhood search: Principles and applications

This page was built for publication: Solving multifacility Huff location models on networks using metaheuristic and exact approaches