A genetic algorithm for the \(p\)-median problem with pos/neg weights

DOI10.1016/j.amc.2006.05.143zbMath1105.65066MaRDI QIDQ865554

Jafar Fathali

Publication date: 19 February 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.05.143

zbMATH Keywords

location theory; numerical examples; \(p\)-median problem; genetic algorithm; undirected graph; obnoxious facilities

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

65K05: Numerical mathematical programming methods

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A polynomial method for the pos/neg weighted 3-median problem on a tree
• Sequential location problems
• An efficient tabu search procedure for the \(p\)-median problem
• A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
• An efficient genetic algorithm for the \(p\)-median problem
• 2-medians in trees with pos/neg weights
• A hybrid heuristic for the \(p\)-median problem
• An ant colony algorithm for the pos/neg weighted \(p\)-median problem
• Solving the \(p\)-median problem with pos/neg weights by variable neighborhood search and some results for special cases
• A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Variable neighborhood search for the p-median
• Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph