Skip to main content

New heuristic algorithms for solving the planar p-median problem

Drezner, Zvi, Brimberg, Jack, Mladenovic, Nenad, Salhi, Said (2015) New heuristic algorithms for solving the planar p-median problem. Computers and Operations Research, 62 . pp. 296-304. ISSN 0305-0548. (doi:10.1016/j.cor.2014.05.010) (KAR id:51102)

PDF (latest version)
Language: English
Download (256kB) Preview
[img]
Preview
Official URL
http://dx.doi.org/10.1016/j.cor.2014.05.010

Abstract

In this paper we propose effective heuristics for the solution of the planar p-median problem.

and also test a hybrid algorithm that combines these two approaches. The best results were

and the average solution was only 0.000016% above the best known solution on 47 well explored

test instances of 654 and 1060 demand points and up to 150 facilities.

Item Type: Article
DOI/Identification number: 10.1016/j.cor.2014.05.010
Additional information: Full text complies with journal regulations
Uncontrolled keywords: Location Analysis; Planar p-median; Multi-source Weber Problem; Variable Neighborhood Search; Genetic Algorithm.
Subjects: H Social Sciences > H Social Sciences (General)
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 11:05 UTC
Last Modified: 08 Feb 2020 04:07 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/51102 (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