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. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Bernardino, E. M., Bernardino, A. M., Sánchez-Pérez, J. M., Gómez-Pulido, J. A., & Vega-Rodríguez, M. A. (2009). A hybrid differential evolution algorithm for solving the terminal assignment problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5518 LNCS, pp. 179–186). https://doi.org/10.1007/978-3-642-02481-8_25
Mendeley helps you to discover research relevant for your work.