The Chinese Postman

Solve a network

Choose a network and find the shortest tour that walks every street, or only some of them, with one postman or several. The solver runs inside your browser: nothing is sent to a server, except street data requested from OpenStreetMap.

Network

Classical arc-routing benchmarks; see the 2026 report, chapter 7.
First line: junctions. Second: streets. Then one line per street: from to cost. Up to 2,500 junctions; for larger networks use the Python package.
Pan and zoom the map to a few blocks (up to about 1 km², or 1,500 junctions), then fetch the streets. One-way streets are kept.

Service

Every postman starts and ends at the depot (the square). With several, the longest route is made as short as possible.

Loading…

The network appears here.