Peer to Peer Delivery System

• US 20160104113A1
• Filed: 10/13/2014
• Published: 04/14/2016
• Est. Priority Date: 10/13/2014
• Status: Active Application

• Current Assignee: Marc Gorlin
• Original Assignee: Marc Gorlin
• Inventors: Gorlin, Marc
• Application Number:
  US14/512,961
• Publication Number:
  US 20160104113A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06Q 10/08355 Routing methods

Abstract

A method, apparatus, and computer readable storage to implement an N-tier application package delivery service. Drivers can register for the system and then be presented with automatic alerts when pick up points (for delivery tasks) are nearby or along their current route so that drivers can make extra money by picking packages that are available on or near their current route and then deliver them. Driving patterns of each driver are detected, stored, and analyzed so that their destinations can automatically be predicted.

Claims

1. A method, comprising:

causing one or more electronic processing units to perform;

maintaining a set of delivery tasks in an electronic database;

receiving an electronic request from a driver to generate a consolidation route comprising a starting point and a maximum time; and

generating the consolidation route, the consolidation route comprising a plurality of delivery tasks, wherein the consolidation route is geographically compatible with the starting point, wherein an estimated time to complete the consolidation route does not exceed the maximum time.

2. The method as recited in claim 1, wherein whether the consolidation route is geographically compatible with the starting point is satisfied when completion of the consolidation route does not require an excessive amount of additional time.

3. The method as recited in claim 2, wherein an excessive amount of time is satisfied by exceeding a predefined time threshold.

4. The method as recited in claim 1, wherein whether the consolidation route is geographically compatible with the starting point is satisfied when completion of the consolidation route does not require an excessive amount of additional miles.

5. The method as recited in claim 4, wherein an excessive amount of additional miles is satisfied by exceeding a predefined mileage threshold.

6. The method as recited in claim 1, wherein the request further comprises and ending point defining the driver'"'"'s location when the consolidation route is completed.

7. The method as recited in claim 1, further comprising generating and displaying a set of proposed consolidation routes.

8. The method as recited in claim 7, further comprising displaying an hourly rate for the each respective consolidation route.

9. The method as recited in claim 7, wherein the request further comprises an amount of empty space in the driver'"'"'s vehicle available for packages.

10. The method as recited in claim 1, further comprising, receiving an acceptance of the consolidation route by the driver, and displaying a navigation map with step by step directions which complete the consolidation route.

11. An apparatus, comprising:

one or more electronic processing units connected to a computer readable storage medium which stores computer readable instructions which are programmed to cause the one or more electronic processing units to;

maintain a set of delivery tasks;

receive a request from a driver to generate a consolidation route comprising a starting point and a maximum time; and

generate the consolidation route, the consolidation route comprising a plurality of delivery tasks, wherein the consolidation route is geographically compatible with the starting point, wherein an estimated time to complete the consolidation route does not exceed the maximum time.

12. The apparatus as recited in claim 11, wherein the instructions are further programmed such that whether the consolidation route is geographically compatible with the starting point is satisfied when completion of the consolidation route does not require an excessive amount of additional time.

13. The apparatus as recited in claim 12, wherein the instructions are further programmed such that an excessive amount of time is satisfied by exceeding a predefined time threshold.

14. The apparatus as recited in claim 11, wherein the instructions are further programmed such that whether the consolidation route is geographically compatible with the starting point is satisfied when completion of the consolidation route does not require an excessive amount of additional miles.

15. The apparatus as recited in claim 14, wherein the instructions are further programmed such that an excessive amount of additional miles is satisfied by exceeding a predefined mileage threshold.

16. The apparatus as recited in claim 11, wherein the instructions are further programmed such that the request further comprises and ending point defining the driver'"'"'s location when the consolidation route is completed.

17. The apparatus as recited in claim 11, wherein the instructions are further programmed to cause operations of generate and display a set of proposed consolidation routes.

18. The apparatus as recited in claim 17, wherein the instructions are further programmed to cause an operation to display an hourly rate for the each respective consolidation route.

19. The apparatus as recited in claim 17, wherein the instructions are further programmed such that the request further comprises an amount of empty space in the driver'"'"'s vehicle available for packages.

20. The apparatus as recited in claim 11, wherein the instructions are further programmed to receive an acceptance of the consolidation route by the driver, and display a navigation map with step by step directions which complete the consolidation route.