The Travelling Salesman Problem using Genetic Algorithm 

The travelling salesman problem (also called the travelling salesperson problem or TSP) asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?" It is an NP-hard problem in combinatorial optimization, important in theoretical computer science and operations research. This video explores how to solve it using Genetic Algorithm, the history of the algorithm and the phases behind it.
MEMBERS:
Demi Gail Ercia
Faustine Rivera
Gabriel Ruiz
Edited by: Gabriel Ruiz