Search thru local computer files and feed matching output to a class that consumes it.

A search engine supporting arbitrary boolean queries, for one's personal text file/article repository.

Python bindings for OptFrame C++ Functional Core

A Java library of Customizable, Hybridizable, Iterative, Parallel, Stochastic, and Self-Adaptive Local Search Algorithms

EvoRBF: A Python Library for Evolving Radial Basis Function Network by Intelligent Nature-inspired Algorithms

Docusaurus plugins for Logos websites

AI constraint solver in Java to optimize the vehicle routing problem, employee rostering, task assignment, maintenance scheduling, conference scheduling and other planning problems.

Deep Reinforcement Learning for Combinatorial Optimization

Timetable solution for a real-world instance based on the MAX-MIN Ant System and Local Search.

A solver based on local search

Functions, examples and data from the first and the second edition of "Numerical Methods and Optimization in Finance" by M. Gilli, D. Maringer and E. Schumann (2019, ISBN:978-0128150658). This repository mirrors https://gitlab.com/NMOF/NMOF .

Functions, examples and data from the book "Numerical Methods and Optimization in Finance" by M. Gilli, D. Maringer and E. Schumann (2011), ISBN 978-0123756626.

A solver based on local search

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

Implementation of a generalized Constraint Satisfaction Problem, alongside a backtracking solver with MAC, min-remaining-value, and least-constraining-value heuristics. Applied to map coloring, the N-Queens Problem, and Circuit Board design. Also an implementation of a min-conflicts local search that is ideal for the N-Queens.

Python-based prototype for the optimization of the incoming orders to a logistic center.

A Julia package to manage Constraint-Based Local Search (CBLS) solvers.

Search over large image datasets with natural language and computer vision!

OptaPy is an AI constraint solver for Python to optimize planning and scheduling problems.

Neighbourhood Functions for Local-Search Algorithms

Simple local file finder / Простой локальный поисковик файлов

This repository contains the code and experiments related to the final project for the course Bio-Inspired Artificial Intelligence at the University of Trento.

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

A book on optimization algorithms.

Implementation and comparison of a number of different approaches for solving a resource assignment scheduling problem.

Implementation of constraint satisfaction problem algorithms to solve the radio link frequency assignment problem - rlfap

Multiple-choice Multidimensional Knapsack Problem implementation in C++

Assignments of artificial intelligent course

Implementation of a genetic algorithm to solve the travelingsalesman problem.

Open Shop Scheduling Problem resolution via Ant Colony Optimization algorithm.