## Memetic Algorithms and the Fitness Landscape of the Graph Bi-Partitioning Problem (1998)

Venue: | in Proceedings of the 5th International Conference on Parallel Problem Solving from Nature - PPSN |

Citations: | 31 - 6 self |

### BibTeX

@INPROCEEDINGS{Merz98memeticalgorithms,

author = {Peter Merz and Bernd Freisleben},

title = {Memetic Algorithms and the Fitness Landscape of the Graph Bi-Partitioning Problem},

booktitle = {in Proceedings of the 5th International Conference on Parallel Problem Solving from Nature - PPSN},

year = {1998},

pages = {765--774},

publisher = {Springer}

}

### Years of Citing Articles

### OpenURL

### Abstract

. In this paper, two types of fitness landscapes of the graph bipartitioning problem are analyzed, and a memetic algorithm -- a genetic algorithm incorporating local search -- that finds near-optimum solutions efficiently is presented. A search space analysis reveals that the fitness landscapes of geometric and non-geometric random graphs differ significantly, and within each type of graph there are also differences with respect to the epistasis of the problem instances. As suggested by the analysis, the performance of the proposed memetic algorithm based on Kernighan-Lin local search is better on problem instances with high epistasis than with low epistasis. Further analytical results indicate that a combination of a recently proposed greedy heuristic and Kernighan-Lin local search is likely to perform well on geometric graphs. The experimental results obtained for non-geometric graphs show that the proposed memetic algorithm (MA) is superior to any other heuristic known to us. For th...

### Citations

10888 |
Computers and Intractability: A guide to the theory of NP-completeness
- Garey, Johnson
- 1979
(Show Context)
Citation Context ...graphs considered, only the initialization phase of the MA is required to find (near) optimum solutions. 1 Introduction The graph partitioning problem is an NP-hard combinatorial optimization problem =-=[11]-=- that arises in many applications such as parallel and distributed computing, VLSI circuit design and simulation, transportation management, and data mining. In this paper, we consider a special case,... |

1050 |
The Selfish Gene
- Dawkins
- 1976
(Show Context)
Citation Context ...geometric graphs. 3 A Memetic GBP Algorithm Memetic algorithms (MA) [20, 21] are population-based heuristic search approaches for optimization problems. They are inspired by Dawkins' notion of a meme =-=[5]-=-, defined as a unit of information that reproduces itself while people exchange ideas. The difference between genes and memes is that memes are typically adapted by the persons who transmit them. In t... |

1043 |
An efficient heuristic procedure for partitioning graphs
- Kernighan, Lin
- 1970
(Show Context)
Citation Context ...n developed that are able to produce (near) optimum solutions in reasonable time. Among these are (a) heuristics especially developed for graph bi--partititioning, such as the Kernighan-Lin algorithm =-=[16]-=- and greedy algorithms [1], and (b) general-purpose heuristic optimization approaches, such as simulated annealing [12], tabu search [2] and genetic algorithms [4, 22]. In this paper, we first analyze... |

1005 |
The Origins of Order: self-organization and selection in evolution
- KAUFFMAN
- 1993
(Show Context)
Citation Context ...inatorial optimization problems is a promising path to performance prediction as well as for developing new theories for designing effective search strategies. A technique used by several researchers =-=[3, 13, 14]-=- is fitness distance analysis (FDA), which is performed by producing N individuals (solutions) and plotting their fitness (solution quality) against their distance to an optimum solution (where an app... |

259 |
The CHC Adaptive Search Algorithm, How to Have Safe Search When Engaging
- Eshelman
(Show Context)
Citation Context ...ting new solutions with distance D to the old ones, where D is set to the average distance in the population after initialization. The restart technique is borrowed from the CHC algorithm by Eshelman =-=[7]-=-. 4 Experimental Results We conducted several experiments by applying our algorithms to 16 different instances, 8 graphs of the first type and 8 graphs of the second type described in section 2.3. The... |

204 | Fitness distance correlation as a measure of problem difficulty for genetic algorithms
- Jones, Forrest
- 1995
(Show Context)
Citation Context ...inatorial optimization problems is a promising path to performance prediction as well as for developing new theories for designing effective search strategies. A technique used by several researchers =-=[3, 13, 14]-=- is fitness distance analysis (FDA), which is performed by producing N individuals (solutions) and plotting their fitness (solution quality) against their distance to an optimum solution (where an app... |

187 | On evolution, search, optimization, genetic algorithms and martial arts, towards memetic algorithms
- Moscato
- 1989
(Show Context)
Citation Context ...igated by performing a fitness distance analysis (FDA) based on the Kernighan-Lin local search heuristic [16] and a recently proposed differential greedy heuristic [1]. The proposed memetic algorithm =-=[20, 21]-=- is a genetic local search algorithm similar to the ones we previously used for other combinatorial optimization problems [9, 10, 17, 18, 19]. It incorporates local search as well as the mentioned gre... |

180 |
Towards a general theory of adaptive walks on rugged landscapes
- Kauffman, Levin
- 1987
(Show Context)
Citation Context ... X i=1 n X j=1 1 2 w ij jx i \Gamma x j j = n X i=1 f i (x i ; x i 1 ; : : : ; x i k(i) ) (1) with V = f1; : : : ; ng and w ij = 1, if (i; j) 2 E, 0 otherwise. Similar to the NK-landscapes defined in =-=[15]-=-, the fitness contribution f i of a site i depends on the gene value x i and of k(i) other genes x i 1 ; : : : ; x i k(i) , where k(i) denotes the degree of vertex i. While for NK-landscapes k(i) = K ... |

88 |
Genetic algorithm and graph partitioning
- Bui, Moon
- 1996
(Show Context)
Citation Context ...such as the Kernighan-Lin algorithm [16] and greedy algorithms [1], and (b) general-purpose heuristic optimization approaches, such as simulated annealing [12], tabu search [2] and genetic algorithms =-=[4, 22]-=-. In this paper, we first analyze the fitness landscape of the GBP and then present a memetic algorithm that is able to produce near-optimum solutions for several GBP instances efficiently. The fitnes... |

86 |
Preventing premature convergence in genetic algorithms by preventing incest
- Eshelman, Schaffer
- 1991
(Show Context)
Citation Context ... of the genetic operators, we use the Kernighan-Lin heuristic with a refined data structure based on the ideas of Fiduccia and Mattheyses [8]. The genetic operators: The crossover operator is the HUX =-=[6]-=-, a variant of the uniform crossover (several other crossover operators were investigated, but their results were inferior to HUX). In order to maintain feasibility, HUX must be adapted for applicatio... |

76 | A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems
- Freisleben, Merz
- 1996
(Show Context)
Citation Context ...sed differential greedy heuristic [1]. The proposed memetic algorithm [20, 21] is a genetic local search algorithm similar to the ones we previously used for other combinatorial optimization problems =-=[9, 10, 17, 18, 19]-=-. It incorporates local search as well as the mentioned greedy heuristic for initialization, and operates on a population of local minima rather than arbitrary candidate solutions. 2 The GBP Fitness L... |

73 | Genetic local search for the TSP: New results
- Merz, Freisleben
- 1997
(Show Context)
Citation Context ...sed differential greedy heuristic [1]. The proposed memetic algorithm [20, 21] is a genetic local search algorithm similar to the ones we previously used for other combinatorial optimization problems =-=[9, 10, 17, 18, 19]-=-. It incorporates local search as well as the mentioned greedy heuristic for initialization, and operates on a population of local minima rather than arbitrary candidate solutions. 2 The GBP Fitness L... |

62 | A memetic approach for the traveling salesman problem implementation of a computational ecology for combinatorial optimization on message-passing systems
- Moscato, Norman
- 1992
(Show Context)
Citation Context ...igated by performing a fitness distance analysis (FDA) based on the Kernighan-Lin local search heuristic [16] and a recently proposed differential greedy heuristic [1]. The proposed memetic algorithm =-=[20, 21]-=- is a genetic local search algorithm similar to the ones we previously used for other combinatorial optimization problems [9, 10, 17, 18, 19]. It incorporates local search as well as the mentioned gre... |

54 | New genetic local search operators for the traveling salesman problem
- Freisleben, Merz
- 1996
(Show Context)
Citation Context ...sed differential greedy heuristic [1]. The proposed memetic algorithm [20, 21] is a genetic local search algorithm similar to the ones we previously used for other combinatorial optimization problems =-=[9, 10, 17, 18, 19]-=-. It incorporates local search as well as the mentioned greedy heuristic for initialization, and operates on a population of local minima rather than arbitrary candidate solutions. 2 The GBP Fitness L... |

38 | B.: A Genetic Local Search Approach to the Quadratic Assignment Problem
- Merz, Freisleben
- 1997
(Show Context)
Citation Context |

36 | Cost versus distance in the traveling salesman problem
- Boese
- 1995
(Show Context)
Citation Context ...inatorial optimization problems is a promising path to performance prediction as well as for developing new theories for designing effective search strategies. A technique used by several researchers =-=[3, 13, 14]-=- is fitness distance analysis (FDA), which is performed by producing N individuals (solutions) and plotting their fitness (solution quality) against their distance to an optimum solution (where an app... |

14 | Differential greedy for the 0–1 equicut problem
- Battiti, Bertossi
- 1997
(Show Context)
Citation Context ...o produce (near) optimum solutions in reasonable time. Among these are (a) heuristics especially developed for graph bi--partititioning, such as the Kernighan-Lin algorithm [16] and greedy algorithms =-=[1]-=-, and (b) general-purpose heuristic optimization approaches, such as simulated annealing [12], tabu search [2] and genetic algorithms [4, 22]. In this paper, we first analyze the fitness landscape of ... |

12 |
Optimization by Simulated Annealing
- Johnson, Aragon, et al.
- 1991
(Show Context)
Citation Context ...ally developed for graph bi--partititioning, such as the Kernighan-Lin algorithm [16] and greedy algorithms [1], and (b) general-purpose heuristic optimization approaches, such as simulated annealing =-=[12]-=-, tabu search [2] and genetic algorithms [4, 22]. In this paper, we first analyze the fitness landscape of the GBP and then present a memetic algorithm that is able to produce near-optimum solutions f... |

10 |
prohibition, and reactive heuristics for graph partitioning
- Greedy
- 1999
(Show Context)
Citation Context ... graph bi--partititioning, such as the Kernighan-Lin algorithm [16] and greedy algorithms [1], and (b) general-purpose heuristic optimization approaches, such as simulated annealing [12], tabu search =-=[2]-=- and genetic algorithms [4, 22]. In this paper, we first analyze the fitness landscape of the GBP and then present a memetic algorithm that is able to produce near-optimum solutions for several GBP in... |

9 | On the effectiveness of evolutionary search in high-dimensional NK-landscapes
- Merz, Freisleben
- 1998
(Show Context)
Citation Context |

7 | Finding balanced graph bi-partitions using a hybrid genetic algorithm
- Steenbeek, Marchiori, et al.
- 1998
(Show Context)
Citation Context ...such as the Kernighan-Lin algorithm [16] and greedy algorithms [1], and (b) general-purpose heuristic optimization approaches, such as simulated annealing [12], tabu search [2] and genetic algorithms =-=[4, 22]-=-. In this paper, we first analyze the fitness landscape of the GBP and then present a memetic algorithm that is able to produce near-optimum solutions for several GBP instances efficiently. The fitnes... |

2 |
Mattheyses. A Liner-Time Heuristic for Improving Network Partitions
- Fiduccia, M
- 1982
(Show Context)
Citation Context ...r local improvement after initialization and after application of the genetic operators, we use the Kernighan-Lin heuristic with a refined data structure based on the ideas of Fiduccia and Mattheyses =-=[8]-=-. The genetic operators: The crossover operator is the HUX [6], a variant of the uniform crossover (several other crossover operators were investigated, but their results were inferior to HUX). In ord... |