(UX)

download PDF with first 40 pages
from my latest eBook
if you need more operators click here

Read also
● Spears W.M., De Jong K.A.  (1991), On the Virtues of Parameterized Uniform Crossover, in Proceedings of the Fourth International Conference on Genetic Algorithms, Morgan Kaufman, pp. 230-236
WEB:     http://citeseer.ifi.unizh.ch/spears91virtues.html
            http://citeseer.ist.psu.edu/spears91virtues.html
●  Belea R., Beldiman L.  (2003), A new method of gene coding for a genetic algorithm designed for parametric optimization, in The Annals of “Dunarea De Jos”, University of Galati, pp. 66-71
WEB:     http://www.ann.ugal.ro/eeai/archives/2003.htm
●  Cordón O., Damas S., Santamaría J.  (2003), A CHC Evolutionary Algorithm for 3D Image Registration, in IFSA 2003, Springer-Verlag, pp. 404-411
WEB:     http://sci2s.ugr.es/publications/
            http://springerlink.metapress.com/
         openurl.asp?genre=article&issn=0302-9743&volume=2715&spage=404
●  Cotta C., Troya J.M.  (2000), Using Dynastic Exploring Recombination to Promote Diversity in Genetic Search, in Parallel Problem Solving from Nature - 6th International Conference, Springer Verlag, pp. 16-20
WEB:     http://citeseer.ifi.unizh.ch/cotta00using.html
            http://citeseer.ist.psu.edu/cotta00using.html

Algorithm UX
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.              for i = 1 to n do

4.              choose a uniform random real number u from interval <0,1>

5.                              if u ≤ p_s then (swap bits)

6.                              c_i^(t+1)=b_i^(t) 

7.                              d_i^(t+1)=a_i^(t)

8.                              else (don’t swap)

9.                              c_i^(t+1)=a_i^(t)

10.                            d_i^(t+1)=b_i^(t)

11.                            end if

12.           end do

where:
 p_s – probability of swapping, in standard form p_s = 0.5