Catering mobile pick up station

• US 20040073449A1
• Filed: 10/08/2003
• Published: 04/15/2004
• Est. Priority Date: 12/08/2000
• Status: Abandoned Application

• Current Assignee: Ping Yang
• Original Assignee: Ping Yang
• Inventors: Yang, Ping
• Application Number:
  US10/681,685
• Publication Number:
  US 20040073449A1
• Time in Patent Office: Days
• US Class Current: 705/1
• CPC Class Codes: G06Q 10/08 Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
• CPC Class Codes: G06Q 10/083 Shipping

Abstract

A method and system for scheduling delivery and delivery of products to buyers. A Mobile Pickup Station (MPS) server is placed within a computer network and receives product shipping instructions from buyers or third party sellers. The MPS server determines optimal pickup points using buyer commuting information and buyer delivery requests. A portable kiosk or locker station, enclosing buyers'"'"' purchases within individually lockable lockers, is placed at a pickup point chosen by the buyers. The buyers use access codes, such as a product ID and password, to unlock the lockers and receive their purchases.

Claims

1. A computer implemented method of delivering a meal to a buyer, comprising:

selecting a pickup point and a pick up time for the meal by the buyer;

transporting to the pickup point the ingredients for the meal in a mobile pickup station, the mobile pickup station including food preparation equipment; and

preparing the meal at the pickup point for delivery to the buyer at the pickup time.

2. The method of claim 1, wherein selecting a pickup point further includes:

receiving route information from the buyer;

selecting from a plurality of pickup points a pickup point based on the route information.

3. The method of claim 2, wherein selecting a pickup point further includes:

receiving a channel width from the buyer;

calculating a channel area using the channel width and the route information;

determining a set of pickup points from the plurality of pickup points based on the channel area; and

selecting by the buyer from the set of pickup points a pickup point.

4. The method of claim 3, wherein the channel width is specified as a distance from a route generated from the route information.

5. The method of claim 3, wherein the channel width is specified as a buyer preferred traveling time from a route generated from the route information.

6. The method of claim 3, wherein the channel width is specified as a traveling distance along roadways from a route generated from the route information.

7. The method of claim 2, wherein the route information includes a plurality of landmarks, the method further comprising generating a shortest travel time route between the landmarks.

8. The method of claim 2, wherein the route information includes a zip code.

9. The method of claim 2, wherein the route information includes a city name.

10. The method of claim 2, wherein the route information includes a telephone number.

11. The method of claim 1, further comprising:

compiling buyer arrival times;

generating a meal preparation schedule using the compiled buyer arrival times; and

preparing the meal in accordance with the meal preparation schedule.

12. A computer implemented method for scheduling and delivery of a product to a buyer along the buyer'"'"'s commuting route, comprising:

receiving route information from the buyer;

receiving a channel width from the buyer;

calculating a channel area using the channel width and the route information;

determining a set of pickup points from the plurality of pickup points based on the channel area;

selecting by the buyer from the set of pickup points a pickup point; and

dispatching a mobile pickup station to the pickup point, the mobile pickup station containing the product for the buyer.

13. The method of claim 12, wherein the channel width is specified as a distance from a route generated from the route information.

14. The method of claim 12, wherein the channel width is specified as a buyer preferred traveling time from a route generated from the route information.

15. The method of claim 12, wherein the channel width is specified as a traveling distance along roadways from a route generated from the route information.

16. The method of claim 12, wherein the route information includes a plurality of landmarks, the method further comprising generating a shortest travel time route between the landmarks.

17. A data processing system for delivering a meal to a buyer, comprising:

a processor; and

a memory coupled to the processor, the memory having program instructions executable by the process stored therein, the program instructions including;

selecting a pickup point and a pick up time for the cooked meal by the buyer;

transporting to the pickup point the ingredients for the meal in a mobile pickup station, the mobile pickup station including food preparation equipment; and

preparing the meal at the pickup point for delivery to the buyer at the pickup time.

18. The data processing system of claim 17, wherein the program instructions for selecting a pickup point further include:

receiving route information from the buyer;

selecting from a plurality of pickup points a pickup point based on the route information.

19. The data processing system of claim 18, wherein the program instructions for selecting a pickup point further include:

receiving a channel width from the buyer;

calculating a channel area using the channel width and the route information;

determining a set of pickup points from the plurality of pickup points based on the channel area; and

selecting by the buyer from the set of pickup points a pickup point.

20. The data processing system of claim 19, wherein the channel width is specified as a distance from a route generated from the route information.

21. The data processing system of claim 19, wherein the channel width is specified as a buyer preferred traveling time from a route generated from the route information.

22. The data processing system of claim 19, wherein the channel width is specified as a traveling distance along roadways from a route generated from the route information.

23. The data processing system of claim 18, wherein the route information includes a plurality of landmarks, the program instructions further including generating a shortest travel time route between the landmarks.

24. The data processing system of claim 18, wherein the route information includes a zip code.

25. The data processing system of claim 18, wherein the route information includes a city name.

26. The data processing system of claim 18, wherein the route information includes a telephone number.

27. A data processing system for scheduling and delivery of a product to a buyer along the buyer'"'"'s commuting route, comprising:

a processor; and

a memory coupled to the processor, the memory having program instructions executable by the process stored therein, the program instructions including;

receiving route information from the buyer;

receiving a channel width from the buyer;

calculating a channel area using the channel width and the route information;

determining a set of pickup points from the plurality of pickup points based on the channel area;

selecting by the buyer from the set of pickup points a pickup point; and

dispatching a mobile pickup station to the pickup point, the mobile pickup station containing the product for the buyer.

28. The data processing system of claim 27, wherein the channel width is specified as a distance from a route generated from the route information.

29. The data processing system of claim 27, wherein the channel width is specified as a buyer preferred traveling time from a route generated from the route information.

30. The data processing system of claim 27, wherein the channel width is specified as a traveling distance along roadways from a route generated from the route information.

31. The data processing system of claim 27, wherein the route information includes a plurality of landmarks, the method further comprising generating a shortest travel time commuting route between the landmarks.