Artificial Intelligence MCQ - Genetic Algorithms
- A The Path Representation of the TSP candidates does not allow all permutations of the cities as candidate tours, while the Adjacency Representation does.
- B In Adjacency Representation every tour has many different representations
- C In Path Representation every tour has many different representations.
- D The Adjacency Representation of the TSP candidates does not allow all permutations of the cities as candidate tours, while the Path Representation does.
- A The pheromone deposited on each edge is directly proportional to the cost of the tour.
- B The pheromone deposited on each edge is inversely proportional to the cost of the tour.
- C The pheromone deposited on each edge is constant.
- D The pheromone deposited on each edge depends upon the length of that edge.
Consider two tours P1 = (1,2,5,6,4,3,8,7) and P2 = (1,4,2,3,6,5,7,8) generated by
an instance of the Genetic Algorithm for the traveling Salesman Problem. Both P1
and P2 are expressed in path representation.
