A Review on Genetic Algorithm and Its Applications
Keywords:
genetic algorithm, evolutionary cycle, principles, operators, advantages and its applications.Abstract
The wide spread use of Artificial Intelligence makes the most useful genetic algorithm as a heuristic search method. Genetic algorithms are one of the best ways to solve a problem for which little is known. They are a very general algorithm and so will work in any search space. Genetic algorithm will be able to create a high quality solution. Genetic algorithm use the principles of selection and evolution to produce several solutions to a given problem Genetic algorithm (GA) is a searching technique used in computing to find true or approximate solutions to optimization and search problems. Genetic algorithm (GA) are categorized as global search heuristics. GA is a good heuristic search for combinatorial problem like TSP, pen movement of a plotter, real world routing of school buses, delivery trucks and posted carriers. In this paper we present the genetic algorithm, its evolutionary cycle, basic principles., basic operator, working mechanism, algorithm, advantages and its applications.
References
- Genetic Algorithms in Engineering and Computer Science , edited by G.Winter, J.Periaux & M.Galan, published by JOHN WILEY & SON Ltd. in 1995.
- [Louis 1993] Genetic Algorithms as a Computational Tool for Design, by Sushil J. Louis, in August 1993
- Foundatiions of Genetic Algorithms Volume 3, by L.Darrell Whitley & Michael D.Vose, in 1995 published by Morgan Kaufmann Publishers, Inc.
- Algorithms and Complexity, by Herbert S.Wilf, in 1986 published by Prentice-Hall, Inc.
- R. P. Pargas, M. J. Harrold, and R. R. Peck, "Test Data Generation Using Genetic Algorithms" Journal of Software Testing, Verifications and Reliability, vol. 9, pp. 263-282, 1999.
- U. Buy, A. Orso, and Pezzè, "Automated Testing of classes," In Proceedings of the International Symposium on Software Testing and Analysis (ISSTA 2000), August 2000.
- V. Martena, A. Orso, and Pezzè, "Interclass Testing of Object Oriented Software," In Proceedings of the IEEE International Conference on Engineering of Complex Computer Systems (ICECCS2002), 2002.
- P. Tonella, "Evolutionary testing of classes," In Proceedings of the International Symposium on Software Testing and Analysis (ISSTA 2000), pp. 119-128, 2004.[22] S.
- Wappler and F. Lammermann, "Using evolutionary algorithms for the unit testing of object-oriented software," In Proceedings of the 2005 conference on Genetic and evolutionary computation (GECCO 2005), pp. 1053-1060, 2005.
- Y. Cheon, M. Y. Kim, and A. Perumandla, "A Complete Automation of Unit Testing for Java Programs," Proceedings of the 2005 International Conference on Software Engineering Research and Practice (SERP '05), pp. 290-295, 2005.
- Y. Cheon and M. Kim, "A Fitness Function for Modular Evolutionary Testing of Object-Oriented Programs" In Genetic and Evolutionary Computation Conference, pp. 1952-1954, 2006.
- M. Y. Kim and Y. Cheon, "A Fitness Function to Find Feasible Sequences of Method Calls for Evolutionary Testing of Object-Oriented Programs," To appear in International Conference on Software Testing, Verification, and Validation, Norway, April 9-11, 2008.
- J. Holland, Adaptation in Natural and Artificial Systems, ISBN 0 472 08460 7. University of Michigan Press, Ann Arbor, MI, 1975.
Downloads
Published
Issue
Section
License
Copyright (c) IJSRST
This work is licensed under a Creative Commons Attribution 4.0 International License.
