MetaHeuristic-Berth-allocation is a project aimed at solving the NP-hard Berth Allocation Problem using four types of algorithms - "Base Cuckoo Search", "Clustering Based Cuckoo Search", "Enhanced Cuckoo Search", and "Enhanced Clustering Cuckoo Search"

Solving Single Machine Schenduling problem with different approaches

Repository of scripts and data for the "Robustness and resilience of complex networks" paper by Oriol Artime, Marco Grassia, Manlio De Domenico, James P. Gleeson, Hernán A. Makse, Giuseppe Mangioni, Matjaž Perc and Filippo Radicchi, published at Nature Review Physics (2024). https://doi.org/10.1038/s42254-023-00676-y

Na Rinha de Algoritmos você deve utilizar suas habilidades para a criação de algoritmos eficientes para resolver problemas!

Heuristics and metaheuristics for enhancing Run-Length Encoding in a database

Official Implementation of the NeurIPS'23 paper 'Maximum Independent Set: Self-Training through Dynamic Programming'.

Implementation of classical problems in Computer Science in the Answer Set Solving dialect of Clingo.

This repository contains a Python implementation of a color coding method for the problem of finding a subtree with k vertices in a given graph.

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

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.

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

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

Hostage situation negotiator simulation

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…

The ripple-spreading algorithm for the k-color 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 that determines all Pareto-optimal paths from one node to all other nodes for the multi-objective shortest path problem.

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.

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

Sabanci University CS301 - Algorithms Course Project