Local Search to solve the 8-Queens puzzle. Implemented Algorithms: Hill Climbing: Steepest Ascent, First Choice and Simulated Annealing.

Hitori puzzle solver using informed and local search algorithms

Solver for the radio link frequency assignment CSP

Telecom spectrum allocation problem using greedy hill climbing search

Practica 1 de metaheuristica

Implémentation d'algorithmes de Résolution de Problèmes

A classroom assignment with built-in, reverse, and search functions

Evolutionary algorithms and metaheuristics project

The research work on local search algorithms

A simple use case of Local Search Algorithm (Hill-Climbing), Adversarial Search Algorithm (Minimax), and Genetic-Minimax Algorithm in Adjacency Strategy Game.

🧠 A set of metaheuristics applied in solving the QAP problem, including local search, genetic algorithms, memetics and more.

Solving the String Mapping Problem using Search Algorithms

The submission of Team SDU-IMADA to the Integrated Healthcare Timetabling Competition 2024 (IHTC-2024)

This assignment was done as part of COL333 Course Requirements. This project involved the development of an Automatic Speech Recognition (ASR) corrector utilizing a local beam search strategy to improve the text outputs from ASR systems.

Vehicle Routing Problem, based on Greedy algorythm.

Experimental evaluation of Hill-Climbing and Depth Search algorithms on SAT problems.

Construction Heuristics, Local Search, VND, GRASP, GVNS, GA and ACO applied to the Minimum Wieghted Crossings with Constraints Problem (MWCCP)

Using Hill Climbing to minimize various functions

Greedy Randomized Adaptive Search Procedure (GRASP) for vehicle routing problems

This project presents a heuristic to solve a simplified version of the examination timetabling problem.