Solving terminal allocation problem using simulated annealing arithmetic

Authors:
Zengnian Zhang;Xudong Ke
Affiliations:
Faculty of Electronic and Information Engineering, Zhejiang Wanli University, Zhejiang Province, China;Faculty of Electronic and Information Engineering, Zhejiang Wanli University, Zhejiang Province, China
Venue:
WSEAS TRANSACTIONS on SYSTEMS
Year:
2008

Citing 5
Cited 2

A tabu search for the survivable fiber optic communication network design

Computers and Industrial Engineering
Heuristic algorithms for the terminal assignment problem

SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Rough set based data mining tasks scheduling on knowledge grid

AWIC'05 Proceedings of the Third international conference on Advances in Web Intelligence
Rough set based computation times estimation on knowledge grid

EGC'05 Proceedings of the 2005 European conference on Advances in Grid Computing
A hybrid Hopfield network-genetic algorithm approach for the terminal assignment problem

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Alopex-based evolutionary algorithm and its application to reaction kinetic parameter estimation

Computers and Industrial Engineering
Swarm optimisation algorithms applied to large balanced communication networks

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.