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
    k-Point Crossover  
         

 

 

(k-PX)

download PDF with first 40 pages
from my latest eBook

if you need more operators click here

Read also
Nomura T.  (1997), An Analysis on Crossovers for Real Number Chromosomes in an Infinite Population Size, ATR Human Information Processing Research Laboratories, Evolutionary Systems Department
WEB:     http://citeseer.ifi.unizh.ch/62577.html

            
http://citeseer.ist.psu.edu/62577.html

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

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

3.     randomly choose k crossover points cp1,...,cpk from set {1,...,n-1}

4.              for i = 1 to cp1 do

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

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

7.              end do

8.     switch = 0

9.              for j = 2 to k do

10.                           if switch = 0 then

11.                                           for i=cpj-1+1 to cpj do

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

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

14.                                           end do

15.                           switch = 1

16.                           else

17.                                           for i=cpj-1+1 to cpj do

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

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

20.                                           end do

21.                           switch = 0

22.                           end if

23.           end do

24.           if switch  = 0 then

25.                           for i=cpk+1 to n do

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

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

28.                           end do

29.           else

30.                           for i=cpk+1 to n do

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

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

33.                           end do

34.           end if

 
   

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