Terminal assignment is an important issue in telecommunication networks optimization. The task here is to assign a given collection of terminals to a given collection of concentrators. The main objective is to minimize the link cost to form a network. This optimization task is an NP-complete problem. The intractability of this problem is a motivation for the pursuits of a local search genetic algorithm that produces approximate, rather than exact, solutions. In this paper, we explore one of the most successful emerging ideas combining local search with population-based search. Simulation results verify the effectiveness of the proposed method. The results show that our algorithm provides good solutions in a better running time. © 2009 Springer-Verlag 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). Solving the terminal assignment problem using a local search genetic algorithm. In Advances in Soft Computing (Vol. 50, pp. 225–234). https://doi.org/10.1007/978-3-540-85863-8_27
Mendeley helps you to discover research relevant for your work.