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
    Blend (BLX) Crossover  
         

 

 

(BLX-a,BLX-a-b)

download PDF with first 40 pages
from my latest eBook

if you need more operators click here

Read also
●   Takahashi M., Kita H.  (2001), A Crossover Operator Using Independent Component Analysis for Real-Coded Genetic Algorithm, in Proceedings of the 2001 Congress on Evolutionary Computation, pp. 643-649
WEB:    
http://ieeexplore.ieee.org/xpl/abs_free.jsp?arNumber=934452

●   Herrera F. , Lozano M. , Sánchez A.M.  (2003), A taxonomy for the Crossover Operator for Real-Coded Genetic Algorithms: An Experimental Study, in International Journal of Intelligent Systems, Wiley, vol. 18, pp. 309-338
WEB:    
http://www3.interscience.wiley.com
           
http://dx.doi.org/10.1002/int.10091

Algorithm BLX-a
1.
     select two parents X(t) and Y(t) from a parent pool

2.     create two offspring  X(t+1) and Y(t+1)  as follows:

3.              for i = 1 to n do

4.              di=|xi(t)-yi(t)|

5.              choose a uniform random real number u from interval
             <min(xi(t),yi(t))-adi, max(xi(t),yi(t))+adi>

6.              xi(t+1)=u

7.              choose a uniform random real number u from interval
             <min(xi(t),yi(t))-adi, max(xi(t),yi(t))+adi>

8.              yi(t+1)=u

9.              end do

where:
a
  – positive real parameter

Algorithm BLX-a-b
1.
     select two parents X(t) and Y(t) from a parent pool

2.     assume that X(t) is better than Y(t)

3.     create two offspring  X(t+1) and Y(t+1)  as follows:

4.              for i = 1 to n do

5.              di=|xi(t)-yi(t)|

6.                              if xi(t)yi(t) than

7.                              choose a uniform random real number u from interval
                             <xi(t)-adi, yi(t)+bdi>

8.                              xi(t+1)=u

9.                              choose a uniform random real number u from interval
                             <xi(t)-adi, yi(t)+bdi>

10.                            yi(t+1)=u

11.                            else

12.                            choose a uniform random real number u from interval
                            <yi(t)-bdi, yi(t)+adi>

13.                            xi(t+1)=u  

14.                            choose a uniform random real number u from interval
                            <yi(t)-bdi, yi(t)+adi>   

15.                            yi(t+1)=u

16.                            end if

17.           end do

where:
a
, b
– positive real parameters

 
   

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