In this paper we propose a new competitive location model that considers the possible negative impact generated by competing facilities (such as cannabis dispensaries) on surrounding communities. The facilities cannot be located too close to the communities. Therefore, when distances are Euclidean, the facilities must be located at a point outside a set of circles centered at the communities. After formulating the model, a specially designed efficient algorithm that solves the single facility location problem within a given relative accuracy of optimality is constructed. A total of 128 instances are solved in a relatively short time. The largest instance of 10 existing competing facilities and 20,000 demand points was solved in less than 15 min of computer time. This new model opens avenues for future research by designing similar new models. Also, the algorithm designed in this paper can be applied to solving other location problems with outside of a set of circles constraints.

在本文中，我们提出了一种新的竞争选址模型，该模型考虑了竞争设施（例如大麻药房）对周边社区可能产生的负面影响。设施不能距离社区太近。因此，当距离为欧几里德距离时，设施必须位于以社区为中心的一组圆之外的点。建立模型后，构建了专门设计的高效算法，可以在给定的相对最优精度内解决单个设施选址问题。在相对较短的时间内总共解决了 128 个实例。10 个现有竞争设施和 20,000 个请求点的最大实例在不到 15 分钟的计算机时间内得到解决。这个新模型通过设计类似的新模型为未来的研究开辟了道路。还，