There are 4 repositories under traveling-salesman-problem topic.
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)
A Vehicle Routing Problem solver
A collection of NVIDIA cuOpt samples and other resources
[NeurIPS 2023] DeepACO: Neural-enhanced Ant Systems for Combinatorial Optimization
Improve Warehouse Productivity using Order Batching
A Kotlin implementation of the TSP problem, with TornadoFX Visualization
ReEvo: Large Language Models as Hyper-Heuristics with Reflective Evolution
Julia package for simple traveling salesman problem heuristics
A dependency free library of standardized optimization test functions written in pure Python.
Genetic algorithm for Traveling salesman problem
This code is to solve traveling salesman problem by using simulated annealing meta heuristic.
A simple, bare bones, implementation of simulated annealing optimization algorithm.
Simple Traveling Salesman Problem implementation in Julia
Genetic Algorithm + Google Maps API to solve the Traveling Salesman (NP-hard) Problem. Plan your travel over 100+ places with ease.
metaheuristics for traveling salesman problem (TSP)
⚡ A simulation of finding the shortest charging routes for electric vehicle fleets using ant colony optimization.
Fork of the Concorde TSP solver with an easier build procedure
Nomad Cyclist Problem - A variation of Traveling Salesman Problem (with open tour) adjusted for elevation and factors
A Python implementation of the Hopfield network used to solve the traveling salesman problem
A Traveling Salesman Problem plotter built in Kotlin/TornadoFX
Web app demonstrating order picking algorithms
ML-Constructive is a deep learning based constructive heuristic for the Traveling Salesman Problem.
Traveling salesman problem solved using genetic algorithm
Examples are written in Java dedicated to JOpt-TourOptimizer
Symmetry-preserving & Multiresolution learning to solve NP-hard problems in Operations Research
GPU fractional 2-matching Solver
Simulated annealing algorithm for solving the traveling salesman problem.