半讨厌型设施选址问题的模型与算法

研究了结合网络和平面模型的半讨厌型设施的选址问题.半讨厌型设施结合了讨厌型设施与喜爱型设施的性质,一方面由于这些设施对人们带来很多副作用,人们想要远离他们以避免遭到污染,但同时人们又希望距离设施不要过远,因此建立0-1整数模型,在保证所有人使用该设施的距离不超过既定距离的基础上,使污染范围最小.由于该问题是NP困难问题,本为给出了启发式算法,通过算例进行了比较分析,证明了算法的有效性.

Model and Algorithms of Semi-Obnoxious Facilities Location Problem

This paper studies semi-obnoxious facilities location problem,with the combination of network model and planar model.Semi-obnoxious facility combines the properties of obnoxious facility and desired facility.On one side due to the negative effect of the facilities, people want to be far away to avoid the pollution from them;on the other side,customers also do not want to be too far.This paper models the situation with the objective that minimizes the covering,with the largest distance no more than p.Because the problem is NP-hard, heuristic algorithms are proposed,which are compared and analyzed by computation examples.These algorithms are proved to be efficient.