On the use of some known methods for T-colorings of graphs
Annals of Operations Research - Special issue on Tabu search
Artificial intelligence: a modern approach
Artificial intelligence: a modern approach
Bounds for the frequency assignment problem
Discrete Mathematics
Frequency Allocation for WLANs Using Graph Colouring Techniques
WONS '05 Proceedings of the Second Annual Conference on Wireless On-demand Network Systems and Services
Job-Shop scheduling based on multiagent evolutionary algorithm
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III
A multiagent genetic algorithm for global numerical optimization
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A multiagent evolutionary algorithm for constraint satisfaction problems
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
| Hi-index | 0.00 |
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.