Variable neighborhood search approach with intensified shake for monitor placement

IF 1.6 4区计算机科学 Q4 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE

Networks Pub Date : 2022-12-01 DOI:10.1002/net.22134

A. Casado, N. Mladenović, J. Sánchez-Oro, A. Duarte

引用次数: 1

Abstract

Several problems are emerging in the context of communication networks and most of them must be solved in reduced computing time since they affect to critical tasks. In this research, the monitor placement problem is tackled. This problem tries to cover the communications of an entire network by locating a monitor in specific nodes of the network, in such a way that every link remains surveyed. In case that a solution cannot be generated in the allowed computing time, a penalty will be assumed for each link uncovered. The problem is addressed by considering the variable neighborhood search framework, proposing a novel constructive method, an intelligent local search to optimize the improvement phase, and an intensified shake to guide the search to more promising solutions. The proposed algorithm is compared with a hybrid search evolutionary algorithm over a set of instances derived from real‐life networks to prove its performance.

查看原文本刊更多论文

用于监视器放置的具有增强抖动的可变邻域搜索方法

在通信网络的背景下出现了一些问题，其中大多数问题必须在减少的计算时间内解决，因为它们会影响关键任务。在本研究中，显示器的放置问题得到了解决。这个问题试图通过在网络的特定节点中定位监视器来覆盖整个网络的通信，从而使每个链路都保持被调查的状态。如果无法在允许的计算时间内生成解决方案，则将对未覆盖的每个链接进行惩罚。通过考虑可变邻域搜索框架来解决该问题，提出了一种新的构造方法，一种智能局部搜索来优化改进阶段，以及一种强化抖动来引导搜索找到更有前景的解决方案。在一组来自真实网络的实例上，将所提出的算法与混合搜索进化算法进行了比较，以证明其性能。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Networks 工程技术-计算机：硬件

CiteScore

4.40

自引率

9.50%

发文量

审稿时长

12 months

期刊介绍： Network problems are pervasive in our modern technological society, as witnessed by our reliance on physical networks that provide power, communication, and transportation. As well, a number of processes can be modeled using logical networks, as in the scheduling of interdependent tasks, the dating of archaeological artifacts, or the compilation of subroutines comprising a large computer program. Networks provide a common framework for posing and studying problems that often have wider applicability than their originating context. The goal of this journal is to provide a central forum for the distribution of timely information about network problems, their design and mathematical analysis, as well as efficient algorithms for carrying out optimization on networks. The nonstandard modeling of diverse processes using networks and network concepts is also of interest. Consequently, the disciplines that are useful in studying networks are varied, including applied mathematics, operations research, computer science, discrete mathematics, and economics. Networks publishes material on the analytic modeling of problems using networks, the mathematical analysis of network problems, the design of computationally eﬃcient network algorithms, and innovative case studies of successful network applications. We do not typically publish works that fall in the realm of pure graph theory (without signiﬁcant algorithmic and modeling contributions) or papers that deal with engineering aspects of network design. Since the audience for this journal is then necessarily broad, articles that impact multiple application areas or that creatively use new or existing methodologies are especially appropriate. We seek to publish original, well-written research papers that make a substantive contribution to the knowledge base. In addition, tutorial and survey articles are welcomed. All manuscripts are carefully refereed.