Metaheuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem

Roman Plotnikov, Adil Erzin

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

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.

Original languageEnglish
Title of host publicationLearning and Intelligent Optimization - 13th International Conference, LION 13, Revised Selected Papers
EditorsNikolaos F. Matsatsinis, Yannis Marinakis, Panos Pardalos
PublisherSpringer Gabler
Pages355-369
Number of pages15
ISBN (Print)9783030386283
DOIs
Publication statusPublished - 1 Jan 2020
Event13th International Conference on Learning and Intelligent Optimization, LION 13 - Chania, Greece
Duration: 27 May 201931 May 2019

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11968 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference13th International Conference on Learning and Intelligent Optimization, LION 13
CountryGreece
CityChania
Period27.05.201931.05.2019

Keywords

  • Ant colony optimization
  • Approximation algorithms
  • Bounded hops
  • Energy efficiency
  • Genetic local search
  • Symmetric connectivity
  • Variable neighborhood search

Fingerprint

Dive into the research topics of 'Metaheuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem'. Together they form a unique fingerprint.

Cite this