Skip to main content

Solving the planar p-median problem by variable neighborhood and concentric searches

Salhi, Said, Drezner, Zvi, Brimberg, Jack, Mladenovic, Nenad (2015) Solving the planar p-median problem by variable neighborhood and concentric searches. Journal of Global Optimization, 63 (3). pp. 501-514. ISSN 0925-5001. (doi:10.1007/s10898-014-0183-1) (KAR id:51099)

PDF (latest version)
Language: English
Download (173kB)
[thumbnail of latest version]
This file may not be suitable for users of assistive technology.
Request an accessible format
Official URL:


Two new approaches for the solution of the p-median problem

in the plane are proposed. One is a Variable Neighborhood Search (VNS)

and the other one is a concentric search. Both approaches are enhanced by a

front-end procedure for finding good starting solutions and a decomposition

heuristic acting as a post optimization procedure. Computational results

confirm the effectiveness of the proposed algorithms.

Item Type: Article
DOI/Identification number: 10.1007/s10898-014-0183-1
Additional information: The final publication is available at Springer via
Uncontrolled keywords: Location-allocation; Variable Neighborhood Search; Concentric Tabu; Concentric Search; Planar p-median.
Subjects: Q Science > Operations Research - Theory
Divisions: Divisions > Kent Business School - Division > Department of Analytics, Operations and Systems
Depositing User: Said Salhi
Date Deposited: 20 Oct 2015 10:52 UTC
Last Modified: 09 Dec 2022 03:22 UTC
Resource URI: (The current URI for this page, for reference purposes)
Salhi, Said:
  • Depositors only (login required):


Downloads per month over past year