| CPC G01C 21/3476 (2013.01) [G06Q 10/047 (2013.01); B60L 53/00 (2019.02)] | 21 Claims |
|
1. A system for optimizing a charger network, comprising:
a memory configured to store trip information, the trip information including start points and end points for routes that are traversed by vehicles and corresponding actual distance and/or time information for traversal of the routes, without storing actual routes taken from the start points to the end points by the vehicles; and
a charger locations server including a hardware processor configured to execute a charger location service to:
for each vehicle trip of a plurality of vehicle trips defined by the trip information:
generate, using a routing algorithm, a set of possible routes from an origin location of the respective vehicle trip to a destination location of the respective vehicle trip,
identify, for each start and end point pair, best routes based on the set of possible routes using the trip information to select the best routes as those closest to the corresponding actual distance and/or time information for the start and end point pair,
identify individual charger recommendations using the best routes,
identify collective charger recommendations across the plurality of vehicle trips based on the individual charger recommendations, the collective charger recommendations including which road segments of the best routes have a total count of unique vehicles that indicate additional charging stations are required to optimize the charger network, and
utilize the collective charger recommendations to optimize the charger network along the indicated road segments.
|