Hi,

I've recently read that the use of random keys in RKGA (Encoding phase) is useful for problems that require permutations of the integers and for which traditional one- or two-point crossover presents feasibility problems.

For example: Consider a 5-node TSP instance. Traditional GA encodings of TSP solutions consist of a stream of integers representing the order in which nodes are to be visited by the tour.1 But one-point crossover, for example, may result in children with some nodes visited more than once and others not visited at all.

My question is: if we don’t have a feasibility problems and our solutions are all feasible solutions so in this case is it correct to apply RKGA?

More Benmesbah Ouissem's questions See All
Similar questions and discussions