Abstract. The p-median problem, like most location problems, is classified as N P -hard, and so, heuristic methods are usually used for solving it. The pmedian problem is a basic discrete location problem with real application that have been widely used to test heuristics. Metaheuristics are frameworks for building heuristics. In this survey, we examine the p-median, with the aim of providing an overview on advances in solving it using recent procedures based on metaheuristic rules.
For this, a survey in the p-median problem with the aim in procedures based on metaheuristics rules REF is useful.
The p-median problem: A survey of metaheuristic approaches
European J Operational Research 179 927
Mathematics Computer Science