Clustering traveling salesman solver for delivery and more.

Efficient, scalable TSP solver for real-world coordinates using the Haversine formula. Instantly computes near-optimal routes for hundreds of geo-points.

Optimize specific transports (single depot location, customer locations with pickups and deliveries) and displays the optimal routes for each of your vehicles on the map.

Visualization of Traveling Salesman in D3, using 2-opt switches for finding a local minimum.

Config files for my GitHub profile.

Traveling Salesman Problem - With Conditions

Traveling Salesman Algorithm

Solving the traveling salesman problem in 3 dimensions using the simulated annealing algorithm

Traveling salesman problem solved by a genetic algorithm

Bus routing tool for dynamically changing rosters and start/end points

Salesman problem solved using genetic algorithms

Full-stack application allowing users to find the optimal route to reach all destinations

Algorithm to take longitudinal and latitudinal coordinates and calculate shortest path

DEPRECATED Part of osrm-backend since 5.7. NodeJS bindings for OSRM

Lib allowing you to view a picker tour inside the warehouse, you can also compare routing algorithm performance.

Lib allowing you to compare routing algorithm performance for warehouse picker tour.

Find the best route between waypoints

A multi-team pub crawl planner with conflict avoidance

Route optimization web application

UI for solving Travelling Salesman Problem using Neural Network