Genetic Algorithm, Particle Swarm Optimization, Simulated Annealing, Ant Colony Optimization Algorithm,Immune Algorithm, Artificial Fish Swarm Algorithm, Differential Evolution and TSP(Traveling salesman)

A Python implementation of a branch-and-bound approach (plus a simple greedy heuristic) to solve a variation of the multiple knapsack problem where items have both individual and pairwise benefits.

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.

Resume Shortlister is an AI application based on NLP to screen and shortlist Resumes

A Python application that optimizes shop floor schedules using a multi-objective Genetic Algorithm (GA) to minimize makespan and tardiness.

It uses backtracking and heuristic algorithms to solve even the most extreme sudoku boards.

Determining the sizing of transistors using heuristic algorithms and logical effort to obtain optimal delay and power

Heuristic algorithms for solving the budget-constrained prize collecting Steiner forest problem.

Solving the 8-puzzle problem with A* and Reinforcement learning methods

A gravity-aware 3D spatial packing system that places multiple cuboid items inside a fixed container using deterministic heuristics. It sorts items, checks collisions, enforces support under gravity, computes valid (x,y,z) positions, validates constraints, and visualizes final stacking for correctness in a clear, stepwise pipeline.

Portfolio optimization using heuristic and meta-heuristic algorithms (Beam Search, Simulated Annealing, Genetic Algorithm) to maximize Sharpe ratio and find optimal asset allocation strategies.

A paradigm-shifting stochastic optimization algorithm that mimics physical earthquakes. Instead of bouncing particles randomly, Seismic Descent cyclically disrupts the geometry of the target landscape with spatially correlated Gaussian Random Fields (via RFF) to gracefully unstick particles from local minima.

Implementation of a meta-heuristic based on genetic algorithms applied to the famous Knapsack problem 0/1

A heuristic approach for Minimum Dominating Set which is an NP-Complete problem and analysis of speed performance and correctness.

High-performance object tracking suite utilizing heuristic analysis and Euclidean clustering. Solves temporal consistency and occlusion challenges via classical image processing pipelines.

Optimal Weighted Graph Matching

Проект по автоматическому составлению школьного расписания с учётом СанПиН, нагрузки в баллах и реальной занятости кабинетов и учителей. Система сама подбирает такое распределение уроков, при котором дети не перегружены, а тяжелые предметы стоят в оптимальное время недели.

Research repository for cost-effective deployment and optimisation of next-generation (B5G/6G) reconfigurable RAN and optical X-haul networks. Features greedy, genetic algorithm, local search, and exact CPLEX models for network planning with complete datasets and analysis tools.

Implementation of dynamic programming heuristics from a research paper to solve the Quadratic Knapsack Problem (QKP), with test cases and complexity analysis.