A Review on Genetic Algorithm Operations and Application in Telecommunication Routing
DOI:
https://doi.org/10.26438/ijcse/v7i7.373377Keywords:
Genetic Algorithm, Telecommunication Routing, Optimization Technique, Evolutionary AlgorithmAbstract
Genetic algorithm is a powerful tool and wide class of global optimization methods. It belongs to the large class of evolutionary algorithm and an efficient way to get optimal solutions. There is a large class of optimization problems that are quite hard to solve by conventional optimization technique but genetic algorithm (GA) is very efficient in that case too. Genetic Algorithm is used to solve many real world problems, some applications are as automotive design, Robotics, Optimized Telecommunications Routing, Biometric invention, Trip-traffic and Shipment routing, Computer gaming, Gene expression profiting, Marketing and Merchandising, etc. The main goal of this work is to solve the telecommunication routing problem by using Genetic Algorithm.
References
[1] J. Holland, “Adaptation in Natural and Artificial Systems”, University of Michigan Press, Ann Arbor. (Technical Report ORA Projects 01252 and 08226).Ann Arbor: University of Michigan, Department of Computer and Communication Sciences, (1975).
[2] D. E. Goldberg, “Genetic Algorithms in Search, Optimization and Machine Learning”, Addison- Wesley Publishing Co., Inc., Reading, Mass, (1989).
[3] R. Sivaraj and T. Ravichandran, “Review of selection methods in genetic algorithm”, International Journal of Engineering Science and Technology (IJEST), 2011, Vol. 3, Issue 5, pp. 3792-3797.
[4] T. Weise, Global Optimization Algorithms – Theory and Application Second Ed., Self-Published. (2009).
[5] J. Kennedy, and R. Eberhart, "Particle Swarm Optimization."IEEE, 7. (1995).
[6] Y. Kaya, M. Uyar, and R. Tekdn, "A Novel Crossover Operator for Genetic Algorithms: Ring Crossover." (2011).
[7] A. Otman and A. Jaafar, "A Comparative Study of Adaptive Crossover Operators for Genetic Algorithms to Resolve the Traveling Salesman Problem."International Journal of Computer Applications, 9.(2011), 31(11).
[8] M. J. Varnamkhasti, L. S. Lee, M. R. A. Bakar and W. J. Leong, "A Genetic Algorithm with Fuzzy Crossover Operator and Probability." Hindawi Publishing Corporation, Advances in Operations Research, 2012, 16. (2011).
[9] D. Vrajitoru, "Crossover improvement for the genetic algorithm in information retrieval." (1998).
[10] M. Srinivas and L. M. Patnaik, "Adaptive Probabilities of Crossover and Mutation in Genetic Algorithms." IEEE Transactions on systems, man and cybernetic, (1994), 24(4), 656-667.
[11] Tomasz Dominik Gwiazda, “Genetic Algorithms Reference”, Volume –I, Poland: Tomasz Gwiazda, 2006.
[12] David E. Goldberg and Robert Lingle Jr., “Alleles, loci and the traveling salesman problem”, Proceedings of the 1st International Conference on Genetic Algorithms, 1985,pp. 154- 159.
[13] I. M. Oliver, D. J. Smith, and J. R. C. Holland, “A study of permutation crossover operators on the TSP”, Proceedings of the 2nd International Conference on Genetic Algorithms on Genetic Algorithms and their Application, 1987, pp. 224-230.
[14] Lawrence Davis, “Applying adaptive algorithms to epistatic domains”, Proceedings of the 9th international joint conference on Artificial Intelligence, 1985, Vol. 1, pp. 162- 164.
[15] Gilbert Syswerda, “Schedule optimization using genetic algorithms”, Handbook of Genetic Algorithms, 1991, pp. 332- 349, New York: Van Nostrand Reinhold.
[16] H. Muhlenbein, “Parallel genetic algorithms, population genetics and combinatorial optimization”, Proceedings of Workshop on Parallel Processing: Logic, Organization and Technology, 1991, pp. 398-406.
[17] Michael Meise, Vasileios Pappas, Lixia Zhang, “A taxonomy of biologically inspired research in computer network”, Computer Network, 54(2010), pp. 901-916, ELSEVIER.
[18] International Journal of Scientific Research in Computer Sciences and Engineering (ISSN: 2320-7639)
[19] International Journal of Scientific Research in Network Security and Communication (ISSN: 2321-3256).
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
