Patent ID: 11868951
Assignee: WALMART APOLLO, LLC
Field: Measurement (Instruments)
Classification: CPC G | IPC G

Claim 6:
7. A non-transitory computer readable medium having instructions stored thereon, wherein the instructions, when executed by a processor cause a device to perform operations comprising:
receiving, via a transceiver, a plurality of orders from a user system, wherein each order in the plurality of orders comprises a geographic location;
generating a trained clustering model configured to cluster the plurality of orders into a plurality of clusters based on the geographic location of each order, wherein the trained clustering model is generated by:
receiving the geographic location for each order in the plurality of orders;
generating a partition of clusters by assigning each order in the plurality of orders as an individual cluster based on the geographic location;
applying a clustering framework to calculate a distance matrix including a distance between each cluster and every other cluster in the partition of clusters, wherein a distance function of the clustering framework includes weighted coefficients;
combining a first cluster and a second cluster having a least distance in the distance matrix;
updating the weighted coefficients of the clustering framework based on a similarity matrix;
updating a predetermined threshold and a predetermined maximum distance metric of the clustering framework based on the similarity matrix; and
automatically iteratively repeating the calculating combining, and updating steps until the partition of clusters is combined into a predetermined number of clusters each having at least one cluster parameter below a predetermined threshold and a predetermined maximum distance metric, wherein the predetermined number of clusters is varied during two or more of the calculating, combining, and updating steps;

generating a linked list data structure comprising a routing solution for each of the plurality of clusters, each linked list data structure comprising a set of parameters including: a total distance to traverse, a plurality of edges to traverse and, for each edge of the plurality of edges, a number of times the corresponding edge is traversed, wherein the linked list data structure for each of the plurality of clusters is generated in parallel using a different set of route parameters for at least two clusters in the plurality of clusters;
iteratively modifying at least one linked list data structure to optimize a corresponding set of parameters, wherein the corresponding set of parameters is optimized based on: minimizing the total distance to traverse in the routing solution with a first weight and minimizing the number of times each edge of the plurality of edges is traversed in the routing solution with a second weight; and
transmitting each linked list data structure to at least one vehicle system.