【摘要】 由于选址决策的长期性,相关参数会随着时间而变化,所以选址问题存在很多不确定因素。针对在最终设施数目不确定,但已知相应概率的情形下,研究了如何选择初始设施的位置,使得期望值最大的截流选址问题,并建立了整数规划模型。在此基础上给出了未来至多新建一个设施时的启发式算法,并通过算例,与分支定界法进行比较。结果表明,该算法能得到较好的结果。更多还原

【Abstract】 Since facility location decisions are frequently long-term in nature,there may be considerable uncertainty regarding the way in which relevant parameters in the location decision will change over time.How to find the initial set of facility locations to intercept the maximum expected flows is studied,under the situation where the total number of facilities to be located is uncertain but the relevant probabilities are known.An integral programming is modeled,and heuristic algorithms are proposed when the additional facility is at most one in future.Cmparing with the branch and bound algorithm through a computational example,the heuristic algorithm is proved to obtain good results.更多还原