Metrika članka

  • citati u SCindeksu: 0
  • citati u CrossRef-u:0
  • citati u Google Scholaru:[=>]
  • posete u poslednjih 30 dana:3
  • preuzimanja u poslednjih 30 dana:3
članak: 5 od 51  
Back povratak na rezultate
Godišnjak Pedagoškog fakulteta u Vranju
2018, vol. 9, br. 2, str. 101-108
jezik rada: engleski
vrsta rada: pregledni članak
objavljeno: 25/04/2019
doi: 10.5937/gufv1802101B
Najvažniji aspekti i operatori genetskog algoritma kao stohastičke metode za rešavanje optimizacionih problema
Univerzitet u Nišu, Učiteljski fakultet, Vranje

e-adresa: milenab@pfvr.ni.ac.rs

Sažetak

U radu se opisuju najvažniji aspekti genetskog algoritma kao jedne od stohastičkih metoda za rešavanje različitih tipova optimizacionih problema. Takođe, opisuju se osnovni genetski operatori: selekcija, ukrštanje i mutacija, koji služe za dobijanje novih generacija individua da bi se dobilo optimalno ili dovoljno dobro rešenje razmatranog optimizacionog problema.

Ključne reči

Reference

Beasley, D., Bull, D.R., Martin, R.R. (1993) An overview of genetic algorithms: Part 2, Research topics. University Computing, vol. 15, br. 4, str. 170-181
Beasley, D., Bull, D.R., Martin, R.R. (1993) An Overview of Genetic Algorithms, Part 1, Research Topics. University Computing, Vol. 15, No. 2, pp. 58-69
Booker, L. (1987) Improving search in genetic algorithms. San Mateo, California, USA: Morgan Kaufmann Publishers, pp. 61-73
Burkowski, F.J. (1999) Shuffle crossover and mutual information. u: Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), Institute of Electrical and Electronics Engineers (IEEE), : 1574-1580
Filipović, V. (1998) A proposal to improve operator tournament selection in genetic algorithms. University of Belgrade - Faculty of Mathematics, Msa Thesis; in Serbian
Filipović, V., Kratica, J., Tošić, D., Ljubić, I. (2000) Fine Grained Tournament Selection for the Simple Plant Location Problem. 5, pp. 152-158
Filipović, V., Tošić, D., Kratica, J. (2001) Experimental Results in Applying of Fine Grained Tournament Selection. pp. 331-336
Filipović, V. (2003) Fine-grained tournament selection operator in genetic algorithms. Computing and Informatics, vol. 22, br. 2, str. 143-161
Höhn, C., Reeves, C.R. (1995) Embedding neighbourhoodsearch operators in a genetic algorithm for graph bipartitioning, Ctac technical report. Reeves, Coventry University, UK, 33,34
Kratica, J. (2000) Parallelization of genetic algorithms for solving some NP-complete problems. Belgrade: Faculty of Mathematics, PhD thesis
Kratica, J. (1999) Improvement of Simple Genetic Algorithm for Solving the Uncapacitated Warehouse Location Problem. u: Roy, Rajkumar; Furuhashi, Takeshi; Chawdhry, Pravir K. [ur.] Advances in Soft Computing, London: Springer Science and Business Media LLC, : 390-402
Mühlenbein, H., Schlierkamp-Voosen, D. (1993) Predictive Models for the Breeder Genetic Algorithm I. Continuous Parameter Optimization. Evolutionary Computation, 1(1): 25-49