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)

An A* pathfinding library for serverside minecraft development

pyHarmonySearch is a pure Python implementation of the harmony search (HS) global optimization algorithm.

Collection of classes and functions to allow 2D/3D path generation with heuristic algorithms such as A*, Theta* and LazyTheta* and ROS Interfaces

A solution for Vehicle Routing Problem (VRP) in Java with heuristic algorithms and Tabu search

Meta-heuristic optimisation suite for python

Algorithms for flight scheduling optimization.

The GWO algorithm mimics the leadership hierarchy and hunting mechanism of grey wolves in nature. Four types of grey wolves such as alpha, beta, delta, and omega are employed for simulating the leadership hierarchy. In addition, three main steps of hunting, searching for prey, encircling prey, and attacking prey, are implemented to perform optim…

How to solve the traveling salesman problem with the 2-opt algorithm, a fast heuristic search algorithm.

A very simple Genetic Algorithm implementation for matlab, easy to use, easy to modify runs fast.

My n-puzzle solver: A* and IDA* search, heuristics, different puzzle configurations and sizes

⚡ A simulation of finding the shortest charging routes for electric vehicle fleets using ant colony optimization.

Highly efficient holistic 2D visibility solution for grid-based environments/maps (C++ and MATLAB). Extends to a planner.

Informed FMT (Fast Marching Tree) Star Planning ROS Action Server

This repository implements various Search Based (Heuristic and Incremental) and Sampling Based (Multi Query and Single Query) motion planning algorithms using ROS and turtlebot

Single robot path planning algorithms implemented in MATLAB. Including heuristic search and incremental heuristic search methods. A*, LPA*, D*Lite

Using heuristic search Best-First and A* with BFS (with manhatan distance) methods to solve 8-puzzle

AI classic search algorithms with graph and program implementation

A PDDL Solver in C++.

Heuristics for cardinality constrained portfolio optimisation