首页 | 本学科首页   官方微博 | 高级检索  
     

竞争环境下截流设施选址问题
引用本文:申瑞玲,霍佳震. 竞争环境下截流设施选址问题[J]. 运筹与管理, 2013, 22(3): 97-101
作者姓名:申瑞玲  霍佳震
作者单位:同济大学 经济与管理学院,上海 200092
基金项目:国家自然基金重点项目 (70832005);国家自然科学基金重大项目资助(71090404/71090400);国家自然科学基金资助项目(71002020)
摘    要:研究企业新建设施时,市场上已有设施存在的情况下,使本企业总体利润最大的截流设施选址问题。在一般截留设施选址模型的基础上引入引力模型,消费者到某个设施接受服务的概率与偏离距离及设施的吸引力相关,同时设施的建设费用与设施吸引力正相关,建立非线性整数规划模型并使用贪婪算法进行求解。数值分析表明,该算法求解速度快,模型计算精度较高。

关 键 词:运筹学  截流设施选址  竞争  非线性规划  贪婪算法  

Flow-Interception Facility Location Problem under Competitive Conditions
SHEN Rui-ling,HUO Jia-zhen. Flow-Interception Facility Location Problem under Competitive Conditions[J]. Operations Research and Management Science, 2013, 22(3): 97-101
Authors:SHEN Rui-ling  HUO Jia-zhen
Affiliation:School of Economics and Management, Tongji University, Shanghai 200092, China
Abstract:We consider a facility location model for locating a set of new facilities that compete for customer demand with each other, as well as with some pre-existing facilities both belong to the entity and the competitor, to capture the maximum profit of the entity. According to Huff gravity model, the probability that a customer selects a certain facility is proportional to its attractiveness and inversely proportional to the distance to the facility, we suppose the facility construction cost is relevant to its attractiveness, the problem is formulated as a non-linear integer program and solved by greedy algorithm. The numerical analysis indicates that the model and the method are practical.
Keywords:operations research  flow-interception facility location  competition  non-linear programming  greedy heuristic  
点击此处可从《运筹与管理》浏览原始摘要信息
点击此处可从《运筹与管理》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号