A hybrid DE algorithm with a multiple strategy 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:
Research Center for Informatics and Communications, Department of Computer Science, School of Technology and Management, Polytechnic Institute of Leiria, Leiria, Portugal;Research Center for Informatics and Communications, Department of Computer Science, School of Technology and Management, Polytechnic Institute of Leiria, Leiria, Portugal;Department of Technologies of Computers and Communications, Polytechnic School, University of Extremadura, Cáceres, Spain;Department of Technologies of Computers and Communications, Polytechnic School, University of Extremadura, Cáceres, Spain;Department of Technologies of Computers and Communications, Polytechnic School, University of Extremadura, Cáceres, Spain
Venue:
SETN'10 Proceedings of the 6th Hellenic conference on Artificial Intelligence: theories, models and applications
Year:
2010

Citing 6
Cited 2

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
Introduction to Evolutionary Computing

Introduction to Evolutionary Computing
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

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
Swarm optimisation algorithms applied to large balanced communication networks

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the last decades a large amount of interests have been focused on telecommunication network problems One important problem in telecommunication networks is the terminal assignment problem In this paper, we propose a Differential Evolution algorithm employing a “multiple” strategy to solve the Terminal Assignment problem A set of available strategies is established initially In each generation a strategy is selected based on the amount fitness improvements achieved over a number of previous generations We use tournament selection for this purpose Simulation results with the different methods implemented are compared.