Fast metaheuristics for the discrete \((r|p)\)-centroid problem

DOI10.1134/S0005117914040080zbMath1307.91139MaRDI QIDQ463377

I. A. Davydov, Dragan Urošević, Nenad Mladenović, Yury A. Kochetov

Publication date: 16 October 2014

Published in: Automation and Remote Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59) Spatial models in economics (91B72)

Related Items (20)

Locating facilities in a competitive environment ⋮ A bilevel planning model for public-private partnership ⋮ A hybrid VND method for the split delivery vehicle routing problem ⋮ VNS-based heuristic with an exponential neighborhood for the server load balancing problem ⋮ A variable neighborhood search algorithm for the \((r\mid p)\) hub-centroid problem under the price war ⋮ Comparison of metaheuristics for the bilevel facility location and mill pricing problem ⋮ A hybrid algorithm of local search for the heterogeneous fixed fleet vehicle routing problem ⋮ 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 ⋮ Optimal placement of rectangles on a plane with fixed objects ⋮ Metaheuristics for bilevel optimization: a comprehensive review ⋮ Competitive network restructuring with spatially loyal customers. A bilevel facility delocation problem ⋮ The generalized discrete ‐centroid problem ⋮ A kernel search matheuristic to solve the discrete leader-follower location problem ⋮ Bilevel competitive facility location and pricing problems ⋮ A hybrid genetic algorithm with solution archive for the discrete \((r|p)\)-centroid problem ⋮ A Bilevel Competitive Location and Pricing Model with Nonuniform Split of Demand ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ Local search with an exponential neighborhood for the servers load balancing problem ⋮ Discrete Competitive Facility Location: Modeling and Optimization Approaches

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A local search heuristic for the \((r| p)\)-centroid problem in the plane
• Sequential competitive location on networks
• An exact procedure and LP formulations for the leader-follower location problem
• The \(p\)-median problem: a survey of metaheuristic approaches
• Multiple voting location and single voting location on trees
• Attraction probabilities in variable neighborhood search
• \((r,p)\)-centroid problems on paths and trees
• Variable neighborhood search
• A hybrid heuristic for the \(p\)-median problem
• A branch-and-cut algorithm for the discrete \((r| p)\)-centroid problem
• Solving Multifacility Huff Location Models on Networks Using Variable Neighborhood Search and Multi-Start Local Search Metaheuristics

This page was built for publication: Fast metaheuristics for the discrete \((r|p)\)-centroid problem