Skip to main content

Incorporating Neighborhood Reduction for the Solution of the Planar p-Median Problem

Drezner, Zvi, Salhi, Said (2017) Incorporating Neighborhood Reduction for the Solution of the Planar p-Median Problem. Annals of Operations Research, 258 . pp. 639-654. ISSN 0254-5330. (doi:10.1007/s10479-015-1961-y) (KAR id:60897)

PDF Author's Accepted Manuscript
Language: English
Download (214kB) Preview
[thumbnail of reduction(dec2014).pdf]
Preview
This file may not be suitable for users of assistive technology.
Request an accessible format
Official URL:
http://dx.doi.org/10.1007/s10479-015-1961-y

Abstract

Two efficient neighbourhood 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 meta-heuristic algorithms 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 3,038 demand points

and up to 500 facilities are also found.

Item Type: Article
DOI/Identification number: 10.1007/s10479-015-1961-y
Uncontrolled keywords: planar p-median, local search, neighbourhood reduction, meta-heuristics
Subjects: H Social Sciences
H Social Sciences > HA Statistics > HA33 Management Science
Divisions: Divisions > Kent Business School - Division > Department of Analytics, Operations and Systems
Depositing User: Said Salhi
Date Deposited: 13 Mar 2017 18:14 UTC
Last Modified: 06 Oct 2021 11:04 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/60897 (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