Date Approved

2018

Degree Type

Campus Only Senior Honors Thesis

Department

Computer Science

First Advisor

Suchindra Maniccam

Second Advisor

Krish Narayanan

Third Advisor

Augustine Ikeji

Abstract

The focus of this senior thesis is applying different machine learning optimization algorithms to different NP-hard problems and comparing their performances. I used three different algorithms: the genetic algorithm, the ant colony optimization algorithm, and simulated annealing. Each of these I applied to three different NP-hard problems: the traveling salesman problem, the graph coloring problem, and the knapsack problem. This resulted in a total of nine different programs. I then compared the solutions found and the execution times of the different algorithms by applying several different data sets to each of the programs.

Share

COinS