Ayush Adhikari

My personal website

Ayush Adhikari

 > 

Search
Monday, May 19, 2025

Found 1 result(s) for "Travelling"! Click on the links for more details

Heuristic Algorithms for Approximating the Traveling Salesman Problem

This program will approximate the Traveling salesman problem using 3 three different algorithms (Nearest Neighbot, 2Opt, and 3Opt). There are size different combinations and explanations for these can be found in the sections below. The program allows you to run each algorithm individually or run a benchmark for all 6 and the original unoptimized list. The results are formatted in a table and displayed in the console. As the algorithms have different time complexities, the time it takes increases for some algorithms drastically, so use caution when using many places.

Nothing to show!
×

This is a feature mainly used to demonstrate the use of the handwriting app built using a canvas and CNN. You can use the search bar to search the site for content or to navigate the site by typing in a word such as home, which will take you to the home page. Below the search bar is a canvas where you can draw letters. This is implemented using a digit recognition CNN. As the accuracy is around 89 percent, it might not always produce an accuracte prediction, for example between o and 0. You can use the three button next to the search bar to delete the last character, clear the search bar, and finally search the site.