could you please me the solution on below problem . please find the below attached document

 

Genetic Algorithm(GA)We can represent the solutions of many problems by a sequence. GA can be used to find approximate solutions for them using limited amountof time. If we need an exact/perfect solution (not an approximate one that serves our purpose), then GA is not the right algorithm.Example steps of simplified GA are:StepsExample1. Randomly generate few solutions (genes)A=001110101000, B=101100111010, C=001010101111, D=1000101010012. Check which of them is the best and select itLets assume, C=001010101111 is the best3. If the selected gene offers acceptable solution TERMINATE the algorithm,else, name the selected gene as “C” and CREATE two new genes C1 and C2from C by flipping one or more bits (in C) from 1 to 0 or 0 to 1; this operation isknown asmutationFrom C=001010101111 we can find the following using mutationC1=101010101111 (1stbit mutated) and C2=001010101110 (last bit mutated)4. (a) If both of the new genes (C1 and C2) are better than C , then swap equal-length segments between them; this operation is known ascross-overSelect the best among C1, C2, C1’ and C2’ and go to Step 3(a) C1’=101010101110C2’=001010101111 (the last 6 bits are swapped)4(b) If one of the new genes is better than C and other is not, then select thebetter one and go to step 3.4(c) If none of the new genes are better than C, then C is still theselectedgene. Go to step 3.

Attachments:

• 1496041276-DSS Assignment 1.pdf