Fleet Management Systems and Processes

• US 20120239452A1
• Filed: 03/16/2012
• Published: 09/20/2012
• Est. Priority Date: 03/17/2011
• Status: Abandoned Application

• Current Assignee: RideCell, Inc.
• Original Assignee: RideCell, Inc.
• Inventors: Trivedi, Aarjav, Elangovan, Arun Kumar, Hariharan, Ram Kumar
• Application Number:
  US13/422,912
• Publication Number:
  US 20120239452A1
• Time in Patent Office: Days
• US Class Current: 705/7.22
• CPC Class Codes: G06Q 10/00 Administration; Management

Abstract

Automated fleet management systems and associated processes. In one embodiment, a method can be provided. The method can include receiving a service request from one or more customers, providing the one or more customers with a plurality of resources to select from, wherein the plurality of resources is ranked by a pain measure, and based at least in part on a customer selection of at least one resource with a pain measure, assigning at least one resource to the one or more customers.

Claims

1. A system for fleet management of one or more resources, comprising:

a processor operable to execute computer-executable instructions stored in at least one memory;

the at least one memory operable to store a dispatch module with computer-executable instructions operable to;

receive a service request from one or more customers;

provide the one or more customers with a plurality of resources to select from, wherein the plurality of resources is ranked by a pain measure; and

based at least in part on a customer selection of at least one resource with a pain measure, assign at least one resource to the one or more customers.

2. The system of claim 1, wherein the pain measure is based at least in part on distance between a resource and a customer;

customer wait time for a resource;

expected travel time for a customer with a resource;

a predicted route for a resource;

cumulative wait time for one or more customers;

customer cost for a resource;

a preference of a customer;

a past or historical behavior of a customer in selecting a resource;

or a past or historical behavior of a customer selecting a particular preference.

3. The system of claim 1, wherein the dispatch module further comprises computer-executable instructions operable to:

determine at least one preference associated with one or more customers; and

based at least in part on the at least one preference, prioritize at least one resource in the plurality of resources for selection by the one or more customers.

4. The system of claim 3, wherein the at least one preference is based at least in part on one of the following:

past service requests, past assigned resources, customer behavioral data, or customer preference of a price or price range for a resource.

5. The system of claim 1, wherein the dispatch module further comprises computer-executable instructions operable to:

if a cancelation or delay occurs, re-assign some or all of the plurality of resources to the one or more customers.

6. The system of claim 1, wherein the at least one memory is further operable to store a request module with computer-executable instructions operable to:

determine a respective price for the service request based at least in part on a total number of service requests in a predefined time; and

transmit the respective price to the assigned resource or to the respective customer.

7. The system of claim 1, wherein the at least one memory is further operable to store a request module with computer-executable instructions operable to:

provide a user interface for at least one of the customers to generate the service request; and

provide a search of past service requests based at least in part on a frequency and clustering algorithm.

8. The system of claim 1, wherein the at least one memory is further operable to store a driver interface module with computer-executable instructions operable to:

provide a user interface configured to;

receive the service request from the one or more customers; and

convert information associated with the service request to audible information.

9. The system of claim 1, wherein the at least one memory is further operable to store an analytics module with computer-executable instructions operable to:

determine an expected demand for the at least one resource;

determine a location to position the at least one resource to satisfy the expected demand; and

transmit information associated with the location to the at least one resource.

10. A method comprising:

receiving a service request from one or more customers;

providing the one or more customers with a plurality of resources to select from, wherein the plurality of resources is ranked by a pain measure; and

based at least in part on a customer selection of at least one resource with a pain measure, assigning at least one resource to the one or more customers.

11. The method of claim 10, wherein the pain measure is based at least in part on distance between a resource and a customer;

customer wait time for a resource;

expected travel time for a customer with a resource;

a predicted route for a resource;

cumulative wait time for one or more customers;

customer cost for a resource;

a preference of a customer;

a past or historical behavior of a customer in selecting a resource;

or a past or historical behavior of a customer selecting a particular preference.

12. The method of claim 10, further comprising:

determining at least one preference associated with one or more customers; and

based at least in part on the at least one preference, prioritizing at least one resource in the plurality of resources for selection by the one or more customers.

13. The method of claim 12, wherein the at least one preference is based at least in part on one of the following:

past service requests, past assigned resources, customer behavioral data, or customer preference of a price or price range for a resource.

14. The method of claim 10, further comprising:

if a cancelation or delay occurs, re-assign some or all of the plurality of resources to the one or more customers.

15. The method of claim 10, further comprising:

determining a respective price for the service request based at least in part on a total number of service requests in a predefined time; and

transmitting the respective price to the assigned resource or to the respective customer.

16. The method of claim 10, further comprising:

providing a user interface for at least one of the customers to generate the service request; and

providing a search of past service requests based at least in part on a frequency and clustering algorithm.

17. The method of claim 10, further comprising:

determining an expected demand for the at least one resource;

determining a location to position the at least one resource to satisfy the expected demand; and

transmitting information associated with the location to the at least one resource.

18. One or more computer-readable media storing computer-executable instructions that, when executed by at least one processor, configure the at least one processor to:

receive a service request from one or more customers;

provide the one or more customers with a plurality of resources to select from, wherein the plurality of resources is ranked by a pain index; and

based at least in part on a customer selection of at least one resource with a pain index measure, assign at least one resource to the one or more customers.

19. The one or more computer-readable media of claim 18, wherein the pain measure is based at least in part on distance between a resource and a customer;

customer wait time for a resource;

expected travel time for a customer with a resource;

a predicted route for a resource;

cumulative wait time for one or more customers;

customer cost for a resource;

a preference of a customer;

a past or historical behavior of a customer in selecting a resource;

or a past or historical behavior of a customer selecting a particular preference.

20. The one or more computer-readable media of claim 18, further storing computer-executable instructions that, when executed by at least one processor, configure the at least one processor to:

determine at least one preference associated with one or more customers; and

based at least in part on the at least one preference, prioritize at least one resource in the plurality of resources for selection by the one or more customers.