21/05/2018 Traditional and Non-Traditional Optimization Tools - - Unit 2 - Week 1

reviewer1@nptel.iitm.ac.in ▼

Courses » Traditional and Non-Traditional Optimization Tools

Announcements Course Ask a Question Progress Mentor

Unit 2 - Week 1

Course outline Assignment 1

How to access the The due date for submitting this assignment has passed. Due on 2018-02-21, 23:59 IST.
portal
Submitted assignment
Week 1
1) Let us consider a function y = f(x) = x5 .     1 point
Lecture 1: Principle
of Optimization      At the point x = x* = 0, it has the 
Lecture 2: (a) Maximum point
Traditional Methods
(b) Minimum point
of Optimization
(c) Saddle/inflection point
Lecture 3:
Traditional Methods
(d) None of the above
of Optimization No, the answer is incorrect.
(Contd.)
Score: 0
Lecture 4: Binary- Accepted Answers:
Coded Genetic
Algorithm (BCGA)
(c) Saddle/inflection point
Lecture 5: Binary- 2) 1 point
Coded Genetic
Algorithm (BCGA)
Contd.

Lecture 6: Binary-
Coded Genetic
Algorithm (BCGA)
Contd.

Week 1 : Lecture
Material

Quiz : Assignment 1

Solution:
Assignment 1

Week 2
−0.55
Week 3 (a)   ; 2.83
{ 0.83 }

Week 4
 0.55
Week 5 (b) ; 6.50
{ −0.83 }

Week 6
;3.50
−0.22
(c)
Week 7 {  0.95 }

Week 8  0.22
(d) ; 4.57
{ −0.95 }
DOWNLOAD VIDEOS
No, the answer is incorrect.
Score: 0
Accepted Answers:

−0.55
(a)   ; 2.83
{ 0.83 }

3)To minimize y = f(x1,x2) = x12 + x22 - x1x2 - x1 + x2  in the range of -10.0≤ 0 points

x1,x2 ≤10.0 using Random walk method, let us start with the initial solution.

https://onlinecourses.nptel.ac.in/noc18_me17/unit?unit=5&assessment=72 1/5
21/05/2018 Traditional and Non-Traditional Optimization Tools - - Unit 2 - Week 1
0
.In the first iteration, search direction and optimal step length are
x1
X1 = =
[x ] [ 0]
2

found to be as follows:

−1
(a) S 1 = ; λ = 1/4
1
∗

{ 1 }

1
(b) S1 = ; λ = 1/3
1
∗

{ −1 }

−1
(c) S1 = ; λ = 1/2
1
∗

{ −1 }

1
(d) S1 =
∗
; λ = 1/5
1
{ 1}

No, the answer is incorrect.

Score: 0
Accepted Answers:
1
(b) S1 = ; λ = 1/3
1
∗

{ −1 }

4) A binary-coded genetic algorithm is to be used to solve an optimization 1 point

problem involving one integer variable and another real variable. The integer and real
variables are allowed to vary in the ranges of (0, 511) and     (0.2, 20.67),
respectively. Let us assume that a precision level of 0.01 is to be maintained for the
real variable. The number of bits to be assigned to represent the integer and the real
variables are as follows:
(a) 9,11
(b) 10,8
(c) 11,10
(d)10,12

No, the answer is incorrect.

Score: 0
Accepted Answers:
(a) 9,11

5) Let us consider random initial population of size N=4 of a binary-coded 1 point

genetic algorithm, as given below:

Let us also assume that their fitness values are nothing but their decoded values. Using Roulette-
Wheel selection, their probability values of being selected in the mating pool are found to be as
follows:
(a) 0.4,0.3, 0.1, 0.2
(b) 0.35, 0.25, 0.18, 0.22
(c) 0.18, 0.35, 0.22, 0.25
(d) 0.36, 0.15, 0.33, 0.16

No, the answer is incorrect.

Score: 0
Accepted Answers:
(d) 0.36, 0.15, 0.33, 0.16
6) Let us consider random initial population of size N=4 of a binary-coded 1 point
genetic algorithm, as given below (refer to Q5):

https://onlinecourses.nptel.ac.in/noc18_me17/unit?unit=5&assessment=72 2/5
21/05/2018 Traditional and Non-Traditional Optimization Tools - - Unit 2 - Week 1

Let us also assume that their fitness values are nothing but their decoded values
(refer to Q5). Using ranking selection, their probability values of being selected in the mating
pool are found to be as follows:
(a) 0.1, 0.2, 0.3, 0.4
(b) 0.2, 0.4, 0.1, 0.3
(c) 0.4, 0.1, 0.3, 0.2
(d) 0.3, 0.4, 0.1, 0.2

No, the answer is incorrect.

Score: 0
Accepted Answers:
(c) 0.4, 0.1, 0.3, 0.2
7) Let us consider two parents participating in single-point crossover in binary- 1 point
coded genetic algorithm.

Children solutions are found to be as follows:

(a) 0 0 1 0 1 0 1 0 1 0 1 0 0 1
             0 1 1 1 1 0 1 1 0 1 0 1 0 1
(b) 1 0 1 0 0 1 0 1 1 1 1 0 1 1
            0 1 0 1 0 1 0 0 1 0 1 0 1 0 
(c) 0 0 1 0 1 0 1 1 0 1 0 1 0 1
            0 1 1 1 1 0 1 0 1 0 1 0 0 1
(d) None of the above

No, the answer is incorrect.

Score: 0
Accepted Answers:
(b) 1 0100101111011
            0 1 0 1 0 1 0 0 1 0 1 0 1 0 
8) Let us consider two parents participating in two-point crossover in binary- 1 point
coded genetic algorithm.

Children solutions are found to be as follows:

(a) 1 0 1 0 1 0 1 0 1 1 1 1 0 1
01110001101010

(b) 01110001101010
10101010111101

(c) 0 1 1 1 0 0 1 0 1 1 1 1 0 1
10101001101010

https://onlinecourses.nptel.ac.in/noc18_me17/unit?unit=5&assessment=72 3/5
21/05/2018 Traditional and Non-Traditional Optimization Tools - - Unit 2 - Week 1

(d) 0 1 1 1 0 0 1 0 1 0 1 0 1 0
10101001111101
No, the answer is incorrect.
Score: 0
Accepted Answers:
(c) 0 1 1 1 0 0 1 0 1 1 1 1 0 1
10101001101010

9) In a string of binary-coded genetic algorithm, 10 bits are used to represent a real 1 point
variable varying in the range of (1.0, 20.0). The real value corresponding to the binary string: 1 0
1 0 1 0 1 0 1 0 is calculated as follows:
(a) 15.64
(b) 17.84
(c) 12.66
(d) 13.67

No, the answer is incorrect.

Score: 0
Accepted Answers:
(d) 13.67

10)Let us suppose that the following two parents are participating in uniform crossover: 1 point

Let us also assume that the 2nd, 4th, 6th and 8th bit-positions counting from the left-most bit have
been selected for this crossover.
Children solutions are found to be as follows:

(a) 1111000001

      1010101010

(b) 0001111000

      1111100100

(c) 1111100010

      0000101101

(d) 1010101001

      0101100110

No, the answer is incorrect.

Score: 0
Accepted Answers:
(c) 1111100010

      0000101101

Previous Page End

© 2014 NPTEL - Privacy & Terms - Honor Code - FAQs -

A project of In association with Funded by

https://onlinecourses.nptel.ac.in/noc18_me17/unit?unit=5&assessment=72 4/5
21/05/2018 Traditional and Non-Traditional Optimization Tools - - Unit 2 - Week 1

Powered by

https://onlinecourses.nptel.ac.in/noc18_me17/unit?unit=5&assessment=72 5/5