Solving the 2-connected m-dominating set problem using a GRASP approach for applications in power systems

Raka Jovanovic, Islam Safak Bayram, Stefan Vos

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The dominating set problem and its variations are growing in importance in the context of power distributions systems in both the communication and monitoring systems of smart grids. One important aspect of such systems is fault tolerance which is well modeled by including the 2-connectivity constraint to the standard dominating set problem. In this paper, we present a constructive heuristic algorithm for the 2-connected m-dominating set problem. It is based on a greedy heuristic in which a 2-connected subgraph is iteratively extended with suitable open ears. The growth procedure is an adaptation of the breadth-first-search which efficiently manages to find open ears. Further, a heuristic function is defined for selecting the best ear out of a list of candidates. The performance of the basic approach is improved by adding a correction procedure which removes unnecessary nodes from a generated solution. Finally, randomization is included and the method is extended towards the GRASP metaheuristic. In our computational experiments, we compare the performance of the proposed algorithm to recently published results and show that the method is highly competitive and especially suitable for dense graphs.

Original languageEnglish
Title of host publicationProceedings - 2018 IEEE 12th International Conference on Compatibility, Power Electronics and Power Engineering, CPE-POWERENG 2018
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1-6
Number of pages6
ISBN (Electronic)9781538625088
DOIs
Publication statusPublished - 4 Jun 2018
Event12th IEEE International Conference on Compatibility, Power Electronics and Power Engineering, CPE-POWERENG 2018 - Doha, Qatar
Duration: 10 Apr 201812 Apr 2018

Other

Other12th IEEE International Conference on Compatibility, Power Electronics and Power Engineering, CPE-POWERENG 2018
CountryQatar
CityDoha
Period10/4/1812/4/18

Fingerprint

Heuristic algorithms
Fault tolerance
Monitoring
Communication
Experiments

ASJC Scopus subject areas

  • Hardware and Architecture
  • Energy Engineering and Power Technology
  • Electrical and Electronic Engineering

Cite this

Jovanovic, R., Bayram, I. S., & Vos, S. (2018). Solving the 2-connected m-dominating set problem using a GRASP approach for applications in power systems. In Proceedings - 2018 IEEE 12th International Conference on Compatibility, Power Electronics and Power Engineering, CPE-POWERENG 2018 (pp. 1-6). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/CPE.2018.8372499

Solving the 2-connected m-dominating set problem using a GRASP approach for applications in power systems. / Jovanovic, Raka; Bayram, Islam Safak; Vos, Stefan.

Proceedings - 2018 IEEE 12th International Conference on Compatibility, Power Electronics and Power Engineering, CPE-POWERENG 2018. Institute of Electrical and Electronics Engineers Inc., 2018. p. 1-6.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Jovanovic, R, Bayram, IS & Vos, S 2018, Solving the 2-connected m-dominating set problem using a GRASP approach for applications in power systems. in Proceedings - 2018 IEEE 12th International Conference on Compatibility, Power Electronics and Power Engineering, CPE-POWERENG 2018. Institute of Electrical and Electronics Engineers Inc., pp. 1-6, 12th IEEE International Conference on Compatibility, Power Electronics and Power Engineering, CPE-POWERENG 2018, Doha, Qatar, 10/4/18. https://doi.org/10.1109/CPE.2018.8372499
Jovanovic R, Bayram IS, Vos S. Solving the 2-connected m-dominating set problem using a GRASP approach for applications in power systems. In Proceedings - 2018 IEEE 12th International Conference on Compatibility, Power Electronics and Power Engineering, CPE-POWERENG 2018. Institute of Electrical and Electronics Engineers Inc. 2018. p. 1-6 https://doi.org/10.1109/CPE.2018.8372499
Jovanovic, Raka ; Bayram, Islam Safak ; Vos, Stefan. / Solving the 2-connected m-dominating set problem using a GRASP approach for applications in power systems. Proceedings - 2018 IEEE 12th International Conference on Compatibility, Power Electronics and Power Engineering, CPE-POWERENG 2018. Institute of Electrical and Electronics Engineers Inc., 2018. pp. 1-6
@inproceedings{d74d95e7726544d081536fdb74e04229,
title = "Solving the 2-connected m-dominating set problem using a GRASP approach for applications in power systems",
abstract = "The dominating set problem and its variations are growing in importance in the context of power distributions systems in both the communication and monitoring systems of smart grids. One important aspect of such systems is fault tolerance which is well modeled by including the 2-connectivity constraint to the standard dominating set problem. In this paper, we present a constructive heuristic algorithm for the 2-connected m-dominating set problem. It is based on a greedy heuristic in which a 2-connected subgraph is iteratively extended with suitable open ears. The growth procedure is an adaptation of the breadth-first-search which efficiently manages to find open ears. Further, a heuristic function is defined for selecting the best ear out of a list of candidates. The performance of the basic approach is improved by adding a correction procedure which removes unnecessary nodes from a generated solution. Finally, randomization is included and the method is extended towards the GRASP metaheuristic. In our computational experiments, we compare the performance of the proposed algorithm to recently published results and show that the method is highly competitive and especially suitable for dense graphs.",
author = "Raka Jovanovic and Bayram, {Islam Safak} and Stefan Vos",
year = "2018",
month = "6",
day = "4",
doi = "10.1109/CPE.2018.8372499",
language = "English",
pages = "1--6",
booktitle = "Proceedings - 2018 IEEE 12th International Conference on Compatibility, Power Electronics and Power Engineering, CPE-POWERENG 2018",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Solving the 2-connected m-dominating set problem using a GRASP approach for applications in power systems

AU - Jovanovic, Raka

AU - Bayram, Islam Safak

AU - Vos, Stefan

PY - 2018/6/4

Y1 - 2018/6/4

N2 - The dominating set problem and its variations are growing in importance in the context of power distributions systems in both the communication and monitoring systems of smart grids. One important aspect of such systems is fault tolerance which is well modeled by including the 2-connectivity constraint to the standard dominating set problem. In this paper, we present a constructive heuristic algorithm for the 2-connected m-dominating set problem. It is based on a greedy heuristic in which a 2-connected subgraph is iteratively extended with suitable open ears. The growth procedure is an adaptation of the breadth-first-search which efficiently manages to find open ears. Further, a heuristic function is defined for selecting the best ear out of a list of candidates. The performance of the basic approach is improved by adding a correction procedure which removes unnecessary nodes from a generated solution. Finally, randomization is included and the method is extended towards the GRASP metaheuristic. In our computational experiments, we compare the performance of the proposed algorithm to recently published results and show that the method is highly competitive and especially suitable for dense graphs.

AB - The dominating set problem and its variations are growing in importance in the context of power distributions systems in both the communication and monitoring systems of smart grids. One important aspect of such systems is fault tolerance which is well modeled by including the 2-connectivity constraint to the standard dominating set problem. In this paper, we present a constructive heuristic algorithm for the 2-connected m-dominating set problem. It is based on a greedy heuristic in which a 2-connected subgraph is iteratively extended with suitable open ears. The growth procedure is an adaptation of the breadth-first-search which efficiently manages to find open ears. Further, a heuristic function is defined for selecting the best ear out of a list of candidates. The performance of the basic approach is improved by adding a correction procedure which removes unnecessary nodes from a generated solution. Finally, randomization is included and the method is extended towards the GRASP metaheuristic. In our computational experiments, we compare the performance of the proposed algorithm to recently published results and show that the method is highly competitive and especially suitable for dense graphs.

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

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

U2 - 10.1109/CPE.2018.8372499

DO - 10.1109/CPE.2018.8372499

M3 - Conference contribution

SP - 1

EP - 6

BT - Proceedings - 2018 IEEE 12th International Conference on Compatibility, Power Electronics and Power Engineering, CPE-POWERENG 2018

PB - Institute of Electrical and Electronics Engineers Inc.

ER -