A Genetic Algorithm with Multiple Operators for Solving the Terminal Assignment Problem

In recent years we have witnessed a tremendous growth of communication networks resulted in a large variety of combinatorial optimization problems. One of these problems is the terminal assignment problem. In this paper, we propose a genetic algorithm employing multiple crossover and mutation operators for solving the well-known terminal assignment problem. Two sets of available crossover and mutation operators are established initially. In each generation a crossover method is selected for recombination and a mutation method is selected for mutation based on the amount fitness improvements achieved over a number of previous operations (recombinations/mutations). We use tournament selection for this purpose. Simulation results with the different methods implemented are compared.

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

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

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

[4]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

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

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

[7]  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).

[8]  A. E. Eiben,et al.  Introduction to Evolutionary Computing , 2003, Natural Computing Series.

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

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

[11]  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).

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

[13]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .