Optimal solutions for the continuous p-centre problem and related -neighbour and conditional problems: A relaxation-based algorithm
该研究通过四项数学改进强化了一种松弛算法，大幅缩短计算时间，首次能最优求解多达1323个节点的大规模连续p-中心问题，并灵活适用于α-邻域和条件p-中心等实际选址问题。
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.