Metaheuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem

Standard

Metaheuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem. / Plotnikov, Roman; Erzin, Adil.

Learning and Intelligent Optimization - 13th International Conference, LION 13, Revised Selected Papers. ред. / Nikolaos F. Matsatsinis; Yannis Marinakis; Panos Pardalos. Springer Gabler, 2020. стр. 355-369 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 11968 LNCS).

Результаты исследований: Публикации в книгах, отчётах, сборниках, трудах конференций › статья в сборнике материалов конференции › научная › Рецензирование

Harvard

Plotnikov, R & Erzin, A 2020, Metaheuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem. в NF Matsatsinis, Y Marinakis & P Pardalos (ред.), Learning and Intelligent Optimization - 13th International Conference, LION 13, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Том. 11968 LNCS, Springer Gabler, стр. 355-369, 13th International Conference on Learning and Intelligent Optimization, LION 13, Chania, Греция, 27.05.2019. https://doi.org/10.1007/978-3-030-38629-0_29

APA

Plotnikov, R., & Erzin, A. (2020). Metaheuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem. в N. F. Matsatsinis, Y. Marinakis, & P. Pardalos (Ред.), Learning and Intelligent Optimization - 13th International Conference, LION 13, Revised Selected Papers (стр. 355-369). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 11968 LNCS). Springer Gabler. https://doi.org/10.1007/978-3-030-38629-0_29

Vancouver

Plotnikov R, Erzin A. Metaheuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem. в Matsatsinis NF, Marinakis Y, Pardalos P, Редакторы, Learning and Intelligent Optimization - 13th International Conference, LION 13, Revised Selected Papers. Springer Gabler. 2020. стр. 355-369. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-38629-0_29

Author

Plotnikov, Roman ; Erzin, Adil. / Metaheuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem. Learning and Intelligent Optimization - 13th International Conference, LION 13, Revised Selected Papers. Редактор / Nikolaos F. Matsatsinis ; Yannis Marinakis ; Panos Pardalos. Springer Gabler, 2020. стр. 355-369 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

BibTeX

@inproceedings{e0172369451245c7b8f59d95a42eb7b6,

title = "Metaheuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem",

abstract = "We consider a Min-Power Bounded-Hops Symmetric Connectivity problem that consists in the construction of communication spanning tree on a given graph, where the total energy consumption spent for the data transmission is minimized and the maximum number of edges in a path in the tree between any pair nodes is bounded by some predefined constant. We focus on the planar Euclidian case of this problem where the power cost necessary for the communication between two network elements is proportional to the squared distance between them. Since this is an NP-hard problem, we propose different heuristics based on the following metaheuristics: genetic local search, variable neighborhood search, and ant colony optimization. We perform a posteriori comparative analysis of the proposed algorithms and present the obtained results in this paper.",

keywords = "Ant colony optimization, Approximation algorithms, Bounded hops, Energy efficiency, Genetic local search, Symmetric connectivity, Variable neighborhood search",

author = "Roman Plotnikov and Adil Erzin",

note = "Publisher Copyright: {\textcopyright} 2020, Springer Nature Switzerland AG. Copyright: Copyright 2020 Elsevier B.V., All rights reserved.; 13th International Conference on Learning and Intelligent Optimization, LION 13 ; Conference date: 27-05-2019 Through 31-05-2019",

year = "2020",

month = jan,

day = "1",

doi = "10.1007/978-3-030-38629-0_29",

language = "English",

isbn = "9783030386283",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Gabler",

pages = "355--369",

editor = "Matsatsinis, {Nikolaos F.} and Yannis Marinakis and Panos Pardalos",

booktitle = "Learning and Intelligent Optimization - 13th International Conference, LION 13, Revised Selected Papers",

address = "Germany",

}

RIS

TY - GEN

T1 - Metaheuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem

AU - Plotnikov, Roman

AU - Erzin, Adil

PY - 2020/1/1

Y1 - 2020/1/1

N2 - We consider a Min-Power Bounded-Hops Symmetric Connectivity problem that consists in the construction of communication spanning tree on a given graph, where the total energy consumption spent for the data transmission is minimized and the maximum number of edges in a path in the tree between any pair nodes is bounded by some predefined constant. We focus on the planar Euclidian case of this problem where the power cost necessary for the communication between two network elements is proportional to the squared distance between them. Since this is an NP-hard problem, we propose different heuristics based on the following metaheuristics: genetic local search, variable neighborhood search, and ant colony optimization. We perform a posteriori comparative analysis of the proposed algorithms and present the obtained results in this paper.

AB - We consider a Min-Power Bounded-Hops Symmetric Connectivity problem that consists in the construction of communication spanning tree on a given graph, where the total energy consumption spent for the data transmission is minimized and the maximum number of edges in a path in the tree between any pair nodes is bounded by some predefined constant. We focus on the planar Euclidian case of this problem where the power cost necessary for the communication between two network elements is proportional to the squared distance between them. Since this is an NP-hard problem, we propose different heuristics based on the following metaheuristics: genetic local search, variable neighborhood search, and ant colony optimization. We perform a posteriori comparative analysis of the proposed algorithms and present the obtained results in this paper.

KW - Ant colony optimization

KW - Approximation algorithms

KW - Bounded hops

KW - Energy efficiency

KW - Genetic local search

KW - Symmetric connectivity

KW - Variable neighborhood search

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

U2 - 10.1007/978-3-030-38629-0_29

DO - 10.1007/978-3-030-38629-0_29

M3 - Conference contribution

AN - SCOPUS:85082393974

SN - 9783030386283

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 355

EP - 369

BT - Learning and Intelligent Optimization - 13th International Conference, LION 13, Revised Selected Papers

A2 - Matsatsinis, Nikolaos F.

A2 - Marinakis, Yannis

A2 - Pardalos, Panos

PB - Springer Gabler

T2 - 13th International Conference on Learning and Intelligent Optimization, LION 13

Y2 - 27 May 2019 through 31 May 2019

ER -

ID: 23905574