%0 Journal Article
%T A New Model for Competitive Location and Its Algorithms<br>一个竞争选址问题的新模型及其求解算法
%A YANG Feng-mei~
%A HUA Guo-wei~
%A LAI Kin Keung~
%A <br>杨丰梅
%A 华国伟
%A 黎建强
%J 系统工程理论与实践
%D 2006
%I 
%X 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.
%K competitive location
%K maximum capture
%K assembling effect
%K branch and bound method
%K greedy algorithm<br>竞争选址
%K 最大市场份额
%K 聚集效应
%K 分支定界算法
%K 贪婪算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=01BA20E8BA813E1908F3698710BBFEFEE816345F465FEBA5&cid=962324E222C1AC1D&jid=1D057D9E7CAD6BEE9FA97306E08E48D3&aid=1F109349769556DB&yid=37904DC365DD7266&vid=96C778EE049EE47D&iid=DF92D298D3FF1E6E&sid=13553B2D12F347E8&eid=B91E8C6D6FE990DB&journal_id=1000-6788&journal_name=系统工程理论与实践&referenced_num=0&reference_num=20