Genetic algorithm implementation to solve the famous NP-hard problem - The Travelling Salesman

Parallel Tabu Search and Genetic Algorithm for the Job Shop Schedule Problem with Sequence Dependent Set Up Times

Ant Colony Optimization (ACO) contains the Metaheuristic Python Model in charge of apply diversification and intensifications techniques to obtain the best solution on the Travelling Salesman Problem (TSP). TSP is an NP-hard problem in combinatorial optimization, important in theoretical computer science and operations research and ask the follo…

A repository for MOOC "Data Structures and Algorithms", written in Python

Repository of the paper "Machine learning dismantling and early-warning signals of disintegration in complex systems" by M. Grassia, M. De Domenico and G. Mangioni

A backtracking-based algorithm to check if a given degree-size sequence can realize a simplicial complex

Implementation of the paper "Sudoku as a SAT Problem"

Use local optimization and stochastic optimization algorithms for solving Igloo NP-Hard problem.

Sabanci University CS301 - Algorithms Course Project

My Edinburgh Napier University Honours Project: investigating the multi-objective Capacitated Vehicle Routing Problem with Time Windows (CVRPTW).

This repo contains the implementation of an heuristic to solve the Traveling Tournament Problem (TTP), as well as the implementation of the Meta-heuristics' algorithm Iterated Local Search (ILS) satisfying the predefined contraints of the NP-hard problem.

The ripple-spreading algorithm that determines all Pareto-optimal paths from one node to all other nodes for the multi-objective shortest path problem.

Calculation of a possible sharing of a quota between entities with different priorities and many constraints, using SAT-Solver or Answer Set Programming

The ripple-spreading algorithm for the k-color shortest path problem

This repo encapsulates a Python implementation of the Simulated Annealing Algorithm to solve by means of a "minimum energy state" heuristic the NP-hard n-machines|no preemption|C_max job shop scheduling problem, considering n=2 machines and jobs having release dates. The code was designed and wrote by me. The whole heuristic design, complexity a…

Hostage situation negotiator simulation

The ripple-spreading algorithm that determines all Pareto-optimal paths for the multi-category multi-objective path optimization problem.

[IEEE TKDE | TITS 2023] "Learning Large Neighborhood Search for Vehicle Routing in Airport Ground Handling" | "Neural Airport Ground Handling"

This is an algorithm that given a Boolean formula with n=3 distinct variables and 2 variables per clause (2-Satisfiability), determines the values of the variables that result in the formula being TRUE, or determines that there is no solution and the formula is never TRUE. Written in Python.

Feasibility Intensive Genetic Algorithm (FIGA) for the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW)