Proceedings ArticleDOI
Solving the 2-connected m-dominating set problem using a GRASP approach for applications in power systems
Raka Jovanovic,Islam Safak Bayram,Stefan Voß +2 more
- pp 1-6
TLDR
This paper presents a constructive heuristic algorithm based on a greedy heuristic in which a 2-connected subgraph is iteratively extended with suitable open ears and extended towards the GRASP metaheuristic.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.read more
Citations
More filters
Journal ArticleDOI
Dynamic vehicle routing problem considering simultaneous dual services in the last mile delivery
TL;DR: The computational experiments show that the CP facilities offer greater flexibility for adjusting routes to dynamic customers and that the S DS delivery system outperforms the RDS delivery system in terms of cost and number of vehicles used.
Book
Algorithms -- ESA 2009 : 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009 : proceedings
Amos Fiat,Peter Sanders +1 more
TL;DR: Algorithms Meet Art, Puzzles, and Magic.
References
More filters
Journal ArticleDOI
Greedy Randomized Adaptive Search Procedures
TL;DR: This paper defines the various components comprising a GRASP and demonstrates, step by step, how to develop such heuristics for combinatorial optimization problems.
Journal ArticleDOI
Algorithm 447: efficient algorithms for graph manipulation
TL;DR: Efficient algorithms are presented for partitioning a graph into connected components, biconnected components and simple paths and each iteration produces a new path between two vertices already on paths.
Journal ArticleDOI
Domination in Graphs Applied to Electric Power Networks
TL;DR: It is shown that the power dominating set (PDS) problem is NP-complete even when restricted to bipartite graphs or chordal graphs and a linear algorithm is given to solve the PDS for trees.
Journal ArticleDOI
A Theorem on Graphs, with an Application to a Problem of Traffic Control
Proceedings ArticleDOI
Networked control systems under cyber attacks with applications to power networks
TL;DR: A distributed scheme to detect and isolate the attacks using observers using observers is proposed and how to reduce the number of observer nodes while maintaining the coverage of the entire network is discussed.