US2017262803A1PendingUtilityA1

Determining estimated pick-up/delivery windows using clustering

Assignee: United parcel service america incPriority: Mar 14, 2016Filed: Oct 27, 2016Published: Sep 14, 2017
Est. expiryMar 14, 2036(~9.6 yrs left)· nominal 20-yr term from priority
G06N 7/01G06Q 10/0838G06Q 10/0833G06Q 10/00G06Q 10/08
42
PatentIndex Score
0
Cited by
0
References
0
Claims

Abstract

Embodiments of the present invention provide methods, systems, apparatuses, and computer program products for determining delivery or pick-up windows. In one embodiment a method is provided comprising determining whether sufficient historical information/data to determine an estimated pick-up/delivery time is received for each weekday when deliveries are made and in response to determining that the sufficient historical information/data is available for a first weekday, determining an estimated pick-up/delivery time for the first serviceable point and for the first weekday based on the sufficient historical information/data for the first serviceable point and for the first weekday. Similarly, in response to determining that the sufficient historical information/data is not available for a second weekday, determining an estimated pick-up/delivery time for the first serviceable point and for the second weekday based on the first historical information/data.

Claims

exact text as granted — not AI-modified
2 . The computer implemented method of claim  1 , further comprising:
 identifying a third serviceable point;   determining whether a distance from the first serviceable point to the third serviceable point satisfies the configurable distance threshold;   determining whether a travel time from the first serviceable point to the third serviceable point satisfies the configurable travel time threshold; and   in response to determining (a) that the distance from the first serviceable point to the third serviceable point satisfies the configurable distance threshold and (b) that the travel time from the first serviceable point to the third serviceable point satisfies the configurable travel time threshold, storing the first serviceable point, the second serviceable point, and the third serviceable point in association with one another.   
     
     
         3 . The computer implemented method of claim  1 , further comprising:
 identifying a geocode for the first serviceable point; and   identifying, based at least in part on the geocode, the configurable distance threshold and the configurable travel time threshold.   
     
     
         4 . The computer implemented method of claim  1 , wherein the configurable distance threshold and the configurable travel time threshold correspond to a geographic location type. 
     
     
         5 . The computer implemented method of claim  1 , further comprising:
 receiving first historical data for first serviceable point, the first historical data comprising a plurality of dates and times of deliveries that occurred at the first serviceable point;   receiving second historical data for second serviceable point, the second historical data comprising a plurality of dates and times of deliveries that occurred at the second serviceable point; and   determining an estimated delivery time for the first serviceable point based at least in part on the first historical data and the second historical data.   
     
     
         6 . The computer implemented method of  claim 5 , further comprising:
 determining a confidence score for the estimated delivery time for the first serviceable point, the confidence score indicating the likelihood that the estimated delivery time is accurate; and   determining an estimated delivery window for the first serviceable point based at least in part on the estimated delivery time and the confidence score, wherein the length of the estimated delivery window is based on the confidence score.   
     
     
         7 . The computer implemented method of  claim 6 , wherein length of the estimated delivery window is inversely proportional to the confidence score. 
     
     
         8 . A system, comprising:
 a data processing apparatus; and   a computer memory apparatus in data communication with the data processing apparatus and storing instructions executable by the data processing apparatus and that upon such execution cause the data processing apparatus to perform operations comprising:   identifying a first serviceable point and a second serviceable point;   determining whether a distance from the first serviceable point to the second serviceable point satisfies a configurable distance threshold;   determining whether a travel time from the first serviceable point to the second serviceable point satisfies a configurable travel time threshold;   in response to determining (a) that the distance from the first serviceable point to the second serviceable point satisfies the configurable distance threshold and (b) that the travel time from the first serviceable point to the second serviceable point satisfies the configurable travel time threshold, storing the first serviceable point and the second serviceable point in association with one another as a cluster.   
     
     
         9 . The system of  claim 8 , wherein the operations further comprise:
 identifying a third serviceable point;   determining whether a distance from the first serviceable point to the third serviceable point satisfies the configurable distance threshold;   determining whether a travel time from the first serviceable point to the third serviceable point satisfies the configurable travel time threshold; and   in response to determining (a) that the distance from the first serviceable point to the third serviceable point satisfies the configurable distance threshold and (b) that the travel time from the first serviceable point to the third serviceable point satisfies the configurable travel time threshold, storing the first serviceable point, the second serviceable point, and the third serviceable point in association with one another.   
     
     
         10 . The system of  claim 8 , wherein the operations further comprise:
 identifying a geocode for the first serviceable point; and   identifying, based at least in part on the geocode, the configurable distance threshold and the configurable travel time threshold.   
     
     
         11 . The system of  claim 8 , wherein the configurable distance threshold and the configurable travel time threshold correspond to a geographic location type. 
     
     
         12 . The system of  claim 8 , wherein the operations further comprise:
 receiving first historical data for first serviceable point, the first historical data comprising a plurality of dates and times of deliveries that occurred at the first serviceable point;   receiving second historical data for second serviceable point, the second historical data comprising a plurality of dates and times of deliveries that occurred at the second serviceable point; and   determining an estimated delivery time for the first serviceable point based at least in part on the first historical data and the second historical data.   
     
     
         13 . The system of  claim 8 , wherein the operations further comprise:
 determining a confidence score for the estimated delivery time for the first serviceable point, the confidence score indicating the likelihood that the estimated delivery time is accurate; and   determining an estimated delivery window for the first serviceable point based at least in part on the estimated delivery time and the confidence score, wherein the length of the estimated delivery window is based on the confidence score.   
     
     
         14 . The system of  claim 13 , wherein length of the estimated delivery window is inversely proportional to the confidence score. 
     
     
         15 . A computer program product comprising at least one non-transitory computer-readable storage medium having computer-readable program code portions stored therein, the computer-readable program code portions comprising:
 identifying a first serviceable point and a second serviceable point;   determining whether a distance from the first serviceable point to the second serviceable point satisfies a configurable distance threshold;   determining whether a travel time from the first serviceable point to the second serviceable point satisfies a configurable travel time threshold;   in response to determining (a) that the distance from the first serviceable point to the second serviceable point satisfies the configurable distance threshold and (b) that the travel time from the first serviceable point to the second serviceable point satisfies the configurable travel time threshold, storing the first serviceable point and the second serviceable point in association with one another as a cluster.   
     
     
         16 . The computer program product of  claim 15 , wherein the code portions further comprise:
 identifying a third serviceable point;   determining whether a distance from the first serviceable point to the third serviceable point satisfies the configurable distance threshold;   determining whether a travel time from the first serviceable point to the third serviceable point satisfies the configurable travel time threshold; and   in response to determining (a) that the distance from the first serviceable point to the third serviceable point satisfies the configurable distance threshold and (b) that the travel time from the first serviceable point to the third serviceable point satisfies the configurable travel time threshold, storing the first serviceable point, the second serviceable point, and the third serviceable point in association with one another.   
     
     
         17 . The computer program product of  claim 15 , wherein the code portions further comprise:
 identifying a geocode for the first serviceable point; and   identifying, based at least in part on the geocode, the configurable distance threshold and the configurable travel time threshold.   
     
     
         18 . The computer program product of  claim 15 , wherein the configurable distance threshold and the configurable travel time threshold correspond to a geographic location type. 
     
     
         19 . The computer program product of  claim 15 , wherein the code portions further comprise:
 receiving first historical data for first serviceable point, the first historical data comprising a plurality of dates and times of deliveries that occurred at the first serviceable point;   receiving second historical data for second serviceable point, the second historical data comprising a plurality of dates and times of deliveries that occurred at the second serviceable point; and   determining an estimated delivery time for the first serviceable point based at least in part on the first historical data and the second historical data.   
     
     
         20 . The computer program product of  claim 19 , wherein the code portions further comprise:
 determining a confidence score for the estimated delivery time for the first serviceable point, the confidence score indicating the likelihood that the estimated delivery time is accurate; and   determining an estimated delivery window for the first serviceable point based at least in part on the estimated delivery time and the confidence score, wherein the length of the estimated delivery window is based on the confidence score.   
     
     
         21 . The computer program product of  claim 20 , wherein the wherein length of the estimated delivery window is inversely proportional to the confidence score.

Join the waitlist — get patent alerts

Track US2017262803A1 — get alerts on status changes and closely related new filings.

We store only your email — no account needed. See our privacy policy.