Allocation of location-based orders to mobile agents

• US 8,706,542 B2
• Filed: 12/18/2000
• Issued: 04/22/2014
• Est. Priority Date: 12/18/2000
• Status: Active Grant

• Current Assignee: Apple Inc.
• Original Assignee: Apple Inc.
• Inventors: Brosnan, Michael, Kelly, Paul, Hyland, Derek, Killeen, Damian, O'Meara, Cian E
• Primary Examiner(s): BOYCE, ANDRE D
• Application Number:
  US09/740,201
• Publication Number:
  US 20020077876A1
• Time in Patent Office: 4,873 Days
• Field of Search: 705/8, 705/9, 705/7.16
• US Class Current: 705/7.16
• CPC Class Codes: G06Q 10/06 Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
• CPC Class Codes: G06Q 10/063114 Status monitoring or status determination for a person or group
• CPC Class Codes: G06Q 10/06316 Sequencing of tasks or work

Abstract

A method of allocating a location-related order to one of a number of mobile agents, such as taxicabs, delivery or repair vehicles. The method involves the following steps:

• • a) holding current order details which identify at least the location and time at which each agent is expected to become free to fulfill new orders;
  • b) keeping a listing of locations, where each location in the listing is prioritised for an agent according to the availability of the agent to reach that location after the agent becomes free;
  • c) receiving a new order and recording the location and time at which this order is to be fulfilled;
  • d) deciding, based on the prioritised listing of locations, which agent(s) are most suitable to take the new order; and
  • e) allocating the new order to the identified agent(s).

Claims

1. A computer-implemented method of allocating a location-related order to one of a plurality of mobile agents, said method being carried out by an ordering server programmed to carry out the steps of the method, which comprise:

a) maintaining a current order record identifying a first location and first time at which each agent is expected to become free to fulfill a new order;

b) maintaining a prioritized listing of locations including both scheduled locations which an agent is currently due to visit and unscheduled locations which said agent is not currently due to visit, with locations in said listing being prioritized to rank both the scheduled and unscheduled locations for said agent according to availability of the agent to reach each location after said first time, said availability having been calculated for each location irrespective of whether or not said agent is currently due to visit a particular location in said listing;

c) receiving said location-based order and recording the location and time at which said order is to be fulfilled;

d) determining from said prioritized listing of locations a suitable agent to fulfill said order; and

e) allocating said order to said suitable agent.

2. A computer-implemented method according to claim 1, wherein step a) comprises maintaining for each agent an individual current order file relating only to that agent.

3. A computer-implemented method according to claim 1, wherein step a) comprises maintaining a combined current order file relating to a plurality of agents, with said first location and first time identified for each such agent.

4. A computer-implemented method according to claim 1, wherein step b) comprises maintaining for each agent an individual prioritized location listing relating only to that agent.

5. A computer-implemented method according to claim 1, wherein step b) comprises maintaining a combined prioritized location listing relating to a plurality of agents, with each location being prioritized for one or more agents according to ability of the or each such agent to reach each location after said first time relating to the agent.

6. A computer-implemented method according to claim 1, further comprising the step of:

updating the current order record for said identified agent with a new first location and first time at which said agent is expected to become free after fulfilling said order.

7. A computer-implemented method according to claim 6, further comprising the step of updating the prioritized listing for said identified agent when said order has been allocated, to take account of said new first location and new first time.

8. A computer-implemented method according to claim 1, wherein said step of allocating said order comprises

i) offering said order to said agent;

and

ii) receiving confirmation of acceptance of the order from the agent.

9. A computer-implemented method according to claim 1, wherein said current order record identifies locations and times relating to all current orders assigned to said agent.

10. A computer-implemented method according to claim 1, wherein said listing of locations identifies the priority of each location with a time at which the agent is expected to be able to reach said location.

11. A computer-implemented method according to claim 1, wherein said listing of locations identifies the priority of each location with a priority identifier calculated from distance between each such location and said first location, and time between the current time and said first time.

12. A computer-implemented method according to claim 11, wherein said distance is a true geographical distance.

13. A computer-implemented method according to claim 11, wherein said distance is a distance calculated in a non-linear representation of an area including said locations.

14. A computer-implemented method according to claim 13, wherein said representation is selected from a grid of cells to which locations are mapped, a set of groups of locations, and a mesh of elements to which locations are mapped.

15. A computer-implemented method according to claim 1, wherein said locations are identified as cells within a grid to which locations are mapped.

16. A computer-implemented method according to claim 1, wherein said locations are identified as groups of locations within a set of such groups.

17. A computer-implemented method according to claim 1, wherein said locations are identified as elements within a mesh of elements to which locations are mapped.

18. A computer-implemented method according to claim 1, wherein said first time is calculated from a journey time file which records expected journey times between locations.

19. A computer-implemented method according to claim 1, wherein said first time is input by an operator based on an expected journey time.

20. A computer-implemented method according to claim 19, wherein said operator is the agent to which the current order record relates.

21. A computer-implemented method according to claim 1, wherein the step of maintaining said current order record includes providing access to an agent to said current order record to edit the details recorded therein.

22. A computer-implemented method according to claim 1, wherein said current order file further includes details of an advance order, including a second location and a second time after said first time, at which said advance order is to be fulfilled, and wherein step d) includes the step of determining whether the agent is expected to be able to finish said new location-based order with sufficient time to fulfill said advance order.

23. A computer-implemented method of operating an ordering server for controlling location-based orders for a plurality of mobile agents, comprising the steps of:

a) maintaining a current order record identifying for each agent a first location and first time at which the agent is expected to become free to fulfill a new order;

b) maintaining a prioritized listing of locations including both scheduled locations which an agent is currently due to visit and unscheduled locations which said agent is not currently due to visit, with locations in said listing being prioritized to rank both the scheduled and unscheduled locations for said agent according to availability of the agent to reach each location after said first time, said availability having been calculated for each location irrespective of whether or not said agent is currently due to visit a particular location in said listing; and

c) updating said current order record and said listing for an agent when a new order has been assigned to said agent resulting in a new first location and first time being identified.

24. An ordering server for allocating location-based orders to a plurality of mobile agents associated with said server, comprising:

a) a current order file storage area for maintaining a current order file which identifies for each agent a first location and first time at which the agent is expected to become free to fulfill a new order;

b) a location priority listing storage area for maintaining a prioritized listing of locations including both scheduled locations which an agent is currently due to visit and unscheduled locations which said agent is not currently due to visit, with locations in said listing being prioritized to rank both the scheduled and unscheduled locations for said agent according to availability of the agent to reach each location after said first time, said availability having been calculated for each location irrespective of whether or not said agent is currently due to visit a particular location in said listing;

c) an input interface for receiving said location-based order and recording the location and time at which said order is to be fulfilled;

d) a processor for determining from said prioritized listing of locations a suitable agent to fulfill said order; and

e) an output interface for allocating said order to said identified agent.

25. An ordering server according to claim 24, wherein said input interface comprises an operator interface for an operator to input details received from an ordering party.

26. An ordering server according to claim 24, wherein said input interface is selected from a web server hosting a user interface via which ordering parties can input order details, a Wireless Application Protocol (WAP) server hosting a user interface via which ordering parties can input order details, an Interactive Voice Response (IVR) unit via which a user can input order details and a Short Messaging Service (SMS) gateway for receiving SMS messages containing order details.

27. An ordering server according to claim 24, further comprising a map database correlating real geographical locations with location identifiers for use in identifying locations in said current orders file and said listing.

28. An ordering server according to claim 24, further comprising a journey times calculator for calculating an expected journey time between two locations.

29. An ordering server according to claim 24, further comprising an agent interface for an agent to access and edit said current orders file.

30. A non-transitory computer readable-medium storing program instructions which when executed in an ordering server cause said ordering server to:

a) maintain for each agent a current order record identifying a first location and first time at which the agent is expected to become free to fulfill a new order;

b) maintain for each agent a prioritized listing of locations in the vicinity of said first location including both scheduled locations which an agent is currently due to visit and unscheduled locations which said agent is not currently due to visit, with locations in said listing being prioritized to rank both the scheduled and unscheduled locations for said agent according to availability of the agent to reach each location after said first time, said availability having been calculated for each location irrespective of whether or not said agent is currently due to visit a particular location in said listing;

c) receive said location-based order and recording the location and time at which said order is to be fulfilled;

d) determine from said prioritized listing of locations a suitable agent to fulfill said order; and

e) allocate said order to said identified agent.

31. A communications network comprising an ordering server for allocating location-based orders to a plurality of mobile agents associated with said server, comprising:

a) a current order file storage area for maintaining a current order file which identifies for each agent a first location and first time at which the agent is expected to become free to fulfill a new order;

b) a location priority listing storage area for maintaining a prioritized listing of locations including both scheduled locations which an agent is currently due to visit and unscheduled locations which said agent is not currently due to visit, with locations in said listing being prioritized to rank both the scheduled and unscheduled locations for said agent according to availability of the agent to reach each location after said first time, said availability having been calculated for each location irrespective of whether or not said agent is currently due to visit a particular location in said listing;

c) an input interface for receiving said location-based order and recording the location and time at which said order is to be fulfilled;

d) a processor for determining from said prioritized listing of locations a suitable agent to fulfill said order; and

e) an output interface for allocating said order to said identified agent.