Speeding up the optimal method of Drezner for the p-centre problem in the plane

4Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

This paper revisits an early but interesting optimal algorithm first proposed by Drezner to solve the continuous p-centre problem. The original algorithm is reexamined and efficient neighbourhood reductions which are mathematically supported are proposed to improve its overall computational performance. The revised algorithm yields a considerably high reduction in computational time reaching, in some cases, a decrease of 96%. This new algorithm is now able to find proven optimal solutions for large data sets with over 1300 demand points and various values of p for the first time.

Cite

CITATION STYLE

APA

Callaghan, B., Salhi, S., & Nagy, G. (2017). Speeding up the optimal method of Drezner for the p-centre problem in the plane. European Journal of Operational Research, 257(3), 722–734. https://doi.org/10.1016/j.ejor.2016.08.038

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free