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

DOI10.1134/S0005117914040080zbMATH Open1307.91139MaRDI QIDQ463377FDOQ463377

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

Publication date: 16 October 2014

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

Recommendations

• A local search heuristic for the \((r| p)\)-centroid problem in the plane
• A branch-and-cut algorithm for the discrete \((r| p)\)-centroid problem
• An exact method for the discrete \((r|p)\)-centroid problem
• A new alternating heuristic for the \((r|p)\)-centroid problem on the plane
• VNS heuristic for the \((r|p)\)-centroid problem on the plane

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Metaheuristics. From design to implementation.
• A hybrid heuristic for the \(p\)-median problem
• The \(p\)-median problem: a survey of metaheuristic approaches
• Attraction probabilities in variable neighborhood search
• Variable neighborhood search
• A branch-and-cut algorithm for the discrete \((r| p)\)-centroid problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Multiple voting location and single voting location on trees
• Sequential competitive location on networks
• Solving multifacility Huff location models on networks using variable neighborhood search and multi-start local search metaheuristics
• \((r,p)\)-centroid problems on paths and trees
• A local search heuristic for the \((r| p)\)-centroid problem in the plane
• An exact procedure and LP formulations for the leader-follower location problem
• Facility location: discrete models and local search methods

Cited In (21)

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

Uses Software

• Tabu search

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

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