Solving the Terminal Assignment Problem Using a Local Search Genetic Algorithm

摘要

Terminal assignment is an important issue in telecommunication networks optimiza-tion. The task here is to assign a given collection of terminals to a given collection of concen-trators. The main objective is to minimize the link cost to form a network. This optimizationtask is an NP-complete problem. The intractability of this problem is a motivation for the pur-suits 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 searchwith population-based search. Simulation results verify the effectiveness of the proposedmethod. The results show that our algorithm provides good solutions in a better running time.