Assignment No.

1. Differentiate fuzzy set and crisp set.

S.No  Crisp Set Fuzzy Set

Fuzzy set defines the value

Crisp set defines the between 0 and 1 including both
1 value is either 0 or 1. 0 and 1.

It is also called a It specifies the degree to which

2 classical set. something is true.

It shows full
3 membership  It shows partial membership.

Eg1. She is 18 years

old. Eg1. She is about 18 years old.
4 Eg2. Rahul is 1.6m tall Eg2. Rahul is about 1.6m tall.   

Crisp set application Fuzzy set used in the fuzzy

5 used for digital design. controller.

It is bi-valued function It is infinite valued function

6 logic. logic
 2. Describe membership function.

Membership functions can be defined as a technique to

solve practical problems by experience rather than
knowledge. Membership functions are represented by
graphical forms.

Features of Membership Functions:

Core
For any fuzzy set A˜A~, the core of a membership function is
that region of universe that is characterize by full membership
in the set. Hence, core consists of all those elements yy of the
universe of information such that,
μA˜(y)=1
Support
For any fuzzy set A˜A~, the support of a membership function
is the region of universe that is characterize by a nonzero
membership in the set. Hence core consists of all those
elements yy of the universe of information such that,
μA˜(y)>0
 3. Give the properties of fuzzy set.
Commutative Property
Having two fuzzy sets A˜A~ and B˜B~, this property states −
A˜∪B˜=B˜∪A˜A~∪B~=B~∪A~
A˜∩B˜=B˜∩A˜

Distributive Property
Having three fuzzy sets A˜A~, B˜B~ and C˜C~, this property states −
A˜∪(B˜∩C˜)=(A˜∪B˜)∩(A˜∪C˜)A~∪(B~∩C~)=(A~∪B~)∩(A~∪C~)
A˜∩(B˜∪C˜)=(A˜∩B˜)∪(A˜∩C˜)

Idempotency Property
For any fuzzy set A˜A~, this property states −
A˜∪A˜=A˜A~∪A~=A~Identity Property
For fuzzy set A˜A~ and universal set UU, this property states −
A˜∪φ=A˜A~∪φ=A~
A˜∩U=A˜A~∩U=A~
A˜∩φ=φA~∩φ=φ
A˜∪U=U

Transitive Property
Having three fuzzy sets A˜A~, B˜B~ and C˜C~, this property states −
IfA˜⊆B˜⊆C˜,thenA˜⊆C˜
 4. Explain the various operations on fuzzy relations.
Operations on Fuzzy Set: 
1. Union :
Consider 2 Fuzzy Sets denoted by A and  B, then let’s consider
Y be the Union of them, then for every member of  A and  B, Y
will be:
degree_of_membership(Y)=max(degree_of_membership(A),
degree_of_membership(B))

2. Intersection :
Consider 2 Fuzzy Sets denoted by A and  B, then let’s consider
Y be the Intersection of them, then for every member of  A and
B, Y will be:
degree_of_membership(Y)= min(degree_of_membership(A),
degree_of_membership(B))

3. Complement :
Consider a Fuzzy Sets denoted by A  , then let’s consider Y be
the Complement of it, then for every member of  A  , Y will be:
degree_of_membership(Y)= 1 - degree_of_membership(A)

4. Difference :  
Consider 2 Fuzzy Sets denoted by A and  B, then let’s consider
Y be the Intersection of them, then for every member of  A and
B, Y will be:
degree_of_membership(Y)= min(degree_of_membership(A), 1-
degree_of_membership(B))
5. What is Defuzzification?

Defuzzification is the process of producing a quantifiable

result in crisp logic, given fuzzy sets and corresponding
membership degrees. It is the process that maps a fuzzy set
to a crisp set. It is typically needed in fuzzy
control systems. These systems will have a number of rules
that transform a number of variables into a fuzzy result,
that is, the result is described in terms of membership
in fuzzy sets. For example, rules designed to decide how
much pressure to apply might result in "Decrease Pressure
(15%), Maintain Pressure (34%), Increase Pressure (72%)".
Defuzzification is interpreting the membership degrees of
the fuzzy sets into a specific decision or real value.
 6. What do you mean by fuzzy logic? Explain fuzzy
propositions and fuzzy connectives with suitable
example.

Fuzzy logic is a form of many-valued logic in which the truth

value of variables may be any real number between 0 and 1. It is
employed to handle the concept of partial truth, where the truth
value may range between completely true and completely false.
[1]
 By contrast, in Boolean logic, the truth values of variables may
only be the integer values 0 or 1.
Fuzzy Propositions :-
Fuzzy propositions are assigned to fuzzy sets. Suppose a fuzzy
proposition ‘P’ is assigned to a fuzzy set ‘A’, then the truth value of the
proposition is proposed by T (P) = μA(x) where 0 ≤ μA(x) ≤ 1
Therefore truthness of a proposition P is membership value of x in fuzzy
set A.
The logical connectives like disjunction, conjunction, negation and
implication are also defined on fuzzy propositions.
Let, a fuzzy proposition ‘P’ is defined on a fuzzy set A
     Q is defined on fuzzy set B
Conjunction
P / Q : x is A and B
T( P / Q) = Min [ T(P), T(Q)]
Negation
T(Pc) = 1 – T(P)

Disjunction
P V Q : x in A or B
T (P V Q) = Max [ T(P), T(Q) ]

For example, suppose we have two universe of discourse X and Y

X = {1, 2, 3, 4}
Y = {1, 2, 3, 4, 5, 6}
X is the universe of normalized temperatures.
Y is the universe of normalized pressures.
Two crisp sets A and B defined on universe of discourses X and Y are
A={2, 3} ; B={3,4}
for the deductive inference if A and B, find the relational matrix R.
sets A and B in Zedah’s notations are given by
A = {0/1 + 1/2 + 1/3 + 0/4}
B = {0/1 + 0/2 + 1/3 + 1/4 + 0/5 + 0/6}
for the deductive inference if A then B, the set theoretic form is given by
the relation
R = (A X B) U (Ac X Y)

Fuzzy connectives:
A fundamental assumption of (mainstream) mathematical fuzzy
logic is that connectives are to be interpreted truth-
functionally over the set of degrees of truth. Such truth-
functions are assumed, in the standard setting, to behave
classically on the extremal values 0 and 1.
A very natural behavior of conjunction, disjunction, and
negation is achieved by
imposing x∧y=min{x,y}x∧y=min{x,y}, x∨y=max{x,y}x∨y=ma
x{x,y}, and ¬x=1−x¬x=1−x for each x,y∈[0,1]x,y∈[0,1].
 7. Explain the fuzzy inference with suitable example.
A fuzzy inference system is the key unit of a fuzzy logic
system. The typical structure of a fuzzy inference system
consists of various functional blocks. It uses new methods
to solve everyday problems.

A fuzzy inference system may be a computer paradigm

supported by fuzzy set theory, fuzzy if-then rules, and
fuzzy reasoning. A nonlinear mapping that derives its
output from fuzzy reasoning and a group of fuzzy if-then
rules. The mapping domain and range can be
multidimensional spaced fuzzy sets or points.

A fuzzy inference system is a system that uses a fuzzy set

theory to map inputs to outputs.

Characteristics of Fuzzy Inference system:

● The yield from FIS is consistently a fuzzy set irrespective of its input
which can be fuzzy or crisp.
● It is necessary to have a fuzzy output when it is used as a controller.
● A defuzzification unit would accompany the FIS to convert the fuzzy
variable into a crisp variable.

Fuzzy Inference System Inputs and Outputs:

● The fundamental fuzzy inference system can take either fuzzy

inputs or crisp inputs, yet the yield it produces is quite often
fuzzy sets.
● Sometimes it is important to have a crisp output, particularly in a
situation where a fuzzy inference system is utilized as a
controller.
● Therefore, we need a technique of defuzzification to extricate a
crisp value to represent a fuzzy set.
 8. What are the basic operators of genetic algorithim?

Basic operators of genetic algorithim are:

1) Selection Operator: The idea is to give preference to the

individuals with good fitness scores and allow them to pass their
genes to successive generations. 

2) Crossover Operator: This represents mating between

individuals. Two individuals are selected using selection
operator and crossover sites are chosen randomly. Then the
genes at these crossover sites are exchanged thus creating a
completely new individual (offspring).

3) Mutation Operator: The key idea is to insert random genes

in offspring to maintain the diversity in the population to avoid
premature convergence. For example:
9. Mention the role of fitness function in GA and what
are the requirements of GA.

o It is a function defined over the genetic representation

and measures the quality of the represented solution.
The fitness function is always problem dependent. 

o Equivalent to objective function,
evaluation function. 

o Quantifies the performance of particle. 

o A process which evaluates a member of a population

and gives a score or fitness. In most cases the goal is
to find an individual with the maximum (or
minimum) fitness. 

o The objective function of the GA for evaluating a

population of solutions. 

o A particular type of objective function that quantifies

the optimality of a solution in a genetic algorithm. 

o A function which maps the subjective property of

a fitness of a solution to an objective value which can
be used to arrange different solutions in the order of
their suitability as final or intermediate solution. 
 10. Describe applications of GA.
● Traveling salesman problem (TSP)
● Vehicle routing problem (VRP)
● Financial markets.
● Manufacturing system.
● Mechanical engineering design.
● Data clustering and mining.
● Image processing.
● Neural networks.
● Wireless sensor networks.
● Medical science.
11. Write short note on:
a)Boltzmann Selection
b)Steady state selection

a) Boltzmann selection

In Boltzmann selection, a continuously varying temperature

controls the rate of selection according to a preset schedule.
The temperature starts out high, which means that the
selection pressure is low. The temperature is gradually
lowered, which gradually increases the selection pressure,
thereby allowing the GA to narrow in more closely to the
best part of the search space while maintaining the
appropriate degree of diversity.
This selection method is based on entropy and importance
sampling methods in Monte Carlo simulation. It naturally
leads to adaptive fitness in which the fitness function does
not stay fixed but varies with the environment. With the
selection method, the algorithm can explore as many
configurations as possible while exploiting better
configurations, consequently helping to solve the premature
convergence problem. To test the performance of the
selection method, we use the NK-model and compared the
performances of the proposed selection scheme with those
of canonical GAs.
 b)Steady state selection
It is steady-state meaning that there are no generations. It
differs from the Simple Genetic Algorithm, as in that
tournament selection does not replace the selected
individuals in the population, and instead of adding the
children of the selected parents into the next generation,
the two best individuals out of the two parents and two
children are added back into the population so that the
population size remains constant.

Features:
● Small Generation Gap.
● Only 2 offspring produced in one generation.
● Generally used for smaller population size N.
● Less computationally expensive compared to Simple GA.
● Population size N remains constant throughout.

Applications:
● To optimize a wide range of different fit functions which is
not solvable using normal hard computing-based algorithms.
● Distributed computer network topologies.
● Learning fuzzy rule base using genetic algorithms.
● In training neural networks using SSGA instead of normal
Backprop algorithms and many more.
12. Define the terms chromosome, fitness function,
crossover and mutation as used in genetic algorithms.

● Chromosome: It is a set of parameters which define a

proposed solution to the problem that the genetic algorithm
is trying to solve. The set of all solutions is known as
the population.

● Fitness function: A fitness function is a particular type

of objective function that is used to summarise, as a
single figure of merit, how close a given design solution is
to achieving the set aims.

● Crossover: Crossover is a genetic operator used to vary the

programming of a chromosome or chromosomes from one
generation to the next. 

● Mutation: Mutation is a genetic operator used to

maintain genetic diversity from one generation of a
population of genetic algorithm chromosomes to the next.
It is analogous to biological mutation.

Submitted By:

Name: Sarvesh Muttepwar

Class: BE (B)
Roll no: 21CEBEB20
College: SKNSITS