You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The project is about solving symmetrical traveling salesman problem. The repository contains 4 optimization algorithms: Tabu Search, Hill Climbing with Multi-Start, Nearest Neighbor and Simulated Annealing.
Algorithmic problem-solving project using autoencoders for dimension reduction, nearest neighbor search algorithms, and K-means clustering. Developed as part of a university course on software development for algorithmic problems.
Personal research compendium for T.C.H. Lux. Includes codes for nonlinear regression, nearest neighbor calculation, a regular expression engine, a Data storage object, and an interactive plotting library.
This is a multi-destination route optimization app, developed as a Final Year Project for a Computer Engineering degree, which received a grade of 10 with honors.
Optimizing vehicle routing for efficient delivery of goods to various customer locations while minimizing costs. This project implements algorithms to solve the Capacitated Vehicle Routing Problem (CVRP) using Python and frameworks like Google OR-Tools and the nearest neighbor heuristic, with the latter being used for comparison purposes.