You are on page 1of 4

Introduction to Soft Computing - - Unit 7 - Week 6 https://onlinecourses.nptel.ac.in/noc18_cs13/uni...

reviewer2@nptel.iitm.ac.in ▼

Courses » Introduction to Soft Computing

Announcements Course Ask a Question Progress Mentor

Unit 7 - Week 6

Course
outline
Assignment 6
The due date for submitting this assignment has passed. Due on 2018-03-21, 23:59 IST.
How to access
the portal Submitted assignment

Week 1 1) Which of the following solution is non-Pareto based a posteriori technique? 1 point

Week 2 SOEA

MOGA
Week 3
VEGA
Week 4 Lexicographic ordering

Week 5 No, the answer is incorrect.


Score: 0
Week 6 Accepted Answers:
VEGA
Lecture
26:Concept of 2) A three-objective optimizations are solved using a MOEA algorithm and a few objective vectors 1 point
domination
are listed below.
Lecture 27: (Assume all objectives are to be minimized)
Non-Pareto [3,5,10], [5,3,10], [3,10,5], [10,5,3], [10,3,5]. Which of the following is true?
based
approaches to
All are non-dominating solutions
solve MOOPs
Solution [3,5,10] dominates all other solution
Lecture 28:
Non-Pareto Solution [10,5,3] dominated by the solution [3,5,10]
based
approaches to Solution [3,10,5] dominates solution [5,3,10]
solve MOOPs
(Contd.) No, the answer is incorrect.
Score: 0
Lecture 29:
Pareto-Based Accepted Answers:
approaches to All are non-dominating solutions
solve MOOPs
3) Which of the following Pareto-based techniques to solve a MOOP follows “ranking” followed by 1 point
Lecture 30: “fitness averaging”?
Pareto-based
approaches to
solve MOOPs MOGA
(contd..)
NPGA
© 2014 NPTEL - Privacy & Terms - Honor Code - FAQs -
Quiz :
A project of NSGA In association with
Assignment 6
VEGA
Feedback for
week 6 No, the answer is incorrect.
Score: 0 Funded by
Week 6 Lecture

1 of 4 Thursday 10 May 2018 04:24 PM


Introduction to Soft Computing - - Unit 7 - Week 6 https://onlinecourses.nptel.ac.in/noc18_cs13/uni...

Material Accepted Answers:


Powered by
MOGA
Solution for
Week 6
4) Which of the following MOEA techniques follows Tournament selection strategy? 1 point
Assignment

Week 7 Lexicographic ordering.

MOGA
Week 8
NPGA
DOWNLOAD NSGA
VIDEOS
No, the answer is incorrect.
Score: 0
Accepted Answers:
NPGA

5) Niche counts of two solutions x1 and x2 are 10, 20. This means that 1 point

x1 is surrounded by more neighbors than that of x2 .

x1 is surrounded by less neighbors than that of x2 .

x1 would be less desirable to provide population diversity .

x2 would be more preferable to provide population diversity .

No, the answer is incorrect.


Score: 0
Accepted Answers:
x1 is surrounded by less neighbors than that of x2 .

6) Which of the following statement is not correct? 1 point

A set of solutions is called trade-off solutions, which lie on the Pareto optimal front.

A solution is called a trade-off solution, if it is not dominated by any other solution in the solution
space.

A front is called Pareto-optimal front on which all optimal solutions lie.

A front containing a non-dominated set of solutions obtained over an exhaustive search space is
called Pareto optimal front.

No, the answer is incorrect.


Score: 0
Accepted Answers:
A front is called Pareto-optimal front on which all optimal solutions lie.

7) In the following, only one statement is correct. Select the correct statement. 1 point

Stochastic selection with remainder supports low selection pressure.

Crowding tournament selection scheme supports low population diversity.

There is no selection scheme in NPGA.

In MOGA, Rank based selection can be applied to select parent chromosome for mating pool
creation.

No, the answer is incorrect.


Score: 0
Accepted Answers:
In MOGA, Rank based selection can be applied to select parent chromosome for mating pool creation.

2 of 4 Thursday 10 May 2018 04:24 PM


Introduction to Soft Computing - - Unit 7 - Week 6 https://onlinecourses.nptel.ac.in/noc18_cs13/uni...

8) Select the wrong statement 1 point

MOGA uses the concept of ranking whereas NSGA uses the concept of niching to assign fitness
values to parent chromosomes.

MOGA assigns different fitness values to all solution with the same rank whereas NSGA assigns
the same fitness value to all solutions belonging to the same front.

MOGA assigns the same fitness values to all solution with the same rank whereas NSGA assigns
different fitness value to all solutions belonging to the same front.

NSGA yields more accurate Pareto front than MOGA.

No, the answer is incorrect.


Score: 0
Accepted Answers:
MOGA assigns the same fitness values to all solution with the same rank whereas NSGA assigns different
fitness value to all solutions belonging to the same front.

9) To create mating pool, NSGA follows 1 point

Stochastic remainder selection

Crowding Tournament selection

Roulette wheel selection

Canonical Selection

No, the answer is incorrect.


Score: 0
Accepted Answers:
Stochastic remainder selection

10)A similarity between NPGA and NSGA is that 1 point

Both are based on the concept of ranking.

Both assign fitness values to the parent chromosomes prior to their selection for mating pool.

Both calculates niched count to maintain population diversity.

Both are computationally very expensive.

No, the answer is incorrect.


Score: 0
Accepted Answers:
Both calculates niched count to maintain population diversity.

11)If c1 and c2 are two offspring chromosomes, then according to NPGA, c1 will be preferable to 1 point
be selected for mating pool if

if c1 ’s niche count is higher than that of c2 .

if c1 ’s niche count is equal to niche count of c2 .

if c1 ’s niche count is lower than that of c2 .

None of the above

No, the answer is incorrect.


Score: 0
Accepted Answers:
if c1 ’s niche count is lower than that of c2 .

12)A priori high level information that is required in “Lexicographic ordering” is 1 point

3 of 4 Thursday 10 May 2018 04:24 PM


Introduction to Soft Computing - - Unit 7 - Week 6 https://onlinecourses.nptel.ac.in/noc18_cs13/uni...

the scalar weights of each objective function.

the descending ordering of the rank of the importance of objective functions.

independent of objective function.

None of the above

No, the answer is incorrect.


Score: 0
Accepted Answers:
the descending ordering of the rank of the importance of objective functions.

13)A solution xi is said to dominate another solution xj if 1 point

xj is worse than xi and xi is strictly better than xj .

xi is no worse than xj and xi is strictly better than xj in at least one objective.

xj is no worse than xi and xi is lesser than xj in at least one objective.

xj is worse than xi and xi is lesser than xj in at least one objective.


No, the answer is incorrect.
Score: 0
Accepted Answers:
xi is no worse than xj and xi is strictly better than xj in at least one objective.

Previous Page End

4 of 4 Thursday 10 May 2018 04:24 PM