Efficient Route Planning for Travelling Salesman Problem

Travelling Salesman Problem (TSP) is a famous example in the study of route optimization in the field of computer science. Various algorithms have been developed by previous researches throughout the years attempting to solve the TSP yet there is always a doubt in producing the best solution. Route planning has always been a major interest of study due to the nature of the topic which covers many industries. Transportation pathways, flight routes, travellers, delivery services and many more applies TSP which means there is a need for a preplanned route schedule to ensure an optimized travelling has been performed. In this article, a small scale research was conducted to produce an optimized route planning using genetic algorithm.