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)

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.

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

Implementing GA to solve TSP

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

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

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.