A MSc's Dissertation Project which focuses on Vehicle Routing Problem with Time Windows (VRPTW), using both exact method and heuristic approach (General Variable Neighbourhood Search)

OptFrame - C++17 (and C++20) Optimization Framework in Single or Multi-Objective. Supports classic metaheuristics and hyperheuristics: Genetic Algorithm, Simulated Annealing, Tabu Search, Iterated Local Search, Variable Neighborhood Search, NSGA-II, Genetic Programming etc. Examples for Traveling Salesman, Vehicle Routing, Knapsack Problem, etc.

Planning to monitor wildfires with a fleet of UAVs

Job Shop Scheduling metaheuristics

Encrypted instant messaging & payments dApp powered by decentralized identities using XMTP, Celo, VNS & NES.TECH SDK

VNS (Visual Novel Script), a universal scripting language for creating in-game dialogues.

Variable neighborhood search used for solving Cell Formation problem

Metaheuristics to compute an optimized solution for the combined MTCVRPTW and DSP problem

Variable Neighborhood Search for the CFLP

Solver of the Team Orienteering Problem (TOP) by several different approaches of the Variable Neighborhood Search (VNS).

This program is used to perform standard associative fear conditioning in animals.

Code used for analyzing data from the "optimal VNS intensity" dosing study at TxBDC

A Python script to fix extraction issues with .spt files from System-NNN visual novels and seamlessly integrate DeepL Machine Translation API for text localization.

Metaheuristic problems

a realization of VNS algorithm for multi-depot vehicle routing problem.

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

Implementations of some metaheuristics for the optimization course

Reimplementation of JIT-JSS solver of Ahmadian

真っ先に拾った。