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

Salhi, Said and Drezner, Zvi and Brimberg, Jack and 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:https://doi.org/10.1007/s10898-014-0183-1) (Full text available)

PDF (latest version)
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 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
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: 07 Aug 2018 15:03 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/51099 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year