A local search heuristic for the \((r| p)\)-centroid problem in the plane

DOI10.1016/j.cor.2013.05.003zbMath1348.90430OpenAlexW2123161323MaRDI QIDQ337239

Mohammad Hasan, M. Dambrine

Publication date: 10 November 2016

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

Full work available at URL: https://doi.org/10.1016/j.cor.2013.05.003

zbMATH Keywords

bilevel optimizationStackelberg gamecompetitive facility locationleader-follower

Mathematics Subject Classification ID

Continuous location (90B85) Hierarchical games (including Stackelberg games) (91A65) Applications of game theory (91A80) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Exact method for the capacitated competitive facility location problem, Local search for load balancing problems for servers with large dimension, Competitive facility location problem with foresight considering discrete-nature attractiveness for facilities: model and solution, Nash equilibrium sorting genetic algorithm for simultaneous competitive maximal covering location with multiple players, A kernel search matheuristic to solve the discrete leader-follower location problem, An upper bound for the competitive location and capacity choice problem with multiple demand scenarios, Fast metaheuristics for the discrete \((r|p)\)-centroid problem, A Bilevel Competitive Location and Pricing Model with Nonuniform Split of Demand, Local search with an exponential neighborhood for the servers load balancing problem

Uses Software

• VNS

Cites Work

• Unnamed Item
• Unnamed Item
• Branch-and-bound algorithm for a competitive facility location problem
• Sequential competitive location on networks
• On the complexity of the \((r|p)\)-centroid problem in the plane
• An exact procedure and LP formulations for the leader-follower location problem
• Multiple voting location and single voting location on trees
• \((r,p)\)-centroid problems on paths and trees
• An alternating heuristic for medianoid and centroid problems in the plane
• Discrete models for competitive location with foresight
• First vs. best improvement: an empirical study
• VNS heuristic for the –centroid problem on the plane
• A new alternating heuristic for the (r | p)–centroid problem on the plane
• LOCATING MULTIPLE FACILITIES IN A PLANAR COMPETITIVE ENVIRONMENT
• Variable neighborhood search: Principles and applications