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 this file (PDF/173kB)
Request a format suitable for use with assistive technology e.g. a screenreader
Official URL: http://dx.doi.org/10.1007/s10898-014-0183-1

Abstract

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 http://dx.doi.org/10.1007/s10898-014-0183-1
Uncontrolled keywords:	Location-allocation; Variable Neighborhood Search; Concentric Tabu; Concentric Search; Planar p-median.
Subjects:	Q Science > Operations Research - Theory
Institutional Unit:	Schools > Kent Business School
Former Institutional Unit:	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:	20 May 2025 12:02 UTC
Resource URI:	https://kar.kent.ac.uk/id/eprint/51099 (The current URI for this page, for reference purposes)

University of Kent Author Information

Salhi, Said.

Creator's ORCID:	https://orcid.org/0000-0002-3384-5240
CReDIT Contributor Roles:

Depositors only (login required):

Altmetric

Total Views

Total unique views of this page since July 2020. For more details click on the image.