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

A concurrent local search heuristic for the Maximum Weight Independent Set problem

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

Algorithms project based on the Coursera course by Pascal Van Hentenryck

Classical and Modern searching algorithms

Discrete Optimization

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

The goal of this assignment is for students to implement and demonstrate an understanding of a variety of fundamental local search and Constraint Satisfaction Problems algorithms.

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

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

Local search algorithms solving the travelling salesman problem

Solver for the planning problem called "Blocks World" with implementation in Python.

This repository contains a collection of Artificial Intelligence algorithms implemented in Python, organized by "Tasks". The codebase is structured into numbered Task folders, each focusing on specific AI concepts: