Research Article
Genetic Algorithm: A Search of Complex Spaces
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 25 - Issue 7 |
| Published: July 2011 |
| Authors: Namita Khurana, Anju Rathi, Akshatha.P.S |
10.5120/3045-4136
|
Namita Khurana, Anju Rathi, Akshatha.P.S . Genetic Algorithm: A Search of Complex Spaces. International Journal of Computer Applications. 25, 7 (July 2011), 13-17. DOI=10.5120/3045-4136
@article{ 10.5120/3045-4136,
author = { Namita Khurana,Anju Rathi,Akshatha.P.S },
title = { Genetic Algorithm: A Search of Complex Spaces },
journal = { International Journal of Computer Applications },
year = { 2011 },
volume = { 25 },
number = { 7 },
pages = { 13-17 },
doi = { 10.5120/3045-4136 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2011
%A Namita Khurana
%A Anju Rathi
%A Akshatha.P.S
%T Genetic Algorithm: A Search of Complex Spaces%T
%J International Journal of Computer Applications
%V 25
%N 7
%P 13-17
%R 10.5120/3045-4136
%I Foundation of Computer Science (FCS), NY, USA
Abstract
Living species solve very complex problem of optimization through the mechanism of evolution and natural selection. Genetic Algorithm has been a field of active interest and applied to solve problems almost in all the fields like Computer Science, Electrical Engg., Mechanical Engg., Optimization, Biology and Image Processing etc. One important application of Genetic Algorithm is to search complex spaces and function optimization. A genetic algorithm begins its search with random solution of the problem. The initial population is evolved to new population using Genetic operators like reproduction, crossover and mutation. A Genetic Algorithm keeps evolving the successive populations unless some criterion is met or a reasonable acceptable solution is found. In this paper Genetic Algorithm has been applied to schwefel function to find the best fit chromosome so far.
References
- D.E.Goldberg, “Genetic Algorithms in search, Optimization and Machine Learning”, Addison Wesley Publishing Company, Ind. U.S.A, 1989.
- Charles C.Peck, Atam P. Dhawan, “Genetic algorithm as global random search methods: An alternative Perspective”, Evolutionary Computation, Volume 3 Issue1, MIT Press, march 1995.
- Wolfram MathWorld available at http://mathworld.com.
- Pratibha Bajpai et al./Indian Journal of Computer Science and Engineering Vol 1 No 3 199-206, “ Genetic Algorithm-an Approach to solve Global Optimization Problems”.
- http://www-optima.amp.i.kyoto-u.ac.jp/member/student/hedar/Hedar_files/TestGO_files/Page2530.htm
- Melanie Mitche,”An introduction to genetic Algorithm”, MIT press,1998.
- L.T.Leng, Guided Genetic Algorithm, Doctoral Dissertation.University of Essex, 1999.
- Yashwant Kanitkar “Pointers in c”.
- Lawrence Davis. Handbook of Genetic Alogorithms. Van Nostrand Reinhold, NewYork, 1991.
- D. Whitley, D.Garrett, and J.Watson. Genetic Quad Search.
- MathWorks available at www.mathworks.com
- Wikipedia (2004).Genetic Algorithm. Available from URL: http://en.wikipedia.org/wiki/Genetic_algorithm
- Holland, J. (1975). Adaptation In Natural and Artificial Systems. University of Michigan Press, Ann Arbor.
- Schaffer, J.D. and Eshelman, L. (1993). Real-coded genetic algorithms and interval schemata. Foundations of Genetic Algorithms,2,ed.D.Whitley.Morgan Kaufmann, an Mateo, A.
- Schwefel, H.P. (1981). Numerical optimization of Computer models. John Wiley, New York.
- Baker, J. (1985). Adaptive selection methods for genetic algorithms. In proceedings of the International Conference on Genetic Algorithms and Their Applications.
- L.T.Leng,Guided genetic algorithm,Doctrol Dissertation. University of Essex,1999.
- L. Painton, J.Campbell, “Genetic Algorithms in optimization of system Reliability” Reliability, IEEE Transaction on Volume: 44 ,Issue 2, Digital Object Identifier.
- T.Weise, “Global Optimization Algorithms-Theory and Application”.
Index Terms
Keywords