EV BATTERY DEGRADATION IN A FLEET
An example operation includes one or more of determining objects to be delivered by a group of vehicles, and choosing a vehicle of the group of vehicles with a most degraded battery to transport a heaviest object of the objects.
1 . A method, comprising:
determining objects to be delivered by a group of vehicles; and
choosing a vehicle of the group of vehicles with a most degraded battery to transport a heaviest object of the objects.
2 . The method of claim 1 , wherein the vehicle of the group of vehicles is provided a route with a minimum radius of a starting location.
3 . The method of claim 1 , comprising:
choosing another vehicle of the group of vehicles with a next most degraded battery to transport other of the heaviest objects when the chosen vehicle is unable to transport the heaviest object.
4 . The method of claim 1 , wherein the choosing is based on an age of the battery of the vehicle and a history of one or more of a number of charging cycles of the battery, and the rate of a received charge of the battery.
5 . The method of claim 1 , wherein the chosen vehicle transports objects a minimum number of times per period as compared with others of the group of vehicles.
6 . The method of claim 1 , comprising:
determining a ranking of all vehicles in the group of vehicles, based on a degradation of each battery in the vehicles; and
choosing a route for each of the ranked vehicles whose distance increases based on a degradation of the battery of each of the vehicles.
7 . The method of claim 1 , comprising:
meeting another vehicle in the group of vehicles and transferring the objects to the another vehicle, when the another vehicle has a less degraded battery.
8 . A system, comprising:
a processor and memory communicably coupled to the processor, wherein the processor is configured to perform:
determine objects to be delivered by a group of vehicles; and
choose a vehicle of the group of vehicles with a most degraded battery to transport a heaviest object of the objects.
9 . The system of claim 8 , wherein the vehicle of the group of vehicles is provided a route with a minimum radius of a that start location.
10 . The system of claim 8 , comprising:
choose another vehicle of the group of vehicles with a next most degraded battery to transport other of the heaviest objects when the chosen vehicle is unable to transport the heaviest object.
11 . The system of claim 8 , wherein the choice of the vehicle is based on an age of the battery of the vehicle and a history of one or more of a number of charging cycles of the battery, and the rate of a received charge of the battery.
12 . The system of claim 8 , wherein the chosen vehicle transports objects a minimum number of times per period as compared with others of the group of vehicles.
13 . The system of claim 8 , comprising:
determine a rank of all vehicles in the group of vehicles, based on a degradation of each battery in the vehicles; and
choose a route for each of the ranked vehicles whose distance increases based on a degradation of the battery of each of the vehicles.
14 . The system of claim 8 , comprising:
meet another vehicle in the group of vehicles and transfer the objects to the another vehicle, when the another vehicle has a less degraded battery.
15 . A non-transitory computer readable medium comprising instructions, that when read by a processor, cause the processor to perform:
determining objects to be delivered by a group of vehicles; and
choosing a vehicle of the group of vehicles with a most degraded battery to transport a heaviest object of the objects.
16 . The non-transitory computer readable medium of claim 15 , wherein the vehicle of the group of vehicles is provided a route with a minimum radius of a starting location.
17 . The non-transitory computer readable medium of claim 15 , comprising:
choosing another vehicle of the group of vehicles with a next most degraded battery to transport other of the heaviest objects when the chosen vehicle is unable to transport the heaviest object.
18 . The non-transitory computer readable medium of claim 15 , wherein the choosing is based on an age of the battery of the vehicle and a history of one or more of a number of charging cycles of the battery, and the rate of a received charge of the battery.
19 . The non-transitory computer readable medium of claim 15 , comprising:
determining a ranking of all vehicles in the group of vehicles, based on a degradation of each battery in the vehicles; and
choosing a route for each of the ranked vehicles whose distance increases based on a degradation of the battery of each of the vehicles.
20 . The non-transitory computer readable medium of claim 15 , comprising:
meeting another vehicle in the group of vehicles and transferring the objects to the another vehicle, when the another vehicle has a less degraded battery.