当前位置: X-MOL 学术Alex. Eng. J. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Optimal algorithms for weighted 1-center problem in deterministic and stochastic tree networks
Alexandria Engineering Journal ( IF 6.8 ) Pub Date : 2020-06-27 , DOI: 10.1016/j.aej.2020.05.026
A.W. Aboutahoun , F. El-Safty

This paper deals with two single facility location problems. The first problem is about the deterministic weighted (DW) 1-center of a deterministic tree network (DTN). The optimality criterion for the DW 1-center is minimizing the weighted distance to the furthest node from the facility. This problem has many applications in the emergency field since it gives satisfactory results for the customers sited at the furthest node of the DTN. The second problem is about the stochastic weighted (SW) 1-center of the stochastic tree network (STN). The criterion for optimality used in the SW 1-center is maximizing the minimum weighted reliability from the nodes of the STN to the facility. The applications of the SW 1-center problem appear in computer and communication fields. Two linear-time algorithms are presented for both problems.



中文翻译:

确定性和随机树网络中加权一中心问题的最优算法

本文讨论了两个单一的设施选址问题。第一个问题是确定性树网络(DTN)的确定性加权(DW)1-中心。DW 1中心的最佳标准是使距设施最远节点的加权距离最小。由于此问题为DTN最远节点的客户提供了令人满意的结果,因此在应急领域中有许多应用。第二个问题是关于随机树网络(STN)的随机加权(SW)1中心。在SW 1中心使用的最佳性标准是使从STN节点到设施的最小加权可靠性最大化。SW 1中心问题的应用程序出现在计算机和通信领域。针对这两个问题,提出了两种线性时间算法。

更新日期:2020-06-27
down
wechat
bug