Solving the Terminal Assignment Problem Using a Local Search Genetic Algorithm

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.

[1]  Mir M. Atiqullah,et al.  Reliability optimization of communication networks using simulated annealing , 1993 .

[2]  Xin Yao,et al.  Non-standard cost terminal assignment problems using tabu search approach , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[3]  Seok J. Koh,et al.  A tabu search for the survivable fiber optic communication network design , 1995 .

[4]  Fred W. Glover,et al.  Least-cost network topology design for a new service , 1991, Ann. Oper. Res..

[5]  Pablo Moscato,et al.  On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .

[6]  Samuel Pierre,et al.  Topological design of computer communication networks using simulated annealing , 1995 .

[7]  Sami Khuri,et al.  Heuristic algorithms for the terminal assignment problem , 1997, SAC '97.

[8]  Sancho Salcedo-Sanz,et al.  Solving terminal assignment problems with groups encoding: The wedding banquet problem , 2006, Eng. Appl. Artif. Intell..

[9]  Miguel A. Vega-Rodríguez,et al.  A Genetic Algorithm with Multiple Operators for Solving the Terminal Assignment Problem , 2008, New Challenges in Applied Intelligence Technologies.

[10]  Roger L. Wainwright,et al.  Terminal assignment in a communications network using genetic algorithms , 1994, CSC '94.

[11]  Xin Yao,et al.  Hybrid Evolutionary Approaches to Terminal Assignment in Communications Networks , 2005 .

[12]  Xin Yao,et al.  A hybrid Hopfield network-genetic algorithm approach for the terminal assignment problem , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).