Boundary-aware Traveling Salesperson routing: shortest tour through your points, around your sloughs.
Plover generates an optimized TSP (Traveling Salesperson) route through a point layer, optionally constrained to stay within a polygon boundary and to route around interior rings (holes / sloughs / exclusion zones). Without a boundary it solves a plain straight-line Euclidean TSP. It builds a visibility graph over the points and the boundary's concave corners, computes obstacle-aware shortest paths between all points, and optimizes the visiting order with multi-start nearest-neighbour, 2-opt and Or-opt. Includes a dialog with live progress (runs in the background, cancellable), a numbered visit-order output layer, GPX/KML export for field navigation, and a Processing algorithm for use in models and batch runs.
Plugin Tags