Dear Students,

The topics belonging to Module III of the Course ME6111D has been listed below.

The third module introduces a few soft computing approaches. Soft Computing is an emerging approach to
computing, which matches the remarkable ability of the human mind to reason and learn in an environment of
uncertainty and imprecision. Soft computing is a collection of computing tools and techniques, shared by closely
related disciplines that include fuzzy logic, artificial neural nets, genetic algorithms, swarm intelligence
techniques etc. These tools are used independently as well as jointly depending on the type of the domain of
applications in AI.

With respect to this module, the topics are divided among the students as a part of an assignment.

This is NOT a GROUP Assignment/Task.

Please find the topic assigned against your name.

For the assigned topic, prepare a study material (as a word document). There must be a good introduction
about the topic and an illustrative example(s) for the concept.

For example, if your topic is to prepare an overview of Ant Colony Optimization,

 You must introduce the idea behind this optimization mechanism (concept of ant colony in search of
food, from nest to food source, method of communication using pheromone etc.).
 Explain the steps involved in solving a problem using this optimization meta-heuristic.
 Take an example problem and solve the problem using the method/concept introduced.

First of all, please write down the topics in your notebook/sheets of paper and then start typing (after re-opening,
you will be asked to submit the notebook/sheets of paper used for preparation for scrutiny and evaluation).
(This will avoid usual copy and paste syndrome - PLEASE DONOT COPY & PASTE all the available
material in the Internet)

The study material is expected to contain about 10-15 pages. Please refer Journal articles, Book
Chapter materials, online materials available for reference.

The prepared word document (not pdf) must be uploaded in your moodle account on or before 22 April 2020,
Wednesday, 05.00 p.m.

Same topic has been given to 3-4 students doesn’t mean that it is a GROUP assignment. This is an Individual
TASK. Everyone must prepare a unique document. The similarity index will be checked and appropriate
correction will be called for.

Each student must prepare a document for the topic assigned.

Finally, a consolidation of the material can be done with different examples and can be used as a study material
by all for this module.

Sl. Roll No. Name of the Student Topic for preparing a study material as a word document.
No.
1 M190136ME ABIJITH KP  An overview of Genetic Algorithm
 Illustrative example to solve a well-known problem
 Pseudo-code for the algorithm
 Present a code for solving the above problem in
Python.
2 M190613ME A B SUJITH KUMAR  An overview of Particle Swarm Intelligence
 Illustrative example to solve a well-known problem
 Pseudo-code for the algorithm
 Present a code for solving the above problem in
Python.
3 M190280ME ALOK KUMAR SINGH  An overview of Tabu Search
 Illustrative example to solve a well-known problem
 Pseudo-code for the algorithm
 Present a code for solving the above problem in
Python.
4 M190408ME ANOJ J  An overview of Ant Colony Optimization
 Illustrative example to solve a well-known problem
 Pseudo-code for the algorithm
 Present a code for solving the above problem in
Python.
5 M190432ME BATTU ANUDEEP  An overview of Hill Climbing heuristic
 An illustrative example to solve (i) 8-puzzle
problem and (ii) shortest path problem
 Pseudo-code for the algorithm
 Present a code for the above problems in Python.
6 M190100ME DEEPAK SAMAL  An overview of Scatter Search
 Illustrative example to solve a well-known problem
 Pseudo-code for the algorithm
 Present a code for solving the above problem in
Python.
7 M190507ME JAZEEL AHAMED E A  An overview of Ant Colony Optimization
 Illustrative example to solve a well-known problem
 Pseudo-code for the algorithm
 Present a code for solving the above problem in
Python.
8 M190098ME K VISHVAJIT  An overview of Genetic Algorithm
SURESH  Illustrative example to solve a well-known problem
 Pseudo-code for the algorithm
 Present a code for solving the above problem in
Python.
9 M190642ME MAHANTESH  An overview of Tabu Search
MALLAPPA S.  Illustrative example to solve a well-known problem
 Pseudo-code for the algorithm
 Present a code for solving the above problem in
Python.
10 M190639ME MEKALA NIKHIL  An overview of Genetic Algorithm
 Illustrative example to solve a well-known problem
 Pseudo-code for the algorithm
 Present a code for solving the above problem in
Python.
11 M190520ME MOHAMED SHAYEEZ  An overview of Ant Colony Optimization
 Illustrative example to solve a well-known problem
 Pseudo-code for the algorithm
 Present a code for solving the above problem in
Python.
12 M190069ME MOHIT PAL SINGH  An overview of Particle Swarm Intelligence
 Illustrative example to solve a well-known problem
 Pseudo-code for the algorithm
 Present a code for solving the above problem in
Python.
13 M190047ME OBAIDULLAH Case based reasoning systems
 What is CBR?
 Why CBR?
 Retrieve/Reuse/Store
 Illustrative example for the concept
14 M190614ME PULAK PATTANAIK  An overview of Tabu Search
 Illustrative example to solve a well-known problem
 Pseudo-code for the algorithm
 Present a code for solving the above problem in
Python.
15 M190225ME PUPPALA SRIDHAR Case based reasoning systems
 What is CBR?
 Why CBR?
 Retrieve/Reuse/Store
 Illustrative example for the concept
16 M190559ME RANDHIR KUMAR  An overview of Scatter Search
 Illustrative example to solve a well-known problem
 Pseudo-code for the algorithm
 Present a code for solving the above problem in
Python.
17 M190193ME SARTHAK GOYAL  An overview of Particle Swarm Intelligence
 Illustrative example to solve a well-known problem
 Pseudo-code for the algorithm
 Present a code for solving the above problem in
Python.
18 M190194ME SAURABH PANDEY  An overview of Hill Climbing heuristic
 An illustrative example to solve (i) 8-puzzle
problem and (ii) shortest path problem
 Pseudo-code for the algorithm
 Present a code for the above problems in Python.
19 M190631ME SAURAV ADHIKARI Case based reasoning systems
 What is CBR?
 Why CBR?
 Retrieve/Reuse/Store
 Illustrative example for the concept
20 M190284ME SHINO SAMUEL  An overview of Particle Swarm Intelligence
 Illustrative example to solve a well-known problem
 Pseudo-code for the algorithm
 Present a code for solving the above problem in
Python.
21 M190605ME VARUN M Case based reasoning systems
 What is CBR?
 Why CBR?
 Retrieve/Reuse/Store
 Illustrative example for the concept
22 M190485ME VIVEK KUMAR N  An overview of Scatter Search
 Illustrative example to solve a well-known problem
 Pseudo-code for the algorithm
 Present a code for solving the above problem in
Python.
23 M190125EE AMAL N N  What are Artificial Neural Networks (ANNs)?
 Basic Structure of ANNs
 Types of Artificial Neural Networks
 Working of ANNs
 Back Propagation Algorithm
 Bayesian Networks (BN)
 Building a Bayesian Network
 An illustrative example (please note the example
must be self-explanatory)
24 M190536EE AMAN TRIPATHI  What are Artificial Neural Networks (ANNs)?
 Basic Structure of ANNs
 Types of Artificial Neural Networks
 Working of ANNs
 Back Propagation Algorithm
 Bayesian Networks (BN)
 Building a Bayesian Network
 An illustrative example (please note the example
must be self-explanatory)
25 M190506EE ARAVIND H S  What are Artificial Neural Networks (ANNs)?
 Basic Structure of ANNs
 Types of Artificial Neural Networks
 Working of ANNs
 Back Propagation Algorithm
 Bayesian Networks (BN)
 Building a Bayesian Network
 An illustrative example (please note the example
must be self-explanatory)
26 M190453EE ARAVIND S  What is Fuzzy Logic?
 Why Fuzzy Logic?
 Fuzzy Logic Systems Architecture
 Membership functions
 An illustrative example for a fuzzy logic system
(please note the example must be self-explanatory)
27 M190588EE DAVID MATHEW  What is Fuzzy Logic?
JONES  Why Fuzzy Logic?
 Fuzzy Logic Systems Architecture
 Membership functions
 An illustrative example for a fuzzy logic system
(please note the example must be self-explanatory)
28 P190060ME GIRIDHAR M P  What are Artificial Neural Networks (ANNs)?
 Basic Structure of ANNs
 Types of Artificial Neural Networks
 Working of ANNs
 Back Propagation Algorithm
 Bayesian Networks (BN)
 Building a Bayesian Network
 An illustrative example (please note the example
must be self-explanatory)
 29 P190065ME MEBY MATHEW  What are Artificial Neural Networks (ANNs)?
 Basic Structure of ANNs
 Types of Artificial Neural Networks
 Working of ANNs
 Back Propagation Algorithm
 Bayesian Networks (BN)
 Building a Bayesian Network
 An illustrative example (please note the example
must be self-explanatory)
30 P190112ME NAVIN MATHEW  What are general uninformed search strategies?
 Explain search Algorithms:
(1) Breadth-first search
(2) Uniform-cost search
(3) Depth-first search
(4) Iterative deepening search
 An illustrative example (please note the examples
must be self-explanatory)
31 P190119ME PRAMOD A  What is Fuzzy Logic?
 Why Fuzzy Logic?
 Fuzzy Logic Systems Architecture
 Membership functions
 An illustrative example for a fuzzy logic system
(please note the example must be self-explanatory)
32 P190062ME RANJIT B NAIR  What are general uninformed search strategies?
 Explain search Algorithms:
(1) Breadth-first search
(2) Uniform-cost search
(3) Depth-first search
(4) Iterative deepening search
 An illustrative example (please note the examples
must be self-explanatory)
33 P190153ME VIJAY S  What is Fuzzy Logic?
 Why Fuzzy Logic?
 Fuzzy Logic Systems Architecture
 Membership functions
 An illustrative example for a fuzzy logic system
(please note the example must be self-explanatory)

Well-known problems that can be used for solving as an Illustrative example are as follows:

1. Travelling salesman problem/Shortest path problem