A

MINI PROJECT REPORT ON

“Genetic Algorithm”

SUBMITTED TO THE SAVITRIBAI PHULE PUNE UNIVERSITY, PUNE.

FOR

LAB PRACTICE III (MACHINE LEARNING)

BACHELOR OF ENGINEERING (COMPUTER ENGINEERING)

SUBMITTED BY

Kumar Anish B172141

Vighnesh Harihar B172142

Vrushali Khatane B172160

DEPARTMENT OF COMPUTER ENGINEERING

D.Y.PATIL COLLEGE OF ENGINEERING AKURDI, PUNE-44.

SAVITRIBAI PHULE PUNE UNIVERSITY, 2020-21.

 INDEX

1. Title: 3

2.Problem Definition: 3

3.Objectives and Scope: 3

4.Motivation of Project: 3

5.Software Requirements: 4

6.Hardware Requirement: 4

7.Abstract: 4

8.Theory: 4

9. Advantages of GA: 8

10. Limitations of GA: 8

11.Results: 9

12.Conclusion: 11

13.Reference 11
Title:

Genetic Algorithm.

Problem Statement:

Apply the Genetic Algorithm for optimization on a dataset obtained

from UCI ML repository. For Example: IRIS Dataset or Travelling

Salesman Problem or KDD Dataset.

Objective and Scope :

● To understand the Genetic Algorithm.

● To understand the Fitness function.

● To understand different parent selection techniques.

Motivation of Project:

Genetic Algorithms have the ability to deliver a “good-enough” solution

“fast-enough”. This makes genetic algorithms attractive for use in

solving optimization problems. The reasons why GAs are needed are as

follows −

● Solving Difficult Problems

● Failure of Gradient Based Methods

● Getting a Good Solution Fast

 Software Requirements:

Anaconda with Python 3.7

Hardware Requirement:
2GB RAM, 500 GB HDD.

Abstract:

The main objective of this project is to apply the Genetic Algorithm for

optimization on a dataset obtained from UCI ML repository. Genetic

Algorithm (GA) is a search-based optimization technique based on the

principles of Genetics and Natural Selection. It is frequently used to find

optimal or near-optimal solutions to difficult problems which otherwise

would take a lifetime to solve. It is frequently used to solve optimization

problems, in research, and in machine learning.

Theory:

Introduction :

Optimization, also known as mathematical programming, collection of

mathematical principles and methods used for solving quantitative

problems in many disciplines, including physics, biology, engineering,

economics.
Optimization problems typically have three fundamental elements. The
first is a single numerical quantity, or objective function, that is to be
maximized or minimized. The second element is a collection of
variables, which are quantities whose values can be manipulated in
order to optimize the objective. The third element of an optimization
problem is a set of constraints, which are restrictions on the values that
the variables can take.

What is Genetic Algorithm ? :

GAs The genetic algorithm is a method for solving both constrained

and unconstrained optimization problems that is based on natural

selection, the process that drives biological evolution. The genetic

algorithm repeatedly modifies a population of individual solutions. At

each step, the genetic algorithm selects individuals at random from

the current population to be parents and uses them to produce the

children for the next generation. Over successive generations, the

population "evolves" toward an optimal solution. You can apply the

genetic algorithm to solve a variety of optimization problems that are

not well suited for standard optimization algorithms, including

problems in which the objective function is discontinuous,

nondifferentiable, stochastic, or highly nonlinear. The genetic

algorithm can address problems of mixed integer programming.

Basic Terminologies in Genetic Algorithms :

● Population - A population is an array of individuals

● Chromosomes – The term chromosome refers to a numerical

value or values that represent a candidate solution to the

problem that the genetic algorithm is trying to solve

● Gene − A gene is one element position of a chromosome.

● Allele − It is the value a gene takes for a particular chromosome.

● Genotype − Genotype is the population in the computation space.

● Phenotype − Phenotype is the population in the actual real world

solution space in which solutions are represented in a way they

are represented in real world situations.

● Decoding and Encoding − For simple problems, the phenotype

and genotype spaces are the same. However, in most of the

cases, the phenotype and genotype spaces are different.

Decoding is a process of transforming a solution from the

genotype to the phenotype space, while encoding is a process of

transforming from the phenotype to genotype space.

 ● Fitness Function − The fitness function is the function that the

algorithm is trying to optimize. The word “fitness” is taken from

evolutionary theory. It is used here because the fitness function

tests and quantifies how ‘fit’ each potential solution is.

● Genetic Operators − These alter the genetic composition of the

offspring. These include crossover, mutation, selection, etc.

Basic Structure of GA :
Advantages of GAs :

GAs have various advantages which have made them immensely

popular. These include −

● GA search from a population of points, not a single point.

● GA use payoff (objective function) information, not

derivatives.

● GA supports multi-objective optimization.

● GA use probabilistic transition rules, not deterministic

rules.

● GA is good for “noisy” environments.

● GA is robust w.r.t. to local minima/maxima.

● GA is easily parallelised.

● GA can operate on various representation.

● GA is stochastic.

● GA work well on mixed discrete/continuous problem.

Limitations of GAs :

Like any technique, GAs also suffer from a few limitations. These

include −

● GA implementation is still an art.

● GA requires less information about the problem, but

designing an objective function and getting the

 representation and operators right can be difficult.

● GA is computationally expensive i.e. time-

consuming.

Results :
Conclusion :

We have successfully applied the Genetic Algorithm for optimization on

a dataset obtained from UCI ML repository.

Reference :

● Sivanandam S., Deepa S. (2008) Terminologies and Operators of GA. In:

Introduction to Genetic Algorithms. Springer, Berlin, Heidelberg.
https://doi.org/10.1007/978-3-540-73190-0_3

● https://electricalvoice.com/genetic-algorithm-advantages-
disadvantages/