Question: 12. A given implementation of an Evolutionary Algorithm for the travelling salesman problem is using char representation, each city represented by a letter. Given the

 12. A given implementation of an Evolutionary Algorithm for the travelling

12. A given implementation of an Evolutionary Algorithm for the travelling salesman problem is using char representation, each city represented by a letter. Given the two parents [a bcdefg] and [c abfeg d], (a) which of the following offspring can be created by two-point crossover? [2 marks] 1. [a bbfefd] 2. [abbfefg] 3. [cacdeg d] 4. [abcdefg] (b) Are the offspring feasible solutions? Explain. [3 marks]

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!