Competitive Multifacility Location on Networks: the (r∣Xp)‐Medianoid Problem
研究了在已有竞争对手设施的网络中，新企业如何选址以最大化市场份额，考虑了三种顾客选择规则和两种服务类型，并给出了离散化结果和启发式算法。
Abstract. We investigate the ( r ∣ X p )‐medianoid problem for networks. This is a competitive location problem that consists of determining the locations of r facilities belonging to a firm in order to maximize its market share in a space where a competitor is already operating with p facilities. We consider six scenarios resulting from the combination of three customer choice rules (binary, partially binary, and proportional) with two types of services (essential and unessential). Known discretization results about the existence of a solution for the set of nodes are extended. Some examples and computational experience using heuristic algorithms are presented.