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)

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

Local search algorithm for the Knapsack problem

Algorithms project based on the Coursera course by Pascal Van Hentenryck

Discrete Optimization

Classical and Modern searching algorithms

This repository contains the implementation of an enhanced NSGA-II algorithm for solving the Flexible Job Shop Scheduling Problem (FJSP), focusing on multi-objective optimization. Developed as part of the Bio-Inspired Artificial Intelligence course project at the University of Trento.

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

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

Implementing GA to solve TSP

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

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