A comparative analysis on Optimization concepts and Intelligent Searches amalgamated to analyze the Travelling Salesman Problem using heuristic algorithms. Nippon Express has a large-scale supply chain structure that depends on Milk-Run delivery operations to efficiently manage its transport and logistics between warehouses, stores and manufacturing outlets. The goal of the problem is, given these locations represented by map coordinates within Singapore, and given any unordered set of locations to deliver to with the initial point as input, to derive the shortest truck route back to this location having visited all other locations exactly once. This is derived by implementing the A* Search, Genetic Algorithm, Simulated Annealing Search and the Uniform Cost Search. The algorithms seek to find the shortest minimal-cost path as output.