Terminal assignment in a communications network using genetic algorithms
CSC '94 Proceedings of the 22nd annual ACM computer science conference on Scaling up : meeting the challenge of complexity in real-world computing applications: meeting the challenge of complexity in real-world computing applications
Heuristic algorithms for the terminal assignment problem
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Swarm intelligence
A Hybrid Differential Evolution Algorithm for Solving the Terminal Assignment Problem
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part II: Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living
A hybrid Hopfield network-genetic algorithm approach for the terminal assignment problem
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Swarm optimisation algorithms applied to large balanced communication networks
Journal of Network and Computer Applications
Hi-index | 0.00 |
With the recent growth of communication networks, a large variety of combinatorial optimization problems appeared. One of these problems is the Terminal Assignment Problem. The main objective is to assign a given set of terminals to a given set of concentrators. In this paper, we propose the Bees Algorithm to assign terminals to concentrators. The algorithm performs a kind of neighbourhood search and uses a local search method to locate the global minimum. The Bees Algorithm is a swam-based optimization algorithm that mimics the natural behaviour of honey bees. We show that the Bees Algorithm is able to achieve feasible solutions to Terminal Assignment instances, improving the results obtained by previous approaches.