检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《运筹与管理》2013年第3期97-101,共5页Operations Research and Management Science
基 金:国家自然基金重点项目(70832005);国家自然科学基金重大项目资助(71090404/71090400);国家自然科学基金资助项目(71002020)
摘 要:研究企业新建设施时,市场上已有设施存在的情况下,使本企业总体利润最大的截流设施选址问题。在一般截留设施选址模型的基础上引入引力模型,消费者到某个设施接受服务的概率与偏离距离及设施的吸引力相关,同时设施的建设费用与设施吸引力正相关,建立非线性整数规划模型并使用贪婪算法进行求解。数值分析表明,该算法求解速度快,模型计算精度较高。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 se- lects 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.
关 键 词:运筹学 截流设施选址 竞争 非线性规划 贪婪算法
分 类 号:O221.2[理学—运筹学与控制论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.42