BASKIN GEN SEÇİMİ OPERATÖRÜNE DAYALI GENETİK ALGORİTMA MODELİ

Öz

Bu çalışmada genetik algoritma için baskın gen seçimi operatörüne dayalı yeni bir model önerilmiştir. Önerilenmodelin performansı iyi bilinen sürekli test fonksiyonları üzerinde incelenerek sonuçlar standart genetikalgoritmaya ait sonuçlarla karşılaştırılmıştır. Elde edilen sonuçlardan önerilen yaklaşımın standart genetikalgoritmanın performansını artırdığı görülmüştür.

Anahtar Kelimeler

• Genetik algoritma, baskın gen seçimi, sürekli optimizasyon.

Kaynakça

1. Holland, J.H., Adaption in natural and artificial
2. systems, University of Michigan Press, Ann
3. Arbor, 1975.
4. De Jong, K.A., Spears, W.M., “An analysis of the
5. interacting roles of population size and crossover
6. in genetic algorithms”, Parallel Problem
7. Solving from Nature, Springer, Berlin, Cilt
8. LNCS 496, 38-47, 1991.

9. Schaffer, J.D., Caruana, R.A., Eshelman, L.J.,
10. Das, R., “A study of control parameters affecting
11. online performance of genetic algorithms for
12. function optimization”, The 3rd Int. Conf. GAs,
13. -60, 1989.
14. Grefenstette, J.J., “Optimisation of control
15. parameters for genetic algorithms”, IEEE Trans.
16. SMC, Cilt 16, No 1, 122-128, 1986.
17. Reeves C.R., Rowe J.E., Genetic algorithms
18. principles and perspectives: A Guide to GA
19. Theory, ISBN 978-1402072406, Springer, 2002.
20. Michalewicz, Z., Schoenauer, M., “Evolutionary
21. algorithms for constrained parameter optimization problems”, Evolutionary
22. Computation, Cilt 4, 1-32, 1996.
23. De Jong, K. A., An analysis of the behavior of a
24. class of genetic adaptive systems, Doctoral
25. Thesis, Department of Computer and
26. Communication Sciences. University of
27. Michigan, Ann Arbor, 1975.
28. Grefenstette, J.J., “Optimization of control
29. parameters for genetic algorithms”, IEEE Trans
30. on Systems, Man and Cybernetics, Cilt SMC-
31. , 122-128, 1986.
32. Schaffer, J.D., et al, “A study of control
33. parameters affecting online performance of
34. genetic algorithms for function optimization”,
35. rd International Conference on Genetic
36. Algorithms, Morgan Kaufmann, San Mateo, CA,
37. -60, 1989.
38. Eshelmvn, L.J., Shaffer, J.D., “Preventing
39. premature convergence in genetic algorithms by
40. preventing incest”, Proc. 4 th Int. Conf Genetic
41. Algorithms, 115-122, 1991.
42. Andris, P., Frollo, I., “Optimisation of NMR coils
43. by genetic algorithms”, Measurement Science
44. Review, Cilt 2, No 2, 13-22, 2002.
45. Davidor, Y., “Analogous crossover operator”,
46. Proc 3rd Int.Conf Genetic Algorithms, George
47. Mason Univ., Arlington, VA., 98-103, 1989.
48. Fagarty, T.C., “Varing the probability of
49. mutation in the genetic algorithm”, Proc. 3rd
50. Int. Conf Genetic Algorithms, 104-109, 1989.
51. Watanabe, M., Ida, K., Gen, M., “A genetic
52. algorithm with modified crossover operator and
53. search area adaptation for the job-shop
54. scheduling problem”, Computers and Industrial
55. Engineering, Cilt 48, No 4, 743-752, 2005.
56. Jiri, K., Jiri, L., “A new genetic operator
57. maintaining population diversity”, In Dubois
58. Daniel M., editor(s), Computing Anticipatory
59. Systems, Liege, Belgium, American Institute of
60. Physics, ISBN 0-7354-0012-1, 338-348, 2001.
61. Yang, W.X., “An improved genetic algorithm
62. adopting immigration operator”, Intelligent Data
63. Analysis, Cilt 8, No 4, 385-401, 2004.
64. Silva, R.R., Lopes, H.S., Erig Lima, C.R., “A
65. new mutation operator for the elitism-based
66. compact genetic algorithm”, LNCS, Cilt 4431,
67. Springer Berlin/Heidelberg, 159-166, 2007.
68. Mitchell, G.G., O'Donoghue, D., Barnes, D.,
69. McCarville, M., “GeneRepair - A repair operator
70. for genetic algorithms”, late-breaking paper,
71. GECCO, Chicago IL, July 2003.
72. Srinwa, M., Patnaik, L.M., “Adaptive
73. probabilities of crossover and mutation in genetic
74. algorithms”, IEEE Trans. SMC, Cilt SMC-24,
75. No 4, 656-666, 1994.
76. Grefenstette, J.J., “Qptimization of control
77. parameters for genetic algorithms”, IEEE Trans.
78. SMC, Cilt SMC-16, No l, 122-128, 1986.
79. Samples, M.E., Byom, M.J., Diada, J.M.,
80. “Parameter sweeps for exploring parameter
81. spaces of genetic and evolutionary algorithms”,
82. in Parameter Setting in Evolutionary
83. Algorithms, Fernando G. Lobo, Cl´audio F.
84. Lima, Zbigniew Michalewicz (Editors), Springer,
85. -184, 2007.
86. Holland J.H., “Building blocks, cohort genetic
87. algorithms, and hyperplane-defined functions”,
88. Evolutionary Computation, Cilt 8, 373-391,
89. -
90. Aksu, O., Yeni bir paralel genetik algoritma
91. modeli ve analog devre tasarımına
92. uygulanması, Yüksek Lisans Tezi, Erciyes
93. Üniversitesi Bilgisayar Mühendisliği Anabilim
94. Dalı, Kayseri, Temmuz 2008.
95. Kalinli, A., Geribeslemeli yapay sinir ağlarının
96. genetik operatörlere dayalı tabu araştırma
97. algoritması kullanarak eğitilmesi, Doktora
98. Tezi, Erciyes Üniversitesi, Elektronik
99. Mühendisliği Anabilim Dalı, 1996.
100. Kalinli, A., Karaboga, D., “Training recurrent
101. neural networks by using parallel tabu search
102. algorithm based on crossover operation”,
103. Engineering Applications of Artificial
104. Intelligence, Cilt 17, No 5, 529-542, 2004.