function [c1,c2] = OUniformXover(p1,p2,bounds,Ops)
// Uniform crossover takes two parents P1,P2 and performs uniform
// crossover on a permuation string.  
//
// function [c1,c2] = linearOrderXover(p1,p2,bounds,Ops)
// p1      - the first parent ( [solution string function value] )
// p2      - the second parent ( [solution string function value] )
// bounds  - the bounds matrix for the solution space
// Ops     - Options matrix for simple crossover [gen #SimpXovers].

// Binary and Real-Valued Simulation Evolution for Matlab 
// Copyright (C) 1996 C.R. Houck, J.A. Joines, M.G. Kay 
//
// C.R. Houck, J.Joines, and M.Kay. A genetic algorithm for function
// optimization: A Matlab implementation. ACM Transactions on Mathmatical
// Software, Submitted 1996.
//
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 1, or (at your option)
// any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details. A copy of the GNU 
// General Public License can be obtained from the 
// Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
rng         = (bounds(:,2)-bounds(:,1))';  // The variable ranges'
numArranges     = rng + 1; 		          // Number of each arrages
cumArranges = cumsum([0 numArranges]);
xZomeLength = sum(numArranges)+1; 		  // Length of string is numVar + fit
c1=p1;
c2=p2;
for i= 1:size(numArranges,2)
    sz=numArranges(i);
    pfrom=(cumArranges(i)+1);
    pto=cumArranges(i+1);
    cut = round(rand(1)*(sz-1)+0.5); // Generate random cut point U(1,n-1)
    part1 = p1(pfrom:pto);
    part2 = p2(pfrom:pto);
    pm1=part1;
    pm2=part2;
    t = round(rand(1,sz));
    szt = sum(t);
    idx = 1:sz;
    idxt = idx(logical(t));
    plst = idxt;
    for i = 1:szt
       plst(i) = find(part2 == part1(idxt(i)));
    end
    plst = sort(plst);
    for i = 1:szt
       pm1(idxt(i)) = part2(plst(i));
    end
    szt = sz - szt;
    idxt = idx(~t);
    plst = idxt;
    for i = 1:szt
       plst(i) = find(part1 == part2(idxt(i)));
    end
    plst = sort(plst);
    for i = 1:szt
       pm2(idxt(i)) = part1(plst(i));
    end
end