|Title:||The p-median problem: A survey of metaheuristic approaches||Journal:||European Journal of Operational Research||Volume:||179||Issue:||3||First page:||927||Last page:||939||Issue Date:||16-Jun-2007||Rank:||M21||ISSN:||0377-2217||DOI:||10.1016/j.ejor.2005.05.034||Abstract:||
The p-median problem is one of the basic models in discrete location theory. As with most location problems, it is classified as NP-hard, and so, heuristic methods are usually used to solve it. 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.
|Keywords:||Location | Metaheuristics | p-Median||Publisher:||Elsevier|
Show full item record
checked on Jan 16, 2022
checked on Jan 17, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.