Artificial Intelligence Search Methods for probl... [Link]
reviewer3@[Link] ▼
Courses » Artificial Intelligence Search Methods for problem Solving
Announcements Course Ask a Question Progress Mentor FAQ
Unit 7 - Week 5
Course outline Assignment 5
How to access the The due date for submitting this assignment has passed. Due on 2018-09-12, 23:59 IST.
portal As per our records you have not submitted this assignment.
Pre-requisite Please DO NOT ENTER ANY BLANKS. This is the assessment is evaluated by a program that does exact
Assignment string matching. Any blank in the answer will result in even a correct answer being evaluated as wrong.
Week 1 This “no blanks” policy will hold THROUGHOUT this course.
1) Which of the following statements is/are true about ‘Traveling Salesman problem’ (TSP)? 1 point
Week 2
Week 3 It is an NP-hard problem in combinatorial optimisation.
There aren’t any exact algorithms known to solve TSP therefore we use heuristic techniques.
Week 4
Ant colony optimisation can generate “good solutions” to TSP using a simulation of an ant colony.
Week 5 All of the above
Optimization II: No, the answer is incorrect.
Genetic
Score: 0
Algorithms
Accepted Answers:
Population based
It is an NP-hard problem in combinatorial optimisation.
methods for
optimization Ant colony optimisation can generate “good solutions” to TSP using a simulation of an ant colony.
Population based 2) Genetic Algorithms are 1 point
methods II
a class of algorithms that try and build solutions by introducing evolution and selection of the best in a
Quiz : Assignment
5 population of candidate solutions.
Week 5 - Methods, based on the theory of natural selection and evolutionary biology, for solving optimisation
Feedback : problems.
Artificial
Intelligence methods for genetically modifying ants to do ant colony optimisation.
Search Methods
a heuristic search method used in artificial intelligence and computing.
for problem
Solving No, the answer is incorrect.
Score: 0
Week 6
Accepted Answers:
Week 7 a class of algorithms that try and build solutions by introducing evolution and selection of the best in a
population of candidate solutions.
Week 8 Methods, based on the theory of natural selection and evolutionary biology, for solving optimisation
problems.
Week 9 a heuristic search method used in artificial intelligence and computing.
3) The phrase “survival of the fittest” is 1 point
Week 10
Week 11 Charles Darwin’s way of describing natural selection
© 2014 NPTEL - Privacy & Terms - Honor Code - FAQs -
A project of In association with
Funded by Powered by
1 of 5 Thursday 08 November 2018 04:24 PM
Artificial Intelligence Search Methods for probl... [Link]
Accepted Answers:
Charles Darwin’s way of describing natural selection
a way of describing the laws of the jungle
4) The Fitness Function in Genetic Algorithms is 1 point
method to measure how fit a candidate solution is in solving the problem.
the objective function for the optimization problem being solved.
a substitute to approximate the survival abilities of individuals in nature.
a least squares approximation for a polynomial.
No, the answer is incorrect.
Score: 0
Accepted Answers:
method to measure how fit a candidate solution is in solving the problem.
the objective function for the optimization problem being solved.
a substitute to approximate the survival abilities of individuals in nature.
5) The basic idea behind Genetic Algorithms is to work with a population 1 point
of problem solvers that interact with each other through signs.
of candidate solutions to try and create better candidates by mixing genes.
of candidate solutions in which each candidate is heuristically refined.
of problem solvers each of which does an independent heuristic search.
No, the answer is incorrect.
Score: 0
Accepted Answers:
of candidate solutions to try and create better candidates by mixing genes.
6) Which chemical is released by ants to keep track of their path? 1 point
Deoxyribonucleic acid (DNA)
Pheromone
H2O
Citric acid
No, the answer is incorrect.
Score: 0
Accepted Answers:
Pheromone
7) The basic idea behind Ant Colony Optimization algorithms is to work with a population 1 point
of problem solvers that interact with each other through signs
of candidate solutions to try and create better candidates by mixing genes.
of candidate solutions in which each candidate is heuristically refined.
of problem solvers each of which does an independent heuristic search.
No, the answer is incorrect.
Score: 0
Accepted Answers:
of problem solvers that interact with each other through signs
of problem solvers each of which does an independent heuristic search.
8) A genetic algorithm (GA) for optimization is most likely to succeed given 1 point
a small population of fit and similar individuals.
a large population of fit and similar individuals.
a small diverse population of fit individuals.
a large diverse population of fit individuals.
No, the answer is incorrect.
2 of 5 Thursday 08 November 2018 04:24 PM
Artificial Intelligence Search Methods for probl... [Link]
Score: 0
Accepted Answers:
a large diverse population of fit individuals.
9) Which of the following is/are True? 1 point
The Path Representation of the TSP candidates does not allow all permutations of the cities as candidate
tours, while the Adjacency Representation does.
In Adjacency Representation every tour has many different representations
In Path Representation every tour has many different representations.
The Adjacency Representation of the TSP candidates does not allow all permutations of the cities as
candidate tours, while the Path Representation does.
No, the answer is incorrect.
Score: 0
Accepted Answers:
In Path Representation every tour has many different representations.
The Adjacency Representation of the TSP candidates does not allow all permutations of the cities as
candidate tours, while the Path Representation does.
10)An ant in Ant Colony Optimization algorithm for TSP produces a tour by 1 point
a deterministic greedy constructive method.
a stochastic greedy constructive method.
a deterministic perturbation of the previous tour.
a stochastic perturbation of the previous tour.
No, the answer is incorrect.
Score: 0
Accepted Answers:
a stochastic greedy constructive method.
11)What is the relation between the pheromone deposited by an ant on an edge and the cost of the tour 1 point
generated by that ant in the ACO algorithm?
The pheromone deposited on each edge is directly proportional to the cost of the tour.
The pheromone deposited on each edge is inversely proportional to the cost of the tour.
The pheromone deposited on each edge is constant.
The pheromone deposited on each edge depends upon the length of that edge.
No, the answer is incorrect.
Score: 0
Accepted Answers:
The pheromone deposited on each edge is inversely proportional to the cost of the tour.
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.
12)What are the offspring tours generated by Partially Mapped Crossover (PMX) when the cuts are made after
the 2nd and 5th cities, as illustrated in bold above? If the two answer tours are (1,2,3,4) AND (2,3,1,4) then
enter 1234,2314 as answer
No, the answer is incorrect.
Score: 0
Accepted Answers:
(Type: String) 13564278,15236487
(Type: String) 15236487,13564278
1 point
13)What are the offspring tours generated by Partially Mapped Crossover (PMX) between P1 and P2 given above
when the cuts are made after the 2nd and 6th cities? If the two answer tours are (1,2,3,4) AND (2,3,1,4)
3 of 5 Thursday 08 November 2018 04:24 PM
Artificial Intelligence Search Methods for probl... [Link]
then enter 1234,2314 as answer
No, the answer is incorrect.
Score: 0
Accepted Answers:
(Type: String) 12564378,14236587
(Type: String) 14236587,12564378
1 point
14)What are the offspring tours generated by Order Crossover (OX) between P1 and P2 given above when the
cuts are made after the 2nd and 5th cities?
No, the answer is incorrect.
Score: 0
Accepted Answers:
(Type: String) 56412378,23615487
(Type: String) 23615487,56412378
1 point
15)
No, the answer is incorrect.
Score: 0
Accepted Answers:
(Type: String) 4,3,6,2,7,5,8,1
1 point
16)Given the reference vector R=(A,B,C,D,E,F,G,H), what is the ordinal representation for the tour
(A,D,B,C,F,E,G,H)? Answer should be comma separated list of cities, for ex., 1,2,3,4
No, the answer is incorrect.
Score: 0
Accepted Answers:
(Type: String) 1,3,1,1,2,1,1,1
1 point
Previous Page End
4 of 5 Thursday 08 November 2018 04:24 PM
Artificial Intelligence Search Methods for probl... [Link]
5 of 5 Thursday 08 November 2018 04:24 PM