Optimal solutions for the continuous p-centre problem and related -neighbour and conditional problems: A relaxation-based algorithm

This paper aims to solve large continuous p-centre problems optimally by re-examining a recent relaxation-based algorithm. The algorithm is strengthened by adding four mathematically supported enhancements to improve its efficiency. This revised relaxation algorithm yields a massive reduction in com...

Full description

Saved in:
Bibliographic Details
Published inThe Journal of the Operational Research Society Vol. 70; no. 2; pp. 192 - 211
Main Authors Callaghan, Becky, Salhi, Said, Brimberg, Jack
Format Journal Article
LanguageEnglish
Published Taylor & Francis 01.02.2019
Subjects
conditional
continuous space
Location
managerial insights
neighbourhood
optimal solutions
p-centre problem
relaxation method
Online AccessGet full text
ISSN0160-5682
1476-9360
DOI10.1080/01605682.2017.1421854

Cover

More Information
Summary:This paper aims to solve large continuous p-centre problems optimally by re-examining a recent relaxation-based algorithm. The algorithm is strengthened by adding four mathematically supported enhancements to improve its efficiency. This revised relaxation algorithm yields a massive reduction in computational time enabling for the first time larger data-sets to be solved optimally (e.g., up to 1323 nodes). The enhanced algorithm is also shown to be flexible as it can be easily adapted to optimally solve related practical location problems that are frequently faced by senior management when making strategic decisions. These include the -neighbour p-centre problem and the conditional p-centre problem. A scenario analysis using variable is also performed to provide further managerial insights.
ISSN:0160-5682
1476-9360
DOI:10.1080/01605682.2017.1421854