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 comprehensive Python implementation comparing multiple metaheuristic algorithms for solving the Vehicle Routing Problem with Time Windows (VRPTW). It provides a detailed comparison of four state-of-the-art optimization algorithms: Hybrid Genetic Search (HGS), Guided Local Search (GLS), Ant Colony Optimization (ACO), Simulated Annealing (SA)
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
An empirical analysis of the Collatz Conjecture (3x+1) using the 'Stochastic Height' framework. Demonstrates how Adelic Stress (Arithmetic Pressure) exceeds Geometric Gravity.
Heuristic algorithms for solving the budget-constrained prize collecting Steiner forest problem.
A heuristic approach for Minimum Dominating Set which is an NP-Complete problem and analysis of speed performance and correctness.
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 a meta-heuristic based on genetic algorithms applied to the famous Knapsack problem 0/1
📊🔄Dive into the captivating world of AI-driven gaming, where stickers of graph algorithms 📊, a dynamic blend of Dijkstra's 🌐 and bread-first search 🔍, and a thrilling twist on the minimax algorithm come together to craft an exhilarating gameplay experience🎮. Step into the future🌌, where your every move is guided by the power of heuristic AI.
Course project for CS271: Introduction to Artificial Intelligence at UC Irvine
Optimal Weighted Graph Matching
Проект по автоматическому составлению школьного расписания с учётом СанПиН, нагрузки в баллах и реальной занятости кабинетов и учителей. Система сама подбирает такое распределение уроков, при котором дети не перегружены, а тяжелые предметы стоят в оптимальное время недели.
Implementation of dynamic programming heuristics from a research paper to solve the Quadratic Knapsack Problem (QKP), with test cases and complexity analysis.
Examen - Análisis y diseño de algoritmos
This repository contains the code used in the CS301 (Algorithms) Project which discusses the Maximum Independent Set Problem
A generalized version of the problem
Add a description, image, and links to the heuristic-algorithms topic page so that developers can more easily learn about it.
To associate your repository with the heuristic-algorithms topic, visit your repo's landing page and select "manage topics."