Solving terminal allocation problem using simulated annealing arithmetic

Due to the tremendous growth in telecommunications network, a large variety of combinatorial optimization problems have aroused people's enormous interest. In those problems, the terminal allocation attracts people's attention most. In this paper, we focus on studying the capability of Simulated Annealing Arithmetic for optimizing the terminal allocation problems in communications network. They take advantage of the best characteristic of the two effective scheduling strategies Round Robin and Shortest Distance based on local information at the terminal in the communications network. The effectiveness of the Simulated Annealing Arithmetic, where some cooling strategies are used, is passed judgment by comparing system performance under different terminal allocation algorithms including Round Robin and Short Distance. Experimental results show that the proposed Simulated Annealing Arithmetic provides an optimized combinatorial solution, therefore increase the whole throughput of the communications network system.