Standard

VNDS for the min-power symmetric connectivity problem. / Plotnikov, Roman; Erzin, Adil; Mladenovic, Nenad.

In: Optimization Letters, Vol. 13, No. 8, 01.11.2019, p. 1897-1911.

Research output: Contribution to journal › Article › peer-review

Harvard

Plotnikov, R, Erzin, A & Mladenovic, N 2019, 'VNDS for the min-power symmetric connectivity problem', Optimization Letters, vol. 13, no. 8, pp. 1897-1911. https://doi.org/10.1007/s11590-018-1324-0

APA

Plotnikov, R., Erzin, A., & Mladenovic, N. (2019). VNDS for the min-power symmetric connectivity problem. Optimization Letters, 13(8), 1897-1911. https://doi.org/10.1007/s11590-018-1324-0

Vancouver

Plotnikov R, Erzin A, Mladenovic N. VNDS for the min-power symmetric connectivity problem. Optimization Letters. 2019 Nov 1;13(8):1897-1911. doi: 10.1007/s11590-018-1324-0

Author

Plotnikov, Roman ; Erzin, Adil ; Mladenovic, Nenad. / VNDS for the min-power symmetric connectivity problem. In: Optimization Letters. 2019 ; Vol. 13, No. 8. pp. 1897-1911.

BibTeX

@article{e5870608141640dfacfe2ba982cc3274,
title = "VNDS for the min-power symmetric connectivity problem",
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.",
keywords = "Communication network, Energy efficiency, Symmetric connectivity, Variable neighborhood decomposition search, VARIABLE NEIGHBORHOOD SEARCH",
author = "Roman Plotnikov and Adil Erzin and Nenad Mladenovic",
year = "2019",
month = nov,
day = "1",
doi = "10.1007/s11590-018-1324-0",
language = "English",
volume = "13",
pages = "1897--1911",
journal = "Optimization Letters",
issn = "1862-4472",
publisher = "Springer-Verlag GmbH and Co. KG",
number = "8",

}

RIS

TY - JOUR

T1 - VNDS for the min-power symmetric connectivity problem

AU - Plotnikov, Roman

AU - Erzin, Adil

AU - Mladenovic, Nenad

PY - 2019/11/1

Y1 - 2019/11/1

N2 - 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.

AB - 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.

KW - Communication network

KW - Energy efficiency

KW - Symmetric connectivity

KW - Variable neighborhood decomposition search

KW - VARIABLE NEIGHBORHOOD SEARCH

UR - http://www.scopus.com/inward/record.url?scp=85053532859&partnerID=8YFLogxK

U2 - 10.1007/s11590-018-1324-0

DO - 10.1007/s11590-018-1324-0

M3 - Article

AN - SCOPUS:85053532859

VL - 13

SP - 1897

EP - 1911

JO - Optimization Letters

JF - Optimization Letters

SN - 1862-4472

IS - 8

ER -

ID: 16688767