The Lin-Kernighan Heuristic implemented in python
-
Updated
Jan 6, 2024 - Python
The Lin-Kernighan Heuristic implemented in python
A column generation algorithm (CG) for the capacitated vehicle routing problem (CVRP)
TSP Solver based on Lin-Kernighan, Lin-Kernighan-Helsgaun, 2-opt, 3-opt, Tabu Search heuristics, all algorithms optimized by Numba (JIT-compiler)
Edge importance analyzer for last-mile delivery routing. Computes criticality scores for TSP instances using LKH-3 solver with parallel optimization.
A local research web application for U-turn-aware TSP routing experiments
Optimization algorithms and heuristics
BetaTour: a graph neural network that learns LKH-3 candidate edges for the TSP from ensembles of cheap LKH tours. Colab notebooks, code, results and analysis scripts for the paper "Better Candidates, Same Speed".
To associate your repository with the lkh topic, visit your repo's landing page and select "manage topics."