Route Optimisation TSP VRP Delivery API
TSP and capacitated/time-window VRP, pickup-delivery, multi-day plans, territory clustering, depot location, ETAs, load sequencing, driver assignment, slot capacity, geofences and polyline codec — pure computation on caller matrices or coordinates.
Build a haversine distance and estimated duration matrix from caller coordinates with optional circuity and speed.
Find a best visiting order for one vehicle (closed tour or open path) with fixed start and optional fixed end using Held-Karp or local search.
Assign stops to vehicles under capacity (and optional duration) limits, returning routes with loads and distances.
Route stops under customer time windows, service times, driver shifts and breaks with forward time propagation.
Route paired pickup-and-delivery requests with precedence, same-vehicle and capacity constraints.
Assign recurring visits across a horizon with frequency and spacing rules, then route each day.
Split stops into k balanced, compact territories with capacitated k-means and imbalance limits.
Choose p hub locations from candidates to minimise demand-weighted distance, optionally capacitated.
Compute arrivals, waits, slack and overtime for a fixed stop sequence with optional return and shift end.
Order parcels last-delivered-first and run a deterministic layer first-fit packing check in a van or truck box.
Assign pre-built routes to drivers by shift, skills and vehicle type with min-cost Hungarian matching.
Estimate bookable orders per zone and time slot from vehicle time, service, drive and stem assumptions.
Test points against GeoJSON service zones with holes, reporting inside/in-hole status and nearest boundary distance.
Encode or decode Google Encoded Polyline strings and optionally simplify with Douglas-Peucker.
Check a manual plan for time-window, capacity, shift, precedence and duplicate/missing-stop violations.