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

Recreate your images with simple shapes

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

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

Artificial Intelligence + Deep Learning

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.

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

MaxCut SS

Classical and Modern searching algorithms

Discrete Optimization

Algorithms project based on the Coursera course by Pascal Van Hentenryck

Apply Simulated Annealing and Genetic Algorithm to solve the problem of Neural Network pruning without prior assumptions of weight importance

Local search algorithm for the Knapsack problem

FIB-IA 2022-23 Q2 Artificial Intelligence subject

Master's | Design & Analysis of Algorithms | Local Search, Heuristics, and Simulated Annealing

Local search algorithms solving the travelling salesman problem

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

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

Hitori puzzle solver using informed and local search algorithms

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