NAME:- SUJEET KUMAR MEHTA

ROLLNO:- ECE/17/02

DATE:- 25/05/20

SUB.:- SOFT COMPUTING

Assignment 4
1. Explain the following:
i) Generalized Modus Ponen (GMP)
ii) Generalized Modus Tollen (GMT)
Ans:-

2. Explain Mamdani Fuzzy system

Ans:- The Mamdani fuzzy inference system was proposed as the first attempt to control a steam
engine and boiler combination by a set of linguistic control rules obtained from experienced human
operators. Figure 1 is an illustration of how a two-rule Mamdani fuzzy inference system derives the
overall output z when subjected to two crisp inputs x and y.

Figure 1: The Mamdani fuzzy inference system using min and max for T-norm and T-conorm
operators, respectively
If we adopt max and algebraic product as our choice for the T-norm and T-conorm operators,
respectively, and use max-product composition instead of the original max-min composition, then the
resulting fuzzy reasoning is shown in Figure2, where the inferred output of each rule is a fuzzy set
scaled down by its firing strength via algebraic product. Although this type of fuzzy reasoning was not
employed in Mamdani's original paper, it has often been used in the literature. Other variations are
possible if we use different T-norm and T-conorm operators.

Figure 2: The Mamdani fuzzy inference system using product and max for T-norm and T-conorm
operators, respectively
In Mamdani's application [1], two fuzzy inference systems were used as two controllers to generate
the heat input to the boiler and throttle opening of the engine cylinder, respectively, to regulate the
steam pressure in the boiler and the speed of the engine. Since the plant takes only crisp values as
inputs, we have to use a defuzzifier to convert a fuzzy set to a crisp value.
3. Give different chromosome representation techniques in Genetic Algorithm
Ans:- In genetic algorithms, a chromosome (also sometimes called a genotype) 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.[1] The chromosome is often represented as a binary string, although a wide variety of
other data structures are also used.

1: binary representation

Suppose the problem is to find the integer value of between 0 and 255 that provides the maximal result

for . The possible solutions for this problem are the integers from 0 to 255, which can all be represented
as 8-digit binary strings. Thus, we might use an 8-digit binary string as our chromosome. If a given
chromosome in the population represents the value 155, its chromosome would be 10011011 .
Note that this is not the type of problem that is normally solved by a genetic algorithm, since it can be trivially
solved using numeric methods; it is only used to serve as a simple example.

2: string representation
A more realistic problem we might wish to solve is the travelling salesman problem. In this problem, we seek
an ordered list of cities that results in the shortest trip for the salesman to travel. Suppose there are six cities,
which we'll call A, B, C, D, E, and F. A good design for our chromosome might be the ordered list we want to
try. An example chromosome we might encounter in the population might be DFABEC .

4. Give different Mutation techniques in Genetic Algorithm

Ans:- 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. Mutation alters one or
more gene values in a chromosome from its initial state. In mutation, the solution may change entirely from
the previous solution. Hence GA can come to a better solution by using mutation. Mutation occurs during
evolution according to a user-definable mutation probability. This probability should be set low. If it is set too
high, the search will turn into a primitive random search.
For different genome types, different mutation types are suitable:

• Bit string mutation

The mutation of bit strings ensue through bit flips at random positions.
Example:
1010010
↓
1010110

The probability of a mutation of a bit is , where is the length of the binary vector. Thus, a

mutation rate of per mutation and individual selected for mutation is reached.

• Flip Bit
This mutation operator takes the chosen genome and inverts the bits (i.e. if the genome bit is 1, it is
changed to 0 and vice versa).

• Boundary
This mutation operator replaces the genome with either lower or upper bound randomly. This can be used
for integer and float genes.

• Non-Uniform
The probability that amount of mutation will go to 0 with the next generation is increased by using non-
uniform mutation operator. It keeps the population from stagnating in the early stages of the evolution. It
tunes solution in later stages of evolution. This mutation operator can only be used for integer and float
genes.

• Uniform
This operator replaces the value of the chosen gene with a uniform random value selected between the
user-specified upper and lower bounds for that gene. This mutation operator can only be used for integer
and float genes.

• Gaussian
This operator adds a unit Gaussian distributed random value to the chosen gene. If it falls outside of the
user-specified lower or upper bounds for that gene, the new gene value is clipped. This mutation operator
can only be used for integer and float genes.

• Shrink
This operator adds a random number taken from a Gaussian distribution with mean equal to the original
value of each decision variable characterizing the entry parent vector. [2]