Ant colony optimization (ACO) algorithm can be used to solve combinatorial optimization problems such as the traveling salesman problem. In this work, an endeavor has been taken in finding the proper algorithm which could be used for routing problems in different real-life situations. Taking into due cognizance of the limitations of the existing routing system, the outcome of this work will facilitate a more convenient way of finding destinations for the users in term of accuracy and time over the existing routing systems. The cost of the program will also be lesser than contemporary systems. To accomplish this, a system has been built that can take a map image with source and destinations denoted; and find an optimal path for them. The work has been concluded with suggestions to future researchers who might look to build a system that can solve any type of routing problems using TSP.