VNDS for the min-power symmetric connectivity problem

Roman Plotnikov, Adil Erzin, Nenad Mladenovic

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)

Abstract

We consider the NP-hard problem of synthesis of optimal spanning communication subgraph in a given arbitrary simple edge-weighted graph. This problem occurs in the wireless networks while minimizing total transmission power consumptions. We propose a new method based on the variable neighborhood decomposition search metaheuristic for the approximate solution to the problem. We have performed a numerical experiment where the proposed algorithm was executed on the randomly generated test instances. For these instances, on average, our algorithm significantly outperforms the previously known heuristics, comparing solutions obtained after the same run time. The advantage of the proposed algorithm becomes more noticeable with increasing dimensions of the problem.

Original languageEnglish
Pages (from-to)1897-1911
Number of pages15
JournalOptimization Letters
Volume13
Issue number8
DOIs
Publication statusPublished - 1 Nov 2019

Keywords

  • Communication network
  • Energy efficiency
  • Symmetric connectivity
  • Variable neighborhood decomposition search
  • VARIABLE NEIGHBORHOOD SEARCH

Fingerprint

Dive into the research topics of 'VNDS for the min-power symmetric connectivity problem'. Together they form a unique fingerprint.

Cite this