A New Model for Competitive Location and Its Algorithms
一个竞争选址问题的新模型及其求解算法

This paper presents a new model for a class of competitive location problems,which is to maximize capture.The model characterizes the assembling effect by introducing the growth rate of demands and the discount on distances,which result from the assembling of competitive facilities.At the same time,the branch-and-bound algorithm and greedy algorithm are developed to solve the model,and a numerical example is given to illustrate and test the algorithms.Finally,the effects of the growth rate of demands and the discount on distances on location are analyzed.