An efficient memetic algorithm for the graph partitioning problem

Philippe Galinier (), Zied Boujbel () and Michael Coutinho Fernandes ()

Annals of Operations Research, 2011, vol. 191, issue 1, 22 pages

Abstract: Given a graph and an integer k, the goal of the graph partitioning problem is to find a partition of the vertex set in k classes, while minimizing the number of cut edges, and respecting a balance constraint between the classes. In this paper, we present a new memetic algorithm for the solution of the problem which uses both a tabu operator and a specialized crossover operator. The algorithm is tested by using the benchmarks of the graph partitioning archive. Our experiments show our memetic algorithm to outperform state-of-the-art algorithms proposed so far for the problem and to reach new records for a majority of the tested benchmarks instances. Copyright Springer Science+Business Media, LLC 2011

Date: 2011
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-011-0983-3 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:191:y:2011:i:1:p:1-22:10.1007/s10479-011-0983-3

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-011-0983-3

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().