Major Project Report

On
ANALYSIS OF BEST HEAURSTIC SEARCH ALGORITHM
Submitted to
Amity University Uttar Pradesh

In partial fulfillment of the requirements for the award of degree

Bachelor of Technology
In
Computer Science & Engineering
Submitted By
Aishwarya Gupta
A2324711007
8CSE6, B.Tech - CSE+MBA
Under the guidance of
Rishi Kumar
Assistant Professor
Department of Computer Science
Amity School of Engineering and Technology
Amity University Uttar Pradesh

ACKNOWLEDGEMENT
I, Aishwarya Gupta student of B.Tech CSE + MBA(2011-16) hereby declare that the project
titled Analysis of Best Heuristic Search Algorithm which is submitted by me to
Department of Computer Science, Amity School of Engineering and Technology, Amity
University Uttar Pradesh, in partial fulfillment of requirement for the award of the degree of
Bachelor of Technology in Computer Science and Engineering, has not been previously
formed the basis for the award of any degree, diploma or other similar title or recognition.

Aishwarya Gupta
Dated: 10-05-15

CERTIFICATE
On the basis of declaration submitted by Aishwarya Gupta, student of B.Tech CSE + MBA,
I hereby certify that the project titled Analysis of Best Heuristic Search Algorithm which
is submitted to Department of Computer Science, Amity School of Engineering and
Technology, Amity University Uttar Pradesh, in partial fulfillment of the requirement for the
award of the degree of Bachelor of Technology in Computer Science & Engineering, is an
original contribution with existing knowledge and faithful record of work carried out by her
under my guidance and supervision. To the best of my knowledge this work has not been
submitted in part or full for any Degree or Diploma to this University or elsewhere.

Mr. Rishi Kumar

Assistant Professor
Dept. Of Computer Science
ASET
Amity University Uttar Pradesh

ABSTRACT
Heuristic is a technique designed for solving a problem more quickly when classic methods are
too slow, or for finding an approximate solution when classic methods fail to find any exact
solution. This is achieved by trading optimality, completeness, accuracy, or precision for
speed. Metaheuristics, reduce the explored space using a far simpler strategy: to restrict the
search to the space of job permutations. Multiprocessor task scheduling is an important and
computationally difficult problem. The idea is to find a permutation of the n jobs and build a
schedule by assigning jobs onto the machines according to this ordering. The well the task be
distributed among the processors the well be the performance. Finding the optimal solution of
scheduling the tasks into the processors is NP-complete, that is, it will take a lot of time to find
the optimal solution. The problem of selecting the best heuristic algorithm when several of them
exist, is a prediction problem. Based on experimental results, a detailed analysis of the
scalability, advantages and disadvantages of each algorithm is presented.

TABLE OF CONTENTS
Acknowledgement
Certificate
Abstract
1. Introduction
1.1 Heuristic
1.2 Scheduling
1.3 Project Goals and Objectives

1
1
2
5

2. Literature Review
2.1 Metaheuristics
2.1.1 Genetic Algorithm
2.1.2 Simulated Annealing
2.2 Problems Taken
2.2.1 Multiprocessor Scheduling
2.2.2 Travelling Salesman Problem

6
6
7
11
14
14
15

3. Project Design and Implementation

3.1 Solving Multiprocessor Scheduling Problem
3.1.1 Simulated Annealing
3.1.2 Genetic Algorithm
3.2 Solving Travelling Salesman Problem
3.2.1 Genetic Algorithm
3.2.2 Simulate Annealing

18
18
18
19
20
20
21

4. Experimentation
4.1 Software Requirements
4.2 Implementing Multiprocessor Scheduling
4.2.1 Simulated Annealing
4.2.2 Genetic Algorithm
4.3 Implementing Travelling Salesman Problem
4.3.1 Genetic Algorithm

22
22
22
22
23
24
24

5. Results

26

6. Conclusions and Future Prospects

28

8. References

31

Appendix
A. Plagiarism Report

33