parent1= 0 0 0 0 1 0 0 1 and parent2=0 0 0 0 1 1 0 0 and i have another parent 1 to 50 element and i want swap 7 and 8th raw

parent 1 :0 0 0 0 1 0 0 1

parent 2: 0 0 0 0 1 1 0 0

swap 7 & 8 element of both1 and create new one

child 1: 0 0 0 0 1 0 0 0

child 2: 0 0 0 0 1 1 0 1

parent 1 & 2 create child 1& 2 same like 3 and 4....5 & 6...done further process in for loop for 1 to 50 all parent and child are in 8 bit digit but here consider as 1*8 matrix or array of 8 entry

child2=parent(1,:);

child2(swapping)=parent(4,:)(swapping);

i tried this but here 'parent(4,:)(swapping)' part create error

Answer 1

[Guillaume]

Don't number variables. It's going to give you problems later on.

You can't chain indexing. What you mean by

 p(2, :)(end)

is actually

 p(2, end)

So, for your example:

parent = [0 0 0 0 1 0 0 1;
          0 0 0 0 1 1 0 0]
child = parent;
swappedcolumns = [7 8];
child([1 2], swappedcolumns) = child([2 1], swappedcolumns)

Notice that the order of the rows has been reversed in the assignment in order to swap the swappedcolumns of row 1 and 2.

One way to swap all even and odd rows:

parent = randi([0 1], 50, 8)  %demo data
swappedcolumns = [7 8];

child = parent;
swapoddeven = reshape([2:2:size(parent, 1); 1:2:size(parent, 1)], 1, []); %create vector of [2 1 4 3 6 5 ...]
child(swapoddeven, swappedcolumns) = child(1:size(parent, 1), swappedcolumns)

No loop needed

[Pratik Anandpara]

wonderfull sir thanx a lot i need this exact

[Pratik Anandpara]

after this i process i got child matrix

     x     y     z
     1     2     6 =9 valid
     6     2     1 =9 valid
     2     1     4 =7 not valid
     2     1     1 =4 not valid
     6     2     8 =16 not valid
     1     7     8 =16 not valid

i want only that child which strickly follow X+Y+Z=9 if not follow than doing process one more time with other element,

[Pratik Anandpara]

my code uptill now...@Guillaume i want to find minumum value of [(X(-0.33).^2+(Y-0.33).^2+(Z-0.33).^2] this function where X+Y+Z=9 with genetic algorithm

x = 0:9 ;

y=x ;

z = x ;

[X,Y,Z] = ndgrid(x,y,z) ;

thesum = X+Y+Z ;

idx = thesum==9 ;

iwant = [X(idx) Y(idx) Z(idx)];

eq1=[(X(idx)-0.33).^2+(Y(idx)-0.33).^2+(Z(idx)-0.33).^2] ;

[p,q]=min(eq1);

iwant(q,:);

dec2bin(iwant)';

de2bi(iwant(1,:));

for i=1:6

c(i)=1+round(rand*54);

el=iwant(c(i),:);

entry(i,:)=[el];

de2bi(el,8);

totalfx0(i,:)=eq1(c(i),:) ;

lowest(i,:)=min(totalfx0(i,:)) ;

finaltotalfx=sum(totalfx0) ;

end

bins=fliplr(de2bi(entry(:,:),8));

swappedcolumns = [7 8];

child = bins;

swapoddeven = reshape([2:2:size(bins, 1); 1:2:size(bins, 1)], 1, []);

child(swapoddeven, swappedcolumns) = child(1:size(bins,

1),swappedcolumns);

bincon=bi2de(fliplr(child(:,:)));

cross1=reshape(bincon,6,3)

[Guillaume]

Your comment is completely unreadable. Please, get rid of all these blank lines between each line of code and use the {}Code button to format your code instead.

It does not make people to want to help you when you accept their answer and then unaccept it when it does not answer a completely different question that you ask in the comments.

I recommend that you reaccept the answer and ask your new question in a completely new post, linking this question and the one where you must have had the first part of your code.

[Pratik Anandpara]

sorry sir not intense to unaccept behind this i repost question http://in.mathworks.com/matlabcentral/answers/316851-i-want-only-that-child-which-strickly-follow-x-y-z-9-if-not-follow-than-doing-process-one-more-time

Answer 2

[KSSV]

p1 =  [0 0 0 0 1 0 0 1] ;
p2= [0 0 0 0 1 1 0 0] ;
c1 = p1 ;
c2 = p2 ;
c1(end) = p2(end) ;
c2(end) = p1(end) ;

[Pratik Anandpara]

i take this p1 p2 from parent matrix if i use

c1 = p(1,:) ;

c2 = p(2,:) ;

c1(end) = p(2,:)(end) ;

c2(end) = p(1,:)(end) ;

than not working each time not possible to define

pa1=p(1,:)..pa2=p(2,:)

[Pratik Anandpara]

my code uptill now...@Guillaume i want to find minumum value of [(X(-0.33).^2+(Y-0.33).^2+(Z-0.33).^2] this function where X+Y+Z=9 with genetic algorithm

x = 0:9 ;

y=x ;

z = x ;

[X,Y,Z] = ndgrid(x,y,z) ;

thesum = X+Y+Z ;

idx = thesum==9 ;

iwant = [X(idx) Y(idx) Z(idx)];

eq1=[(X(idx)-0.33).^2+(Y(idx)-0.33).^2+(Z(idx)-0.33).^2] ;

[p,q]=min(eq1);

iwant(q,:);

dec2bin(iwant)';

de2bi(iwant(1,:));

for i=1:6

c(i)=1+round(rand*54);

el=iwant(c(i),:);

entry(i,:)=[el];

de2bi(el,8);

totalfx0(i,:)=eq1(c(i),:) ;

lowest(i,:)=min(totalfx0(i,:)) ;

finaltotalfx=sum(totalfx0) ;

end

bins=fliplr(de2bi(entry(:,:),8));

swappedcolumns = [7 8];

child = bins;

swapoddeven = reshape([2:2:size(bins, 1); 1:2:size(bins, 1)], 1, []);

child(swapoddeven, swappedcolumns) = child(1:size(bins,

1),swappedcolumns);

bincon=bi2de(fliplr(child(:,:)));

cross1=reshape(bincon,6,3)