US2021312370A1PendingUtilityA1

Systems and methods for computerized balanced delivery route assignment

Assignee: COUPANG CORPPriority: Feb 18, 2019Filed: Jun 22, 2021Published: Oct 7, 2021
Est. expiryFeb 18, 2039(~12.6 yrs left)· nominal 20-yr term from priority
G06Q 10/063112G06Q 10/1097G06Q 10/047G06Q 10/105G06Q 10/06315G06Q 10/06316G06Q 10/063116G06Q 10/08355G06Q 10/103G06F 16/29
65
PatentIndex Score
0
Cited by
0
References
0
Claims

Abstract

A system for attendance assignment. The system may include a memory storing instructions and at least processor configured to execute the instructions to perform operations. The operations may include retrieving, from a database, a plurality of delivery routes and a plurality of delivery sub-routes, wherein the delivery sub-routes are part of the delivery routes; calculating, based on the retrieval, a number of packages allocated to the delivery sub-routes; receiving, as input, a number and a type of workers available for deliveries, wherein the type including at least one of classification characteristics or efficiency characteristics; assigning, based on the calculated number of packages and the received input, the workers to a plurality of groups, wherein the groups correspond to different delivery routes or sub-routes; and comparing, based on the assignment, the assigned workers against the delivery routes or the delivery sub-routes.

Claims

exact text as granted — not AI-modified
1 - 20 . (canceled) 
     
     
         21 . A computer-implemented system for attendance assignment, the system comprising:
 a memory storing instructions; and   at least one processor configured to execute the instructions to:
 retrieve, from a database, a plurality of delivery routes and a plurality of delivery sub-routes, wherein the delivery sub-routes are part of the delivery routes; 
 receive, as a first input, a package distribution and a number and a type of workers available for deliveries, the type including classification characteristics and efficiency characteristics; 
 assign, based on a number of packages allocated to delivery sub-routes, the workers to a plurality of groups, wherein the groups correspond to different delivery routes or sub-routes; 
 generate, based on the classification characteristics and the efficiency characteristics, a plurality of candidate routes associated with the workers; 
 calibrate, based on the generated candidate routes, the delivery sub-routes; 
 determine, using at least the package distribution, a visiting sequence; 
 calculate an expected delivery efficiency for a first pre-defined region associated with at least one of the delivery routes, the expected delivery efficiency being based on at least one driving time between the first pre-defined region and a second pre-defined region; 
 recalibrate, based on the calculated expected delivery efficiency, the at least one of the delivery sub-routes; 
 receive, over a network, delivery information from an electronic device associated with a delivery worker; and 
 transmit, over the network, the recalibrated at least one of the delivery sub-routes to the display of the electronic device associated with the delivery worker. 
   
     
     
         22 . The system of  claim 21 , wherein:
 the type of workers is associated with a weight; and   calculating the expected delivery efficiency is based on the weight.   
     
     
         23 . The system of  claim 21 , wherein at least one of the first or second pre-defined region is designated for the type of workers. 
     
     
         24 . The system of  claim 21 , wherein calculating the expected delivery efficiency comprises calculating the expected delivery efficiency based on geographical data comprising at least one of: landscape data, business data, residential data, parking data, or building data. 
     
     
         25 . The system of  claim 21 , wherein calculating the expected delivery efficiency comprises calculating the expected delivery efficiency based on historical delivery data associated with deliveries performed during a predetermined time period. 
     
     
         26 . The system of  claim 21 , wherein the expected delivery efficiency is measured by percentiles of addresses visited by the workers per hour (APH). 
     
     
         27 . The system of  claim 26 , wherein the at least one processor is further configured to execute the instructions to calculate the percentiles based on historical data. 
     
     
         28 . The system of  claim 21 , wherein the type of worker is associated with an amount of packages for a worker of the type to deliver. 
     
     
         29 . The system of  claim 28 , wherein assigning the workers to the groups is based on the amount of packages. 
     
     
         30 . The system of  claim 21 , wherein assigning the workers to the groups is based on a second input. 
     
     
         31 . The system of  claim 21 , wherein the at least one processor is further configured to execute the instructions to determine an optimal combination of regions comprising at least one of the first pre-defined region and the second pre-defined region. 
     
     
         32 . The system of  claim 21 , wherein the at least one processor is further configured to execute the instructions to generate the delivery routes and the delivery sub-routes. 
     
     
         33 . The system of  claim 21 , wherein the at least one processor is further configured to execute the instructions to:
 generate at least one of delivery regions or delivery sub-regions associated with the delivery routes or the delivery sub-routes; and   combine at least two of the delivery regions and delivery sub-regions into new regions for delivery.   
     
     
         34 . The system of  claim 33 , wherein combining at least two of the delivery regions and delivery sub-regions into new regions for delivery is based on the calculated expected delivery efficiency. 
     
     
         35 . The system of  claim 21 , wherein the at least one processor is further configured to execute the instructions to:
 increase or decrease a quantity of the delivery routes to match the number of workers; or   increase or decrease a quantity of the delivery sub-routes to match the number of workers.   
     
     
         36 . A computer-implemented method for attendance assignment, the method comprising:
 retrieving, from a database, a plurality of delivery routes and a plurality of delivery sub-routes, wherein the delivery sub-routes are part of the delivery routes;   receiving, as a first input, a package distribution and a number and a type of workers available for deliveries, the type including classification characteristics and efficiency characteristics;   assigning, based on a number of packages allocated to delivery sub-routes, the workers to a plurality of groups, wherein the groups correspond to different delivery routes or sub-routes;   generating, based on the classification characteristics and the efficiency characteristics, a plurality of candidate routes associated with the workers;   calibrating, based on the generated candidate routes, the delivery sub-routes;   determining, using at least the package distribution, a visiting sequence;   calculating an expected delivery efficiency for a first pre-defined region associated with at least one of the delivery routes, the expected delivery efficiency being based on at least one driving time between the first pre-defined region and a second pre-defined region;   recalibrating, based on the calculated expected delivery efficiency, the at least one of the delivery sub-routes;   receiving, over a network, delivery information from an electronic device associated with a delivery worker; and   transmitting, over the network, the recalibrated at least one of the delivery sub-routes to the display of the electronic device associated with the delivery worker.   
     
     
         37 . The computer-implemented method of  claim 36 , wherein calculating the expected delivery efficiency comprises calculating the expected delivery efficiency based on geographical data comprising at least one of: landscape data, business data, residential data, parking data, or building data. 
     
     
         38 . The computer-implemented method of  claim 36 , wherein calculating the expected delivery efficiency comprises calculating the expected delivery efficiency based on historical delivery data associated with deliveries performed during a predetermined time period. 
     
     
         39 . The computer-implemented method of  claim 36 , wherein the expected delivery efficiency is measured by percentiles of addresses visited by the workers per hour (APH). 
     
     
         40 . The computer-implemented method of  claim 39 , further comprising calculating the percentiles based on historical data.

Join the waitlist — get patent alerts

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

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