Editura SfÃ¢ntul Ierarh Nicolae ISBN 978-606-577-027-0

More documents

Recommendations

Info

void Citire(); void CalculFitness(); void GenereazaPermutare(int i, int j); int Valid(int k); void CopieSolutie(int i); void InitializeazaPopulatie(); void Elitism(int NrMutati); void Crossover(TCromozom g1, TCromozom g2, TCromozom &rez1, TCromozom &rez2); void Mutatie(TCromozom &mutant); void MutaRestul(int NrMutati); void OrdoneazaDupaFitness(); void SelectieParintiAranjata(int &r1, int &r2); void Afiseaza(); void main() { int i; Citire(); randomize(); InitializeazaPopulatie(); OrdoneazaDupaFitness(); for(i=1;i
} } void GenereazaPermutare(int i, int j) { int k=2; st[1]=1; st[2]=random(MaxGena-1); while(j&&(k>1)) { if (k==MaxGena) { CopieSolutie(i); j--;k--; } else if (st[k]
Page 1 and 2: Editura Sfântul Ierarh Nicolae ISB
Page 3 and 4: In timpul reproducerii apar doua ti
Page 5 and 6: cat timp nu este indeplinit criteri
Page 7 and 8: 2) Populatia initiala Populatia est
Page 9 and 10: Codificarea binara a) Incrucisare i
Page 11 and 12: Cap.III Implementarea algoritmului
Page 13 and 14: void Afiseaza(); void main() { /*pr
Page 15 and 16: -=PopulatieVeche[r2].fitness; } } 3
Page 17 and 18: 4) Selectarea cromozomilor parinti
Page 19 and 20: for(i=1;i
Page 21 and 22: else cout
Page 23 and 24: 5) Crossover-ul Incrucisarea se rea
Page 25 and 26: for(i=1;i
Page 27 and 28: Exemplu Pentru urmatoarele date de
Page 29: 5) Crossover-ul O alta dificultate
Page 33 and 34: 1=0; while (r>0) { r1++; r-=r1; } r
Page 35 and 36: 6) Mutatia Mutatia are o probabilit
Page 37 and 38: eturn x; } void CalculFitness() { i
Page 39 and 40: Exemplu Pentru a=1, b=2 programul v
Page 41 and 42: In continuare vom da cateva optimiz
Page 43 and 44: Evolutia in timp a functiilor f opt
Page 45: CUPRINS Capitolul I. Consideraţii

Editura SfÃ¢ntul Ierarh Nicolae ISBN 978-606-577-027-0

Create successful ePaper yourself

Delete template?

Save as template?