SYSTEM AND METHOD FOR MANAGING FLEET VEHICLES OR EMPLOYEE OWNED VEHICLES

• US 20110301997A1
• Filed: 06/04/2010
• Published: 12/08/2011
• Est. Priority Date: 06/04/2010
• Status: Abandoned Application

• Current Assignee: Ecology and Environment Incorporated (WSP Global, Inc.)
• Original Assignee: Ecology and Environment Incorporated (WSP Global, Inc.)
• Inventors: Gale, Anthony Bruce, Ferris-Young, Mary Ann, Coniglio, Gregory Ronald
• Application Number:
  US12/794,090
• Publication Number:
  US 20110301997A1
• Time in Patent Office: Days
• US Class Current: 705/7.26
• CPC Class Codes: G06Q 10/06316 Sequencing of tasks or work
• CPC Class Codes: G06Q 10/1097 Task assignment

Abstract

A computer based system for managing vehicles, including: a memory unit for at least one specially programmed computer, for storing a request from a first user regarding a trip including a starting point, destination, and schedule. The system includes a processor for the computer for receiving a request from a second user regarding a trip including a starting point, a destination, and a schedule. The processor calculates whether the requests are compatible by calculating whether the following are true: the starting points are within a range of each other; the destinations are within a range of each other; and the schedules are within a range of each other. If the requests are compatible, the processor is for: assigning a vehicle from a plurality of vehicles to the requests; and displaying a notification regarding the assignment of the vehicle.

Claims

1. A computer based method for managing vehicles, comprising:

storing, in a memory unit for at least one specially programmed computer, a first request from a first user regarding a first trip, the first request including a first starting point, a first destination, and a first schedule for the first trip;

receiving, using a processor for the at least one specially programmed computer, a second request from a second user regarding a second trip, the second request including a second starting point, a second destination, and a second schedule for the second trip;

calculating, using the processor, whether the first and second requests are compatible by calculating, using the processor, whether the following are true;

the first and second starting points are within a first range of each other;

the first and second destinations are within a second range of each other; and

,

the first and second schedules are within a third range of each other; and

,

if the first and second requests are compatible;

assigning, using the processor, a first vehicle from a plurality of vehicles to the first and second requests; and

,

displaying, using the processor, a notification regarding the assignment of the first vehicle.

2. The computer based method of claim 1, wherein:

the first and second requests include first and second specifications, respectively, of a particular type of vehicle; and

,

calculating whether the first and second requests are compatible includes calculating whether the first vehicle satisfies the first and second specifications.

3. The computer based method of claim 1, further comprising:

storing, in the memory element and for each vehicle in the first plurality of vehicles, a respective value for at least one performance parameter;

identifying a second plurality of vehicles, from among the first plurality of vehicles, compatible with the first and second requests; and

,

selecting, using the processor, the first vehicle as a vehicle in the second plurality of vehicles with a highest respective value.

4. The computer based method of claim 3 wherein the at least one respective performance parameter is selected from the group consisting of fuel efficiency of said each vehicle, air emissions from said each vehicle, green house gas emissions from said each vehicle, and percentage of carbon in fuel used by said each vehicle.

5. The computer based method of claim 1, wherein:

the first and second requests include;

first and second personal preferences of the first and second users, respectively;

an intermediate destination between an origin and a destinations for the first or second trip; and

,

first and second routes for the first and second trips, respectively; and

,

calculating whether the first and second requests are compatible includes calculating whether one or more of the following are true;

the first and second personal preferences match;

the intermediate destination is acceptable to the first or second user;

or,

the first and second routes are within a fourth range of each other.

6. The computer based method of claim 1, further comprising:

storing, in the memory element, a respective passenger capacity and vehicle type for each vehicle in the first plurality of vehicles;

determining, using the processor, available passenger capacity of the first vehicle accounting for occupancy by the first user; and

,

displaying, using the processor, a notification regarding the available passenger capacity.

7. The computer based method of claim 1, further comprising:

storing, in the memory unit, a plurality of third requests from a first plurality of users regarding a plurality of third trips, each third request including a respective third starting point, a respective third destination, and a respective third schedule for a respective third trip;

receiving, using the processor, a fourth request from a third user regarding a fourth trip, the fourth request including a fourth starting point, a fourth destination, and a fourth schedule for a fourth trip;

calculating, using the processor, that a third request from the plurality of third requests is compatible with the fourth request by calculating, using the processor, that for the third and fourth requests the following are true;

the respective third starting point and the fourth starting points are within a fourth range of each other;

the respective third destinations and the fourth destination are within a fifth range of each other; and

,

the respective third schedule and the fourth schedule are within a sixth range of each other; and

,

if the third and fourth requests are compatible;

assigning, using the processor, a second vehicle from the plurality of vehicles to the third and fourth requests; and

,

displaying, using the processor, a notification regarding the assignment of the second vehicle.

8. The computer based method of claim 7, further comprising:

storing, in the memory element and for each vehicle in the first plurality of vehicles, a respective value for at least one performance parameter;

calculating, using the processor, that no third request from the plurality of third requests is compatible with the third request;

selecting, using the processor, a third vehicle from the first plurality of vehicles compatible with the third request and having a highest respective value for the at least one performance parameter; and

,

assigning, using the processor, the third vehicle to the fourth request.

9. A computer based method for managing vehicles, comprising:

storing, in a memory unit for at least one specially programmed computer, a value for a parameter associated with operation of the plurality of vehicles and a value for a baseline occupancy rate;

receiving, using a processor for the at least one specially programmed computer, a plurality of requests from a plurality of users regarding respective trips, each request including a respective distance for a respective trip;

forming, using the processor, a plurality of combined requests from the plurality of requests, each combined request including;

two or more requests from the plurality of requests;

a respective combined distance substantially equal to a respective distance from the two or more requests; and

,

a respective first number of users from the plurality of users, the first number greater than the value for the baseline occupancy rate;

assigning, using the processor, a respective single vehicle, from the plurality of vehicles, to said each combined request; and

,

multiplying, using the processor;

a sum of the respective distances by the value for the baseline occupancy rate to generate a first product;

the first product by the value for the parameter to generate a fleet environmental baseline value; and

,

a sum of the respective combined distances by the value for the parameter to generate a fleet environmental value.

10. The computer based method of claim 9 further comprising calculating, using the processor, a fleet mileage savings value by subtracting the sum of the combined distances from the sum of the respective distances.

11. The computer based method of claim 10 wherein the fleet mileage saving value is in a unit of distance, the method further comprising:

for the plurality of vehicles, storing, in the memory element, a fleet fuel efficiency value equal to an amount of fuel used by the plurality of vehicles for operation over the unit of distance; and

,

calculating, using the processor, a fleet fuel savings value by multiplying the fleet mileage savings value by the fleet fuel efficiency value.

12. The computer based method of claim 10 wherein the fleet mileage saving value is in a unit of distance, the method further comprising:

for the plurality of vehicles, storing, in the memory element, respective fleet air emission values equal to respective amounts of respective air emissions released by the plurality of vehicles during operation over the unit of distance; and

,

calculating, using the processor, respective fleet emissions savings values by multiplying the fleet mileage savings value by the respective fleet air emission values.

13. The computer based method of claim 9 further comprising:

storing, in the memory unit, a value for a parameter associated with operation of a first respective single vehicle from the plurality of vehicles; and

,

calculating, using the processor, a vehicle environmental improvement value by;

subtracting the value for the baseline occupancy rate from the respective first number of users associated with the first respective single vehicle to generate a first product;

multiplying the combined distance associated with the first respective single vehicle by the first product to generate a second product; and

,

multiplying the value for the parameter associated with operation of the first respective single vehicle by the second product.

14. A computer based system for managing vehicles, comprising:

a memory unit for at least one specially programmed computer, for storing a first request from a first user regarding a first trip, the first request including a first starting point, a first destination, and a first schedule for the first trip;

a processor the at least one specially programmed computer for;

receiving a second request from a second user regarding a second trip, the second request including a second starting point, a second destination, and a second schedule for the second trip;

calculating whether the first and second requests are compatible by calculating, using the processor, whether the following are true;

the first and second starting points are within a first range of each other;

the first and second destinations are within a second range of each other; and

,

the first and second schedules are within a third range of each other; and

, if the first and second requests are compatible;

assigning a first vehicle from a plurality of vehicles to the first and second requests; and

,

displaying a notification regarding the assignment of the first vehicle.

15. The computer based system of claim 14, wherein:

the first and second requests include first and second specifications, respectively, of a particular type of vehicle; and

,

calculating whether the first and second requests are compatible includes calculating whether the first vehicle satisfies the first and second specifications.

16. The computer based system of claim 14, wherein:

the memory element is for storing, for each vehicle in the first plurality of vehicles, a respective value for at least one performance parameter; and

,

the processor is for;

identifying a second plurality of vehicles, from among the first plurality of vehicles, compatible with the first and second requests; and

,

selecting, using the processor, the first vehicle as a vehicle in the second plurality of vehicles with a highest respective value.

17. The computer based system of claim 16, wherein the at least one respective performance parameter is selected from the group consisting of fuel efficiency of said each vehicle, air emissions from said each vehicle, green house gas emissions from said each vehicle, and percentage of carbon in fuel used by said each vehicle.

18. The computer based system of claim 14, wherein:

the first and second requests include;

first and second personal preferences of the first and second users, respectively;

an intermediate destination between an origin and a destinations for the first or second trip; and

,

first and second routes for the first and second trips, respectively; and

,

calculating whether the first and second requests are compatible includes calculating whether one or more of the following are true;

the first and second personal preferences match;

the intermediate destination is acceptable to the first or second user;

or,

the first and second routes are within a fourth range of each other.

19. The computer based system of claim 14, wherein:

the memory unit is for storing a respective passenger capacity and vehicle type for each vehicle in the first plurality of vehicles; and

,

the processor is for;

determining available passenger capacity of the first vehicle accounting for occupancy by the first user; and

,

displaying a notification regarding the available passenger capacity.

20. The computer based system of claim 14, wherein:

the memory unit is for storing a plurality of third requests from a first plurality of users regarding a plurality of third trips, each third request including a respective third starting point, a respective third destination, and a respective third schedule for a respective third trip; and

,

the processor is for;

receiving a fourth request from a third user regarding a fourth trip, the fourth request including a fourth starting point, a fourth destination, and a fourth schedule for a fourth trip;

calculating that a third request from the plurality of third requests is compatible with the fourth request by calculating that for the third and fourth requests the following are true;

the respective third starting point and the fourth starting points are within a fourth range of each other;

the respective third destinations and the fourth destination are within a fifth range of each other; and

,

the respective third schedule and the fourth schedule are within a sixth range of each other; and

,

if the third and fourth requests are compatible;

assigning a second vehicle from the plurality of vehicles to the third and fourth requests; and

,

displaying a notification regarding the assignment of the second vehicle.

21. The computer based system of claim 14, wherein:

the memory unit is for storing, for each vehicle in the first plurality of vehicles, a respective value for at least one performance parameter; and

,

the processor is for;

calculating that no third request from the plurality of third requests is compatible with the third request;

selecting a third vehicle from the first plurality of vehicles compatible with the third request and having a highest respective value for the at least one performance parameter; and

,

assigning the third vehicle to the fourth request.

22. A computer based system for managing vehicles, comprising:

a memory unit for at least one specially programmed computer for storing a value for a parameter associated with operation of the plurality of vehicles and a value for a baseline occupancy rate; and

,

a processor for;

receiving a plurality of requests from a plurality of users regarding respective trips, each request including a respective distance for a respective trip;

forming a plurality of combined requests from the plurality of requests, each combined request including;

two or more requests from the plurality of requests;

a respective combined distance substantially equal to a respective distance from the two or more requests; and

,

a respective first number of users from the plurality of users, the first number greater than the value for the baseline occupancy rate;

assigning a respective single vehicle, from the plurality of vehicles, to said each combined request; and

,

multiplying;

a sum of the respective distances by the value for the baseline occupancy rate to generate a first product;

the first product by the value for the parameter to generate a fleet environmental baseline value; and

,

multiplying, using the processor, a sum of the respective combined distances by the value for the parameter to generate a fleet environmental value.

23. The computer based system of claim 22, wherein the processor is for calculating a fleet mileage savings value by subtracting the sum of the combined distances from the sum of the respective distances.

24. The computer based system of claim 23 wherein:

the fleet mileage saving value is in a unit of distance,

the memory unit is for storing, for the plurality of vehicles, a fleet fuel efficiency value equal to an amount of fuel used by the plurality of vehicles for operation over the unit of distance; and

,

the processor is for calculating a fleet fuel savings value by multiplying the fleet mileage savings value by the fleet fuel efficiency value.

25. The computer based system of claim 23, wherein:

the fleet mileage saving value is in a unit of distance;

the memory unit is for storing, for the plurality of vehicles, respective fleet air emission values equal to respective amounts of respective air emissions released by the plurality of vehicles during operation over the unit of distance; and

,

the processor is for calculating respective fleet emissions savings values by multiplying the fleet mileage savings value by the respective fleet air emission values.

26. The computer based system of claim 22, wherein:

the memory unit is for storing a value for a parameter associated with operation of a first respective single vehicle from the plurality of vehicles; and

,

the processor is for;

calculating a vehicle environmental improvement value by;

subtracting the value for the baseline occupancy rate from the respective first number of users associated with the first respective single vehicle to generate a first product;

multiplying the combined distance associated with the first respective single vehicle by the first product to generate a second product; and

,

multiplying the value for the parameter associated with operation of the first respective single vehicle by the second product.