KR101385371B1 - Method and system of performing route scheduling for electric vehicle based on waiting time - Google Patents

Abstract

A method and system are provided for optimizing the route of an electric vehicle using latency. The route scheduling method includes identifying a plurality of charging points existing on a specific path, obtaining a waiting time required for charging an electric vehicle at each of the plurality of charging points, and a plurality of charging points based on the waiting time. Determining the order of visits.

Description

Route Scheduling Method and System for Electric Vehicles Using Waiting Time TECHNICAL AND SYSTEM OF PERFORMING ROUTE SCHEDULING FOR ELECTRIC VEHICLE BASED ON WAITING TIME

The following embodiments are related to a route scheduling method and system of an electric vehicle using the waiting time.

While electric vehicles require a long charging time, the driving distance of the electric vehicles is relatively short. However, since electric vehicles can not only reduce air pollution, but also waste of fuel costs, the demand for electric vehicles is expected to continue to increase.

When the user plans a trip, the user sets up a travel schedule in advance. However, when the user travels by using the electric vehicle, the travel schedule created by the user may cause a problem due to the charging time, the number of charging of the electric vehicle, and the like. Assuming that the user schedules travel schedules in the A region, the B region, and the C region, the user may plan different time of stay in each of the A region, the B region, and the C region. If the distances are different between the regions A, B and C, the charging time of the electric vehicle may be difficult for the user to properly execute the travel schedule.

Embodiments of the present invention determine the order of visits of the various points in consideration of the waiting time required for charging the electric vehicle at each of the plurality of charging points, thereby providing an electric schedule that can provide the user with an optimal schedule. Provided are a method and a system for scheduling a route of a vehicle.

Path scheduling method of an electric vehicle according to an embodiment of the present invention comprises the steps of identifying a plurality of charging points existing on a specific path; Obtaining a waiting time required for charging the electric vehicle at each of the plurality of charging points; And determining a visit order of the plurality of charging points based on the waiting time.

The route scheduling method of the electric vehicle includes obtaining a predetermined dwell time at each of the plurality of charging points; Calculating a charge amount charged in the electric vehicle during a predetermined dwell time at each of the plurality of charge points; And predicting available battery capacity at each of the plurality of charging points according to the calculated charge amount, and obtaining the standby time based on the estimated available battery capacity. It may be a step of obtaining a waiting time.

The route scheduling method of the electric vehicle may include obtaining an initial battery remaining amount of the electric vehicle at each of the plurality of charging points; And predicting the available battery capacity at each of the plurality of charging points according to the initial battery remaining amount, wherein obtaining the standby time is based on the estimated available battery capacity. It may be a step of obtaining a waiting time.

The acquiring the waiting time may be an operation of acquiring the waiting time based on a distance from a specific charging point to a next charging point.

Obtaining the standby time may include estimating available battery capacity at each of the plurality of charging points.

Acquiring the standby time may be acquiring the standby time based on a difference between the distance from the specific charging point to the next charging point and the available battery capacity at each of the plurality of charging points. .

The route scheduling method of the electric vehicle may further include calculating a sum of waiting times at the plurality of charging points.

The determining of the visit order may be determining the visit order based on the sum of waiting times at the plurality of charging points.

In addition, the system for optimizing the path of the electric vehicle according to an embodiment of the present invention comprises a plurality of charging point identification unit existing on a specific path; A waiting time obtaining unit required for charging the electric vehicle at each of the plurality of charging points; And a visit order determining unit of the plurality of charging points based on the waiting time.

The system for optimizing the path of the electric vehicle includes: a predetermined dwell time acquisition unit for acquiring a predetermined dwell time at each of the plurality of charging points; A calculator configured to calculate an amount of charge charged in the electric vehicle during a predetermined residence time at each of the plurality of charge points; And a usable battery capacity estimator configured to estimate usable battery capacity at each of the plurality of charging points according to the calculated charge amount, wherein the standby time obtainer is based on the estimated usable battery capacity. The waiting time can be obtained.

The system for optimizing the path of the electric vehicle includes: an initial battery remaining amount obtaining unit obtaining an initial battery remaining amount of the electric vehicle at each of the plurality of charging points; And a usable battery capacity estimator configured to estimate usable battery capacity at each of the plurality of charging points according to the initial battery remaining amount, wherein the standby time obtainer is based on the estimated available battery capacity. The waiting time can be obtained.

The waiting time obtaining unit may obtain the waiting time based on a distance from a specific charging point to the next charging point.

The standby time obtainer may include a usable battery capacity predictor that predicts usable battery capacity at each of the plurality of charging points.

The waiting time obtaining unit may obtain the waiting time based on a difference between the distance from the specific charging point to the next charging point and the available battery capacity at each of the plurality of charging points.

The system for optimizing a path of the electric vehicle may further include a sum calculator configured to calculate a sum of waiting times at the plurality of charging points.

The visit order determining unit may determine the visit order based on the sum of waiting times at the plurality of charging points.

Embodiments of the present invention determine the order of visits of the various points in consideration of the waiting time required for charging the electric vehicle at each of the plurality of charging points, thereby providing an electric schedule that can provide the user with an optimal schedule. A route scheduling method and system for a vehicle can be provided.

1 is a diagram illustrating an electric vehicle charging network including a plurality of charging points.
2 illustrates two charging points by way of example.
3 is an operation flowchart illustrating a path scheduling method of an electric vehicle according to an embodiment of the present invention.
4 is a flowchart illustrating operation 320 illustrated in FIG. 3 in more detail.
FIG. 5 is a flowchart illustrating operation 330 illustrated in FIG. 3 in more detail.
6 is a block diagram illustrating a path scheduling system of an electric vehicle according to an embodiment of the present invention.

Hereinafter, embodiments according to the present invention will be described in detail with reference to the accompanying drawings.

1 is a diagram illustrating an electric vehicle charging network including a plurality of charging points.

1, in an electric vehicle charging network, point A 120, point B 130, point C 140, point D 150, point E 160 on a route planned by the electric vehicle 110. ), F point 170, G point 180, H point 190 is present.

The electric vehicle 110 requires a long charging time while the driving distance is relatively short. The electric vehicle 110 has plans to visit all the points, but assumes that the order of visits of the points is not limited. For example, the electric vehicle is point A 120, point B 130, point C 140, point D 150, point E 160, point F 170, point G 180, H Points 190 may be visited in order, but point A 120, point C 140, point H 190, point D 150, point G 180, point F 170, and point B ( 130 may be visited in the order of point E 160.

The route scheduling method of the electric vehicle according to the embodiment of the present invention may be performed distributedly or centrally. For example, the electric vehicle network may include a central server, and the central server may centrally perform the path scheduling method of the electric vehicle, and then share the scheduling result with the electric vehicle. In addition, the electric vehicle may have a built-in computing device and may perform scheduling by itself using the computing device.

In the following, determining the order of visits between charging points in the electric vehicle network will be referred to as scheduling for charging points. Scheduling for charging points is an important issue. For example, if the electric vehicle is charged while staying at point A 120 for two hours, then the electric vehicle may move from point A 120 to point B 130, while at point B 130 1 If it is charged while staying for a time, it may not be possible to move from point B 130 to point A 120. Thus, the order of visits between charging points of the electric vehicle must be determined according to the time of stay at each of the points, the distance between the points.

In general, a visit from the first point to the destination point and then back to the first destination may be considered a Traveling Salesman Problem (TSP). TSP has a complexity O (n!) And n means the number of visited points. TSP is a representative heuristics problem and is an NP-hard combinational optimization problem, but aims to reduce the total visit distance.

When G = {V, E}, V is a set of nodes, and E is a set of links. Also, if D (V _{iV j} ) is the cost from node V _i to node V _j , then link C = {D (V _{iV j} )} is the distance or cost with respect to set E It is defined as a (cost) matrix.

TSP is so for the purpose of navigation of the smallest landing distance, TSP is a cost function (cost function), F (V 1, V 2, ..., V n) = Σ D (V i · V i + 1) + D ( the V _{i + 1} · V ₁₎ to obtain the solutions is minimized that is, according to the TSP, the node V _i from the drive arrangement at least in from the distance to the node V _{i + 1} to the node V _{i + 1} to the node V ₁ The order of visits is determined if possible. TSP implements backtracking-based search space traversal. This scheme selects the route with the lowest cost among the various costs calculated using the corresponding cost function, assuming that all possible points are visited. The complexity of this technique is O (n!).

However, it may be inefficient to consider the cost function of the TSP as it is to determine the order of visit of the electric vehicle. This is because, since the electric vehicle necessarily requires frequent charging, determining the path by considering only the cost according to the above-described cost function may cause a shortage of charge or an excessive amount of charge. In addition, in order to optimally schedule the route of the electric vehicle, the residence time of the user also needs to be considered. Below, the difference between the user's residence time and the required charging time of the electric vehicle is defined as the waiting time.

Since electric vehicles require long and frequent charging time, the user has to wait for charging of the electric vehicle to move to the next place. Therefore, the path scheduling method of the electric vehicle can determine the path of the electric vehicle so that the total waiting time can be reduced. That is, even if the total visit distance is minimum, the sum of the waiting times may not be the minimum, and the embodiment of the present invention may determine the order of visit of the electric vehicle such that the sum of the waiting times is minimum.

If the electric vehicle wants to move from a certain point to the next point, if the distance that can be driven by the amount of remaining battery is greater than the distance from the specific point to the next point, the waiting time is regarded as '0'. On the other hand, if additional time is needed for charging the electric vehicle, the waiting time will be greater than zero.

That is, embodiments of the present invention additionally provide a solution that utilizes the necessary charging time and residence time to minimize the sum of the waiting times. At this time, the time of stay at each of all visit points can be identified not only realistically but also statistically. For example, the statistical residence time can be set to an average value of residence times.

Since the electric vehicle can be charged during the dwell time, overlapping the charging time and the dwell time of the electric vehicle can reduce the waiting time. Since the efficiency of path scheduling depends on a reduction in latency, the latency can be further reduced as the area of overlap between residence time and charge time increases.

Below, we define a latency estimation model for reducing the latency of a specific visit order and describe a method for minimizing the latency. In this case, the road network may include Point Of Interest (POI) describing the visited point, and an embodiment of the present invention uses an A * algorithm to between two points. It is possible to estimate the travel distance and travel time of. Every pair of user-selected points may correspond to a cost matrix, and the space search mechanism may be applied based on the cost matrix.

2 shows an example of two charging points.

Referring to FIG. 2, when the electric vehicle 210 arrives at the charging point 1 220 or the charging point 2 230 at any point, the initial battery remaining amount is 10 km, and the charging point 1 220 and the charging point Assume that the distance difference between 2 (230) is 30 km, and if the electric vehicle 210 is charged for 1 hour, it is assumed that it can drive 15 km further, and the scheduled residence time at the charging point 1 (220) is 1 It is time and assumes that the scheduled residence time at charging point 2 230 is 3 hours.

Distance credit refers to the distance traveled by an electric vehicle with a certain amount of battery. The distance credit increases when the electric vehicle charges the battery and decreases with the distance the electric vehicle has traveled. The distance index may be converted between the distance domain, time domain, and battery domain.

The electric vehicle 210 is charged for a predetermined residence time. For example, when moving from charging point 1 (220) to charging point 2 (230), the distance difference between charging point 1 (220) and charging point 2 (230) is 30 km and the electric vehicle during the scheduled residence time of 1 hour. If 210 is charged, the distance credit of the available battery capacity will be 25 km. Thus, the electric vehicle must be charged further by a distance corresponding to 5 km, and thus a waiting time of 20 minutes occurs. However, when charging point 2 230 goes from charging point 1 220 to charging point 1 220, the distance difference between charging point 1 220 and charging point 2 230 is 30 km and the electric vehicle 210 is operated for 3 hours of the predetermined residence time. If charged, the distance credit of the available battery capacity would be 55 km. Thus, no waiting time occurs when going from charging point 2 230 to charging point 1 220. Therefore, no waiting time occurs when going from charging point 2 230 to charging point 1 220, so going from charging point 2 230 to charging point 1 220 is charged at charging point 1 220. It may be more efficient than going to point 2 230.

An embodiment of the present invention calculates the amount of charge charged to an electric vehicle during a predetermined residence time at each of a plurality of charge points. T (V _i ) is the distance credit corresponding to the amount of battery charged during the predetermined dwell time at the charging point V _i . And B ⁱ _in is the distance index corresponding to the amount of battery remaining before staying at the charging point V _i , and B ⁱ _av is the available battery capacity for driving from the charging point V _i to the next charging point V _{i + 1} Corresponding to the distance index.

B ⁱ _av may be represented by Equation 1 below.

[Equation 1]

B ⁱ _av = min (B _max , B ⁱ _in + T (V _i ))

Where B ⁱ _av is the distance index corresponding to the available battery capacity for travel from charging point V _i to the next charging point V _{i + 1} , and B ⁱ _in is the amount of battery before staying at charging point V _i The corresponding distance index, T (V _i ) is the distance index corresponding to the amount of battery charged during the predetermined residence time at the charging point V _i , and B _max is the maximum battery charge of the electric vehicle. The standby time is a time spent for additional charging in addition to the scheduled residence time, and may be calculated based on the predicted available battery capacity and the distance from the specific charging point to the next charging point.

W _i is a distance index of the waiting time required for driving from the charging point V _i to the next charging point V _{i + 1} , and may be defined as in Equation 2 below.

&Quot; (2) "

^{_{W i = W i-1 -}} min (0, B i av - D (V i · V i + 1))

At this time, W _i is the waiting time required for driving from the charging point V _i to the next charging point V _{i + 1} , and W ^i-1 is required for driving from the charging point V _i-1 to the next charging point V _i . latency, B ⁱ _av is a charging point V _{i +} battery capacity is available for the operation of up to _{1, D (V i · V} i + 1) is next charge point in the charging points V _i V _i at a charging point V _i Battery capacity required for driving up to ₊₁ .

When B ⁱ _av is greater than _{D (V i · V i +} 1) , the means that the battery power required for the operation in the charging points V _i to the next charge point, V _{i + 1} is sufficient. Therefore, because it does not require additional battery charging _{^{min (0, B i av -}} D (V i · V i + 1)) is zero. Means that, while the B ⁱ _av is _{D (V i · V i +} 1) is smaller than, charging points V _{i + 1} is the battery level required for operation is not enough to fill in the points V _i. As a result, additional battery charging is required, resulting in a waiting time, and B ⁱ _av -D (V _i · V _{i + 1} ) becomes negative. Therefore, W ^_i = W ^_i-1 - a _{D (V i · V i +} 1) , wherein _{^{- min (0, B i av}} - D (V i · V i + 1)) min (0, B i av in- 1 is multiplied so that the sum of W _i is as _{^{-min (0, B i av -D}} (V i · V i + 1) in the W ^i-1.

Is set in any one of _{D (V i · V i +} 1) - finally, B ^{i + 1} _in ⁱ _av is 0 or B, depending on whether the additional battery charge is needed in the filling point of V _i.

In addition, embodiments of the present invention determine the order of visits of the plurality of charging points. At this time, the latency prediction model can be used, and backtracking-based search space traversal can optimize the path of the electric vehicle so that the sum of the latency is minimum ∑W _i , and the optimized visit You can decide the order. Therefore, the embodiment of the present invention can minimize the waiting time, which is additionally required for charging the electric vehicle, by determining the optimal order of visit in consideration of the user's predetermined schedule (retention time).

3 is an operation flowchart illustrating a path scheduling method of an electric vehicle according to an embodiment of the present invention.

Referring to FIG. 3, a path scheduling method of an electric vehicle according to an embodiment of the present invention identifies a plurality of charging points existing on a planned path (310).

Here, whether there are charging points on the planned route can be determined on the electric vehicle through a pre-stored map database or on the server via online.

At this time, the user inputs the points to be visited and the time of stay at each of the points directly into a computing device embedded in the electric vehicle or into a remote application through an electric vehicle network connection. Can be. Of course, the dwell time described above may be set statistically.

In addition, the path scheduling method of the electric vehicle obtains a waiting time required for charging the electric vehicle at each of the plurality of charging points (320).

At this time, the standby time may depend on the available battery capacity at each of the plurality of charging points. Here, the available battery capacity at each of the plurality of charging points is the amount of charge charged to the electric vehicle during the predetermined dwell time as described above, the initial battery level of the electric vehicle at each of the plurality of charging points or the next charge from a specific charging point. It may be calculated based on at least one of the distances to the points. Here, the amount of charge charged to the electric vehicle during the predetermined dwell time, the initial battery remaining amount of the electric vehicle at each of the plurality of charging points, or the distance from the specific charging point to the next charging point may be used as variables in order to reduce the calculation amount. At least one of them may be set to a specific value through statistics.

As described above, the standby time W _i is the time taken for additional charging in addition to the scheduled residence time, as defined in Equation 2 above, and the estimated usable battery capacity and the distance from the specific charging point to the next charging point. It can be calculated based on.

In addition, the route scheduling method of the electric vehicle determines the visit order of the plurality of charging points (330). That is, the optimized visit order may be derived in the process of optimizing the path of the electric vehicle such that the sum of waiting times ΣW _i is minimum.

FIG. 4 is an operational flowchart showing step 320 shown in FIG. 3 in more detail.

Referring to FIG. 4, step 320 acquires an initial battery remaining amount B ⁱ _in when arriving at each of the plurality of charging points (410). Although not shown in FIG. 4, step 320 may further include obtaining a predetermined residence time at each of the plurality of charging points.

Step 320 also calculates 420 the amount of charge T (V _i ) that is charged during the predetermined residence time at each of the plurality of charge points.

At this time, as described above, T (V _i ) is a distance index corresponding to the amount of battery charged during the predetermined residence time at the charging point V _i .

Step 320 also predicts 430 the available battery capacity B ⁱ _av at each of the plurality of charging points according to the charge amount T (V _i ) charged during the predetermined residence time. More specifically, step 320 may estimate the available battery capacity B ⁱ _av at each of the plurality of charging points using Equation 1 above.

Further, step 320 estimates the battery capacity required to travel from each of the plurality of charging points to the next charging point according to the estimated charge amount B ⁱ _av (440).

At this time, the route scheduling method of the electric vehicle searches for the next charging point V _{i + 1} to be moved from the charging point V _i by using the A * algorithm, and then calculates the difference of the distance from the charging point V _i . In operation 440, the battery capacity required to travel from each of the plurality of charging points to the next charging point is estimated.

Here, as described above, D (V _{iV i + 1} ) is a battery capacity required for driving from the charging point V _i to the next charging point V _{i + 1} .

Step 320 calculates a standby time based on the difference between the distance from a particular charging point to the next charging point and the available battery capacity at each of the plurality of charging points (450). That is, as defined in Equation (2), step 320 is ^{_{W i = W i-1 -}} min (0, B i av - D (V i · V i + 1)) according to calculate the waiting time Can be.

In addition, the latency may depend on the predicted available battery capacity. For example, if the available battery capacity predicted for a given dwell time is large and the remaining battery capacity is small, the standby time may be long. Conversely, if the predicted usable battery capacity is small and the remaining battery capacity is large, the standby time can be shortened.

The waiting time may also depend on the distance from a particular charging point to the next charging point. That is, the waiting time may increase as the distance from a specific charging point to the next charging point increases.

The path scheduling method of the electric vehicle repeatedly performs steps 410 to 450 until the next charging point does not exist.

FIG. 5 is a flowchart illustrating operation 330 illustrated in FIG. 3 in more detail.

Referring to FIG. 5, step 330 calculates a sum of waiting times at a plurality of charging points (510).

Step 330 also selects 520 the sum of the smallest wait times at the final charging point.

In addition, the visit order determining step determines the visit route of the smallest sum of the selected waiting times as the visit order of the electric vehicle (530).

That is, the order of visit of the electric vehicle is determined such that the sum ΣW _{i, which} is the sum of waiting times along the visit path from the initial charging point to the final charging point, is minimum.

The above-described method for optimizing the path of the electric vehicle may be implemented in the form of program instructions that can be executed by various computer means and recorded in a computer readable medium. The computer-readable medium may include program instructions, data files, data structures, and the like, alone or in combination. The program instructions recorded on the medium may be those specially designed and constructed for the present invention or may be available to those skilled in the art of computer software. Examples of computer-readable media include magnetic media such as hard disks, floppy disks and magnetic tape; optical media such as CD-ROMs and DVDs; magnetic media such as floppy disks; Magneto-optical media, and hardware devices specifically configured to store and execute program instructions such as ROM, RAM, flash memory, and the like. Examples of program instructions include machine language code such as those produced by a compiler, as well as high-level language code that can be executed by a computer using an interpreter or the like. The hardware devices described above may be configured to operate as one or more software modules to perform the operations of the present invention, and vice versa.

6 is a block diagram illustrating a path scheduling system of an electric vehicle according to an embodiment of the present invention.

Referring to FIG. 6, the charging point identification unit 610 identifies a plurality of charging points existing on the planned path.

In addition, the waiting time obtainer 620 obtains a waiting time required for charging the electric vehicle at each of the plurality of charging points.

At this time, although not shown in FIG. 6, the initial battery remaining amount obtaining unit may check the remaining battery level before each of the plurality of charging points.

In addition, the standby time obtainer 620 may include a standby time calculator that calculates a standby time based on a difference between a distance from a specific charging point to the next charging point and the available battery capacity at each of the plurality of charging points. Can be. In addition, the visit order determiner 630 determines the visit order of the plurality of charging points. In this case, the visit order determiner may include a sum calculator that calculates a sum of waiting times at the plurality of charging points.

Since the contents described with reference to FIGS. 1 to 5 may be applied to the route scheduling system of the electric vehicle illustrated in FIG. 6, a detailed description thereof will be omitted.

As described above, the present invention has been described by way of limited embodiments and drawings, but the present invention is not limited to the above embodiments, and those skilled in the art to which the present invention pertains various modifications and variations from such descriptions. This is possible.

Therefore, the scope of the present invention should not be limited to the described embodiments, but should be determined by the equivalents of the claims, as well as the claims.

Claims (15)

In the method of optimizing the path of the electric vehicle,
Identifying a plurality of charging points present on a particular path;
Obtaining a waiting time required for charging the electric vehicle in addition to a predetermined dwell time at each of the plurality of charging points; And
Determining a visit order of the plurality of charging points based on the waiting time
Lt; / RTI >
Obtaining the waiting time,
Calculating a charge amount charged in the electric vehicle during the predetermined residence time;
Predicting available battery capacity at each of the plurality of charging points using the calculated charge amount; And
Calculating the standby time based on the predicted available battery capacity
How to optimize the path of the electric vehicle comprising a. delete The method of claim 1,
Predicting the available battery capacity,
Obtaining an initial battery remaining amount of the electric vehicle at each of the plurality of charging points; And
Estimating available battery capacity at each of the plurality of charging points using the initial battery level and the calculated charge amount
How to optimize the path of the electric vehicle comprising a. The method of claim 1,
Obtaining the waiting time,
Obtaining the waiting time based on a distance from each of the plurality of charging points to a next charging point
How to optimize the path of the electric vehicle comprising a. 5. The method of claim 4,
Obtaining the waiting time,
Obtaining the standby time based on a difference between a distance from each of the plurality of charging points to a next charging point and available battery capacity at each of the plurality of charging points
How to optimize the path of the electric vehicle comprising a. The method of claim 1, wherein
Calculating a sum of waiting times at the plurality of charging points
Further comprising:
Determining the visit order,
Determining the order of visits based on the sum of the wait times at the plurality of charging points
How to optimize the path of the electric vehicle comprising a. A computer-readable recording medium having recorded thereon a program for performing the method of any one of claims 1 and 3 to 6. In a system for optimizing the path of an electric vehicle,
A charging point identification unit identifying a plurality of charging points existing on a specific path;
A waiting time obtaining unit for obtaining a waiting time additionally required for charging the electric vehicle in addition to a predetermined residence time at each of the plurality of charging points; And
A visit order determining unit to determine a visit order of the plurality of charging points based on the waiting time
Lt; / RTI >
The waiting time obtaining unit
A charge amount calculator configured to calculate a charge amount charged in the electric vehicle during the predetermined residence time;
A usable battery capacity estimator for estimating usable battery capacity at each of the plurality of charge points using the calculated charge amount; And
A standby time calculator configured to obtain the standby time based on the estimated available battery capacity
System for optimizing the path of the electric vehicle comprising a. delete 9. The method of claim 8,
The usable battery capacity prediction unit,
An electric vehicle that obtains an initial battery remaining amount of the electric vehicle at each of the plurality of charging points, and estimates available battery capacity at each of the plurality of charging points using the initial battery remaining amount and the calculated charge amount System to optimize the path. 9. The method of claim 8,
The waiting time obtaining unit,
And optimize the path of the electric vehicle to obtain the waiting time based on the distance from each of the plurality of charging points to the next charging point. 12. The method of claim 11,
The waiting time obtaining unit,
And optimize the path of the electric vehicle to obtain the standby time based on the difference between the distance from each of the plurality of charging points to the next charging point and the available battery capacity at each of the plurality of charging points. 9. The method of claim 8,
A sum calculator for calculating a sum of waiting times at the plurality of charging points
Further comprising:
The visit order determination unit,
A system for optimizing the route of an electric vehicle that determines the order of visits based on a sum of waiting times at the plurality of charging points. 11. The method of claim 10,
The usable battery capacity prediction unit,
Equation
B ⁱ _av = min (B _max , B ⁱ _in + T (V _i ))
Predicts available battery capacity at each of the plurality of charging points according to
B ⁱ _av is the available battery capacity at each of the plurality of charging points, B _max is the maximum battery charge of the electric vehicle, and B ⁱ _in is the initial battery of the electric vehicle at each of the plurality of charging points The remaining amount, and T (V _i ) is the amount of charge charged to the electric vehicle for a predetermined residence time at each of the plurality of charging points. The method of claim 12,
The waiting time obtaining unit,
Equation
^{_{W i = W i-1 -}} min (0, B i av - D (V i · V i + 1))
Acquiring the waiting time according to
W _i is the waiting time at each of the plurality of charging points, W ^i-1 is the waiting time at each of the previous charging points of the plurality of charging points, and B ⁱ _av is at each of the plurality of charging points Is a usable battery capacity of and D (V _{iV i + 1} ) is the battery capacity required to travel the distance from each of the plurality of charging points to the next charging point.

Images