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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have