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

A collection of NVIDIA cuOpt samples and other resources

A Python implementation of the Ant Colony Optimization Meta-Heuristic

A simple graph library

Solve vehicle routing problems with Google Optimization AI Cloud Fleet Routing

Solving Travelling Salesman Problem using Ant Colony Optimization

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

This work proposes an anytime iterative system to concurrently solve the multi-objective path planning problem and determine the visiting order of destinations. The paper has been uploaded to arXiv at https://arxiv.org/abs/2205.14853

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

Travelling salesman problem on OpenStreetMap data. Shortest path distances by Dijkstra's algortihm. Frontend built with react and leaflet.

Defund the Police.

The Lin-Kernighan Heuristic implemented in python

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

A Julia wrapper for the Lin-Kernighan-Helsgaun (LKH) solver.

A Julia wrapper for the Concorde TSP Solver.

Java 2-opt solution for TSP Coursework

Implementation of a simple genetic algorithm designed to solve the Traveling Salesman Problem, using ncurses to visualize the graph.

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.

Randomly Deployed Wireless Sensor Network. UAV data collection. Nodes clustering. Find and build optimal route to collect data. Build network energy model. Calculate energy for data transmittion. Display charge, lifetime, used energy.