JP2015087799A - Management device, management method, and management program - Google Patents

Abstract

PROBLEM TO BE SOLVED: To increase an operating rate of an electric car.SOLUTION: A processor of a management device executes: a selection procedure which selects an electric car charged with electricity for allowing the vehicle to move from a first point on a route, from a start point to an arrival point, excluding the arrival point, to a second point which is located closer to the arrival point on the route and to be reached next, from among an electric car group located in the first point; a setting procedure which sets a recommendation degree of the electric car, on the basis of the amount of electricity charged to the electric vehicle selected by the selection procedure; and an output procedure which outputs the recommendation degree sets by the setting procedure.

Description

  The present invention relates to a management device, a management method, and a management program for managing an electric vehicle.

  In recent years, electric vehicles have been put into practical use and used in industries such as car rental and car sharing. Among them, the length of charging time, which is a drawback inherent to electric vehicles, is a problem. Generally, an electric vehicle takes time to charge. For this reason, for example, a rental car company assumes that a gasoline car is returned in a full tank, but an electric vehicle permits a return in an empty charge state, and is charged at a store after the return. In addition, a car sharing company has a charging station in a standby area of a vehicle and performs charging during the standby time. As a result of the above-described device, the user can rent a fully charged vehicle and use the vehicle without charging, thereby avoiding a decrease in convenience due to a long charging time. In this case, the vehicle being charged cannot be rented, and the operation rate of the electric vehicle is lower than that of the gasoline vehicle.

  A vehicle management technique using a user's action schedule and a charge amount of the electric vehicle has been proposed for the operation rate of the electric vehicle (see, for example, Patent Document 1). The related art is a technique for predicting a usage situation from a user's action history and presenting an optimal vehicle in a car sharing system. Further, a technique for avoiding a decrease in the amount of charge of a battery due to an increase in the number of times of charging has been proposed (see, for example, Patent Document 2). The prior art is a technique for controlling the lending of a vehicle so that charging can be performed so that the burden on the battery is minimized by using the travel distance and the charge amount as parameters.

JP 2013-50902 A JP 2013-90359 A

  However, the technique of Patent Document 1 is based on the premise that the electric vehicle is fully charged, and a vehicle with a charge amount that is not fully charged is not rented, resulting in a problem that the operation rate is reduced. Moreover, since the technology of Patent Document 2 merely controls the vehicle according to the charge amount by paying attention to the load of the battery, as in Patent Document 1, it does not lend a vehicle with a charge amount that is not fully charged, There is a problem that the operating rate is reduced.

  An object of the present invention is to improve the operating rate of an electric vehicle.

  A management device, a management method, and a management program, which are one aspect of the invention disclosed in the present application, are a first point that is a point on the route excluding the destination point on a route from a departure point to a destination point. The electric vehicle having a charge amount that can reach the second point, which is the point on the route on the destination point side to be reached next, is selected from the group of electric vehicles existing at the first point A selection procedure, a setting procedure for setting a recommendation level of the electric vehicle based on a small amount of charge of the electric vehicle selected by the selection procedure, and an output procedure for outputting the recommendation level set by the setting procedure And executing.

  According to the representative embodiment of the present invention, it is possible to improve the operating rate of an electric vehicle. Problems, configurations, and effects other than those described above will become apparent from the description of the following embodiments.

It is explanatory drawing which shows the example of vehicle management concerning a present Example. It is explanatory drawing which shows the system configuration example of the vehicle management system of a present Example. It is a block diagram which shows the hardware structural example of the user terminal shown in FIG. FIG. 3 is a block diagram illustrating a hardware configuration example of the management apparatus illustrated in FIG. 2. It is a block diagram which shows the hardware structural example of the onboard equipment shown in FIG. It is explanatory drawing which shows the structural example of the program for users which operate | moves with a user terminal. It is explanatory drawing which shows the structural example of the management program which operate | moves with a management apparatus. It is explanatory drawing which shows the structural example of the program for onboard equipment which operate | moves with an onboard equipment. It is explanatory drawing which shows an example of the vehicle state table shown in FIG. It is explanatory drawing which shows an example of the parking place table shown in FIG. It is explanatory drawing which shows an example of the user setting path | route table shown in FIG. It is explanatory drawing which shows an example of the lending candidate table shown in FIG. It is a flowchart which shows the loan candidate creation processing procedure by a management apparatus. It is a flowchart which shows the detailed process sequence example of the 1st recommendation degree calculation process (step S1307) shown in FIG. It is a flowchart which shows the detailed example of a process sequence of the 2nd recommendation degree calculation process (step S1308) of FIG. It is a flowchart which shows the detailed process sequence example of the 3rd recommendation degree calculation process (step S1314) of FIG. It is explanatory drawing which shows the specific example 1 of a 1st recommendation degree calculation process (step S1307). It is explanatory drawing which shows the specific example 2 of a 1st recommendation degree calculation process (step S1307). It is explanatory drawing which shows the specific example of a 3rd recommendation degree calculation process (step S1314). It is explanatory drawing which shows the recommended route example 1. FIG. It is explanatory drawing which shows the example of a combination of the vehicle in each station in the case of FIG. It is explanatory drawing which shows the recommended route example 2. FIG. It is explanatory drawing which shows the example of a combination of the vehicle in each station in the case of FIG. It is explanatory drawing which shows the recommended route example 3.

  The present embodiment will be described below. In this specification, a vehicle is an electric vehicle having a built-in rechargeable battery, and includes a hybrid vehicle. In an electric vehicle, the travelable distance is determined by the amount of charge. In this embodiment, for convenience of explanation, the maximum travelable distance when fully charged is the same for all electric vehicles, but the maximum travelable distance may be different for each electric vehicle.

<Vehicle management example>
FIG. 1 is an explanatory diagram illustrating a vehicle management example according to the present embodiment. FIG. 1 shows an example of vehicle management for a route in which point A is a departure point P0, point B is a transit point P1, and point C is an arrival point P2. Further, the point A has a station STa, and the point B has a station STb. The station has a vehicle that can be rented, and the vehicle can be charged. At the station STa, the vehicles EV001 to EV004 can be lent, and at the station STb, the vehicles EV005 and EV006 can be lent.

  Here, when a certain user moves from point A to point C via point B, the distance between points A and B is 15 km, so the charge amount of the vehicle lent out at station STa travels at least 15 km. It is sufficient if there is a possible charge amount. For this reason, the vehicle EV002 having a travelable distance of 15 km or more and a minimum charge amount is selected as a recommended vehicle. The vehicle EV002 has the smallest amount of charge, but can travel to the point B, so that the operating rate at the station STa can be improved.

  Further, since the distance between the points B and C is 25 km, the charge amount of the vehicle lent out at the station STb only needs to be a charge amount capable of traveling at least 25 km. For this reason, the vehicle EV006 having a travelable distance of 25 km or more and a minimum charge amount is selected as a recommended vehicle. Although the vehicle EV006 has the smallest amount of charge, the vehicle EV006 can travel to the point C, so that the operating rate at the station STb can be improved.

<System configuration example>
FIG. 2 is an explanatory diagram illustrating a system configuration example of the vehicle management system according to the present embodiment. The management system 200 includes a user terminal 201, a management device 203 in the vehicle management center 202, and an electric vehicle 204 on which the vehicle-mounted device 205 is mounted. The user terminal 201, the management device 203, and the electric vehicle 204 are communicably connected via a wireless communication network 206 such as the Internet.

  The user terminal 201 is a computer in which a user inputs information and receives a result. The management device 203 is a computer that receives information on the user terminal 201 and the vehicle-mounted device 205 from the user terminal 201 and the vehicle-mounted device 205 via the wireless communication network 206 and manages the electric vehicle 204. The vehicle-mounted device 205 is a computer that acquires vehicle information of the electric vehicle 204 equipped with the vehicle-mounted device 205 and transmits the vehicle information to the management device 203 via the wireless communication network 206.

<Hardware configuration example>
FIG. 3 is a block diagram illustrating a hardware configuration example of the user terminal 201 illustrated in FIG. The user terminal 201 includes a CPU (Central Processing Unit) 301, a memory 302 that is a temporary storage area, an input device 303 that allows a user to input information such as a keyboard and a touch panel, and a display that displays information to the user such as a liquid crystal display. A device 304, an external communication device 305 for connecting to the wireless communication network 206, an external storage device 306 having an auxiliary storage device such as a hard disk drive or a flash memory, and a bus 307 for connecting them are provided. The external storage device 306 holds a user terminal program 308. The function of the user terminal 201 related to the management system 200 is realized by reading the user program 308 into the memory 302 and executing it by the CPU 301.

  FIG. 4 is a block diagram illustrating a hardware configuration example of the management apparatus 203 illustrated in FIG. The management device 203 includes a CPU 401, a memory 402 as a temporary storage area, an external communication device 403 for connecting to the wireless communication network 206, an external storage device 404 having an auxiliary storage device such as a hard disk drive or a flash memory, And a bus 405 for connecting them. The external storage device 404 holds a management program 400. The function of the management apparatus 203 related to the management system 200 is realized by reading the management program 400 into the memory 402 and executing it by the CPU 501.

  FIG. 5 is a block diagram illustrating a hardware configuration example of the vehicle-mounted device 205 illustrated in FIG. The vehicle-mounted device 205 includes a CPU 501, a memory 502 that is a temporary storage area, a positioning device 503 having a GPS (Global Positioning System) signal receiver, an inertial sensor, and the like, and an external communication device 504 for connecting to the wireless communication network 206. And an external storage device 505 having an auxiliary storage device such as a hard disk drive or a flash memory, a charging status acquisition device 506 for acquiring the state of the battery of the electric vehicle 204, and a bus 507 for connecting them. The external storage device 505 holds the on-vehicle device program 508. The functions of the vehicle-mounted device 205 related to the management system 200 are realized by the memory 502 reading the vehicle-mounted device program 508 and executing it by the CPU 501.

<Program configuration example>
FIG. 6 is an explanatory diagram showing a configuration example of the user program 308 operating on the user terminal 201. The user program 308 includes an input handler 601, a user setting route input program 602, a user terminal I / F 603, a user setting route display program 604, a display handler 605, a user setting route transmission program 606, a transmission handler 607, a reception handler 608, and a rental. A candidate vehicle reception program 609 and a rental candidate vehicle display program 610 are provided.

  The input handler 601 is called when the user inputs a movement route using the input device 303, and passes the input content to the user setting route input program 602. The user setting route input program 602 is a program for passing the route received from the input handler 601 to the user setting route display program 604 and the user setting route transmission program 606 via the user terminal I / F 603.

  The user terminal I / F 603 is a program for receiving route information from the user setting route input program 602 and passing it to the user setting route display program 604 and the user setting route transmission program 606. Further, the user terminal I / F 603 is a program for receiving the rental candidate information from the rental candidate vehicle reception program 609 and passing it to the rental candidate vehicle display program 610. The user setting route display program 604 is a program for receiving route information from the user terminal I / F 603 and passing it to the display handler 605.

  The display handler 605 is a program for receiving route information from the user setting route display program 604 and displaying it on the display device 304. The display handler 605 is a program for receiving rental candidate information from the rental candidate vehicle display program 610 and displaying it on the display device 304. The user setting route transmission program 606 is a program for receiving route information from the user terminal I / F 603 and passing it to the transmission handler 607.

  The transmission handler 607 is a program for receiving route information from the user setting route transmission program 606 and sending the route information to the management device 203 by the external communication device 504. The reception handler 608 is a program for receiving the rental candidate information from the management apparatus 203 and passing it to the rental candidate vehicle reception program 609. The loan candidate vehicle reception program 609 is a program for passing the loan candidate information to the loan candidate vehicle display program 610 via the user terminal I / F 603. The lending candidate vehicle display program 610 is a program for receiving lending candidate information from the user terminal I / F 603 and passing it to the display handler 605.

  FIG. 7 is an explanatory diagram showing a configuration example of the management program 400 that runs on the management apparatus 203. The management program 400 includes a reception handler 701, a vehicle position acquisition program 702, a charging status acquisition program 703, a user setting route acquisition program 704, a management device I / F 705, a rental candidate vehicle creation program 711, and a rental candidate vehicle. A transmission program 714 and a transmission handler 715 are provided.

  Further, the external storage device 505 includes a vehicle state DB 706, a vehicle state table 707, a map information DB 708, a parking place table 709, a user setting route table 710, a loan candidate DB 712, and a loan candidate table 713. Stored.

  The reception handler 701 is a program for distributing the vehicle position information, the charging status information, and the route information passed from the external communication device 504 to the vehicle position acquisition program 702, the charging status acquisition program 703, and the user setting route acquisition program 704. . The vehicle position acquisition program 702 is a program for receiving vehicle position information from the reception handler 701 and passing it to the management apparatus I / F 705.

  The charging status acquisition program 703 is a program for receiving charging status information from the reception handler 701 and passing it to the management apparatus I / F 705. The user setting route acquisition program 704 is a program for receiving route information from the reception handler 701 and passing it to the management apparatus I / F 705.

  The management apparatus I / F 705 is a program for storing the vehicle position information received from the vehicle position acquisition program 702 and the charging status information received from the charging status acquisition program 703 in the vehicle status DB 706. The management apparatus I / F 705 is a program for storing the route information received from the user setting route acquisition program 704 in the map information DB 708. Further, the management apparatus I / F 705 is a program for storing the loan candidate information created by the loan candidate vehicle creation program 711 in the loan candidate DB 712. The management device I / F 705 is a program for passing the tables of the vehicle state DB 706 and the map information DB 708 to the rental candidate vehicle creation program 711.

  The vehicle state DB 706 has a vehicle state table 707 and is a database that stores vehicle position information and charging state information received from the management apparatus I / F 705. The map information DB 708 is a database that has a parking place table 709 and a user setting route table 710, receives route information from the management apparatus I / F 705, and saves it in the user setting route table 710.

  The rental candidate vehicle creation program 711 receives the contents of the vehicle state table 707, the parking place table 709, and the user setting route table 710 from the management apparatus I / F 705, and creates rental candidate information ranking the rental candidate vehicles for each user. It is a program for. The rental candidate vehicle creation program 711 is a program for storing the result in the rental candidate DB 712 via the management device I / F 705.

  The lending candidate DB 712 is a database that has a lending candidate table 713 and stores lending candidate information received from the management apparatus I / F 705. The loan candidate vehicle transmission program 714 is a program for passing the loan candidate information created by the loan candidate vehicle creation program 711 to the transmission handler 715. The transmission handler 715 is a program for receiving rental candidate information from the rental candidate vehicle transmission program 714 and sending it to the user terminal 201 by the external communication device 504.

  FIG. 8 is an explanatory diagram illustrating a configuration example of the on-vehicle device program 508 that operates on the on-vehicle device 205. The on-vehicle device program 508 includes a reception handler 801, a current position acquisition program 802, a charging status acquisition program 803, an on-vehicle device I / F 804, a charging status transmission program 805, a current position transmission program 806, and a transmission handler 807. And comprising.

  The reception handler 801 is a program for acquiring position information and charging status information from the positioning device 503 and the charging status acquisition device 407 and passing them to the current location acquisition program 802 and the charging status acquisition program 803. The current position acquisition program 802 is a program for passing the position information received from the reception handler 801 to the vehicle-mounted device I / F 804. The charging status acquisition program 803 is a program for passing the charging status information received from the reception handler 801 to the vehicle-mounted device I / F 804.

  The on-vehicle device I / F 804 is a program for receiving position information from the current position acquisition program 802 and passing it to the current position transmission program 806. In addition, this is a program for receiving charging status information from the charging status acquisition program 803 and passing it to the charging status transmission program 805. The charging status transmission program 805 is a program for passing charging status information received from the vehicle-mounted device I / F 804 to the transmission handler 807.

  The current position transmission program 806 is a program for passing the position information received from the vehicle-mounted device I / F 804 to the transmission handler 807. The transmission handler 807 is a program for receiving the charging status information from the charging status transmission program 805 and the location information from the current position transmission program 806 and sending it to the management device 203 by the external communication device 504.

  FIG. 9 is an explanatory diagram showing an example of the vehicle state table 707 shown in FIG. The vehicle state table 707 includes a vehicle ID field 901, a current position field 902, a charge amount field 903, and a travelable distance field 904, and each field has a value in each of the fields 901 to 906.

  The vehicle ID field 901 stores a vehicle ID. The vehicle ID is identification information that uniquely identifies a vehicle to be lent. The current position field 902 stores the current position information of the vehicle specified by the vehicle ID. The current position information is information indicating the position of the vehicle (for example, latitude and longitude) at the time of data acquisition. For example, it may be information such as information specifying a point when the user is at a parking place such as a charging station (for example, a point name), or “moving” when the user is rented.

The charge amount field 903 stores the charge amount of the vehicle specified by the vehicle ID. The amount of charge indicates the state of charge of the battery at the time of data acquisition. The travelable distance field 904 stores the travelable distance of the vehicle specified by the vehicle ID. The travelable distance is a distance that can be traveled according to the amount of charge of the vehicle at the time of data acquisition.

  FIG. 10 is an explanatory diagram showing an example of the parking place table 709 shown in FIG. The parking place table 709 has a station ID field 1001 and a position field 1002, and has a value of each field for each station. The station ID field 1001 stores a station ID. The station ID is identification information that uniquely identifies a station that is a rechargeable parking place. The position field 1002 stores information indicating the position of the station specified by the station ID (for example, latitude and longitude).

  FIG. 11 is an explanatory diagram showing an example of the user setting route table 710 shown in FIG. The user setting route table 710 has a link ID field 1101, a user name field 1102, a start point field 1103, an end point field 1104, and a movement distance field 1105, and has a value of each field for each link.

  The link ID field 1101 stores a link ID. The link ID is identification information that uniquely identifies a link that constitutes a route registered by the user. The user name field 1102 stores a user name. The user name is information that identifies the registered user. The starting point field 1103 stores position information (for example, latitude and longitude) of a point (starting point) that is a starting point of a link set by the user. The end point field 1104 stores position information (for example, latitude and longitude) of a point (end point) that is the end of the link set by the user. A route is specified by connecting links of the same user. The movement distance field 1105 stores the movement distance. The movement distance is the distance of the link between the start point specified by the start point field 1103 and the end point specified by the end point field 1104.

  FIG. 12 is an explanatory diagram showing an example of the lending candidate table 713 shown in FIG. The lending candidate table 713 has a user name field 1102, a recommendation level field 1201, a link ID field 1101, a start station field 1202, an end station field 1203, and a boarding vehicle field 1204. The value of each field for each link in units of users. Have

  A recommendation level is stored in the recommendation level field 1201. The degree of recommendation is an index value for recommending a vehicle to the user. For example, the recommendation level is an index value indicating how much the administrator of the management apparatus 203 wants to lend the vehicle to the user. In this example, the higher the recommendation value is, the more the vehicle is lent. The recommendation level is calculated by the rental candidate vehicle creation program 711 when presenting the rental candidate vehicle to the user. By providing the user with a route with a vehicle having a higher recommendation level, the operating rate of the vehicle can be improved.

  The starting station field 1202 stores a station ID indicating the starting station. The start point station is a station near the start point set by the user. In the end station field 1203, a station ID indicating the end station is stored. The end station is a station near the end point set by the user. The end station may be a parking lot such as a sightseeing spot or a restaurant, a charging station for the electric vehicle 204, or a coin parking as long as it can be charged. The boarding vehicle field 1204 stores the vehicle ID of the boarding vehicle. The vehicle ID of the boarding vehicle is specified by the rental candidate vehicle creation program 711.

<Lending candidate creation flow>
FIG. 13 is a flowchart showing a loan candidate creation processing procedure by the management apparatus 203. The processing shown in the flowchart is executed by the rental candidate vehicle creation program 711.

  First, the management device 203 reads the vehicle state table 707, the parking place table 709, and the user setting route table 710 (step S1301), and searches for stations near the start point and end point of the user setting route table 710 (step S1302). In the example of FIG. 1, the station STa at the point A and the station STb at the point B are searched.

  Then, the management device 203 numbers the spot numbers from 0 in order starting from the spot that becomes the movement start position of the route (step S1303). In the example of FIG. 1, numbering is performed in the order of point A, point B, and point C, such as P0, P1, and P2.

  Thereafter, the management apparatus 203 determines whether or not the total number N of points is N> 2 (step S1304). If N> 2 (step S1304: YES), the process proceeds to step S1305. If N> 2 is not satisfied (step S1304: NO), the process proceeds to step S1314.

  In step S1305, the management apparatus 203 sets the spot number n to n = 0 (step S1305), and selects the spot Pn (step S1306). Then, the management apparatus 203 executes a first recommendation degree calculation process (step S1307). The first recommendation degree calculation process (step S1307) is a process for calculating the recommendation degree for each vehicle existing in the station at the selected point Pn in step S1306. Details of the first recommendation degree calculation process (step S1307) will be described later.

  Thereafter, the management device 203 executes a second recommendation degree calculation process (step S1308). The second recommendation level calculation process (step S1308) is a process of executing the first recommendation level calculation process (step S1307) for the point Pn + 1 of the point number n + 1. The recommendation level calculated by the second recommendation level calculation process (step S1308) is used in step S1309. Details of the second recommendation level calculation process (step S1308) will be described later.

  Thereafter, the management apparatus 203 determines whether or not the recommended degrees of all the vehicles at the point Pn + 1 that is the processing target in the second recommended degree calculation process (step S1308) are “unreachable” (step S1308). S1309). “Unreachable” indicates that any vehicle existing at the station at the point Pn + 1 cannot reach the next point Pn + 2 with the charge amount of the vehicle. When the recommendation level of all vehicles at the point Pn + 1 is “unreachable”, the management device 203 deletes the point Pn + 1, and points Pn + 2, Pn + 3,... After the deleted point Pn + 1. Renumbering is performed by reducing the number by one.

  When it cannot reach | attain (step S1309: Yes), the management apparatus 203 judges whether the point Pn-1 exists (step S1310). Unless it is the departure point which becomes the movement start position of the route, the process proceeds to Yes. When the point Pn-1 exists (step S1310: Yes), the management device 203 changes the selected point Pn to the point Pn-1 and changes the point Pn + 1 to the point Pn (step S1311), and returns to step S1306.

  On the other hand, in step S1309, when the recommended degrees of all the vehicles at the point Pn + 1 that is the processing target in the second recommended degree calculation process (step S1308) are not “unreachable” (step S1309: No), the process proceeds to step S1312. Transition. Similarly, in step S1310, when the point Pn-1 does not exist (step S1309: No), the process proceeds to step S1312.

  In step S1312, the management apparatus 203 determines whether or not the spot number n of the selected spot Pn is N-2 (step S1312). The spot number n in step S1312 is the spot number before the change in step S1311. If n = N−2 is not satisfied (step S1312: NO), since the spot number n has not yet reached N−2, the spot number n is incremented (step S1313), and the process returns to step S1306.

  On the other hand, when n = N−2 (step S1312: Yes), the point Pn + 1 is the arrival point of the route, and the point Pn + 2 does not exist, so the management device 203 executes the third recommendation degree calculation process (step) S1314). The third recommendation degree calculation process (step S1314) is a process for calculating the recommendation degree for each vehicle existing in the station at the selected point Pn when the point Pn + 2 does not exist. Details of the third recommendation degree calculation process (step S1314) will be described later.

  Then, the management apparatus 203 adds the recommended degrees at each point on the route, generates a combination of maximum recommended degrees, and sets the recommended route (step S1315). The recommended route is a route that travels while connecting vehicles in the generated combination.

  Then, the management apparatus 203 outputs the result of step S1315 (step S1316). The output destination may be the user terminal 201 or the vehicle-mounted device 205, or the display, printer, or external storage device of the management device 203. As a result, the series of processes is completed.

  FIG. 14 is a flowchart illustrating a detailed processing procedure example of the first recommendation degree calculation processing (step S1307) illustrated in FIG. First, the management device 203 acquires the distance between the point Pn and the point Pn + 1 from the movement distance field 1105 of the user setting route table 710 (step S1401), and moves the distance between the point Pn + 1 and the point Pn + 2 in the user setting route table 710. Obtained from the distance field 1105 (step S1402).

  Next, with reference to the vehicle state table 707, the management device 203 identifies rentable vehicles at each of the point Pn and the point Pn + 1 (step S1403), and determines whether there is an unselected vehicle at the point Pn. (Step S1404). When there is an unselected vehicle (step S1404: Yes), steps S1405 to S1412 are executed, and when there is no unselected vehicle (step S1404: No), the first recommendation degree calculation process (step S1307) is terminated. .

  In step S1405, the management apparatus 203 selects a vehicle that can arrive at the point Pn + 1 from the point Pn and has the smallest charge amount (that is, the vehicle that has the shortest movable distance) (step S1405). Then, the management apparatus 203 determines whether or not the selected vehicle at the point Pn can reach the point Pn + 2 without changing at the point Pn + 1 (step S1406).

  If it is not reachable (step S1406: No), it is necessary to transfer at the point Pn + 1. Therefore, the management device 203 determines whether there is a vehicle that can reach the point Pn + 2 at the point Pn + 1 by changing the vehicle at the point Pn + 1. Judgment is made (step S1407). When it is not reachable (step S1407: No), the management device 203 sets the recommended degree of the selected vehicle at the point Pn to “unreachable” (step S1408), returns to step S1404, and reselects the vehicle.

  On the other hand, when reachable in step S1407 (step S1407: Yes), the management device 203 calculates the recommended degree of the selected vehicle at the point Pn (step S1409), returns to step S1404, and reselects the vehicle. The recommendation degree of the selected vehicle is calculated by a calculation formula in which the value of the recommendation degree increases as the charge amount decreases in the vehicle group at the point Pn. For example, the recommendation degree is calculated by the following formula (1).

Degree of recommendation = 1- (order in ascending charge amount / total number of vehicles at that point) (1)

  In step S1406, when it is reachable (step S1406: Yes), the management device 203 determines whether or not there is already a vehicle having a recommendation degree 0 at the selected point Pn (step S1410). When there is no vehicle with the recommendation degree 0 (step S1410: No), the management apparatus 203 sets the recommendation degree of the selected vehicle to 0 (step S1411), returns to step S1404, and reselects the vehicle.

  On the other hand, when there is a vehicle with a recommendation degree 0 (step S1410: Yes), the management device 203 sets the recommendation degree of the selected vehicle to −1 (step S1412), returns to step S1404, and reselects the vehicle.

  That is, the management device 203 sets the recommendation degree to 0 for a vehicle with the smallest charge amount among vehicles that can reach the point Pn + 2 without changing from the point Pn to the point Pn + 1, and for a vehicle with the least charge amount, Set the recommendation level to -1. Thus, by setting the recommendation level in the case of no transfer to be low, it is possible to improve the operation rate of the vehicle at the station at each point. In addition, the reason why the recommendation level is set to −1 for a vehicle whose charge amount is not minimum is to make the recommendation level lower than that of a vehicle whose charge amount is 0 at the recommendation level.

  FIG. 15 is a flowchart showing a detailed processing procedure example of the second recommendation level calculation processing (step S1308) of FIG. The management apparatus 203 first increments the spot number n (step S1501), executes the first recommendation degree calculation process (step S1307), and decrements n (step S1503). Thereby, the recommendation degree can be calculated based on the point Pn + 1.

  FIG. 16 is a flowchart showing a detailed processing procedure example of the third recommendation degree calculation processing (step S1314) of FIG. First, the management device 203 obtains the distance between the point Pn and the point Pn + 1 from the movement distance field 1105 of the user setting route table 710 (step S1601), and refers to the vehicle state table 707 to find a vehicle that can be rented at the point Pn. It identifies (step S1602) and determines whether there is an unselected vehicle at the point Pn (step S1603).

  When there is an unselected vehicle (step S1603: Yes), steps S1604 to S1607 are executed, and when there is no unselected vehicle (step S1603: No), the third recommendation degree calculation process (step S1314) is terminated. .

  In step S1604, the management apparatus 203 selects a vehicle having the smallest charge amount at the point Pn (that is, a vehicle having the shortest movable distance) (step S1604). Then, the management device 203 determines whether or not the selected vehicle at the point Pn can reach the point Pn + 1 (step S1605). If it is reachable (step S1605: Yes), the management device 203 calculates the recommended degree of the selected vehicle using the above formula (1) (step S1606), returns to step S1603, and reselects the vehicle.

  On the other hand, if it is not reachable (step S1605: No), the management device 203 sets the recommended degree of the selected vehicle at the point Pn to “unreachable” (step S1607), returns to step S1603, and reselects the vehicle. .

  Next, the first recommendation degree calculation process (step S1307) and the third recommendation degree calculation process (step S1314) described above will be described using a specific example.

  FIG. 17 is an explanatory diagram showing a specific example 1 of the first recommendation degree calculation process (step S1307). In FIG. 17 and FIG. 18, the route of the target user is assumed to be a route passing through the points P0 to P5. Moreover, the link which connects between points is marked using the point number of both points. For example, the link between the point P0 and the point P1 is L01. Similarly, the movement distance between points is marked using the point numbers at both ends. For example, the movement distance (distance of the link L01) between the point P0 and the point P1 is d01.

  FIG. 17 shows a processing example when the location number n = 1 of the selected location. The management device 203 selects the vehicle EV006 with the smallest charge amount from the vehicle group managed at the selected point P1 (step S1405). Then, the management device 203 determines whether or not the vehicle EV006 can reach the point P3 via the point P2 without changing at the point P2 (step S1406). In this case, the travelable distance of the vehicle EV006 is 20 km, the moving distance between the points P1 and P2 is d12, and the moving distance between the points P2 and P3 is d23. Therefore, the management device 203 determines whether or not 25 ≧ d12 + d23.

  When 25 ≧ d12 + d23, since the vehicle EV006 can reach the point P3 via the point P2 without changing at the point P2, the management apparatus 203 sets the recommended degree of the vehicle EV006 to 0 (step S1411). . If the selected vehicle is EV005, the recommended degree of EV006, which is less charged than EV005, is set to 0, so the recommended degree of EV005 is -1 (step S1412).

  If it is not 25 ≧ d12 + d23, it is necessary to change the vehicle at the point P2. Therefore, the management apparatus 203 determines whether the point P3 can be reached at any of the vehicles EV007 to EV009 at the point P2 (step S1407). If it is reachable, the management device 203 calculates a recommendation degree of the selected vehicle EV005 at the point P1 (step S1409). On the other hand, if it is not reachable, the management device 203 sets the recommended degree of the selected vehicle EV005 to “unreachable” at the point P1 (step S1408).

  FIG. 18 is an explanatory diagram of a specific example 2 of the first recommendation degree calculation process (step S1307). FIG. 18 shows a state where the selected point Pn is changed to the point Pn−1 and the point Pn + 1 is changed to the point Pn in step S1311 of FIG. Specifically, this is an example in which the selected point is changed from the point P1 to the point P0 and the point to be reached next to the selected point is changed from the point P2 to the point P1. That is, this is an example in which the point P3 cannot be reached with the amount of charge of the vehicles EV007 to EV009 at the point P2.

  Further, since the point P3 cannot be reached with the charge amount of the vehicles EV007 to EV009 at the point P2, the point P2 is deleted, and the point numbers after the point P2 are renumbered. In this example, since the point P2 is deleted, the points P3 to P5 become the points P2 to P4. The distance codes d23, d34, and d45 are used without renumbering for the sake of convenience.

  At the point P0, the management device 203 selects the vehicle EV002 with the smallest charge amount from the group of vehicles managed at the selected point P0 (step S1405). Then, the management apparatus 203 determines whether or not the vehicle EV002 can reach the point P2 via the point P1 without changing at the point P1 (step S1406). In this case, the travelable distance of the vehicle EV002 is 20 km, the moving distance between the points P0 and P1 is d01, and the moving distance between the points P1 and P2 is d12 + d23. Therefore, the management apparatus 203 determines whether or not 20 ≧ d01 + d12 + d23.

  When 25 ≧ d01 + d12 + d23, since the vehicle EV002 can reach the point P2 via the point P1 without changing at the point P1, the management device 203 sets the recommended degree of the vehicle EV002 to 0 (step S1411). . If the selected vehicle is, for example, EV003, the recommended degree of EV002, which is less charged than EV003, is set to 0, so the recommended degree of EV003 is -1 (step S1412).

  If it is not 25 ≧ d01 + d12 + d23, it is necessary to change the vehicle at the point P1, so the management device 203 determines whether the point P2 can be reached at any of the vehicles EV005 and EV006 at the point P1 (step S1407). If it is reachable, the management device 203 calculates a recommendation degree of the selected vehicle EV002 at the point P0 (step S1409). On the other hand, if any vehicle is unreachable, the management device 203 sets the recommended degree of the selected vehicle EV002 to “unreachable” at the point P0 (step S1408).

  Thereafter, the point number n is incremented in step S1313 of FIG. 13, so the selected point becomes the point P1. The management device 203 selects the vehicle EV006 with the smallest charge amount from the vehicle group managed at the selected point P1 (step S1405). Then, the management device 203 determines whether or not the vehicle EV006 can reach the point P3 via the point P2 without changing at the point P2 (step S1406). In this case, the travelable distance of the vehicle EV006 is 20 km, the moving distance between the points P1 and P2 is d12 + d23, and the moving distance between the points P2 and P3 is d34. Therefore, the management apparatus 203 determines whether or not 20 ≧ d12 + d23 + d34.

  When 25 ≧ d12 + d23 + d34, since the vehicle EV006 can reach the point P3 via the point P2 without changing at the point P2, the management device 203 sets the recommended degree of the vehicle EV006 to 0 (step S1411). . If the selected vehicle is EV005, the recommended degree of EV006, which has a smaller charge amount than EV005, is set to 0, so the recommended degree of EV006 is -1 (step S1412).

  When it is not 25 ≧ d12 + d23 + d34, it is necessary to change the vehicle at the point P2, and therefore the management device 203 determines whether the point P3 can be reached at any of the vehicles EV010 and EV011 at the point P2 (step S1407). If it is reachable, the management device 203 calculates a recommendation degree of the selected vehicle EV006 at the point P1 (step S1409). On the other hand, if any vehicle is unreachable, the management device 203 sets the recommended degree of the selected vehicle EV006 to “unreachable” at the point P1 (step S1408).

  FIG. 19 is an explanatory diagram showing a specific example of the third recommendation degree calculation process (step S1314). In FIG. 19, it is assumed that the route of the target user is a route passing through the points P0 to P1.

  FIG. 19 shows a processing example when the point number n = 0 of the selected point. The management device 203 selects the vehicle EV002 with the smallest charge amount from the vehicle group managed at the selected point P0 (step S1604). Then, the management device 203 determines whether or not the vehicle EV002 can reach the point P1 (step S1605). In this case, the travelable distance of the vehicle EV002 is 20 km, and the moving distance between the points P0 and P1 is d01. Therefore, the management apparatus 203 determines whether or not 25 ≧ d01.

  When 25 ≧ d01, since the vehicle EV002 can reach the point P1, the management device 203 calculates a recommendation degree of the vehicle EV002 (step S1606). If 20 ≧ d01 is not satisfied, the management device 203 sets the recommended degree of the selected vehicle EV002 to “unreachable” at the point P0 (step S1607).

  FIG. 20 is an explanatory diagram of a recommended route example 1. FIG. 21 is an explanatory diagram showing a combination example of vehicles at each station in the case of FIG. In the recommended route example 2000 of FIG. 20, the recommendation degree at the point P0 is as shown in the table 2001, and the recommendation degree at the point P1 is as shown in the table 2002. Further, among the combinations shown in FIG. 21, the highest recommended value 1 is the total recommended route of the route that gets on the vehicle EV002 at the station STa, goes to the station STb, changes to the vehicle BV006 at the station STb, and goes to the point C (P2). Therefore, this route is the recommended route.

  FIG. 22 is an explanatory diagram of a recommended route example 2. Moreover, FIG. 23 is explanatory drawing which shows the example of a combination of the vehicle in each station in the case of FIG. In the recommended route example 2200 in FIG. 22, the recommendation level at the point P0 is as shown in Table 2201, the recommendation level at the point P1 is as shown in Table 2202, and the recommendation level at the point P2 is Table 2203. It is as shown in. That is, it is an example in which any vehicle at the point C (P2) cannot reach the point D (P3).

  Of the combinations shown in FIG. 23, the highest recommended value of the total recommended route for the route EV to the station STb at the station STa and the vehicle BV005 to the point D (P3) at the station STb is the highest value 0.75. Therefore, this route is the recommended route.

  FIG. 24 is an explanatory diagram of a recommended route example 3. In the recommended route example 2400 of FIG. 24, the recommendation degree at the point P0 is as shown in the table 2401, the recommendation degree at the point P1 is as shown in the table 2402, and the recommendation degree at the point P2 is the table 2403. It is as shown in. In this example, since both the vehicle at the point B (P2) and the point C (P3) are “unreachable”, board the vehicle EV004 and change from the point A (P0) to the point D (P3). Since the total recommended degree of the route to be reached is the highest value 0.75, this route becomes the recommended route.

  Thus, according to the present embodiment, a vehicle that has a small amount of charge but can reach the destination can be preferentially lent out, so that the operating rate of the vehicle can be improved. Further, by setting the recommended route so that the number of transfers increases, it is possible to improve the operation rate of the vehicle. Further, by setting the recommended route so that the number of transfers is reduced, it is possible to improve the operating rate of the vehicle and improve the convenience for the user. Even if it is determined that all the vehicles at a certain point cannot reach the next point to be reached, it is possible to search for vehicles that can be reached from other points as much as possible. be able to.

  The present invention is not limited to the above-described embodiments, and includes various modifications and equivalent configurations within the scope of the appended claims. For example, the above-described embodiments have been described in detail for easy understanding of the present invention, and the present invention is not necessarily limited to those having all the configurations described. A part of the configuration of one embodiment may be replaced with the configuration of another embodiment. Moreover, you may add the structure of another Example to the structure of a certain Example. In addition, for a part of the configuration of each embodiment, another configuration may be added, deleted, or replaced.

  In addition, each of the above-described configurations, functions, processing units, processing means, etc. may be realized in hardware by designing a part or all of them, for example, with an integrated circuit, and the processor realizes each function. It may be realized by software by interpreting and executing the program to be executed.

  Information such as programs, tables, and files that realize each function can be stored in a storage device such as a memory, a hard disk, or an SSD (Solid State Drive), or a recording medium such as an IC card, an SD card, or a DVD.

  Further, the control lines and the information lines are those that are considered necessary for the explanation, and not all the control lines and the information lines that are necessary for the mounting are shown. In practice, it can be considered that almost all the components are connected to each other.

200 management system 201 user terminal 203 management device 204 electric vehicle 205 on-board unit 206 wireless communication network 707 vehicle state table 709 parking location table 710 user setting route table 711 rental candidate vehicle creation program 713 rental candidate table

Claims (8)

A management device having a processor that executes a program and a memory that stores a program executed by the processor,
The processor is
On the route from the departure point to the arrival point, the second point that is the point on the route on the arrival point side that should be reached next from the first point that is the point on the route excluding the arrival point A selection procedure for selecting an electric vehicle having a reachable charge amount from the group of electric vehicles existing at the first point;
A setting procedure for setting a recommendation degree of the electric vehicle based on a small amount of charge of the electric vehicle selected by the selection procedure;
An output procedure for outputting the recommended degree set by the setting procedure;
The management apparatus characterized by performing.   In the setting procedure, in the group of electric vehicles existing at the first point, the selected electric vehicle is set to be higher than the recommended degree of other electric vehicles that is larger than the charge amount of the selected electric vehicle. The management device according to claim 1, wherein a recommendation degree is set. The processor is
By selecting an electric vehicle with the recommended degree set for each first point, a combination of electric vehicles moving on the route is generated, and a sum of recommended degrees of the electric vehicles constituting the combination is obtained. Run the generation procedure,
The management apparatus according to claim 1, wherein in the output procedure, a generation result generated by the generation procedure is output. The processor is
An electric vehicle having a charge amount that can reach a third point that is a point on the route on the arrival point side that should be reached next to the second point from the first point is the first point. A determination procedure for determining whether the vehicle exists in the electric vehicle group existing in
In the setting procedure,
The management device according to claim 1, further comprising setting a recommendation level of the selected electric vehicle based on a determination result determined by the determination procedure. The processor is
An electric vehicle having a charge amount that can reach a third point that is a point on the route on the arrival point side that should reach the second point from the second point is the second point. A determination procedure for determining whether the vehicle exists in the electric vehicle group existing in
In the setting procedure,
The management device according to claim 1, further comprising setting a recommendation level of the selected electric vehicle based on a determination result determined by the determination procedure. The processor is
When it is determined by the determination procedure that an electric vehicle having a charge amount that can reach the third point from the second point does not exist in the electric vehicle group existing at the second point, Executing a change procedure for changing the first point and the second point to points on the departure point side,
In the selection procedure, an electric vehicle having a charge amount that can reach the second point after the change from the first point after the change by the change procedure is an electric vehicle group existing at the first point after the change. The management apparatus according to claim 5, wherein the management apparatus is selected from the following. A management method executed by a management device having a processor that executes a program and a memory that stores a program executed by the processor,
The management method is:
The processor is
On the route from the departure point to the arrival point, the second point that is the point on the route on the arrival point side that should be reached next from the first point that is the point on the route excluding the arrival point A selection procedure for selecting an electric vehicle having a reachable charge amount from the group of electric vehicles existing at the first point;
A setting procedure for setting a recommendation degree of the electric vehicle based on a small amount of charge of the electric vehicle selected by the selection procedure;
An output procedure for outputting the recommended degree set by the setting procedure;
The management method characterized by performing. To the processor,
On the route from the departure point to the arrival point, the second point that is the point on the route on the arrival point side that should be reached next from the first point that is the point on the route excluding the arrival point A selection procedure for selecting an electric vehicle having a reachable charge amount from the group of electric vehicles existing at the first point;
A setting procedure for setting a recommendation degree of the electric vehicle based on a small amount of charge of the electric vehicle selected by the selection procedure;
An output procedure for outputting the recommended degree set by the setting procedure;
The management method characterized by making it execute.

Images