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

Practica 1 de metaheuristica

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

Vehicle Routing Problem, based on Greedy algorythm.

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

Mutant kill-based local search augmented evolutionary algorithm test case prioritization technique. (COMPSAC 2021)

Artificial Intelligence

Implementation of A* Search, Constraint Satisfaction Problem, Local Search and Knowledge Engineering

Implementation of optimization algorithms to analyze the efficiency and effectiveness of said algorithms.

The objective of this practice is to solve a problem of a Distributed File System using two local search algorithms. Hill Climbing Simulated Annealing.

Package provides java implementation of local searchers in continuous and discrete optimization problems

local search and optimization algorithms are used in AI with a map coloring example | AI course - Fall 2018

A Variable Neighborhood Search for the Median Location Problem with Interconnected Facilities.

Car-sharing system optimization with Local Search algorithms Hill Climbing and Simulated Annealing. Group project from the Artificial Intelligence course of my Data Science and Engineering Bachelor's Degree

This repository is dedicated to my exploration and understanding of various artificial intelligence (AI) algorithms and techniques. I document my progress and share resources, code, and insights related to AI.

Assignments of artificial intelligent course

using 2-opt algorithm with fast and guided local search heuristics

🗺️ Local Search for Bicing (IA-FIB)