Continuous covering and cooperative covering problems with a general decay function on networks
Continuous covering and cooperative covering problems with a general decay function on networks
复制标题
网络上具有一般衰减函数的连续覆盖和合作覆盖问题
DOI：
--
复制
发表时间：
2013
影响因子：
3.6
通讯作者：
D. Krass
中科院分区：
文献类型：
--
作者：
O. Berman;Z. Drezner;D. Krass
分析了网络中任意位置的协作覆盖定位问题。每个设施发射一个信号，该信号沿网络的弧沿着衰减一定距离，每个节点观测所有设施发射的总信号。如果节点的累积信号超过给定阈值，则该节点被覆盖。合作的方法不同于传统的覆盖模型，其中来自最近的设施的信号确定一个点是否被覆盖。目标是通过网络上任何地方的最佳设施位置来最大限度地扩大覆盖范围。对问题进行了阐述和分析。提出了一个或两个设施的优化算法。启发式算法的位置提出了两个以上的设施。广泛的计算实验报告。
A cooperative covering location problem anywhere on the networks is analysed. Each facility emits a signal that decays by the distance along the arcs of the network and each node observes the total signal emitted by all facilities. A node is covered if its cumulative signal exceeds a given threshold. The cooperative approach differs from traditional covering models where the signal from the closest facility determines whether or not a point is covered. The objective is to maximize coverage by the best location of facilities anywhere on the network. The problems are formulated and analysed. Optimal algorithms for one or two facilities are proposed. Heuristic algorithms are proposed for location of more than two facilities. Extensive computational experiments are reported.