Search: id:"swepub:oai:lup.lub.lu.se:34133c03-172e-4bb4-80f5-7c97bd5ba23b" >
Memetic Algorithm f...
Memetic Algorithm for the Minimum Edge Dominating Set Problem
-
- Abdulaziz, Shada (author)
- Lund University,Lunds universitet,Centrum för Mellanösternstudier (CMES),Samhällsvetenskapliga institutioner och centrumbildningar,Samhällsvetenskapliga fakulteten,Centre for Advanced Middle Eastern Studies (CMES),Departments of Administrative, Economic and Social Sciences,Faculty of Social Sciences
-
- Hedar, Abdel-Rahman (author)
- Assiut University
-
- Sewisy, Adel (author)
- Assiut University
-
(creator_code:org_t)
- 2013-12-01
- 2013
- English 8 s.
-
In: International Journal of Artificial Intelligence. - : Institute of Advanced Engineering and Science. - 2252-8938. ; 2:4, s. 179-186
- Related links:
-
http://dx.doi.org/10...
-
show more...
-
https://lup.lub.lu.s...
-
https://doi.org/10.1...
-
show less...
Abstract
Subject headings
Close
- The minimum edge dominating set (MEDS) is one of the fundamental covering problems in graph theory, which finds many practical applications in diverse domains. In this paper, we propose a meta-heuristic approach based on genetic algorithm and local search to solve the MEDS problem. Therefore, the proposed method is considered as a memetic search algorithm which is called Memetic Algorithm for minimum edge dominating set (MAMEDS). In the MAMEDS method, a new fitness function is invoked to effectively measure the solution qualities. The search process in the proposed method uses intensification schemes beside the main genetic search operations in order to achieve faster performance. The experimental results proves that the proposed method is promising in solving the MEDS problem.
Subject headings
- SAMHÄLLSVETENSKAP -- Annan samhällsvetenskap (hsv//swe)
- SOCIAL SCIENCES -- Other Social Sciences (hsv//eng)
Keyword
- Minimum edge dominating set
- Graph theory
- Genetic algorithm
- Memetic Algorithm
- Local search
Publication and Content Type
- art (subject category)
- ref (subject category)
Find in a library
To the university's database