Contains notebook implementations for the AI based assignments using graph based algorithms that are commonly used in solving AI based problems. Algorithms include BFS, DFS, Hill Climbing, ...

An optimized genetic algorithm engine for solving large-scale Travelling Salesman Problem instances with custom mutation, crossover, and hyper-parameter tuning.

Abstract: Genetic Algorithms (GAs) is a predominant heuristic technique used to improve the solution space for Travelling Salesman Problem (TSP) and real-time problems in dynamic environments. In this ...