LogiTMS

Stop order within a trip is optimised in two passes — nearest neighbour, then pairwise swaps — under a hard constraint: a pickup always precedes its delivery. The dispatcher is not told it is «optimal» but how many kilometres and minutes it saved against the original order.

Data lives locally, yet the application is written as if a server were already behind it: access goes only through repositories whose signatures mirror the future REST endpoints. A write lands in local storage first and only then in the outbound queue, and the queue survives a reload. Swapping storage for a real backend therefore does not rewrite the interface.

The screenshot shows the demo dataset, not a real fleet at work.

TypeScript · React · Vite · IndexedDB · Leaflet · PocketBase · Electron