A Hybrid Differential Evolution Algorithm for Solving the Terminal Assignment Problem

Authors:
Eugénia Moreira Bernardino;Anabela Moreira Bernardino;Juan Manuel Sánchez-Pérez;Juan Antonio Gómez-Pulido;Miguel Angel Vega-Rodríguez
Affiliations:
Department of Computer Science, School of Technology and Management, Polytechnic Institute of Leiria, Leiria, Portugal 2400;Department of Computer Science, School of Technology and Management, Polytechnic Institute of Leiria, Leiria, Portugal 2400;Department of Technologies of Computers and Communications, Polytechnic School, University of Extremadura, Cáceres, Spain 10071;Department of Technologies of Computers and Communications, Polytechnic School, University of Extremadura, Cáceres, Spain 10071;Department of Technologies of Computers and Communications, Polytechnic School, University of Extremadura, Cáceres, Spain 10071
Venue:
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
Year:
2009

Citing 5
Cited 4

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
Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces

Journal of Global Optimization
Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)

Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)
A hybrid Hopfield network-genetic algorithm approach for the terminal assignment problem

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

Discrete differential evolution algorithm for solving the terminal assignment problem

PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II
Using the bees algorithm to assign terminals to concentrators

IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part II
A hybrid DE algorithm with a multiple strategy for solving the terminal assignment problem

SETN'10 Proceedings of the 6th Hellenic conference on Artificial Intelligence: theories, models and applications
Swarm optimisation algorithms applied to large balanced communication networks

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The field of communication networks has witnessed tremendous growth in recent years resulting in a large variety of combinatorial optimization problems in the design and in the management of communication networks. One of these problems is the terminal assignment problem. The task here is to assign a given set of terminals to a given set of concentrators. In this paper, we propose a Hybrid Differential Evolution Algorithm to solve the terminal assignment problem. We compare our results with the results obtained by the classical Genetic Algorithm and the Tabu Search Algorithm, widely used in literature.