Home
last modified time | relevance | path

Searched refs:popold (Results 1 – 6 of 6) sorted by relevance

/dports/science/pagmo2/pagmo2-2.18.0/src/algorithms/
H A Dde1220.cpp224 tmp[n] = popold[r[0]][n] + F * (popold[r[1]][n] - popold[r[2]][n]); in evolve()
258 … = gbIter[n] + (popold[r[0]][n] - popold[r[1]][n]) * F + (popold[r[2]][n] - popold[r[3]][n]) * F; in evolve()
275 tmp[n] = popold[r[4]][n] + (popold[r[0]][n] - popold[r[1]][n]) * F in evolve()
376 tmp[n] = popold[r[0]][n] + (popold[r[1]][n] - popold[r[2]][n]) * F in evolve()
377 … + (popold[r[3]][n] - popold[r[4]][n]) * F + (popold[r[5]][n] - popold[r[6]][n]) * F; in evolve()
394 … + (popold[r[3]][n] - popold[r[4]][n]) * F + (popold[r[5]][n] - popold[r[6]][n]) * F; in evolve()
411 … + (popold[r[3]][n] - popold[r[4]][n]) * F + (popold[r[5]][n] - popold[r[6]][n]) * F; in evolve()
428 … + (popold[r[3]][n] - popold[r[4]][n]) * F + (popold[r[5]][n] - popold[r[6]][n]) * F; in evolve()
445 tmp[n] = popold[r[0]][n] + (popold[r[1]][n] - popold[i][n]) * F in evolve()
463 tmp[n] = popold[r[0]][n] + (popold[r[1]][n] - popold[i][n]) * F in evolve()
[all …]
H A Dsade.cpp213 tmp[n] = popold[r[0]][n] + F * (popold[r[1]][n] - popold[r[2]][n]); in evolve()
247 … = gbIter[n] + (popold[r[0]][n] - popold[r[1]][n]) * F + (popold[r[2]][n] - popold[r[3]][n]) * F; in evolve()
264 tmp[n] = popold[r[4]][n] + (popold[r[0]][n] - popold[r[1]][n]) * F in evolve()
365 tmp[n] = popold[r[0]][n] + (popold[r[1]][n] - popold[r[2]][n]) * F in evolve()
366 … + (popold[r[3]][n] - popold[r[4]][n]) * F + (popold[r[5]][n] - popold[r[6]][n]) * F; in evolve()
383 … + (popold[r[3]][n] - popold[r[4]][n]) * F + (popold[r[5]][n] - popold[r[6]][n]) * F; in evolve()
400 … + (popold[r[3]][n] - popold[r[4]][n]) * F + (popold[r[5]][n] - popold[r[6]][n]) * F; in evolve()
417 … + (popold[r[3]][n] - popold[r[4]][n]) * F + (popold[r[5]][n] - popold[r[6]][n]) * F; in evolve()
434 tmp[n] = popold[r[0]][n] + (popold[r[1]][n] - popold[i][n]) * F in evolve()
452 tmp[n] = popold[r[0]][n] + (popold[r[1]][n] - popold[i][n]) * F in evolve()
[all …]
H A Dde.cpp125 auto popold = pop.get_x(); in evolve() local
127 auto popnew = popold; in evolve()
155 tmp = popold[i]; in evolve()
159 tmp[n] = gbIter[n] + m_F * (popold[r[1]][n] - popold[r[2]][n]); in evolve()
174 tmp[n] = popold[r[0]][n] + m_F * (popold[r[1]][n] - popold[r[2]][n]); in evolve()
199 …tmp[n] = gbIter[n] + (popold[r[0]][n] + popold[r[1]][n] - popold[r[2]][n] - popold[r[3]][n]) * m_F; in evolve()
211 … + (popold[r[0]][n] + popold[r[1]][n] - popold[r[2]][n] - popold[r[3]][n]) * m_F; in evolve()
224 tmp[n] = gbIter[n] + m_F * (popold[r[1]][n] - popold[r[2]][n]); in evolve()
235 tmp[n] = popold[r[0]][n] + m_F * (popold[r[1]][n] - popold[r[2]][n]); in evolve()
258 … = gbIter[n] + (popold[r[0]][n] + popold[r[1]][n] - popold[r[2]][n] - popold[r[3]][n]) * m_F; in evolve()
[all …]
H A Dgaco.cpp169 population popold(pop); in evolve() local
276 generate_new_ants(popold, dist, gauss, prob_cumulative, sigma, new_ants, sol_archive); in evolve()
329 …bool check = compare_fc(pop.champion_f(), popold.champion_f(), n_ec, pop.get_problem().get_c_tol()… in evolve()
H A Dmaco.cpp158 population popold(pop); in evolve() local
467 generate_new_ants(popold, dist, gauss, prob_cumulative, sigma, new_ants, sol_archive); in evolve()
/dports/math/octave-forge-optim/optim-1.6.1/inst/
H A Dde_min.m225 popold = zeros (size (pop)); # toggle population variable
252 ## popold is the population which has to compete. It is static
264 popold = pop; # save the old population variable
279 pm1 = popold(a1,:); # shuffled population 1
280 pm2 = popold(a2,:); # shuffled population 2
281 pm3 = popold(a3,:); # shuffled population 3
313 ui = popold + F*(bm-popold) + F*(pm1 - pm2);
315 pm4 = popold(a4,:); # shuffled population 4
348 li = popold + F*(bm_n- popold) + F*(lpm1 - lpm2);
349 gi = popold + F*(bm - popold) + F*(pm1 - pm2);
[all …]