Shopping optimizer

• US 9,978,090 B2
• Filed: 07/05/2013
• Issued: 05/22/2018
• Est. Priority Date: 07/05/2013
• Status: Active Grant

• Current Assignee: Globalfoundries US Incorporated (GlobalFoundries, Inc.)
• Original Assignee: GlobalFoundries, Inc.
• Inventors: Bank, Judith H., Bradley, Lisa M., Etgen, Michael P., Sun, Lin
• Primary Examiner(s): CASEY, ALEXIS M
• Application Number:
  US13/935,762
• Publication Number:
  US 20150012380A1
• Time in Patent Office: 1,782 Days
• Field of Search: 705 268
• CPC Class Codes: G06Q 30/0613 Third-party assisted
• CPC Class Codes: G06Q 30/0633 Lists, e.g. purchase orders, compilation or processing

Abstract

A method, system, and/or computer program product optimizes shopping for one or more desired items. An identification of a desired item, which is initially available for purchase at a first physical store, is received. An identity of a second shopper, who also wants the desired item and is currently shopping for the desired item, is received. One or more processors then determine a likelihood of the first shopper arriving at the first physical store before the second shopper purchases a last available instance of the desired item in the first physical store. In response to determining that the first shopper will arrive at the first physical store before the last available instance of the desired item has been purchased by the second shopper, the first shopper is provided with an identity of the first physical store.

Claims

1. A computer program product for optimizing a shopping itinerary, the computer program product comprising a non-transitory computer readable storage medium having program code embodied therewith, the program code readable and executable by one or more processors to perform a method comprising:

receiving, by the one or more processors, from a computing device of a first shopper, over a network, an identification of a first desired item, wherein the identification of the first desired item is from a list of multiple desired items for the first shopper, wherein each desired item of the multiple desired items is offered at a discounted price, at a different physical store, and at a specific time on a given date, and wherein the first desired item is available for purchase at a first physical store at a first specific time on a first given date comprising a point in time of the receiving from the computing device of the first shopper, the identification of the first desired item;

receiving, by the one or more processors, from a computing device of a second shopper, over the network, an identity of the second shopper, wherein the second shopper has been identified as also desiring the first desired item and currently shopping for the first desired item;

determining a likelihood of the first shopper arriving at the first physical store before the second shopper purchases a last available instance of the first desired item in the first physical store, wherein the determining comprises;

ascertaining, by the one or more processors, a geographical location of the first shopper at the point in time of the receiving from the computing device of the first shopper, the identification of the first desired item, based on utilizing a global positioning system in the computing device of the first shopper over the network;

ascertaining, by the one or more processors, a geographical location of the second shopper at the point in time of the receiving from the computing device of the first shopper, the identification of the first desired item, based on utilizing a global positioning system in the computing device of the second shopper over the network;

determining, by the one or more processors, relative travel times to the first physical store for the first shopper and the second shopper from the point in time of the receiving from the computing device of the first shopper, the identification of the first desired item;

determining, by the one or more processors, a time at which a quantity of the first desired items will be exhausted, based on polling, at pre-determined intervals, an inventory management system to determine the quantity of the first desired items that is available at the first physical store and a rate at which the first desired item is sold at the first physical store during the pre-determined intervals; and

determining, by the one or more processors, the likelihood of the first shopper arriving at the first physical store before the second shopper purchases the last available instance of the first desired item in the first physical store, by comparing the time at which the quantity of the first desired items will be exhausted with the relative travel times;

based on the likelihood, determining, by the or more processors, that the first shopper will arrive at the first physical store before the last available instance of the first desired item has been purchased by the second shopper;

computing, by the one or more processors, directions to the first physical store from the geographical location of the first shopper, wherein based on following the direction, the first shopper will arrive at the first physical store at a time before the time at which the quantity of the first desired items will be exhausted;

providing, by the one or more processors, over the network, the first shopper with an identity of the first physical store, wherein the providing comprises providing the global positioning system in the computing device of the first shopper with directions to the first physical store to enable the computing device of the first shopper to navigate to the first physical store to arrive before the time at which the quantity of the first desired items will be exhausted; and

generating, by the one or more processors, a shopping itinerary for the first shopper, wherein the shopping itinerary comprises, for the first desired item, the identity of the first physical store and the directions to the first physical store and for each remaining desired item on the list of multiple desired items, an identity of the different physical store and directions to the different physical store with an anticipated arrival at the specific time on a given date when the desired item is offered at the discounted price.

3. The computer program product of claim 1, wherein the method further comprises:

receiving, by the one or more processors, from the computing device of the first shopper, over the network, an identification of a second desired item, wherein the identification of the second desired item is generated by the first shopper, and wherein the second desired item is available for purchase at a second physical store at a point in time of the receiving from the computing device of the first shopper, the identification of the second desired item;

receiving, by the one or more processors, from a computing device of a second shopper, over the network, an identity of the second shopper, wherein the second shopper has been identified as also desiring the second desired item and currently shopping for the second desired item;

determining a likelihood of the first shopper arriving at the second physical store before the second shopper purchases a last available instance of the second desired item in the second physical store, wherein said determining comprises;

ascertaining, by the one or more processors, a geographical location of the first shopper at the point in time of the receiving from the computing device of the first shopper, the identification of the second desired item, based on utilizing a global positioning system in the computing device of the first shopper over the network;

ascertaining, by the one or more processors, a geographical location of the second shopper at the point in time of the receiving from the computing device of the first shopper, the identification of the second desired item, based on utilizing a global positioning system in the computing device of the second shopper over the network;

determining, by the one or more processors, relative travel times to the second physical store for the first shopper and the second shopper from the point in time of the receiving from the computing device of the first shopper, the identification of the second desired item;

determining, by the one or more processors, a time at which the quantity of the second desired items will be exhausted, based on polling, at pre-determined intervals, an inventory management system comprising inventory data of the second physical store to determine a quantity of the second desired items that is available at the second physical store and a rate at which the second desired item is sold at the second physical store during the pre-determined intervals; and

determining, by the one or more processors, the likelihood of the first shopper arriving at the second physical store before the second shopper purchases the last available instance of the second desired item in the second physical store, by comparing the time at which the quantity of the second desired items will be exhausted with the relative travel times;

based on the likelihood, determining, by the or more processors, that the first shopper will arrive at the second physical store after the last available instance of the second desired item has been purchased by the second shopper;

computing, by the one or more processors, directions to a third physical store from the geographical location of the first shopper, wherein the third physical location currently has the second desired item in stock.

4. The computer program product of claim 3, wherein the method further comprises:

receiving a ranked list of desired items from the first shopper, wherein the second desired item is a highest ranked item on the ranked list of desired items; and

directing the first shopper to a location that has a secondary item in stock, wherein the secondary item is on the ranked list of desired items, and wherein the secondary item is ranked lower than the second desired item.

5. The computer program product of claim 3, wherein the method further comprises:

identifying an alternative item to the second desired item based on a functionality of the desired item being equivalent to a functionality of the alternative item; and

providing an identity of a fourth physical store that currently has the alternative item in stock.

6. The computer program product of claim 3, wherein determining, by the one or more processors, relative travel times to the second physical store for the first shopper and the second shopper from the point in time of the receiving from the computing device of the first shopper, the identification of the second desired item, further comprises:

detecting real-time travel route delays to the second physical store.

7. The computer program product of claim 1, the method further comprises:

identifying the second shopper based on obtaining by the one or more processors, a shopping history of the second shopper, wherein the shopping history of the second shopper describes the second shopper'"'"'s history of purchasing the first desired item at a discounted price equivalent to a price of the first item at the point in time of the receiving from the computing device of the first shopper, the identification of the first desired item.

8. The computer program product of claim 1, wherein the desired item was sold out before the first shopper was able to purchase the desired item at the first physical store, and wherein the method further comprises:

in response to the first physical store restocking the desired item, transmitting an alert to the first shopper, wherein the alert describes a new availability of the desired item at the first physical store.

9. The computer program product of claim 1, wherein generating the shopping itinerary for the first shopper further comprises:

determining, by the one or more processors, for each physical location, a period of time during the specific time on the given date during which crowds at each different physical stores will be lightest compared to other periods of times during the specific time on the given date; and

generating the shopping itinerary for the first shopper, wherein the shopping itinerary directs the first shopper to each of the different physical stores during the period of time when the crowds will be lightest compared to the other periods of time.

10. The computer program product of claim 3, wherein determining the likelihood of the first shopper arriving at the second physical store before the second shopper purchases the last available instance of the second desired item in the second physical store further comprises:

determining a first probability that the first shopper will arrive at the second physical store before said last available instance of the second desired item has been purchased by the second shopper at the second physical store;

determining a second probability that the first shopper will arrive at a third physical store before said last available instance of the second desired item has been purchased by the second shopper at the third physical store; and

in response to the first probability being lower than a predetermined level set by the first shopper, and in response to the second probability being higher than the predetermined level set by the first shopper, determining the likelihood that the first shopper will arrive at the second physical store after the last available instance of the second desired item has been purchased by the second shopper and directing the first shopper to the second physical store.

11. The computer program product of claim 3, wherein determining the likelihood of the first shopper arriving at the second physical store before the second shopper purchases a last available instance of the second desired item in the second physical store, further comprises:

obtaining, by the one or more processors, based on receiving an input from the computing device of the first shopper, a predetermined likelihood level;

determining the likelihood that the first shopper will arrive at the second physical store before said last available instance of the second desired item has been purchased by the second shopper at the second physical store

lower than the predetermined likelihood level; and

directing the first shopper to a the third physical store.

12. The computer program product of claim 3, wherein the second desired item is a highest ranked item from a ranked list of multiple desired items for the first shopper, and wherein the method further comprises:

directing the first shopper to a physical location of a lower ranked item from the ranked list of multiple desired items for the first shopper.

13. The computer program product of claim 1, wherein a third shopper is an agent of the first shopper, and wherein the method further comprises:

in response to determining that the third shopper has arrived at the first physical store before the second shopper, issuing authorization from the first shopper to the third shopper to purchase the desired item.

14. The computer program product of claim 1, wherein the desired item is advertised to a specific geographic region, and wherein the method further comprises:

determining an estimated quantity of shoppers within the specific geographic region who will be shopping for copies of the desired item at a particular time; and

adjusting the likelihood of the first shopper arriving at the first physical store before the last available instance of the desired item in the first physical store is purchased based on the estimated quantity of shoppers within the specific geographic region who will be shopping for copies of the desired item at the particular time.

15. The computer program product of claim 1, wherein the first shopper desires a first item and a second item, wherein the first shopper ranks the first item over the second item in importance to the first shopper, and wherein the second shopper also desires the first item and the second item, but wherein the second shopper ranks the second item over the first item in importance to the second shopper, and wherein the method further comprises:

in response to determining that the first shopper has access to the second item and that the second shopper has access to the first item, directing the first shopper to purchase the second item on behalf of the second shopper and the second shopper to purchase the first item on behalf of the first shopper.

16. The computer program product of claim 1, wherein the method further comprises:

directing the first shopper to a specific location within the first physical store where the desired item is located.

17. The computer program product of claim 1, wherein the method further comprises:

in response to determining that the desired item has sold out at the first physical store without the first shopper purchasing an instance of the desired item, transmitting a notice to the first shopper of when the desired item will next be in stock at the first physical store.

18. The computer program product of claim 1, wherein the method further comprises:

receiving a pictorial representation of the desired item from the first shopper; and

creating the identification of the desired item from the pictorial representation of the desired item.

2. A computer system comprising:

computer readable memory;

one or more processors in communication with the computer readable memory; and

program instructions executable by the one or more processors via the memory to perform a method, the method comprising;

receiving, by the one or more processors, from a computing device of a first shopper, over a network, an identification of a first desired item, wherein the identification of the first desired item is from a list of multiple desired items for the first shopper, wherein each desired item of the multiple desired items is offered at a discounted price, at a different physical store, and at a specific time on a given date, and wherein the first desired item is available for purchase at a first physical store at a first specific time on a first given date comprising a point in time of the receiving from the computing device of the first shopper, the identification of the first desired item;

receiving, by the one or more processors, from a computing device of a second shopper, over the network an identity of the second shopper, wherein the second shopper has been identified as also desiring the first desired item and currently shopping for the first desired item;

determining, by the one or more processors, a likelihood of the first shopper arriving at a first physical store before the second shopper purchases a last available instance of the first desired item in the first physical store, the determining comprising;

ascertaining, by the one or more processors, a geographical location of the first shopper at the point in time of the receiving from the computing device of the first shopper, the identification of the first desired item, based on utilizing a global positioning system in the computing device of the first shopper over the network;

ascertaining, by the one or more processors, a geographical location of the second shopper at the point in time of the receiving from the computing device of the first shopper, the identification of the first desired item, based on utilizing a global positioning system in the computing device of the second shopper over the network;

determining, by the one or more processors, relative travel times to the first physical store for the first shopper and the second shopper from the point in time of the receiving from the computing device of the first shopper, the identification of the first desired item;

determining, by the one or more processors, a time at which a quantity of the first desired items will be exhausted, based on polling, at pre-determined intervals, an inventory management system to determine the quantity of the first desired items that is available at the first physical store and a rate at which the first desired item is sold at the first physical store during the pre-determined intervals; and

determining, by the one or more processors, the likelihood of the first shopper arriving at the first physical store before the second shopper purchases the last available instance of the first desired item in the first physical store, by comparing the time at which the quantity of the first desired items will be exhausted with the relative travel times;

based on the likelihood, determining, by the or more processors, that the first shopper will arrive at the first physical store before the last available instance of the first desired item has been purchased by the second shopper;

computing, by the one or more processors, directions to the first physical store from the geographical location of the first shopper, wherein based on following the direction, the first shopper will arrive at the first physical store at a time before the time at which the quantity of the first desired items will be exhausted; and

providing, by the one or more processors, over the network, the first shopper with an identity of the first physical store, wherein the providing comprises providing the global positioning system in the computing device of the first shopper with directions to the first physical store to enable the computing device of the first shopper to navigate to the first physical store to arrive before the time at which the quantity of the first desired items will be exhausted; and

generating, by the one or more processors, a shopping itinerary for the first shopper, wherein the shopping itinerary comprises, for the first desired item, the identity of the first physical store and the directions to the first physical store and for each remaining desired item on the list of multiple desired items, an identity of the different physical store and directions to the different physical store with an anticipated arrival at the specific time on a given date when the desired item is offered at the discounted price.