A non-transitory computer readable medium having instructions stored therein that, when executed by one or more processors, cause the one or more processors to perform a method for assigning frequencies in a fixed spectrum frequency assignment (FS-FA) telecommunications network having a plurality of wireless transmitters and at least one wireless receiver comprising:
- receiving, by a computing system configured for receiving, a fixed spectrum of frequencies, a list of a plurality of transmitters to be assigned frequencies, and a set of constraints;
- dividing the plurality of transmitters into a first set of local transmitters and a second set of neighborhood transmitters, where the transmitters of the first set are different from the transmitters of the second set;
- conducting, by a computing system having a processor with program instructions configured for searching, a local search heuristic with a one-change move within a search space of the first set;
- conducting a compound move that shifts the local heuristic search to a new location in a neighborhood search space of the second set;
- repeating the local search heuristic and compound move in order to determine an assignment of frequencies for the transmitters which minimizes the total interference that may occur due to violation of the frequency constraints;
- assigning a frequency to each transmitter of the plurality of transmitters which minimizes the total interference within the telecommunications network;
- using a lookup table (LUT) to classify all possible one-change moves, wherein the lookup table (LUT) comprises a number of columns equal to the number of frequencies to be assigned and a number of rows equal to the number of transmitters, wherein the contents of the look-up table (LUT) are precomputed values of the possible increase/decrease in the interference when each transmitter changes its frequency and wherein the one-change moves are one of positive moves and negative moves, wherein a positive move represents a decrease in interference and a negative move represents an increase in interference;
- updating the contents of the LUT a based on the increase or decrease in interference;
- computing a local cost function of the interference after each move, wherein the cost function decreases after a positive move and is unchanged or increases after a negative move;
- computing a total cost function for the set of transmitter assignments, wherein the total cost function is minimized by the application of the heuristic;
- storing the frequency assignments in an archive;
- applying the heuristic iteratively;
- updating the archive upon each iteration of the heuristic when there is at least one frequency assignment which provides a lower total cost function value;
- determining, by the local search heuristic, whether a positive move is available for the frequency of a transmitter;
- if the positive move is available, changing the frequency assigned to the transmitter by the amount of the positive move and updating the LUT with the changed frequency;
- if a positive move is not available, calculating the difference between the cost function of the current frequency assignment and the cost function of the frequency assignment after a negative move;
- summing the differences and dividing by the absolute value of the negative move to determine the average value of the differences;
- generating a set of negative moves whose differences are less than the average value;
- randomly selecting a negative move from the set of negative moves;
- changing the frequency by the amount of the negative move;
- updating the LUT with the frequency represented by the negative move;
- computing the total cost function;
- and updating the archive.