Hybrid genetic algorithm for minimum dominating set problem

Authors:
Abdel-Rahman Hedar;Rashad Ismail
Affiliations:
Dept. of Computer Science, Faculty of Computers and Information, Assiut University, Assiut, Egypt;Dept. of Mathematics, Faculty of Science, Assiut University, Assiut, Egypt
Venue:
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part IV
Year:
2010

Citing 10
Cited 1

The NP-completeness of Steiner Tree and Dominating Set for chordal bipartite graphs

Theoretical Computer Science
Tackling Real-Coded Genetic Algorithms: Operators and Tools for Behavioural Analysis

Artificial Intelligence Review
Soft computing: integrating evolutionary, neural, and fuzzy systems

Soft computing: integrating evolutionary, neural, and fuzzy systems
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Computational Intelligence: An Introduction

Computational Intelligence: An Introduction
Adaptive Selection Methods for Genetic Algorithms

Proceedings of the 1st International Conference on Genetic Algorithms
Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up

SIAM Journal on Computing
Computational Intelligence: Principles, Techniques and Applications

Computational Intelligence: Principles, Techniques and Applications
DTN Based Dominating Set Routing for MANET in Heterogeneous Wireless Networking

Mobile Networks and Applications

Two hybrid meta-heuristic approaches for minimum dominating set problem

SEMCCO'11 Proceedings of the Second international conference on Swarm, Evolutionary, and Memetic Computing - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

The minimum dominating set (MDS) problem is one of the central problems of algorithmic graph theory and has numerous applications especially in graph mining. In this paper, we propose a new hybrid method based on genetic algorithm (GA) to solve the MDS problem, called shortly HGA-MDS. The proposed method invokes a new fitness function to effectively measure the solution qualities. The search process in HGA-MDS uses local search and intensification schemes beside the GA search methodology in order to achieve faster performance. Finally, the performance of the HGA-MDS is compared with the standard GA. The new invoked design elements in HGA-MDS show its promising performance compared with standard GA.