Código para el proyecto de investigación basado en encontrar una ruta óptima de escape usando un algoritmo de colonia de hormigas

Motion planning and Navigation of AGV/AMR：ROS planner plugin implementation of A*, JPS, D*, LPA*, D* Lite, Theta*, RRT, RRT*, RRT-Connect, Informed RRT*, ACO, PSO, Voronoi, PID, LQR, MPC, DWA, APF, Pure Pursuit etc.

A (still growing) paper list of Evolutionary Computation (EC) published in some (rather all) top-tier (and also EC-focused) journals and conferences. For EC-focused publications, only Parallel/Distributed EC are covered in the current version.

[Python Version] Solving Travelling Salesman Problem using Ant Colony Optimization

It is an attempt to approximate full color image with limited color ellipses.

[NeurIPS 2024] ReEvo: Large Language Models as Hyper-Heuristics with Reflective Evolution

TAVNIT is a pipeline dedicated to the identification of targets for CAR-Ts and other anticancer drugs. The pipeline comprises cancer subtyping and subsequent extraction of cancer subtype signatures. It utilizes hierarchical clustering with constraints and an Ant Colony Optimization algorithm. Author: Dmitri Finaev (ORCID 0000-0003-3470-8501)

GPU-accelerated Ant Colony Optimization (ACO)

Ant colony optimization workshop for solving a travelling salesman problem

[NeurIPS 2023] DeepACO: Neural-enhanced Ant Systems for Combinatorial Optimization

A sophisticated simulation of the Ant Colony Optimization algorithm that employs artificial ants to dynamically navigate a graph, demonstrating emergent pathfinding behaviors through pheromone-based decision-making and iterative exploration strategies.

Projects of "Bio Inspired Computing" Course - University of Tehran - Spring 2024

Ant Colony Optimization on RRT* - improved heuristic for node search

A Rust Library for Solving the Travelling Salesman Problem (TSP)

Este repositorio contiene el código desarrollado para mi Trabajo de Fin de Grado en Ingeniería Informática.

An advanced route optimization tool with React that leverages metaheuristic algorithms to solve the Traveling Salesman Problem (TSP). Whether on a grid or a map.

My Master's Thesis Project - Solving Vehicle Routing Problem with Time Windows using multiple Classic Heuristic, Metaheuristic algorithms (Hybrid Genetic Search (HGS), Guided Local Search (GLS), Ant Colony Optimisation (ACO), Simulated Annealing (SA)), compare result's with each one's results and present it in the graph.