A hybrid self-adaptive evolutionary algorithm for the minimum weight dominating set problem
by Geng Lin
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 11, No. 1, 2016

Abstract: Given an undirected graph with weights associated with its vertices, the minimum weight dominating set problem (MWDSP) is to determinate a subset of vertices with minimum sum of weights such that each vertex of the graph either belongs to the subset or is adjacent to a vertex in the subset. This paper presents a hybrid self-adaptive evolutionary algorithm for the MWDSP. A greedy randomised adaptive construction procedure is used to generate an initial population. Then, a crossover operator and an adaptive mutation operator are employed to generate a new solution, which is further refined by an adaptive tabu search. These adaptive strategies make a good balance between intensification and diversification. Computational experiments on two types of benchmark instances prove that our proposed algorithm can find high quality solutions in a short computing time.

Online publication date: Tue, 27-Sep-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Wireless and Mobile Computing (IJWMC):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com