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 (230kB) Preview
[img]
Preview
Official URL
http://dx.doi.org/10.1007/s10898-014-0183-1

Abstract

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

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

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
Divisions: Faculties > Social Sciences > Kent Business School > Management Science
Faculties > Social Sciences > Kent Business School > Centre for Logistics and Heuristic Organisation (CLHO)
Depositing User: Said Salhi
Date Deposited: 20 Oct 2015 10:52 UTC
Last Modified: 08 Feb 2020 04:07 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/51099 (The current URI for this page, for reference purposes)
Salhi, Said: https://orcid.org/0000-0002-3384-5240
  • Depositors only (login required):

Downloads

Downloads per month over past year