1. This question relates to section 2 Genetic Algorithm
a) Here
DNA -> channel assigned to a wireless link
Individual -> channel allocation scheme
Generation -> Group of channel allocation schemes
You start with a number of randomly generated schemes
The GA based algorithm then takes the following steps ( 2e)
Selection
Crossover
Mutation
Until no evolution
Optimal solution
Your assignment is to show numerically the steps taken by the GA based algorithm.
You can start by taking 3-4 schemes for example and then show each step of the GA based algorithm numerically. Explain each step (selection, cross-over, mutation) in detail. You can show in any way as long as each step is shown and explained numerically.
b) Pros and Cons of this algorithm? What can be improved?