Name
Abstract | ||
|---|---|---|
Two efficient neighborhood reduction schemes are proposed for the solution of the p-median problem on the plane. Their integration into a local search significantly reduces the run time with an insignificant deterioration in the quality of the solution. For completeness this fast local search is also embedded into one of the most powerful metaheuristic algorithms, which is a combination of a genetic algorithm and a new improvement algorithm, recently developed for this continuous location problem. Excellent results for instances with up to 1060 demand points with various values of p are reported. Eight new best known solutions for ten instances of a large problem with 3038 demand points and up to 500 facilities are also found. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/s10479-015-1961-y | ANNALS OF OPERATIONS RESEARCH |
Keywords | Field | DocType |
Planar p-median,Local search,Neighborhood reduction,Metaheuristics | Mathematical optimization,Planar,Local search (optimization),Completeness (statistics),Mathematics,Genetic algorithm,Metaheuristic | Journal |
Volume | Issue | ISSN |
258 | 2 | 0254-5330 |
Citations | PageRank | References |
2 | 0.37 | 16 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zvi Drezner | 1 | 1195 | 140.69 |
| Said Salhi | 2 | 342 | 26.38 |