Variable neighborhood search variants for Min-power symmetric connectivity problem

A. I. Erzin, N. Mladenovic, R. V. Plotnikov

Research output: Contribution to journalArticlepeer-review

10 Citations (Scopus)

Abstract

We consider the problem of optimal communication tree construction in a given undirected weighted graph. Such a problem occurs while minimizing the power consumption of data transmission in different distributed networks in the case when network elements are able to adjust their transmission ranges. In this paper, the most general strongly NP-hard formulation, when edge weights have arbitrary non-negative values, is considered. We propose new heuristics, mostly based on variable neighborhood search, for getting an approximate solution of the problem. Extensive comparative analysis between the proposed methods was performed. Numerical experiments demonstrated the high efficiency of the proposed heuristics.

Original languageEnglish
Pages (from-to)557-563
Number of pages7
JournalComputers and Operations Research
Volume78
DOIs
Publication statusPublished - 1 Feb 2017

Keywords

  • Energy efficiency
  • NP-hard problem
  • Variable neighborhood search
  • Wireless sensor network
  • RADIO NETWORKS
  • ASSIGNMENT

Fingerprint Dive into the research topics of 'Variable neighborhood search variants for Min-power symmetric connectivity problem'. Together they form a unique fingerprint.

Cite this