The asymptotic probabilistic genetic algorithm
Author: Galushin P.V., Semenkin E.S.
Journal: Сибирский аэрокосмический журнал @vestnik-sibsau
Section: Математика, механика, информатика
Article in issue: 5 (26), 2009.
Free access
This paper proposes the modification of probabilistic genetic algorithm, which uses genetic operators, not affecting the particular solutions, but the probabilities distribution of solution vector's components. This paper also compares the reliability and efficiency of the base algorithm and proposed modification using the set of test optimization problems and bank loan portfolio problem.
Probabilistic genetic algorithm, mutation, selection
Short address: https://sciup.org/148176096
IDR: 148176096
Text of the scientific article The asymptotic probabilistic genetic algorithm
I X I P i lr v = exp — -—-x - sin29 [-A 9 + Bl sin 9 + y V 2 V k Л[ ]
х[ A exp ( -ц9 ) + B exp ( -ц9 ) ] +
I Xf P +ц exp l -I -^
V 2 V k
- x - sin2 9 I l[- A exp ( -ц9 ) + B exp ( -ц9 ) ] I cos 9 .
f\ -+n
5) u = exp IX 2
AB\
Here A , B , X are arbitrary constants; X 2 = 1.
In this case
v = X exp (х ^ + П ) A -—П + B - A exp fx^-^^ .
V 2 JL 2 ] I 2 J
I X I P _„i ir v, = exp — -—-x - sin29 [-A 9 + Bl cos 9
x V 2 V k Jr ]
p
k
- x - sin2 9 I l [ - A 9 + B ] -
[. f X f p
+ X exp
I V 2 V k
- x - sin2 9 | l [ - A 9 + B ] -
- x - sin2 9 I I I cos 9 .
