A python library with implementations of 15 classical heuristics for the capacitated vehicle routing problem.

A Python implementation of the Ant Colony Optimization Meta-Heuristic

A simple graph library

部分关于车辆路径规划问题（Vehicle Routing Problem, VRP）的智能优化算法

Solving Travelling Salesman Problem using Ant Colony Optimization

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

The Lin-Kernighan Heuristic implemented in python

Defund the Police.

Python/Numba implemenation of of Lin-Kernighan-style TSP solver

Travelling Salesman Problem implementation with Hill Climbing Algorithm

OR-Tools is an open source software suite for optimization, tuned for tackling the world's toughest problems in vehicle routing, flows, integer and linear programming, and constraint programming.

Encode-attend-navigate unofficial Pytorch implementation

Official implementation of Rethinking the "Heatmap + Monte Carlo Tree Search" Paradigm for Large Scale TSP.

Python implementation of different algorithms for solving basic TSP.

TSP Solver based on Lin-Kernighan, Lin-Kernighan-Helsgaun, 2-opt, 3-opt, Tabu Search heuristics, all algorithms optimized by Numba (JIT-compiler)

A Travelling Salesman Problem (TSP) solver using a hybrid of strategies

Tabu search algorithm with high parallelism to solve optimization problems

some basic (or advanced) heuristic algorithms applied in TSP

The traveling salesman problem (TSP) is a well-known problem in theoretical computer science and operations research. The standard version of the TSP is a hard problem and belongs to the NP-Hard class. In this project, I build an application to implement the TSP by the dynamic approach and the GVNS approach .