A hybrid genetic algorithm with solution archive for the discrete \((r|p)\)-centroid problem
From MaRDI portal
Publication:524886
DOI10.1007/S10732-015-9282-5zbMath1360.90298OpenAlexW2055724001MaRDI QIDQ524886
Bin Hu, Benjamin Biesinger, Günther R. Raidl
Publication date: 26 April 2017
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10732-015-9282-5
combinatorial optimizationmetaheuristicsbi-level optimizationcompetitive facility locationsolution archivediscrete \((r|p)\)-centroid problem
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (6)
Models and algorithms for competitive facility location problems with different customer behavior ⋮ Competitive facility location problem with foresight considering discrete-nature attractiveness for facilities: model and solution ⋮ 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Sequential competitive location on networks
- On the complexity of the \((r|p)\)-centroid problem in the plane
- Fast metaheuristics for the discrete \((r|p)\)-centroid problem
- The \(p\)-median problem: a survey of metaheuristic approaches
- Multiple voting location and single voting location on trees
- On locating new facilities in a competitive environment
- Solving the multiple competitive facilities location problem
- An alternating heuristic for medianoid and centroid problems in the plane
- A branch-and-cut algorithm for the discrete \((r| p)\)-centroid problem
- VNS heuristic for the –centroid problem on the plane
- Algorithms on Strings, Trees and Sequences
This page was built for publication: A hybrid genetic algorithm with solution archive for the discrete \((r|p)\)-centroid problem