Abstract: A device can receive, from a client device, a request to modify a schedule that includes information identifying the set of deliveries that the fleet of vehicles is to perform. The device can generate a set of modified schedules using information included in the request and one or more routing techniques. The device can determine, for each modified schedule, of the set of modified schedules, one or more scores for ranking the set of modified schedules, such as a projected delivery time score, an operational cost score, and/or an overall score. The device can provide the set of modified schedules that have been scored to the client device. The device can receive a modified schedule that has been selected by the client device. The device can deploy the selected modified schedule to instruct the fleet of vehicles to perform an updated set of deliveries associated with the selected modified schedule.

Abstract: A method for finding an approximation to the all-pairs shortest travel path between a number of predetermined nodes, comprising clustering nodes of an original road network into a plurality of subgroups so that the number of nodes in each subgroup is no greater than a first predetermined threshold and the maximum distance between any two nodes of a subgroup is no greater than a second predetermined threshold; adding information of intra group shortest paths for all pairs in a same subgroup to a newly created higher level road network; adding information of inter group shortest paths for the plurality of subgroups to the same road network; and searching the same road network for the shortest travel path. In those cases in which the path returned is not exact, the path represents one in the original map, even if not necessarily the best one.

Abstract: A method for finding an approximation to the all-pairs shortest travel path between a number of predetermined nodes, comprising clustering nodes of an original road network into a plurality of subgroups so that the number of nodes in each subgroup is no greater than a first predetermined threshold and the maximum distance between any two nodes of a subgroup is no greater than a second predetermined threshold; adding information of intra group shortest paths for all pairs in a same subgroup to a newly created higher level road network; adding information of inter group shortest paths for the plurality of subgroups to the same road network; and searching the same road network for the shortest travel path. In those cases in which the path returned is not exact, the path represents one in the original map, even if not necessarily the best one.