|
|
|
User Rating:
Rated by: |
Good (3.3/5)
16 user(s) |
|
|
|
Genetic Algorithm Java Application description |
|
|
Genetic Algorithm Java Application was designed to solve the Geodetic Cover Problem. Genetic algorithms are a form of artificial intelligence in which the theory of evolution is used to find an approximate answer to a given problem.
In this research project is a genetic algorithm to search for geodetic covers of random graphs. A geodetic cover is defined as the subset S of vertices of a graph such that any vertex not in S is on a shortest path between two vertices in S.
Specifically, the program was designed to solve the Geodetic Cover Problem; namely, to find the smallest geodetic cover. The results show that the genetic algorithm is considerably faster than other algorithms used to solve the problem but produces suboptimal results for large graphs.
|
|
