Anzeige
Erschienen in:
2008 | OriginalPaper | Buchkapitel
Multiagent Evolutionary Algorithm for T-coloring Problem
verfasst von : Jing Liu, Weicai Zhong, Jinshu Li
Erschienen in: Simulated Evolution and Learning
Verlag: Springer Berlin Heidelberg
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
With the properties of T-coloring problems in mind, multiagent systems and evolutionary algorithms are integrated to form a new algorithm, Multiagent Evolutionary Algorithm for T-coloring (MAEA-T-coloring). We studied the generalization of classical graph coloring model, and focused our interest in the restricted T-coloring. An agent in MAEA-T-coloring represents a candidate solution to T-colorings. All agents live in a latticelike environment, with each agent fixed on a lattice-point. In order to increase energies, they compete or cooperate with their neighbors using their knowledge. Experiments on large random instances of T-colorings show encouraging results about MAEA- T-coloring.