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

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

Local search algorithms solving the travelling salesman problem

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

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

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.

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