Bernardino, EugéniaBernardino, AnabelaSánchez-Pérez, Juan ManuelGómez-Pulido, Juan AntonioVega-Rodríguez, Miguel Angel2025-06-032025-06-032009-06Bernardino, 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: Omatu, S., et al. Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living. IWANN 2009. Lecture Notes in Computer Science, vol 5518. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02481-8_25.978364202480197836420248180302-9743http://hdl.handle.net/10400.8/1307510th International Work-Conference on Artificial Neural Networks, IWANN 2009, 10 June 2009 through 12 June 2009 - Code 77015The 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.engCommunication NetworksGenetic AlgorithmsHybrid Differential Evolution AlgorithmTabu SearchTerminal Assignment Problembook part10.1007/978-3-642-02481-8_251611-3349