Hybrid real-coded mutation for genetic algorithms applied to graph layouts

Authors:
Dana Vrajitoru;Jason DeBoni
Affiliations:
Indiana University South Bend;Indiana University South Bend
Venue:
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Year:
2005

Citing 5
Cited 0

Adapting operator probabilities in genetic algorithms

Proceedings of the third international conference on Genetic algorithms
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Graph Drawing: Algorithms for the Visualization of Graphs

Graph Drawing: Algorithms for the Visualization of Graphs
Setting The Mutation Rate: Scope And Limitations Of The 1/L Heuristic

GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Consistent graph layout for weighted graphs

AICCSA '05 Proceedings of the ACS/IEEE 2005 International Conference on Computer Systems and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we introduce an application of real-coded genetic algorithms to the problem of consistent graph layout and exploring the role of mutation for this particular problem. We introduce several forms of mutation, some of which being specific to this problem, and show that the choice of this operator can have a great impact on the performance of the algorithm.