- #1

- 462

- 11

I have a random array which represents method calls. For instance: [3, 4, 7, 40, 39, .....] meaning that method 0 is called 3 times, method 1 is called 4 times, method 2 is called 7 times, method 3 is called 40 times, method 4 is called 39 times and so on upto n. Now consider a module as a collection of random methods from 1-5 and there are 20 such modules. Find out a module whose execution causes exercising maximum number of method calls with minimum number of method.

I have applied the genetic algorithm without considering the binary values and I have obtained the module which can have maximum method calls with minimum number of methods. The steps of my algorithm are:

Initial population Fitness function Selection

However, I have not applied the other two steps i.e. crossover and mutation. Some body please guide me how to apply these two steps in my algorithm. Also I am not using binary values. How to incorporate binary values in the data? Some body please guide me.

Zulfi.