Solving the Traveling Salesman Problem using Self-Organizing Maps

This is the official code for the published paper 'Solve routing problems with a residual edge-graph attention neural network'

Solve vehicle routing problems with Google Maps Platform Route Optimization

A genetic algorithm to solve the Travelling Salesman Problem, implemented in Python. Made by Jack Frigaard, modified by Mauricio Aizaga

code repo for paper Unsupervised Learning for Solving the Travelling Salesman Problem

Solving Travelling Salesman Problem using Ant Colony Optimization

Official implementation of H-TSP (AAAI2023)

Genetic algorithms are heuristic search algorithms inspired by the process that supports the evolution of life. The algorithm is designed to replicate the natural selection process to carry generation, i.e. survival of the fittest of beings.

Official implementation of ICLR 2025 paper: "Unify ML4TSP: Drawing Methodological Principles for TSP and Beyond from Streamlined Design Space of Learning and Search".

A super simple Python wrapper for the constrained traveling salesman and vehicle routing problem solver LKH-3.

The Lin-Kernighan Heuristic implemented in python

TSP benchmark problem generator written in pure R.

MuNES: Multifloor Navigation Including Elevators and Stairs

Travelling salesman problem with 3opt move and 2opt perturbation

Monte Carlo tree search (MCTS) on traveling salesman problem (TSP)

Silk Road Graph Analyzer is an application in which you can draw you desired graph with arbitrary IDs and numbers, and solve Shortest Path and Traveling Sales Person problems.

ML4CO-Bench-101: Benchmark Machine Learning for Classic Combinatorial Problems on Graphs.

A fun study of some heuristics for the Travelling Salesman Problem.

Parser to read tsplib problems data into a python dict