基于混合需求的设施选址问题研究  

Models and algorithms for locating facilities on network with hybrid demand

作　　者：申瑞玲[1] 霍佳震[1] 李旭芳[1,2] 

机构地区：[1]同济大学经济与管理学院,上海200092 [2]上海工程技术大学管理学院,上海201602

出　　处：《计算机应用研究》2013年第11期3228-3231,共4页Application Research of Computers

基　　金：国家自然科学基金资助项目(71102071;71002020);国家自然科学基金重大项目(71090404;71090400)

摘　　要：研究网络中设施的需求一部分来自于网络节点,一部分来自于过往流量的基于混合需求的设施选址问题。引入引力模型,以新建设施获得总利润最大为目标建立非线性整数规划模型,并构造启发式算法,通过MATLAB进行仿真实验,将求解结果与GPAH算法及精确算法的结果进行比较。比较结果表明,提出的算法求解质量高、运行速度快,可用于大中型网络设施的选址问题。This paper developed a new model for locating facilities with demand that were originated from both residential area customers and from intercepting customers passing by the facility on a routine pre-planned trips. It proposed a mixed integer program with the objective function of maximum the total profit gained by serving both types of customers. Since the problem was NP-hard, it proposed greedy heuristic and improved greedy heuristic. The improved greedy heuristic solves the computational experiments with competitive results, while the run time is much less than that of the optimal method.

关 键 词：设施选址 截流 混合需求 改进的贪婪算法 

分 类 号：O221.2[理学—运筹学与控制论] TP301.5[理学—数学]