dr Tomasz D.Gwiazda
 Assistant Professor

 ———————
Home page
Short CV
    Publications
   
(e-)Books
   
Papers
My latest book
Students
Office hours
Teaching
 ———————

Contents of e-Book
Index of authors
Index of experiment domains


Introduction

Standard operators
1-Point Crossover
k-Point Crossover
Shuffle Crossover
Reduced Surrogate Crossover
Uniform Crossover
Highly Disruptive Crossover,Heuristic Uniform Crossover
Average Crossover
Discrete Crossover
Flat Crossover
Heuristic Crossover,Intermediate Crossover
Blend Crossover


Binary coded operators
Random Respectful Crossover
Masked Crossover
1bit Adaptation Crossover
Multivariate Crossover
Homologous Crossover
Count-preserving Crossover
Elitist Crossover
    Reduced Surrogate Crossover  
         

 

 

(SC)

download PDF with first 40 pages
from my latest eBook

if you need more operators click here

Algorithm
1.
    
select two parents A(t) and B(t) from a parent pool

2.     create a list PCP=(cp1,...,cpl) of possible l crossover points as follows:

3.     l = 0

4.              for i = 1 to n do

5.                              if ai(t)bi(t) then

6.                              l = l + 1

7.                              cpl=i 

8.                              end if

9.              end do

10.           if l > 0 then

11.           create two offspring  C(t+1)  and D(t+1)  as follows:

12.           randomly choose one crossover point cp from PCP

13.                           for i = 1 to cp do

14.                           ci(t+1)=ai(t)

15.                           di(t+1)=bi(t)

16.                           end do

17.                           for i = cp + 1 to n do

18.                           ci(t+1)=bi(t)

19.                           di(t+1)=ai(t)

20.                           end do

21.           else

22.           do nothing

23.           end if

 
   

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