dr Tomasz D.Gwiazda
Assistant Professor


Home page
Short CV
Publications

(e-)Books

Papers
My latest book
Students
Office hours
Teaching


Introduction

Standard operators

Binary coded operators
 1bit Adaptation Crossover (1BX) download PDF with first 40 pages from my latest eBook if you need more operators click here Keywords adaptive, recombination, combination of crossovers Motivation ●   Obtaining different trajectories of searching the solution space through simultaneous application of two operators of diametrically opposite characteristics. Source text ●   Spears W.M. (1992), Adapting Crossover in Evolutionary Algorithms, Technical Report AIC-92-025, Naval Research Laboratory, Navy Center for Applied Research on Artificial Intelligence. Read also ●   Vrajitoru D. (2004), Intra and Extra-Generation Schemes for Combining Crossover Operators, in Proceedings of the Fifteenth Midwest Artificial Intelligence and Cognitive Science Conference MAICS 2004, pp. 86-91 WEB:  ●   Herrera F., Lozano M., Sαnchez A.M., Hybrid Crossover Operators for  Real-Coded Genetic Algorithms: An Experimental Study, in Soft Computing - A Fusion of Foundations, Methodologies and Applications, Springer, vol. 9(4), pp. 280-298 WEB:     http://sci2s.ugr.es/publications/             See also ●   k-Point Crossover ●   Uniform Crossover ●   Combined Balanced Crossover ●   Adaptive Strategies of Mixing Crossovers Algorithm 1.     select  two parents A(t) and B(t) from current population P(t) 2.     choose a uniform random real number u from interval <0, 1> 3.              if an(t)=bn(t)=1 then 4.              create two offspring  C(t+1)  and D(t+1)  by the 2-Point              Crossover as follows: 5.              randomly choose two crossover points cp1 and cp2 from set              {1,...,n-1} (cp1 22.                                           if u ≤ ps then (swap bits) 23.                                           ci(t+1)=bi(t)      24.                                           di(t+1)=ai(t)   25.                                           else (dont swap) 26.                                           ci(t+1)=ai(t)   27.                                           di(t+1)=bi(t)  28.                                           end if 29.                           end do 30.           else 31.           choose a uniform random real number u from interval <0, 1> 32.                           if u <  0.5  then 33.                           create two offspring  C(t+1)  and D(t+1)  by the                            Uniform Crossover as follows: 34.                                           for i = 1 to n do 35.                                           choose a uniform random real number                                             u from interval <0,1> 36.                                                          if u ≤ ps then (swap bits) 37.                                                          ci(t+1)=bi(t)     38.                                                          di(t+1)=ai(t)       39.                                                          else (dont swap) 40.                                                          ci(t+1)=ai(t)       41.                                                          di(t+1)=bi(t)   42.                                                          end if 43.                                           end do 44.                           else 45.                           create two offspring  C(t+1)  and D(t+1)  by the                            2-Point Crossover as follows: 46.                           randomly choose two crossover points cp1 and cp2                                   from set {1,...,n-1} (cp1

:: Copyrights © tomaszgwiazda e-books 2006 :: webmaster ::