SYSTEMS AND METHODS FOR DAILY TASK OPTIMIZATION

摘要

A system and method is disclosed for determining an optimized sequence of visits by a consumer to a plurality of merchant locations irrespective of travel distance. The system is configured to receive, from the consumer, errand data including start time and start and finish location and a plurality of merchant locations to visit. The system also generates one or more models for predicting visit durations the merchant locations as a function of time using transaction data and location data associated with a plurality of consumers that previously visited the merchant locations. Based on the generated models, and current and historical travel/traffic information and the errand data, the system generates an optimized sequence of visits for the consumer.

主权项

1. A computer-implemented method for determining an optimized sequence of visits by a first consumer to a plurality of locations irrespective of travel distance, the method being implemented by a computing device having a memory storing instructions in the form of code and a processor configured by executing the instructions therein, the method comprising:
receiving, by the configured processor over a network from a remote device associated with the first consumer, a start time, a start location, a final location and the plurality of intervening locations to be visited by the first consumer; generating, by the configured processor, one or more models for predicting visit durations at each of the plurality of locations using transaction data and consumer location data associated with one or more of a plurality of consumers other than the first consumer being at respective intervening locations; generating, by the configured processor, one or more ordered sequences of locations to be visited by the first consumer, wherein each of the one or more ordered sequences begins with the start location, ends with the final location, includes at least a portion of the plurality of intervening locations, and wherein consecutive locations in a ordered sequence define respective travel segments there between; calculating, by the configured processor, a total duration for each of the one or more ordered sequences, wherein the total duration is calculated using the one or more models in view of the start time, and in view of travel times for the respective travel segments as determined from a database of travel data; and identifying, by the configured processor based on the calculated total durations, an optimal ordered sequence from among the one or more ordered sequences, wherein the optimal ordered sequence has the lowest calculated total duration irrespective of a total distance of the respective travel segments; and providing, by the configured processor over a network to the remote device associated with the first consumer, the optimal ordered sequence.