T-Coloring Algorithm Based on Multiagent Evolution
一种基于多智能体进化的广义图染色算法

Based on the study of T-coloring problem, multiagent systems and evolutionary algorithms are integrated to form a new algorithm, multiagent evolutionary algorithm for T-coloring problem (MAEA-TCP). Then, this method is used to deal with the realistic frequency assignment problem, and has achieved encouraging results. In this algorithm, each agent is fixed on a lattice point of agent lattice as a possible solution. In order to increase energies, they compete or cooperate with their neighbors. They can also use knowledge to achieve their aims. Three evolutionary operators are designed for simulating the intelligent behaviors of agent, such as competition, self-learning and so on. The evolutionary operators are controlled through evolution, so that the populations can evolve. Experiments on large random graph instances and Philadelphia instances show that MAEA-TCP is a more encouraging algorithm than other methods.