Minimum Span Frequency Assignment Based on a Multiagent Evolutionary Algorithm

Authors:
Jing Liu;Jinshu Li;Weicai Zhong;Li Zhang;Ruochen Liu
Affiliations:
Xidian University, China;Xidian University, China;Northwest A&F University, China;Soochow University, China;Xidian University, China
Venue:
International Journal of Swarm Intelligence Research
Year:
2011

Citing 7
Cited 0

On the use of some known methods for T-colorings of graphs

Annals of Operations Research - Special issue on Tabu search
Bounds for the frequency assignment problem

Discrete Mathematics
A Permutation Based Genetic Algorithm for Minimum Span Frequency Assignment

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
lambda-Coloring of Graphs

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Frequency Allocation for WLANs Using Graph Colouring Techniques

WONS '05 Proceedings of the Second Annual Conference on Wireless On-demand Network Systems and Services
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

In frequency assignment problems FAPs, separation of the frequencies assigned to the transmitters is necessary to avoid the interference. However, unnecessary separation causes an excess requirement of spectrum, the cost of which may be very high. Since FAPs are closely related to T-coloring problems TCP, multiagent systems and evolutionary algorithms are combined to form a new algorithm for minimum span FAPs on the basis of the model of TCP, which is named as Multiagent Evolutionary Algorithm for Minimum Span FAPs MAEA-MSFAPs. The objective of MAEA-MSFAPs is to minimize the frequency spectrum required for a given level of reception quality over the network. In MAEA-MSFAPs, all agents live in a latticelike environment. Making use of the designed behaviors, MAEA-MSFAPs realizes the ability of agents to sense and act on the environment in which they live. During the process of interacting with the environment and other agents, each agent increases the energy as much as possible so that MAEA-MSFAPs can find the optima. Experimental results on TCP with different sizes and Philadelphia benchmark for FAPs show that MAEA-MSFAPs have a good performance and outperform the compared methods.