This repository implements several swarm optimization algorithms and visualizes them. Implemented algorithms: Particle Swarm Optimization (PSO), Firefly Algorithm (FA), Cuckoo Search (CS), Ant Colony Optimization (ACO), Artificial Bee Colony (ABC), Grey Wolf Optimizer (GWO) and Whale Optimization Algorithm (WOA)

Library for working with TSPLIB files.

This code is to solve traveling salesman problem by using simulated annealing meta heuristic.

Small lib which generate binary data for tsc printer (tspl tspl2)

Vehicle routing problem instances and best-known solutions for benchmarking.

A C++ implementation of the Christofides algorithm for instances in TSPLIB format

Ant Colony Optimization in Julia

Implementation of Ant Colony Optimization (ACO) in Erlang language. Project realized for Computational Intelligence class.

python module to parse TSPLIB files and obtain distance matrix

A parser to read TSPLIB format files and convert to full matrix structure.

This project implements two nature-inspired optimization algorithms: Moth Flame Optimization (MFO) and Honey Badger Optimization (HBO). Both algorithms are designed to solve complex optimization problems by mimicking behaviors observed in nature. also it includes a path finding algorithm, A-star

High-performance Evolutionary TSP Solver with Gamified Streamlit UI. Features Hybrid GA (Genetic Algorithm) + 3-Opt Local Search, TSPLIB support (EUC_2D/ATT), and real-time visualization.

Comparative metaheuristics for the Sequential Ordering Problem (SOP): Genetic Algorithm vs Particle Swarm Optimization on TSPLIB-SOP.

Algorithms of integer linear programming applied to TSP and written report about them.

A High-Performance C++ Toolkit for solving classic TSP instances with B&B.

Qt Application to solve the TSP problem using TSPLIB instances and applied in Google Maps, through hybridization of GRASP and VNS metaheuristics

Some experiments with Nearest Neighbor Euclidean 2D tours using problems from TSPLIB

Few implementations of algorithms solving Travelling Salesman Problem