Anzeige
Erschienen in:
2015 | OriginalPaper | Buchkapitel
Search Space Reduction in the Combinatorial Multi-agent Genetic Algorithms
verfasst von : Łukasz Chomątek, Danuta Zakrzewska
Erschienen in: Intelligent Systems'2014
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Genetic algorithms are widely used for solving the optimization problems. However combinatorial problems are usually hard to solve using genetic algorithms as the chromosomes are very long, what causes the increase of the computational complexity of such solutions. In the previous research, authors proposed the method of efficient search space reduction, which was applied to lower the complexity of random searches. In the current work, a modification of the multi-agent genetic algorithm and its application for solving the single source shortest path problem are proposed. Presented approach is compared to the former implementation of the genetic algorithm. Investigations showed that the genetic diversity of the population in multi-agent genetic algorithm can be successfully measured, which allows to identify the premature convergence.