Output details
11 - Computer Science and Informatics
University of Stirling
Return to search
Output 0 of 0 in the submission
Article title
A Multilevel Memetic Approach for Improving Graph k-Partitions
Type
D - Journal article
Title of journal
IEEE Transactions on Evolutionary Computation
Article number
-
Volume number
15
Issue number
5
First page of article
624
ISSN of journal
1941-0026
Year of publication
2011
URL
-
Number of additional authors
1
Additional information
<22> This paper presents a highly effective multilevel memetic algorithm for graph partitioning which is specially tailored for the given search landscape. Indeed, the efficiency of the dedicated backbone-based multi-parent crossover and the perturbation-based tabu search procedure, both based on a stronger intensification, is justified by high landscape correlation and the backbone phenomenon within high quality solutions. The innovative approach described here was able to improve on a large number of commonly used graph partitioning instances. These results are included in Walshaw's Graph Partitioning Archive (http://staffweb.cms.gre.ac.uk/~wc06/partition/).
Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
6
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
