Applying genetic algorithm for solving travelling salesman problem in Skynet Courier Service / Nah Izzattie Itqan Ahmad Nah Rodzi

• Main Author: Ahmad Nah Rodzi, Nah Izzattie Itqan
• Format: Thesis
• Language: English
• Published: 2020
• Subjects: Back propagation (Artificial intelligence); Instruments and machines; Evolutionary programming (Computer science). Genetic algorithms
• Online Access: http://ir.uitm.edu.my/id/eprint/39053/1/39053.pdf; http://ir.uitm.edu.my/id/eprint/39053/

Nowadays, courier service has shown a tremendous increase in Malaysia. This courier service turned out to be progressively mainstream as the arrival of online shopping. Therefore, the courier service such as Skynet has a very wide potential to be the most successful business in Malaysia. However, courier service has a problem to specify the best route in order to optimize the time and distance hence save cost when doing a delivery. Most of the time not all the items can be sent within the specific time frame because the riders are lack of information in seeking how to determine the sequence of the road when doing a delivery. This problem is also known as the Travelling Salesman Problem (TSP). TSP can be solved by applying a Genetic Algorithm (GA). In this research, the distance travel from starting point into another point will determine the sequence of the road for the rider to do delivery. The data will be obtained from the actual event and the result will be compared. This Genetic Algorithm (GA) will determined the best and the shortest route from one point into another point that need to be taken by the riders. Therefore, by doing this research it can help the courier service company like Skynet to improve their service as well as to optimize the problem.