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

DOI10.1016/J.COR.2013.05.003MaRDI QIDQ337239zbMATH OpenOpenAlexFDO

Authors I. Davydov, Yury Kochetov, Emilio Carrizosa

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 optimizationcompetitive facility locationStackelberg gameleader-follower

Mathematics Subject Classification ID

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

Recommendations

• VNS heuristic for the \((r|p)\)-centroid problem on the plane
• A new alternating heuristic for the \((r|p)\)-centroid problem on the plane
• On the complexity of the \((r|p)\)-centroid problem in the plane
• Fast metaheuristics for the discrete \((r|p)\)-centroid problem
• A branch-and-cut algorithm for the discrete \((r| p)\)-centroid problem

Cites work

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

Cited in

(18)

• A hybrid genetic algorithm with solution archive for the discrete \((r|p)\)-centroid problem
• An exact method for the discrete \((r|p)\)-centroid problem
• An upper bound for the competitive location and capacity choice problem with multiple demand scenarios
• Heuristics for the facility location and design \((1|1)\)-centroid problem on the plane
• Local search with an exponential neighborhood for the servers load balancing problem
• Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants
• On the complexity of the \((r|p)\)-centroid problem in the plane
• Fast metaheuristics for the discrete \((r|p)\)-centroid problem
• A kernel search matheuristic to solve the discrete leader-follower location problem
• Exact method for the capacitated competitive facility location problem
• A new alternating heuristic for the \((r|p)\)-centroid problem on the plane
• Nash equilibrium sorting genetic algorithm for simultaneous competitive maximal covering location with multiple players
• 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
• VNS heuristic for the \((r|p)\)-centroid problem on the plane
• The \((1 | 1)\)-centroid problem in the plane with distance constraints
• A bilevel competitive location and pricing model with nonuniform split of demand
• An efficient algorithm for the Euclidean \(r\)-centrum location problem

Describes a project that uses

Uses Software

• VNS heuristic

This page was built for publication: A local search heuristic for the \((r| p)\)-centroid problem in the plane

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337239)