What is the Traveling Salesman Problem (TSP)?

The Traveling Salesman Problem (TSP) is a classic optimization problem where the goal is to find the shortest possible route that visits each city exactly once and returns to the starting city. It has applications in logistics, delivery routing, manufacturing, and many other fields.

How does TSP Solver Online work?

TSP Solver Online uses advanced algorithms including LKH-3.0.10 (Lin-Kernighan-Helsgaun), Robopol Precise, Robopol Fast, and Nearest Neighbor to find optimal or near-optimal solutions. It also supports multi-vehicle mTSP routing through the Method Config panel. Simply add points by clicking on the canvas or import coordinates, then click Calculate to find the best route.

Is TSP Solver Online free to use?

Yes, TSP Solver Online is completely free to use. The web version supports up to thousands of points with 4 CPU cores and 8GB RAM. For larger datasets and unlimited computing power, a desktop application is also available.

TSP Art is a creative application of the Traveling Salesman Problem where an image is converted into stipple points, and the TSP solution creates a single continuous line that recreates the image. Our tool includes a TSP Art generator that can transform any image into line art.

TSP & mTSP Solver Online - Free Traveling Salesman Problem Calculator

TSP SOLVER BOOT SEQUENCE

INITIALIZING SYSTEM

ROUTE ENGINEONLINE

NUMBA JITCOMPILING

DISTANCE MATRIXSYNC

CANVAS GRIDREADY

Compiling optimized algorithms for the first run.

Please wait...

Method

VISUAL CONFIG

Color Theme:

Background Hex:

#020802

Node Hex:

#00ff41

Link Hex:

#008F11

Node Size: 5px

Link Width: 2px

Skip Drawing (for large datasets)

PAGE COLORS

Page BG:

#020202

Sidebar:

#050805

Panels:

#0a0f0a

Accent:

#00ff41

Accent Dark:

#008F11

Text:

#e0ffe0

Borders:

#1a3d1a

Borders Dim:

#0f1a0f

Inputs BG:

#000000

Text Dim:

#608060

Text Secondary:

#aaaaaa

Danger:

#ff003c

Icon Blue:

#3498db

Problem type	TSP (1 route) Multi-vehicle (mTSP)
Vehicles
Objective	Tip: MINSUM minimizes overall distance/time. MINMAX minimizes the worst vehicle route. MINMAX_SIZE balances stop counts.
Depot index (1..n)	Start/end for all vehicles. In ROAD mode: 1 = first successfully geocoded address.
Min points / vehicle	Excludes depot. Use this to prevent unbalanced splits.
Max points / vehicle
Road optimize by

INITIALIZING SYSTEM

VISUAL CONFIG

PAGE COLORS

ALGORITHM CONFIG

MULTI-VEHICLE / ROAD (LKH)

NEAREST NEIGHBOR

ROBOPOL FAST (SUPERBOOST)

ROBOPOL PRECISE

ROBOPOL REFINED

LKH-3.0.10 METHOD