Cognitive route planning for unit replenishment in a distributed network

Patent metadata

Field	Value
Publication number	US-11087246-B2
Application number	US-201916533346-A
Country	US
Kind code	B2
Filing date	Aug 6, 2019
Priority date	Jan 26, 2017
Publication date	Aug 10, 2021
Grant date	Aug 10, 2021

Abstract

Techniques facilitating cognitive route planning for unit replenishment in a distributed network are provided. In one example, a computer-implemented method can include determining, by a system operatively coupled to one or more processors, a time limit for unit replenishment at a unit dispensing device based on a unit depletion rate for the unit dispensing device. The computer-implemented method can also include generating, by the system, a route plan for the unit replenishment based on the unit depletion rate, the time limit, and respective unit depletion rates and respective time limits for other unit dispensing devices of a set of unit dispensing devices. The unit depletion rate can be based on historical and projected withdrawal data. Further, the unit dispensing device can be included in the set of unit dispensing devices located within a defined area. The time limit can indicate time remaining until the unit dispensing device is depleted of units.

First claim

What is claimed is:

1. A computer-implemented method, comprising:
determining, by a system operatively coupled to one or more processors, a time limit for unit replenishment at a unit dispensing device based on a unit depletion rate for the unit dispensing device, wherein the time limit indicates an amount of time remaining until the unit dispensing device is depleted of units;
generating, by the system, using a non-optimal traveling salesman problem with a greedy water-fall process, a route plan for the unit replenishment based on the unit depletion rate, the time limit, and respective unit depletion rates and respective time limits for other unit dispensing devices of a set of unit dispensing devices; and
dispatching, by the system, at least one unit replenishment vehicle according to the route plan.

2. The computer-implemented method of claim 1 , wherein the unit depletion rate is based on projected withdrawal data that comprises data associated with a related activity that indicates an impact on the unit depletion rate, the related activity is a search for unit dispensing devices within an electronic mapping application installed on a computing device, and wherein the unit depletion rate is determined based on:
identifying a location of the computing device within a defined area; and
determining a quantity of units expected to be withdrawn from the unit dispensing device based on information known about an identity of an entity associated with the computing device.

3. The computer-implemented method of claim 1 , wherein the unit depletion rate is based on projected withdrawal data that comprises data associated with a related activity that indicates an impact on the unit depletion rate, the related activity is an event, and wherein the unit depletion rate is determined based on:
identifying an occurrence of the event based on information received from one or more computing devices; and
determining a quantity of units expected to be withdrawn from the unit dispensing device based on information known about respective identities of entities associated with the one or more computing devices, wherein the event is an unscheduled event.

4. The computer-implemented method of claim 1 , wherein the generating the route plan comprises:
determining a route from a source of units to the unit dispensing device and the other unit dispensing devices in an order selected based on the time limit and the respective time limits.

5. The computer-implemented method of claim 1 , wherein the generating the route plan comprises:
determining a first route for a first unit replenishment vehicle and a second route for a second unit replenishment vehicle, wherein the first route and the second route originate at a source of the units and are determined based on the time limit and the respective time limits.

6. The computer-implemented method of claim 1 , further comprising:
monitoring, by the system, an actual unit depletion rate of the unit dispensing device;
determining, by the system, an adjusted time limit for the unit replenishment based on a determination that the actual unit depletion rate is different than the unit depletion rate by a defined amount; and
generating, by the system, an updated route plan for the unit replenishment based on the actual unit depletion rate and the adjusted time limit and based on the respective unit depletion rates and the respective time limits for the other unit dispensing devices of the set of unit dispensing devices.

7. The computer-implemented method of claim 1 , further comprising:
determining, by the system, an expedited time limit for the unit replenishment at the unit dispensing device based on an expedited unit depletion rate for the unit dispensing device, the expedited unit depletion rate is based on a determination that unit withdrawals from the unit dispensing device are more than expected; and
generating, by the system, an updated route plan for the unit replenishment based on the expedited unit depletion rate, the expedited time limit, and the respective unit depletion rates and the respective time limits for other dispensing devices of the set of unit dispensing devices.

8. The computer-implemented method of claim 7 , wherein the generating the updated route plan comprises dispatching a unit replenishment vehicle to the unit dispensing device, and wherein the unit replenishment vehicle is associated with a second defined area.

9. The computer-implemented method of claim 1 , wherein the generating the route plan comprises determining the time limit based on a determination of a second amount of time remaining before a quantity of units within the unit dispensing device reaches a defined unit level.

10. The computer-implemented method of claim 1 , wherein the unit depletion rate is based on historical withdrawal data and projected withdrawal data, the computer-implemented method further comprising receiving, by the system, data indicative of respective patterns of unit withdraws from the unit dispensing device and associated with one or more entities, wherein the historical withdrawal data comprises data indicative of the respective patterns of unit withdraws.

11. The computer-implemented method of claim 1 , wherein the generating the route plan comprises increasing a processing speed of the unit replenishment at the set of unit dispensing devices.

12. The computer-implemented method of claim 1 , wherein the unit depletion rate is based on projected withdrawal data that comprises data associated with a related activity that indicates an impact on the unit depletion rate, the related activity is an event scheduled to occur at a venue within a defined distance of the unit dispensing device, and wherein the unit depletion rate is determined based on:
determining a quantity of units expected to be withdrawn from the unit dispensing device based on information known about the event.

13. A system, comprising:
a memory that stores computer executable components; and
a processor that executes the computer executable components stored in the memory, wherein the computer executable components comprise:
a timing component that determines a time limit for unit replenishment at a unit dispensing device based on a unit depletion rate for the unit dispensing device, wherein the time limit indicates an amount of time remaining until the unit dispensing device is depleted of units; and
a scheduling component that:
generates, using a non-optimal traveling salesman problem with a greedy water-fall process, a route plan for the unit replenishment based on the unit depletion rate, the time limit, and respective unit depletion rates and respective time limits for other unit dispensing devices of a set of unit dispensing devices; and
dispatches at least one unit replenishment vehicle according to the route plan.

14. The system of claim 13 , wherein the scheduling component schedules the unit replenishment before a second unit replenishment of a second unit dispensing device of the set of unit dispensing devices based on a determination that the unit depletion rate is shorter than a second unit depletion rate of the second unit dispensing device.

15. The system of claim 13 , wherein the respective projected withdrawal data comprises data associated with a related activity that indicates a potential impact on the unit depletion rate, and wherein the related activity is a search for unit dispensing devices within an electronic mapping application installed on a computing device, the computer executable components further comprise:
a location component that determines a location of the computing

Assignees

• IBM

Inventors

• Guo Shang Qing
• Lenchner Jonathan
• Mukherjee Maharaj

Classifications

• G06Q10/10

  Office automation; Time management · CPC title

• G06Q10/08355

  Routing methods · CPC title

• G06F17/00

  Digital computing or data processing equipment or methods, specially adapted for specific functions (information retrieval, database structures or file system structures therefor G06F16/00) · CPC title

• G06Q10/047 Primary

  Optimisation of routes or paths, e.g. travelling salesman problem · CPC title