This engine performs sequencing of delivery routes for a provided set of addresses or street sides. It provides good-enough (by quality) results of a salesman task for the shortest possible time. Computations are based on a third-party solution for a travel salesman task and on the KSF Clustered Reachability Matrix (ClRMx) data structure (clustering of streets data) that significantly reduces computation time.
Two-tier application that includes: