Koji
Draw shapes on a map and it finds the shortest route through all of them. There's a full geofence manager built in too. React on top, a Rust core doing the math underneath.
The project I've put the most into, by a wide margin. The routing's a multithreaded Rust core, with C++ for the clustering. A community benchmark on a ~5,000-stop area clocked it finding a shorter route in two seconds than the previous tool managed in seventeen minutes. When the built-in solver buckled on the biggest sets, I wrote tsp-mt, a multithreaded TSP plugin to take those over. I still reopen the whole thing to tweak parts I'd called done.