Memetic Algorithms and the Fitness Landscape of the Graph Bi-Partitioning Problem

  title={Memetic Algorithms and the Fitness Landscape of the Graph Bi-Partitioning Problem},
  author={Peter Merz and Bernd Freisleben},
In this paper, two types of tness landscapes of the graph bi-partitioning problem are analyzed, and a memetic algorithm { a genetic algorithm incorporating local search { that nds near-optimum solutions eeciently is presented. A search space analysis reveals that the tness landscapes of geometric and non-geometric random graphs diier significantly , and within each type of graph there are also diierences with respect to the epistasis of the problem instances. As suggested by the analysis, the… CONTINUE READING


Publications citing this paper.
Showing 1-10 of 50 extracted citations


View 4 Excerpts
Highly Influenced


Publications referenced by this paper.
Showing 1-10 of 21 references


L. J. Eshelman, J. D. Sch
Preventing Premature Convergence in Genetic Algorithms by Preventing Incest. In Proceedings of the 4th Int. Conference on Genetic Algorithms, pages 115{122. Morgan Kaufmann, • 1991
View 6 Excerpts
Highly Influenced

Genetic Algorithm and Graph Partitioning

IEEE Trans. Computers • 1996
View 10 Excerpts
Highly Influenced

An E cient Heuristic Procedure for Partitioning Graphs

B. Kernighan, S. Lin
Bell Systems Journal, 49:291{307, • 1972
View 4 Excerpts
Highly Influenced

Differential greedy for the 0-1 equicut problem

Network Design: Connectivity and Facilities Location • 1997
View 4 Excerpts
Highly Influenced

On the E ectiveness of Evolutionary Search in High{ Dimensional NK-Landscapes

P. Merz, B. Freisleben
In Proceedings of the 1998 IEEE International Con ference on Evolutionary Computation, pages 741{745, IEEE Press, • 1998
View 2 Excerpts

Genetic Local Search for the Tsp: New Results

Bernd FreislebenDepartment
View 2 Excerpts

Similar Papers

Loading similar papers…