A python library with implementations of 15 classical heuristics for the capacitated vehicle routing problem.

Solution quadratic assign problem via LS(local search), ILS(iterated local search), GLS(guided local search)

Artificial Intelligence + Deep Learning

A Vehicle Routing Problem optimized solution with Variable Neighborhood Search (VNS), Variable Neighborhood Descent (VND) and Simulated Annealing

My Research project under Dr Andrea Raith, Senior Lecturer at the Department of Engineering Science at the University of Auckland (UoA).

AI assistant that helps groups of friends or co-workers find a restaurant to order from together, that best matches the group members' dining preferences.

MaxCut SS

Algorithms project based on the Coursera course by Pascal Van Hentenryck

Discrete Optimization

Classical and Modern searching algorithms

Using two powerful local search algorithms to find a solution for the popular 8-queen problem.

Implementing GA to solve TSP

This repository seeks to optimize bikes distribution of a public bicycle renting service across city stations using local search algorithms like Hill Climbing and Simulated Annealing, aiming to minimize costs and efficiently meet demand. It includes tools to visualize the distribution and showcases the utility of AI in urban logistics.

Local search algorithms solving the travelling salesman problem

FIB-IA 2022-23 Q2 Artificial Intelligence subject

Contains all the assignments of the course CSE-318 offered in CSE, BUET

In this project are implemented example of local search algorithm and algorithm for constraint satisfaction problem applied to different cases

Hitori puzzle solver using informed and local search algorithms

Python Code for different simple Metaheuristics

Implementation of different types of algorithm in order to solve the Travelling Salesman Problem. It also includes performance analysis in report