JP2018081574A - Vehicle management method and vehicle management system - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a vehicle management method and a vehicle management system having an increased operating rate of a vehicle. A vehicle management method or a vehicle management system for managing a plurality of vehicles used by a plurality of users, which receives a vehicle usage request from a user, manages a vehicle usage status, and manages a vehicle station status. The usage request including the departure place or arrival place of the vehicle specified by the user is stored, the stations existing around the departure place or the arrival place are extracted, the existence probability in the extracted station is calculated, and the calculated existence probability is calculated. Based on, set up a station for renting or returning vehicles. [Selection diagram] Fig. 4

Description

  The present invention relates to a vehicle management method and a vehicle management system.

  The following methods are conventionally known as carport management methods for eliminating the uneven distribution of vehicles. A mail requesting movement of the vehicle from the car port Ci to the destination car port Cj is distributed to a registered user who wishes to entrust the vehicle movement. It is confirmed that the vehicle has been moved to the destination car port (Patent Document 1).

JP 2010-170283 A

  However, the above carport management method cannot grasp when the registered user receives the request, and the registered user cannot respond immediately, so the vehicle cannot be moved in a timely manner. May not be resolved. Therefore, there is a problem that the vehicle is unevenly distributed and the operation rate of the vehicle cannot be increased.

  The problem to be solved by the present invention is to provide a vehicle management method and a vehicle management system in which the operation rate of the vehicle is increased.

  The present invention is a management method and a vehicle management system for a plurality of vehicles used by a plurality of users, and receives a vehicle use request from a user, manages the use state of the vehicle and the state of a station of the vehicle, The usage request including the departure or arrival location of the vehicle specified by is stored, the stations existing around the departure or arrival location are extracted, the existence probability at the extracted station is calculated, and the calculated existence probability is calculated. Based on this, the above-mentioned problem is solved by setting a station for renting or returning a vehicle.

  According to the present invention, there is an effect that the operation rate of the vehicle can be increased.

FIG. 1 is a block diagram of a car sharing system according to the present embodiment. FIG. 2 is a block configuration diagram illustrating functional blocks of the server-side control device. FIG. 3 is a conceptual diagram showing a departure place, a departure station, an arrival place, and an arrival station on a map. FIG. 4 is a flowchart showing a control flow of the control device in the car sharing system according to the present embodiment. FIG. 5 is a flowchart showing a control flow of the control device in the car sharing system according to the present embodiment. FIG. 6 is a table showing the relationship between departure stations and arrival stations set for three users. FIG. 7 is a flowchart showing a control flow of a control device in a car sharing system according to another embodiment of the present invention.

  Hereinafter, embodiments of the present invention will be described with reference to the drawings.

<< First Embodiment >>
FIG. 1 is a block diagram of a car sharing system according to the present embodiment. FIG. 2 is a block configuration diagram illustrating functional blocks of the server-side control device. As shown in FIG. 1, the car sharing system of this embodiment includes a management server 100, a plurality of shared vehicles 200 used for car sharing, and a plurality of users that can communicate with the vehicle management server 100 via the Internet 300. Terminal 400. In FIG. 1, only two shared vehicles 200 are shown, but the car sharing system of the present embodiment includes a large number of shared vehicles 200. And in the car sharing system of this embodiment, many shared vehicles 200 are each parked in the predetermined parking space provided in each place, and the specific many users are parked in the desired parking space. The vehicle 200 can be selected and used.

  As shown in FIG. 1, the shared vehicle 200 can communicate with the management server 100 and includes an in-vehicle device 210 and a communication device 220. The in-vehicle device 210 includes information on the scheduled departure time (use start time) and estimated arrival time (use end time) of the shared vehicle 200, travel distance information, own vehicle position information, vehicle speed information, and battery remaining amount information. The information on the on / off of the power switch of the vehicle is transmitted from the communication device 220 to the communication device 120 included in the management server 100 by wireless communication. The communication device 220 receives information transmitted from the management server 100 as a signal.

  In addition, as a method for the in-vehicle device 210 to acquire information on the own vehicle position, for example, a radio wave transmitted from a positioning satellite by a GPS (Global Positioning System) provided in each shared vehicle 200 is received every predetermined time. Thus, a method of acquiring real-time position information of each shared vehicle 200 can be mentioned.

  The user terminal 400 is a terminal owned by a specific number of users who use the car sharing system of the present embodiment, and can communicate with the communication device 120 provided in the management server 100 via the Internet 300. In the car sharing system of the present embodiment, each user can make a use application for the shared vehicle 200 using the user terminal 400.

  Here, the use application of the shared vehicle 200 may be an immediate use application in which the user starts using the shared vehicle 200 immediately after the use application, or the use for the user to use the shared vehicle 200 in the future. You may apply for a reservation.

  Further, in the car sharing system of the present embodiment, when the user makes an application for use of the shared vehicle 200 using the user terminal 400, the user sets a planned return place for return after using the shared vehicle 200. .

  Examples of the user terminal 400 include various mobile terminals such as a mobile phone and a PDA in addition to a personal computer. When the user terminal 400 is a mobile phone, vehicle information communicated by the communication device 120 is read into the user terminal 400 by wireless communication based on various wireless device standards, and the user terminal 400 receives vehicle information and the like. You may transmit to the management server 100. In FIG. 1, four terminals are shown as examples of the user terminal 400. However, the number of users using the user terminal 400 and the car sharing system of the present embodiment is not particularly limited.

  The management server 100 includes a control device 110, a communication device 120, and a database 130.

  The communication device 120 is a device for communicating with the user terminal 400 owned by each user via the Internet 300 and the communication device 220 provided in the shared vehicle 200 by wireless communication. The communication device 120 receives information on the scheduled departure time and arrival time of the shared vehicle 200, information on the travel distance, information on the vehicle position, and the like from the in-vehicle device 210 by wireless communication, and information on the vehicle position from the user terminal 400 Information on the application for use of the shared vehicle 200, information on the planned return location selected by the user, and the like are acquired. The usage application information includes vehicle information desired to be used, service usage history, member registration information, and the like.

  The database 130 is a storage device for storing, for each shared vehicle 200, usage reception information, return planned site information, position information of parking spaces that are parked, and the like as information associated with the date and time. The usage acceptance information and the return planned site information are stored in the user terminal 400 when the user makes an application for the use of the shared vehicle 200, selects an available vehicle, and selects a planned return site via the user terminal 400. This is information generated for each shared vehicle 200 based on the information transmitted from. Further, when the user of the car sharing system is limited to members, the database 130 also stores registered member information, identification information of the user terminal 400 registered by the member, and the like.

  Further, the database 130 stores information on a plurality of parking spaces for parking the shared vehicle 200. Specifically, the database 130 stores position information of a plurality of parking spaces provided in a predetermined area. In the car sharing system of the present embodiment, the parking space is a parking lot for parking the shared vehicle 200, and an area where a plurality of parking spaces are provided is a parking station.

  As shown in FIG. 1, the control device 110 of the management server 100 includes a ROM (Read Only Memory) 112 in which various programs are stored, and a CPU (Central Processing Unit) as an operation circuit for executing the programs stored in the ROM 112. ) 111 and a RAM (Random Access Memory) 113 that functions as an accessible storage device.

  And in order to manage the car sharing system which concerns on this embodiment, the control apparatus 110 manages the reservation management function which manages the reservation from a user, the vehicle management function which manages the shared vehicle 200, and the state of a station. A station management function is provided. The control device 110 can execute each function by cooperation of software for realizing the above functions and the hardware described above. Moreover, the control apparatus 110 has the reservation management part 11, the vehicle management part 12, and the station management part 13 as a functional block for exhibiting each of these functions, as shown in FIG.

  Below, each function which the control apparatus 110 of the management server 100 implement | achieves is each demonstrated using FIG. Further, control on the vehicle side will be described as necessary.

  First, the control device 110 receives an application for use of the shared vehicle 200 from the user by the reservation management unit 11. Specifically, when the user operates the user terminal 400 to apply for the use reservation of the shared vehicle 200, the reservation management unit 11 uses the reservation application information transmitted from the user terminal 400. Accept application.

  The use application information includes departure place information, arrival place information, scheduled departure time, estimated arrival time, and the like. The departure place information is information on the departure place desired by the user, and is location information specified by the facility name, the facility telephone number, and the address. The arrival place information is information on an arrival place desired by the user, and is position information specified by a facility name, a facility telephone number, and an address. The scheduled departure time is a time specified by the user and indicates the departure time of the departure place. The estimated arrival time is a time designated by the user and indicates the arrival time of the arrival place. Usage application information is specified by the user. A value calculated from the scheduled departure time and the travel time to the destination stored in the database may be used as the estimated arrival time.

  The reservation manager 11 identifies the departure place and the arrival place on the map data by extracting the departure place and arrival place information from the reservation application information received from the user. The reservation management unit 11 searches for a departure station within a predetermined range centering on the departure place. In addition, the reservation management unit 11 searches for an arrival station within a predetermined range centering on the arrival place.

  FIG. 3 is a conceptual diagram showing a departure place, a departure station, an arrival place, and an arrival station on a map. In FIG. 3, a point S indicates a departure place, and a point G indicates an arrival place. ST1 to ST4 and ST7 to ST10 indicate stations. Area A and area B indicate the search range of stations. A number indicated by a flag near the station indicates the existence probability at each station.

  As shown in FIG. 3, the reservation management unit 11 sets a search range A as a circle drawn with a predetermined radius around the point S that is the departure point. The reservation management unit 11 sets a circle drawn with a predetermined radius around the point G, which is the arrival point, in the search range B. The radii A and B are determined by the distance that the user can move on foot from the arrival place, and are set to 300 m, for example. Note that the search range may be set for each user based on the usage record of the user. The search range may be set according to the business hours of each station. For example, the search range may be set wider in a time zone with fewer sales stations.

  The reservation management unit 11 extracts stations included in the search range A as departure stations. The reservation management unit 11 extracts stations included in the search range B as arrival stations. In the example of FIG. 3, ST1, ST2, and ST3 are extracted as departure stations, and ST7, ST8, and ST9 are extracted as arrival stations. Since ST4 and ST10 are outside the areas of search range A and search range B, they are not extracted as departure stations and arrival stations. That is, the departure station is a place where the shared vehicle 200 is rented out to a user who has designated the departure place S. The arrival station is a place where the shared vehicle 200 is returned to the user who specified the arrival place G.

  The reservation management unit 11 acquires the existence probability of each station managed by the station management unit 13 from the station management unit 13. The existence probability indicates the existence probability of the shared vehicle 200 at each station and the existence probability of the empty parking space at each station. When the station is specified as the departure station, the existence probability indicates the existence probability of the vehicle, and when the station is specified as the arrival station, the existence probability is the existence probability of the empty parking space.

  In the car sharing system according to the present embodiment, if the shared vehicle 200 reserved by the user at the designated time is departed and the shared vehicle 200 can be returned at the designated time, other users can also use the shared vehicle 200 as scheduled. Available. However, it is assumed that the vehicle is not used as scheduled due to traffic conditions and the like. In addition, the bias in the use of vehicles varies depending on the ability to attract customers at each station, the weather, and the like. Further, assuming a situation in which the user cancels immediately before use, it is conceivable that the number of reservations is made larger than the number of vehicles to be managed from the operation side of the system. In view of these circumstances, there is a possibility that an available vehicle is not parked in the parking space even if the user goes to the station registered for reservation at the reserved time designated for renting the shared vehicle 200. Similarly, there is a possibility that there is no empty parking space even if the user arrives at the station registered for reservation at the designated reservation time in order to return the vehicle on board. The existence probability at the departure station represents the possibility that a rentable vehicle is parked in the parking space of the departure station. That is, the higher the existence probability at the departure station, the higher the possibility that the vehicle can be used. The existence probability at the arrival station indicates the possibility that the parking space at the arrival station is empty. That is, the higher the existence probability at the arrival station, the higher the possibility that the vehicle can be returned.

  In the example of FIG. 3, since the existence probability (70%) of ST1 is the highest among the three departure stations (ST1 to ST3), there is a high possibility that the user can use the vehicle when going to ST1. Moreover, since the existence probability of ST7 is the highest among the three arrival stations (ST7 to ST9), when the user goes to ST7, there is a high possibility that the vehicle can be returned.

  As a response to the reservation application from the user, the reservation management unit 11 communicates with the extracted position information and the existence probability of each arrival station while corresponding the position information and the existence probability of each extracted departure station. The device 120 is used to notify the user of the station status. On the user terminal 400, the position of the departure station near the departure place and the existence probability of each station are displayed in association with each other, and the position of the arrival station near the arrival place and the existence probability of each station are displayed in association with each other. . Thereby, in addition to the position of the station close | similar to the departure place and the arrival place which a user desires, the user can grasp | ascertain the availability of the vehicle in each station, and the return possibility of a vehicle, respectively.

  The user operates the user terminal 400 and designates a desired departure station from the list of departure stations, and designates a desired arrival station from the list of arrival stations. The user terminal 400 transmits information on the designated station. When the control device 110 acquires station information using the communication device 120, the station management unit 13 sets the designated station as a station that lends a vehicle and a station that returns a vehicle. Thereby, the control apparatus 110 sets a departure station and an arrival station based on the existence probability in each station.

  The vehicle management unit 12 manages the usage state of the shared vehicle 200 to be managed. In addition, the vehicle management unit 12 manages the position of the shared vehicle 200 by communicating with the shared vehicle 200 using the communication device 120 and acquiring position information of the shared vehicle 200. The usage state of the shared vehicle 200 includes at least two states, a state where the vehicle is currently being used and a state where the vehicle is not currently used. For example, when the user wants to know the vacant state of the shared vehicle 200, the vehicle management unit 12 creates a list of available vehicles and transmits the created list to the reservation management unit 11. The reservation management unit 11 transmits a list of available vehicles to the user using the communication device 120. An available vehicle is a vehicle that is not currently used. The user who has received the list can check the available vehicle and the parking position of the available vehicle by checking the list on the display screen of the user terminal 400.

  The station management unit 13 manages the state of the station. The state of the station is managed by the existence probability of a vehicle at the station or the existence probability of an empty parking space at the station. Since the existence probability of the vehicle in the parking space and the existence probability of the empty parking space are in a contradictory relationship, the station management unit 13 determines the existence probability of at least one of the existence probability of the vehicle and the existence probability of the empty parking space. Can be managed.

  The station management unit 13 calculates the vehicle existence probability and the vacant parking space existence probability based on the vehicle use record or the parking space use record. The vehicle usage record is represented by the number of times the vehicle is used for each time zone, the vehicle usage time for each time zone, and the parking time of the vehicle, and is managed for each station. The usage record of the parking space is represented by the free time of the parking space and is managed for each station. For example, the station management unit 13 divides the parking time of the vehicle in a certain parking space by the time length from the time t1 to the time t2 between the time t1 and the time t2, so that the vehicle from the time t1 to the time t2 Calculate the existence probability of. The station management unit 13 similarly calculates the vehicle existence probability from time t1 to time t2 for other parking spaces in a certain station. The station management unit 13 calculates the vehicle existence probability at a certain departure station by calculating the average value of the calculated vehicle existence probabilities.

  When the station management unit 13 calculates the existence probability of an empty parking space in a certain parking space from time t1 to time t2, the station management unit 13 calculates the time vacant from time t1 to time t2. By dividing by the time length from time t2 to time t2, the existence probability of an empty parking space from time t1 to time t2 is calculated. Similarly, the station management unit 13 calculates the existence probability of an empty parking space from time t1 to time t2 for other parking spaces at a certain station. And the station management part 13 calculates the existence probability of the empty parking space in a certain departure station by calculating the average value of the calculated existence probability of the empty parking space.

  Next, the control flow of the control apparatus 110 is demonstrated using FIG. FIG. 4 is a flowchart showing a control flow of the control device 110. The control flow in FIG. 4 is executed when a user makes an application for a reservation for use.

  In step S1, the reservation management unit 11 accepts an application for use of the shared vehicle 200 from the user.

  In step S2, the reservation management unit 11 acquires the departure place information and the arrival place information from the reservation application information, thereby specifying the departure place and the arrival place designated by the user.

  In step S <b> 3, the reservation management unit 11 sets a predetermined search range with the identified departure place as a base point. The reservation management unit 11 searches for a station within the set search range. The reservation management unit 11 extracts a station located within the search range as a departure station. Similarly, for the arrival station, the reservation management unit 11 sets a search range based on the arrival place, and extracts the arrival station by searching for the station within the set search range.

  In step S4, the station management unit 13 calculates the existence probability of each departure station based on the extracted utilization results of the departure stations. The existence probability of the departure station is the existence probability of the shared vehicle 200. The station management unit 13 calculates the existence probability of each arrival station based on the extracted usage record of the arrival station. The existence probability of the arrival station is the existence probability of the empty parking space.

  In step S <b> 5, the reservation management unit 11 transmits a signal including station information to the user terminal 400 using the communication device 120. The station information includes the existence probability of the departure station calculated by the station management unit 13, the existence probability of the arrival station calculated by the station management unit 13, the position of the departure station, and the position of the arrival station.

  The user terminal 400 receives a signal including station information from the management server 100 and displays the station information on a display. The station information is information shown in FIG. The user operates the user terminal 400 to designate a station that serves as a vehicle rental site and a station that serves as a vehicle return location according to the position and existence probability of the station. The user terminal 400 transmits a use registration signal including the designated station information to the management server 100.

  In step S6, control device 110 determines whether or not a usage registration signal has been received. The use registration signal is a signal indicating that the user registers the reservation content in the management server 100. The management server 100 officially accepts a reservation for the shared vehicle 200 by confirming reception of the use registration signal.

  When the use registration signal is received, the control flow proceeds to step S7. When the use registration signal is not received, the reservation management unit 11 determines that the user has canceled the reservation application, and the control flow ends. In the control flow in step S6, the control flow may be terminated by receiving a signal to cancel the reservation application.

  In step S7, the station management unit 13 sets the departure station and the arrival station by storing the departure station and the arrival station specified by the user in the database 130.

  In step S8, the reservation management unit 11 performs a final confirmation as to whether or not the user can accept the reservation. When receiving a signal to confirm the reservation content from the user terminal 400, the reservation management unit 11 stores the reservation information in the database 130, thereby determining the reservation content. The control flow ends. If a signal for confirming the reservation details has not been received from the user terminal 400, the control flow returns to step S7.

  As described above, in the present embodiment, the usage request for the shared vehicle 200 is received from the user, the usage state of the shared vehicle 200 and the state of the station of the shared vehicle 200 are managed, and the shared vehicle 200 specified by the user from the usage request. The starting and arriving locations are identified, the stations that exist around the starting and arriving locations are extracted, the existence probabilities at the extracted stations are calculated, and the rental and return of vehicles are performed based on the calculated existence probabilities. Set the station to perform. Thereby, since the existence probability of each station is managed, the user can grasp a station having a high existence probability, so that the operating rate of the shared vehicle 200 can be increased.

  In the present embodiment, the control device 110 extracts stations that exist around either one of the departure point and the arrival point. When the departure station existing around the departure place is extracted, the control device 110 calculates the existence probability of the departure station, includes the calculated existence probability in the station information, and notifies the user. Good. In addition, when the arrival stations existing around the arrival place are extracted, the control device 110 calculates the existence probability of the arrival station, includes the calculated existence probability in the station information, and notifies the user. Good. The user can grasp a station having a higher boarding probability by confirming the existence probability of the vehicle at the departure station. Further, the user can grasp a station having a higher getting-off probability by confirming the existence probability of an empty parking space at the arrival station.

<< Second Embodiment >>
A car sharing system according to another embodiment of the present invention will be described. In the present embodiment, a part of the calculation control of the existence probability is different from the first embodiment. Other configurations are the same as those in the first embodiment described above, and the description thereof is incorporated as appropriate.

  The station management unit 13 calculates the existence probability of the time zone before the scheduled departure time and the existence probability of the time zone after the scheduled arrival time. The existence probability of the time zone before the scheduled departure time is the existence probability of the departure station included in the search range A. In addition, the existence probability of the time zone before the scheduled departure time is calculated based on the getting-off use probability. The existence probability of the time zone after the estimated arrival time is the existence probability of the arrival station included in the search range B. In addition, the existence probability of the time zone after the estimated arrival time is calculated based on the boarding use probability.

  In the example of FIG. 3, the station management unit 13 calculates the use probability of the scheduled departure time and the use probability after the scheduled departure time for each of the plurality of departure stations (ST1 to ST3). Further, the station management unit 13 calculates the use probability of the estimated arrival time and the use probability after the estimated arrival time for each of the plurality of arrival stations (ST7 to ST9).

  Here, the calculation method of the boarding use probability (boarding probability) and the boarding usage probability (boarding probability) by the station management unit 13 will be described. The station management unit 13 calculates the probability of occurring in the future based on the past result using the Poisson distribution.

ただし、ｄ_ｉｊ（ｔ）は時刻ｔに発生するステーションｉ、ｊ間の移動需要発生数を示し、λ_ｉｊ（ｔ）はポアソン分布の期待値パラメータを示す。 The existence probability of a vehicle at a certain station can be calculated by calculation from the relationship between the boarding use probability (departure use probability), the getting-off use probability (arrival use probability), and the set number of parking spaces. The boarding use probability can be calculated from the number of movements from the departure station (ST_i) to the arrival station (ST_j). The probability distribution P of the movement demand represented by the number of movements is expressed by the following formula (1) when it is assumed that the movement demand occurs according to the Poisson distribution.

Here, d _ij (t) indicates the number of movement demands generated between stations i and j occurring at time t, and λ _ij (t) indicates an expected value parameter of Poisson distribution.

  For example, the number of vehicles that leave the station (ST_01) and arrive at the station (ST_02) within a predetermined time (30 minutes) from a certain time (8:00) is extracted from the usage record. Similarly, with respect to other station combinations, the number of vehicles that depart from one station and arrive at the other station is extracted from the usage record. The other station combination is a combination between stations from the station (ST_01) to the station (ST_06).

The extracted number corresponds to d _ij (t) in the above formula (1). By substituting the extracted d _ij (t) into equation (1), the values shown in Table 1 below are derived. In the following table, the distribution of the number of departure vehicles and the number of arrival vehicles is applied to the Poisson distribution, and λ _ij (t) is estimated by the maximum likelihood method.

  For example, in the time zone from 8:00 to 8:30, when the station (ST02) is set as the departure station, the boarding use probability is represented by the average value Ave (λi) in the column of “ST02” in Table 1 above. The

Similarly, when each station from station ST01 to station ST06 is a departure station and the boarding use probability of each station is obtained in increments of 30 minutes between 8 o'clock and 11 o'clock, the boarding use probability is an example. As shown in Table 2 below.

The arrival use probability is calculated by the same method as the boarding use probability, and is represented by the following Table 3 as an example.

  The boarding use probability may be calculated from the ratio between the average value of the number of boarding times in a predetermined time and the maximum number of boarding times in the predetermined time. The getting-off probability may be calculated from the ratio between the average value of the number of times of getting off at a predetermined time and the maximum number of times of getting off at the predetermined time.

  The reservation management unit 11 acquires the presence probability at the extracted departure station and the presence probability at the extracted arrival station from the station management unit 13. The reservation management unit 11 transmits the existence probability of the departure station and the existence probability of the arrival station to the user terminal 400 after being included in the station information.

  The user operates the user terminal 400 to display the received station information. As shown in FIG. 3, the display displays the probability of getting off in a time zone before the scheduled departure time, in addition to the station position and the existence probability of the scheduled departure time. For example, when the existence probability of the shared vehicle 200 at the scheduled departure time is the same among a plurality of departure stations, the boarding probability at the scheduled departure time increases as the departure probability of the previous time zone is higher. Since the user can check the getting-off probability in the previous time zone, the departure station having a higher boarding probability can be designated as the rental location of the vehicle.

  Further, the display displays the boarding use probability in the time zone after the scheduled arrival time in addition to the station position and the existence probability of the scheduled departure time as shown in FIG. For example, when the existence probability of the shared vehicle 200 at the scheduled arrival time is the same among a plurality of departure stations, the shared vehicle 200 can be parked in a parking space with a higher probability of boarding in a later time zone. The operation rate of the vehicle after the estimated arrival time is increased. Since the user can confirm the boarding use probability in the later time zone, the user can grasp to which arrival station the vehicle should be returned in order to increase the operating rate of the vehicle. Thereby, the operation rate of a vehicle can be raised.

  As described above, in the present embodiment, the existence probability at the designated time specified by the user and the existence probability before the designated time are calculated, and the calculated existence probabilities are notified to the user. Thereby, the probability that the user can use the vehicle can be increased. As a result, the convenience of the system can be improved. Moreover, the operating rate of the vehicle can be increased.

<< Third Embodiment >>
A car sharing system according to another embodiment of the present invention will be described. The car sharing system according to the present embodiment executes the following control after the reservation is confirmed according to the first embodiment or the second embodiment. Note that the control until the reservation is confirmed is the same as in the first embodiment or the second embodiment, and the description thereof is incorporated as appropriate.

  In the car sharing system according to the present embodiment, a control flow of the control device 110 will be described with reference to FIGS. 5 and 6. FIG. 5 is a flowchart showing a control flow of the control device 110. FIG. 6 is a table showing the relationship between departure stations and arrival stations set for three users (user 1, user 2, and user 3).

  The control flow shown in FIG. 5 is executed when a predetermined time before the scheduled departure time is reached. The predetermined time is, for example, 30 minutes ago. The scheduled departure time is the time indicated by the confirmed reservation registration, and is the time designated by the user. In the following description, as an example, it is assumed that the control flow is executed 30 minutes before the scheduled departure time of the user 1. Also, the following control flow is a flow for setting a station for renting an actual vehicle among the candidates for the departure station set at the time of reservation confirmation. Moreover, it is a flow for setting the station which lends and returns a vehicle among the candidates of the arrival station set at the time of reservation confirmation.

  In step S11, the reservation management unit 11 generates a use registration list. The use registration list is a list showing departure stations and arrival stations set for each user. FIG. 6 shows an example of the usage registration list. The reservation management unit 11 extracts information on other users who have registered the same station as the departure station set for the user 1 as the departure station in the same time zone. Further, the reservation management unit 11 extracts information on other users who have registered the same station as the arrival station set for the user 1 as the arrival station in the same time zone. The reservation management unit 11 divides the extracted user information into a list by dividing the information by the departure station and the arrival station.

  In the example of FIG. 3, the departure stations of the user 1 are ST1, ST2, and ST3. Since the user 2 has registered the same station (ST2) as the user 1 as the departure station, the user 2 is listed in the use registration list. Since the user 3 has registered the same station (ST3) as the user 1 as the departure station, the user 3 is listed in the use registration list.

  In step S12, the station management unit 13 confirms the status of the stations listed in the use registration list. The state of the station indicates the presence or absence of a vehicle and the presence or absence of an empty parking space at each station. For example, if the shared vehicle 200 is not parked in all the parking spaces set as the departure station 30 minutes before the scheduled departure time, the vehicle can be used even if the calculation existence probability is high. The nature is low. Therefore, the station management unit 13 excludes the departure station from the lending station when the number of vehicles parked at the departure station is equal to or less than a predetermined lower limit value. Similarly, the station management unit 13 excludes the arrival station from the return station when the number of empty parking spaces at the arrival station is equal to or less than a predetermined lower limit. The excluded station is also excluded from the use registration list.

  In step S13, the reservation management unit 11 determines whether or not the use reservations overlap in the same time period. When either one of the departure station and the arrival station is duplicated in the use registration list, the use reservation is duplicated. If the usage registrations overlap, the control flow proceeds to step S14. If the usage registrations do not overlap, the control flow proceeds to step S15.

  In step S14, the reservation management unit 11 calculates the combination with the largest number of users in the same time period. The combination is a combination of a departure station and an arrival station. The largest number of users corresponds to the highest operating rate of the vehicle.

  The control flow in step S14 will be described with reference to FIG. Note that the use registration list shown in FIG. 6 is a list after the stations to be excluded are excluded in the control flow of step S12.

  For example, when the station (ST2) is set as the renting station for the user 1 and the station (ST4) is set as the renting station for the user 3, the user 2 is connected to the station (ST2) and the station ( Since ST4) is registered as a departure station, the user 2 cannot use the shared vehicle 200. On the other hand, for example, the station (ST1) is set as the renting station for the user 1, the station (ST2) is set as the renting station for the user 2, and the station (ST3) is set as the renting station for the user 3. In this case, all users can use the shared vehicle 200. In this manner, the reservation management unit 11 assigns a rental station to each user so that more users can rent a vehicle.

  As for the return station, similarly to the departure station, the reservation management unit 11 assigns a return station to each user so that more users can return the vehicle. In the example of FIG. 6, the return station for user 1 is set to station (ST7), the return station for user 2 is set to station (ST9), and the return station for user 3 is set to station (ST8). The By setting such a return station, all users can return the shared vehicle 200 to the parking space of each station.

  In step S15, the reservation management unit 11 determines whether there are a plurality of selectable stations. If there are a plurality of selectable stations, the control flow proceeds to step S16. If there are not a plurality of selectable stations, the control flow proceeds to step S18. In the example of FIG. 6, there are a plurality of combinations of stations where all users can use the vehicle, and there are a plurality of departure stations that can be selected for each user.

  In step S16, the station management unit 13 sets, as a user's departure station, a station having a higher probability of getting off in the next time zone among a plurality of departure stations. The next time zone is a time zone after the scheduled departure time of the user. The set departure station corresponds to a rental station. In the example of FIG. 6, the stations that can be selected for the user 1 are ST1, ST2, and ST3. Then, the station management unit 13 calculates the arrival use probability of each station (ST1, ST2, ST3) in the time zone next to the scheduled departure time of the user 1. The station management unit 13 sets the station having the highest arrival use probability among the arrival use probabilities of the respective stations (ST1, ST2, ST3) as the departure station of the user 1.

  For example, the case where the arrival use probability of the station (ST1) is the highest in the time zone next to the scheduled departure time among the stations (ST1, ST2, ST3) will be described. In order to increase the operation rate of the vehicle, after the user 1 moves the shared vehicle 200 from the parking space of the station (ST1), the vacant parking space may be set as a return station for other users. . The arrival use probability of the station (ST1) is higher than the arrival use probability of the other stations (ST2, ST3). Therefore, generating an empty parking space at the station (ST1) by the time zone next to the scheduled departure time can increase the operation rate of the vehicle. In this embodiment, a station having a high arrival use probability is set as a rental station in a time zone next to the scheduled departure time.

  In step S <b> 17, the station management unit 13 sets a station having a higher boarding use probability in the next time zone among the plurality of arrival stations as the departure station of the user. The next time zone is a time zone after the scheduled arrival time of the user. The set arrival station corresponds to a return station. In the example shown in FIG. 6, for example, it is assumed that the stations that can be selected for the user 1 are ST7, ST8, and ST9. The station management unit 13 calculates the departure use probability of each station (ST7, ST8, ST9) in the time zone next to the estimated arrival time of the user 1. The station management unit 13 sets the station having the highest departure use probability among the departure use probabilities of the respective stations (ST7, ST8, ST9) as the arrival station of the user 1.

  For example, a case will be described where, among the stations (ST7, ST8, ST9), the departure use probability of the station (ST7) is highest in the time zone next to the estimated arrival time. In order to increase the operation rate of the vehicle, after the user 1 parks the shared vehicle 200 from the parking space of the station (ST7), the shared vehicle 200 may be lent to other users. The departure use probability of the station (ST7) is higher than the departure use probability of the other stations (ST8, ST9). Therefore, parking the shared vehicle 200 at the station (ST7) by the time zone next to the estimated arrival time can increase the operation rate of the vehicle. In the present embodiment, a station having a high departure use probability is set as a return station in the time zone next to the estimated arrival time.

  In step S18, the reservation management unit 11 notifies the user of the vehicle rental station and the return station, respectively. Then, the control flow ends.

  As described above, in the present embodiment, for a plurality of users, a departure station existing around the departure place and an arrival station existing around the arrival place are respectively extracted, and the shared vehicle used by the plurality of users is used. Stations for lending the shared vehicle 200 and returning the shared vehicle 200 are set for each of a plurality of users so that the operation rate of 200 is maximized. Thereby, the operation rate of the shared vehicle 200 can be increased.

  In the present embodiment, among the plurality of stations existing around the arrival place, a station having a higher boarding use probability at a time later than the estimated arrival time at the arrival place is set as the arrival station of the shared vehicle 200. To do. Thereby, after returning the shared vehicle 200 to an arrival station, the utilization probability of the returned shared vehicle 200 can be raised. As a result, the operating rate of the shared vehicle 200 can be increased.

  In the present embodiment, among a plurality of stations existing around the departure place, the station having the higher probability of getting off in the time zone after the scheduled arrival time at the departure place is set as the departure station of the vehicle. To do. Thus, after the shared vehicle 200 departs from the departure station, the use probability can be increased as a return place in an empty parking space. As a result, the operating rate of the shared vehicle 200 can be increased.

  As a modification of the present embodiment, when there are a plurality of selectable stations, the station management unit 13 sets a station set as a departure station of another user in the next time zone among the plurality of arrival stations. To the user's arrival station. The next time zone is a time zone after the estimated arrival time.

  For example, in the example of FIG. 6, a case will be described in which only the station (ST7) is set as the departure station of another user in the time zone next to the estimated arrival time among the stations (ST7, ST8, ST9). In order to increase the possibility that the parked vehicle is lent out to other users after the user 1 parks in the parking space of the arrival station, the shared vehicle 200 is used in the parking space of the station (ST7) where use registration is performed. It is better to be parked at. Therefore, in this embodiment, a station registered as a departure station of another user is set as a return station in a time zone next to the estimated arrival time. Thereby, the operation rate of the shared vehicle 200 can be increased.

  As a modification of the present embodiment, when there are a plurality of selectable stations, the station management unit 13 sets a station set as an arrival station of another user in the next time zone among the plurality of departure stations. To the user's departure station. The next time zone is a time zone after the scheduled departure time.

  For example, in the example of FIG. 6, a case will be described in which only the station (ST1) among the stations (ST1, ST2, ST3) is set as the arrival station of another user in the time zone next to the scheduled departure time. After the shared vehicle 200 has moved from the parking space of the station, in order for the empty parking space to be used as a return place for the other shared vehicle 200, the shared vehicle 200 is connected to the station (ST1) where use registration is performed. It is better to move from the parking space. Therefore, in the present embodiment, a station registered as an arrival station of another user is set as a rental station in a time zone next to the scheduled departure time. Thereby, the operation rate of the shared vehicle 200 can be increased.

<< 4th Embodiment >>
A car sharing system according to another embodiment of the present invention will be described. The car sharing system according to the present embodiment executes the following control after the reservation is confirmed according to the first embodiment or the second embodiment. In addition, control until reservation confirmation is the same as 1st Embodiment or 2nd Embodiment, and uses description of 1st-3rd embodiment suitably.

  In the car sharing system according to the present embodiment, a control flow of the control device 110 will be described with reference to FIG. FIG. 7 is a flowchart showing a control flow of the control device 110. The control flow shown in FIG. 7 is executed when a predetermined time before the scheduled departure time is reached. The following control flow is a flow for setting a station for renting an actual vehicle among the candidate departure stations set at the time of reservation confirmation. Moreover, it is a flow for setting the station which lends and returns a vehicle among the candidates of the arrival station set at the time of reservation confirmation.

  Since the control flow from step S21 to step S24 is the same as the control flow from step S11 to step S14 in the third embodiment, a description thereof will be omitted.

  In step S25, the reservation management unit 11 determines whether or not the usage conditions overlap among a plurality of users. A case where usage conditions overlap is a case where a plurality of users are registered at the same departure station and the same arrival station in the same usage time zone. For example, in a combination with the largest number of users, when user A cannot use user B and user B can use user A when user A uses it, between user A and user B The usage conditions are duplicated. If the usage conditions overlap, the control flow proceeds to step S26. If the usage conditions do not overlap, the control flow ends.

  In step S <b> 26, the reservation management unit 11 selects a usage user based on the usage history of each overlapping user. The user is a user who is permitted to lend a vehicle. The usage record is, for example, the number of registration failures, the number of registrations, the registration time, the number of service usages, the service usage frequency, and the like.

  Registration failure is when the use of the shared vehicle 200 is refused after the reservation registration is confirmed. For example, in order to generate the combination with the largest number of users in the control flow of step S24, there are cases where the use of some users cannot be permitted. In addition, when an upper limit is set for the number of confirmed reservations, the reservation registration itself may be rejected. In such a case, the number of registration failure is incremented. And the reservation management part 11 selects a user with more registration failure frequency as a utilization user, when utilization conditions overlap.

  As another example of user selection, the reservation management unit 11 may preferentially select a user with a high degree of use of the car sharing system. The system usage is represented by the number of registrations, registration time, service usage, service usage frequency, and the like.

  In step S27, the reservation management unit 11 notifies the user selected as the user to be permitted to use. In addition, the reservation management unit 11 notifies a user who has not been selected as a use user that use is not permitted.

  As described above, in the present embodiment, when a station that lends the shared vehicle 200, a station that returns the shared vehicle 200, and a use time of the shared vehicle 200 overlap among a plurality of users, a plurality of overlapping users The user who permits the use of the shared vehicle 200 is selected on the basis of the actual use record. Thereby, in using a car sharing system, unfairness between users can be corrected, or a user's utilization degree can be raised.

DESCRIPTION OF SYMBOLS 11 ... Reservation management part 12 ... Vehicle management part 13 ... Station management part 100 ... Management server 110 ... Control apparatus 111 ... CPU (Central Processing Unit)
112 ... ROM (Read Only Memory)
113 ... RAM (Random Access Memory)
DESCRIPTION OF SYMBOLS 120 ... Communication apparatus 130 ... Database 200 ... Shared vehicle 210 ... In-vehicle apparatus 220 ... Communication apparatus 300 ... Internet 400 ... User terminal

Claims (10)

A method for managing a vehicle using a controller for managing a plurality of vehicles used by a plurality of users,
While receiving the use request of the vehicle from the user, managing the use state of the vehicle and the state of the station of the vehicle,
Specify the departure and arrival locations of the vehicle specified by the user from the usage request;
Extracting the stations present around the departure point or the arrival point;
Calculate the existence probability in the extracted station,
A vehicle management method for setting the station for renting or returning a vehicle based on the calculated existence probability. The vehicle management method according to claim 1, comprising:
Vehicle management for calculating the existence probability based on at least one of the existence probability of the vehicle at the station, the existence probability of an empty parking space at the station, the boarding probability at the station, and the exit probability at the station. Method. A vehicle management method according to claim 1 or 2,
Calculating the existence probability at a designated time designated by the user, and the existence probability before the designated time;
A vehicle management method for notifying the user of the calculated existence probability. A vehicle management method according to claim 1 or 2,
For a plurality of users, a departure station existing around the departure place and an arrival station existing around the arrival place are extracted, respectively.
A vehicle management method in which the station for renting the vehicle and returning the vehicle is set for each of the plurality of users so that the operation rate of the vehicle when the plurality of users use the maximum. A vehicle management method according to any one of claims 1 to 4,
When there are a plurality of the stations existing around the arrival place designated by the first user, the station set as the departure station of the second user after the scheduled arrival time at the arrival place is A vehicle management method set as an arrival station of the first user. A vehicle management method according to any one of claims 1 to 5,
Calculate the existence probability based on the boarding probability at the station,
A vehicle that sets, as the arrival station of the vehicle, the station having the higher boarding probability in a time zone after the scheduled arrival time at the arrival place among the plurality of stations existing around the arrival place. Management method. A vehicle management method according to any one of claims 1 to 4,
When there are a plurality of the stations existing around the departure place designated by the first user, the station set as the arrival station of the second user is set before the scheduled departure time from the departure place. The vehicle management method set as the departure station of the first user. A vehicle management method according to any one of claims 1 to 5,
Calculate the existence probability based on the probability of getting off at the station,
A vehicle that sets, as a departure station of the vehicle, the station having the higher probability of getting off in a time zone after the scheduled arrival time at the departure place among the plurality of stations existing around the departure place Management method. A vehicle management method according to any one of claims 1 to 8,
When the station that rents the vehicle, the station that returns the vehicle, and the use time of the vehicle overlap among the plurality of users, the use of the vehicle is based on the use results of the plurality of duplicate users. A vehicle management method for selecting the user who permits the vehicle. A vehicle management system for managing a plurality of vehicles used by a plurality of users,
A controller for receiving a use request of the vehicle from the user, and managing a use state of the vehicle and a state of the station of the vehicle;
A database for storing the use request including a departure place or an arrival place of the vehicle designated by the user;
The controller is
Extracting the stations present around the departure point or the arrival point;
Calculate the existence probability in the extracted station,
A vehicle management system that sets the station that lends or returns a vehicle based on the calculated existence probability.

Images