Vehicle allocation management system, vehicle allocation reservation management method, and computer program

Abstract

To provide a vehicle allocation management system, a vehicle allocation reservation management method, and a computer program, which improve convenience when a user makes a reservation in a demand-type vehicle allocation management system that operates vehicles according to reservations.SOLUTION: In a demand-type vehicle allocation management system 1 that operates vehicles according to reservations, a management server includes a storage unit configured to store vehicle allocation schedule information indicating a vehicle allocation schedule, a reception unit configured to receive a ride reservation request from a user, and a vehicle allocation processing unit configured to determine whether it is possible to allocate a vehicle that satisfies desired conditions indicated in the ride reservation request received by the reception unit, based on the vehicle allocation schedule information in the storage unit, then determine, if it is impossible to allocate the vehicle that satisfies the desired conditions, whether it is possible to allocate a vehicle again after performing a predetermined condition change on the desired conditions, and respond to the user with information on the vehicle allocation that has been determined to be possible.SELECTED DRAWING: Figure 1

Description

[Technical Field]

[0001] The present invention relates to a vehicle dispatch management system, a vehicle dispatch reservation management method, and a computer program. [Background technology]

[0002] On-demand transportation is a type of public transportation service that allows users to make reservations in advance and operates according to the reservations. Regarding on-demand transportation, a reservation management technology is known, for example, as described in Patent Document 1. This technology encourages multiple users to board the same vehicle by suggesting ride reservations to users who are likely to ride together based on their past riding history. The interface of the user terminal for making reservations is disclosed as one in which reservation information such as the desired date and time, boarding location, and disembarking location is input and transmitted, and if the seat reservation is successful, the reservation is confirmed and the reservation result is displayed.

[0003] Furthermore, Non-Patent Document 1 describes a trip-based vehicle dispatch technology that takes into account departure and arrival from bases in order to realize an operation in which out-of-service vehicles are kept waiting at bases, which is particularly necessary when using self-driving vehicles in on-demand transportation. [Prior art documents] [Patent documents]

[0004] [Patent Document 1] Patent No. 6432205 [Non-patent literature]

[0005] [Non-Patent Document 1] Aoi Koizuka and Tomohiko Ogishi, "A Study on Demand-Based Transportation Dispatch Methods with an Eye to the Use of Autonomous Driving Vehicles," Institute of Electronics, Information and Communication Engineers, 2020 Society Conference Proceedings, B-15-11, September 1, 2020 Summary of the Invention [Problem to be solved by the invention]

[0006] However, with the conventional technology described above, when a user requests a ride reservation by specifying desired conditions such as a departure point, destination, and desired time (desired departure time and desired arrival time) and searches for a vehicle, if a vehicle that meets the desired conditions is not found, the user is notified that the vehicle is unavailable. This requires the user to reset the desired conditions (e.g., desired departure time) and search for a vehicle again. Furthermore, even if the user resets the desired conditions and searches for a vehicle again, there is no guarantee that a vehicle that meets the desired conditions will be found, which creates an issue of inconvenience for the user.

[0007] The present invention has been made in consideration of the above circumstances, and its purpose is to improve the convenience for users when making reservations in a demand-based vehicle dispatch management system that operates vehicles according to reservations. [Means for solving the problem]

[0008] ( 1 ) One aspect of the present invention is a demand-type vehicle dispatch management system that operates vehicles in response to reservations, comprising: a memory unit that stores vehicle dispatch schedule information indicating vehicle dispatch schedules; a reception unit that receives ride reservation requests from users; and a vehicle dispatch processing unit that determines, based on the vehicle dispatch schedule information in the memory unit, whether a vehicle can be dispatched that satisfies the desired conditions indicated in the ride reservation request received by the reception unit, and if a vehicle that satisfies the desired conditions is not possible, makes specified condition changes to the desired conditions and then determines again whether a vehicle can be dispatched, and responds to the user with information about a vehicle that is determined to be possible to be dispatched; and if a vehicle that satisfies the desired conditions is not possible, the vehicle dispatch processing unit is a vehicle dispatch management system that, if a vehicle that satisfies the desired conditions is not possible, changes the desired conditions from ride-sharing refusal to ride-sharing permission and then determines again whether a vehicle can be dispatched. ( 2) One aspect of the present invention is a demand-type vehicle dispatch management system that operates vehicles in response to reservations, comprising: a memory unit that stores vehicle dispatch schedule information that indicates vehicle dispatch schedules; a reception unit that receives ride reservation requests from users; and a vehicle dispatch processing unit that determines whether a vehicle that satisfies the desired conditions indicated in the ride reservation request received by the reception unit is possible based on the vehicle dispatch schedule information in the memory unit, and if a vehicle that satisfies the desired conditions is not possible, makes predetermined condition changes to the desired conditions and then determines again whether a vehicle is possible, and responds to the user with information about a vehicle that is determined to be possible to be dispatched; and if a vehicle that satisfies the desired conditions is not possible, the vehicle dispatch processing unit changes at least one of the departure point and destination of the desired conditions to the same as the existing vehicle, and then determines again whether a vehicle is possible to be dispatched. ( 3 ) One aspect of the present invention is a demand-type vehicle dispatch management system that operates vehicles in response to reservations, comprising: a memory unit that stores vehicle dispatch schedule information that indicates vehicle dispatch schedules; a reception unit that receives ride reservation requests from users; and a vehicle dispatch processing unit that determines whether a vehicle that satisfies the desired conditions indicated in the ride reservation request received by the reception unit is possible based on the vehicle dispatch schedule information in the memory unit, and if a vehicle that satisfies the desired conditions is not possible, makes predetermined condition changes to the desired conditions and then determines again whether a vehicle is possible to dispatch, and responds to the user with information about a vehicle that is determined to be possible to dispatch; and if a vehicle that satisfies the desired conditions is not possible when adding the number of passengers of the desired conditions to the number of passengers in the existing vehicle to result in an excess of passenger capacity, the vehicle dispatch processing unit is a vehicle dispatch management system that reduces the number of passengers of the desired conditions and then determines again whether a vehicle is possible to dispatch.

[0009] ( 4) One aspect of the present invention is a vehicle dispatch reservation management method executed by a demand-type vehicle dispatch management system that operates vehicles in accordance with reservations, the vehicle dispatch reservation management method including: a storage step of storing vehicle dispatch schedule information indicating a vehicle dispatch schedule in a storage unit; a reception step of receiving a ride reservation request from a user; and a vehicle dispatch processing step of determining, based on the vehicle dispatch schedule information in the storage unit, whether a vehicle that satisfies the desired conditions indicated in the ride reservation request received by the reception step is possible, and if a vehicle that satisfies the desired conditions is not possible, making predetermined condition changes to the desired conditions and then determining again whether a vehicle is possible, and responding to the user with information about a vehicle that is determined to be possible to be dispatched; and if a vehicle that satisfies the desired conditions is not possible, the vehicle dispatch processing step is a vehicle dispatch reservation management method in which, if a vehicle that satisfies the desired conditions is not possible, the vehicle dispatch processing step changes the desired conditions from ride-sharing refusal to ride-sharing permission and then determines again whether a vehicle is possible to be dispatched. ( 5 ) One aspect of the present invention is a vehicle dispatch reservation management method executed by a demand-type vehicle dispatch management system that operates vehicles in response to reservations, the vehicle dispatch reservation management method including: a storage step of storing vehicle dispatch schedule information indicating a vehicle dispatch schedule in a storage unit; a reception step of receiving a ride reservation request from a user; and a vehicle dispatch processing step of determining whether a vehicle that satisfies the desired conditions indicated in the ride reservation request received by the reception step is possible based on the vehicle dispatch schedule information in the storage unit, and if a vehicle that satisfies the desired conditions is not possible, making predetermined condition changes to the desired conditions and then determining again whether a vehicle is possible to dispatch, and responding to the user with information on a vehicle that is determined to be possible to dispatch; and in the vehicle dispatch processing step, if a vehicle that satisfies the desired conditions is not possible, and if a departure point of the desired conditions is within a predetermined distance from the departure point of an existing vehicle to be dispatched, or if a destination of the desired conditions is within a predetermined distance from the destination of an existing vehicle to be dispatched, changing at least one of the departure point and destination of the desired conditions to the same as the existing vehicle to determine again whether a vehicle is possible to dispatch. ( 6) One aspect of the present invention is a vehicle dispatch reservation management method executed by a demand-type vehicle dispatch management system that operates vehicles in response to reservations, the vehicle dispatch reservation management method including: a storage step of storing vehicle dispatch schedule information indicating a vehicle dispatch schedule in a storage unit; a reception step of receiving a ride reservation request from a user; and a vehicle dispatch processing step of determining whether a vehicle that satisfies the desired conditions indicated in the ride reservation request received by the reception step is possible based on the vehicle dispatch schedule information in the storage unit, and if a vehicle that satisfies the desired conditions is not possible, making predetermined condition changes to the desired conditions and then determining again whether a vehicle is possible to dispatch, and responding to the user with information on a vehicle that is determined to be possible to dispatch; and in the vehicle dispatch processing step, if a vehicle that satisfies the desired conditions is not possible and adding the number of passengers of the desired conditions to the number of passengers of an existing vehicle exceeds the passenger capacity, the vehicle dispatch reservation management method reduces the number of passengers of the desired conditions and then determines again whether a vehicle is possible to dispatch.

[0010] ( 7 ) One aspect of the present invention is the above ( 4 )from( 6 ) is a computer program for causing a computer to execute any one of the vehicle dispatch reservation management methods. [Effects of the Invention]

[0011] According to the present invention, in a demand-based vehicle allocation management system that operates vehicles according to reservations, it is possible to obtain the effect of improving convenience when a user makes a reservation. [Brief explanation of the drawings]

[0012] [Figure 1] 1 is a block diagram illustrating an example of the configuration of a vehicle dispatch management system according to an embodiment. [Figure 2] FIG. 2 is a diagram illustrating an example of a trip according to an embodiment. [Figure 3] 1 is a flowchart illustrating an example of a procedure of a vehicle dispatch determination method according to an embodiment. [Figure 4]FIG. 2 is a diagram illustrating an example of an operation of the vehicle dispatch management system according to an embodiment. [Figure 5] 1 is a flowchart illustrating an example of a procedure of a vehicle dispatch determination method according to an embodiment. [Figure 6] 1 is a flowchart illustrating an example of a procedure of a vehicle dispatch determination method according to an embodiment. [Figure 7] FIG. 2 is a diagram illustrating an example of an operation of the vehicle dispatch management system according to an embodiment. [Figure 8] FIG. 2 is a diagram illustrating an example of an operation of the vehicle dispatch management system according to an embodiment. [Figure 9] FIG. 2 is a diagram illustrating an example of an operation of the vehicle dispatch management system according to an embodiment. [Figure 10] FIG. 10 is a diagram illustrating an example of a trip (dispatch) output according to an embodiment. DETAILED DESCRIPTION OF THE INVENTION

[0013] Hereinafter, embodiments of the present invention will be described with reference to the drawings. Note that subscripts such as "a" may be written as "_a".

[0014] 1 is a block diagram showing an example of the configuration of a vehicle dispatch management system according to an embodiment. The vehicle dispatch management system 1 according to this embodiment is a demand-based traffic management system. In a demand-based traffic management system, vehicles are operated according to user reservations.

[0015] In this embodiment, vehicle dispatch management is performed on a trip basis. A trip refers to a series of vehicle operations from a base departure time, passing through one or more demand stopover points (departure points (boarding locations) or destination points (drop-off locations)), and returning to the base at a base return time.

[0016] The vehicle dispatch management system 1 includes terminal devices 20-1, 20-2, and 20-3, an in-vehicle device 30, and a management server 100. The terminal devices 20-1, 20-2, and 20-3, the in-vehicle device 30, and the management server 100 are connected via a network NW. The network NW is a wireless or wired communication network. This network NW includes the Internet, an intranet, and the like. Specifically, the network NW is an information communication network configured by a WAN (Wide Area Network), a LAN (Local Area Network), and the like. This WAN includes, for example, a mobile phone network, a PHS (Personal Handyphone System) network, a PSTN (Public Switched Telephone Network), a dedicated communication line network, and a VPN (Virtual Private Network).

[0017] The terminal device 20-1 is used by a user. The user operates the terminal device 20-1 to reserve a vehicle. When reserving a vehicle, the user specifies desired conditions. Desired conditions include the departure point (boarding location), destination (drop-off location), desired time (desired time to depart from the departure point (desired departure time) and desired time to arrive at the destination (desired arrival time)), number of passengers, whether or not to share a ride, etc. Based on the user's operation, the terminal device 20-1 creates a ride reservation request addressed to the management server 100, including ride reservation information (demand). The ride reservation information includes information indicating the user's desired conditions. The terminal device 20-1 transmits the created ride reservation request to the management server 100.

[0018] The management server 100 receives the ride reservation request sent by the terminal device 20-1. The management server 100 stores location information of the base where the vehicle will be waiting. The management server 100 acquires the ride reservation information included in the received ride reservation request, and searches for a route from the first base to the first or second base via the boarding location and the disembarking location based on the acquired ride reservation information and the stored location information of the base.

[0019] Based on the route search results, the management server 100 creates a new vehicle operation schedule that departs from a first base at a first time, passes through boarding and disembarking locations, and returns to the first base or second base at a second time. Based on the created new operation schedule and the existing operation schedules of one or more vehicles, the management server 100 determines whether operation according to the new operation schedule that meets the user's desired conditions is possible. At this time, if the management server 100 determines that operation according to the new operation schedule that meets the user's desired conditions is impossible, the management server 100 makes predetermined condition changes to the desired conditions and then determines again whether operation according to the new operation schedule is possible.

[0020] If the management server 100 determines that operation according to the new operation schedule is possible, it creates a ride reservation response addressed to the terminal device 20-1 and including the new operation schedule. The management server 100 transmits the created ride reservation response to the terminal device 20-1. The terminal device 20-1 receives the ride reservation response transmitted by the management server 100 and displays the new operation schedule included in the received ride reservation response. When the management server 100 receives confirmation of the new operation schedule from the terminal device 20-1 in response to the ride reservation response, it records the new operation schedule as a confirmed new operation schedule (existing operation schedule).

[0021] Furthermore, the management server 100 creates a vehicle dispatch request addressed to the in-vehicle device 30 and including the confirmed new operation schedule. The management server 100 transmits the created vehicle dispatch request to the in-vehicle device 30. The in-vehicle device 30 receives the vehicle dispatch request transmitted by the management server 100. If the vehicle VE in which the in-vehicle device 30 is installed is a manually driven vehicle, the in-vehicle device 30 displays the new operation schedule included in the received vehicle dispatch request. If the vehicle VE in which the in-vehicle device 30 is installed is an autonomous vehicle, the in-vehicle device 30 outputs the new operation schedule included in the received vehicle dispatch request to the autonomous driving system of the vehicle VE.

[0022] The terminal device 20-1, the terminal device 20-2, the terminal device 20-3, the vehicle-mounted device 30, and the management server 100 included in the vehicle dispatch management system 1 will be described below in order.

[0023] (Terminal Device) The terminal device 20-1, the terminal device 20-2, and the terminal device 20-3 are realized by, for example, a personal computer, a mobile phone, a tablet, a smartphone, a PHS (Personal Handy-phone System), or a PDA (Personal Digital Assistant).

[0024] The terminal device 20-1 is a mobile device carried by a user. The user uses the terminal device 20-1 to make a reservation for a ride. A ride reservation app is installed on the terminal device 20-1. The ride reservation app causes the terminal device 20-1 to create ride reservation information based on the user's operation.

[0025] Ride reservations include instant reservations and advance reservations. Instant reservations are when you wish to board immediately, and the boarding and disembarking locations are specified. Examples of information specifying the boarding location and the disembarking location are place names and other information indicating locations. When an instant reservation is made, the ride reservation information includes information specifying the boarding and disembarking locations, the number of passengers, whether or not ridesharing is permitted, etc.

[0026] On the other hand, advance reservations are made when boarding and disembarking times are desired, and include specifying boarding and disembarking locations, desired departure and arrival times, etc. When an advance reservation is made, the boarding reservation information includes information specifying boarding and disembarking locations, desired times (desired departure and arrival times), number of passengers, whether or not passengers can share a ride, etc.

[0027] The ride reservation app causes the terminal device 20-1 to create a ride reservation request including ride reservation information and addressed to the management server 100. The ride reservation app causes the terminal device 20-1 to transmit the created ride reservation request to the management server 100. The ride reservation app causes the terminal device 20-1 to receive the ride reservation response transmitted by the management server 100, and to process the ride reservation information included in the received ride reservation response.

[0028] The terminal device 20-2 is, for example, a device used by a person sitting in the driver's seat of a vehicle. For example, the terminal device 20-2 may be fixed to the driver's seat like a car navigation system. An example of a person sitting in the driver's seat of a vehicle is the driver. However, if the vehicle is an autonomous vehicle, the conductor may use the terminal device 20-2. An operation app is installed in the terminal device 20-2. The operation app causes the terminal device 20-2 to receive information about vehicle operation, such as information specifying the user's boarding location, information specifying the disembarking location, and route information, transmitted by the management server 100. The operation app causes the terminal device 20-2 to display the boarding location, disembarking location, and route information on a map displayed on the display unit, based on the received information about vehicle operation.

[0029] The operation application causes the terminal device 20-2 to perform processing related to vehicle operation. When a point corresponding to a boarding location or a disembarking location on a map displayed on the display unit of the terminal device 20-2 is pressed, the operation application causes the terminal device 20-2 to create operation information addressed to the management server 100, the operation information including information indicating the time of pressing and information indicating the boarding location or a disembarking location corresponding to the pressed point. The operation application causes the terminal device 20-2 to transmit the created operation information to the management server 100.

[0030] The terminal device 20-3 is a device used by a person riding in a vehicle. For example, the terminal device 20-3 may be fixed to the driver's seat like a car navigation system. The terminal device 20-3 may be used by a user who does not normally carry a smartphone or tablet. An operation status notification management app is installed in the terminal device 20-3. The operation status notification app causes the terminal device 20-3 to receive user boarding information, disembarking information, and route information transmitted from the management server 100. The operation status notification app causes the terminal device 20-3 to display boarding and disembarking locations and route information on a map displayed on the display unit based on the received user boarding information, disembarking information, and route information. However, depending on the environment in which the terminal device 20-3 is used, the content displayed on the terminal device 20-3 may be limited in consideration of privacy.

[0031] (onboard device) The in-vehicle device 30 is mounted on the vehicle VE. An in-vehicle application is installed on the in-vehicle device 30. The in-vehicle application is software that runs within the vehicle VE. The in-vehicle application causes the in-vehicle device 30 to transmit location information of the vehicle VE and CAN (Controller Area Network) data to the management server 100. If the vehicle VE in which the in-vehicle device 30 is mounted is an autonomous vehicle, the in-vehicle device 30 cooperates with the autonomous driving system of the vehicle VE. In this case, the in-vehicle application causes the in-vehicle device 30 to receive route information transmitted by the management server 100 and outputs the received route information to the autonomous driving system.

[0032] (Management Server) The management server 100 includes a communication unit 102 , a reception unit 104 , a vehicle dispatch processing unit 106 , a route search unit 108 , and a storage unit 110 .

[0033] Each function of the management server 100 is realized by the management server 100 including computer hardware such as a CPU (Central Processing Unit) and memory, and the CPU executing a computer program stored in the memory. The management server 100 may be configured using a general-purpose computer device or a dedicated hardware device. For example, the management server 100 may be realized by a device such as a personal computer, a server, or an industrial computer. For example, the management server 100 may be configured using a server computer connected to a communication network such as the Internet. Each function of the management server 100 may be realized by cloud computing. The management server 100 may be realized by a single computer, or may be realized by distributing the functions of the management server 100 across multiple computers. The management server 100 may also be configured to set up a website using, for example, a WWW system.

[0034] The communication unit 102 is realized by a communication module. The communication unit 102 communicates with other devices such as the terminal device 20-1, the terminal device 20-2, the terminal device 20-3, and the in-vehicle device 30 via the network NW. The communication unit 102 receives a ride reservation request transmitted by the terminal device 20-1. The communication unit 102 also transmits a ride reservation response output by the vehicle allocation processing unit 106 to the terminal device 20-1. The communication unit 102 transmits the vehicle allocation request output by the vehicle allocation processing unit 106 to the in-vehicle device 30.

[0035] The storage unit 110 is realized by, for example, RAM, ROM, HDD, flash memory, or a hybrid storage device that combines two or more of these. The storage unit 110 stores a program (vehicle dispatch management app) executed by the management server 100. The storage unit 110 also stores identification information (hereinafter referred to as "base ID") of a base where a vehicle is to be parked and location information of the base in association with each other. The storage unit 110 also stores various data required for the management server 100 to dispatch vehicles. For example, the storage unit 110 stores demand information 110a, vehicle information 110b, and user information 110c as data required for dispatching vehicles.

[0036] The demand information 110a includes one or more pieces of demand-related information that associates the user's identification information (hereinafter referred to as "user ID"), the ride reservation information included in the ride reservation request sent by the user's terminal device 20-1, and the processing status of the ride reservation.

[0037] Vehicle information 110b includes one or more pieces of vehicle-related information that associate vehicle identification information (hereinafter referred to as "vehicle ID"), information indicating the vehicle's operating schedule, information indicating the vehicle's capacity, information indicating whether or not passengers can share the vehicle, information indicating the waiting location base, such as a base ID, rest time information, conductor information, current location information, and status information. In this embodiment, the vehicle information 110b corresponds to vehicle allocation schedule information that indicates the allocation schedule of each vehicle. The vehicle allocation schedule information is information for determining whether a new vehicle can be allocated, and includes information such as the existing operating schedule, the number of people that can be accommodated, and whether or not carpooling is permitted.

[0038] The user information 110c includes one or more pieces of user-related information that associate information indicating the user's name, information indicating the user's gender, information indicating the user's age, and information indicating the user's condition.

[0039] The reception unit 104 receives the ride reservation request received by the communication unit 102 and acquires ride reservation information included in the received ride reservation request. The dispatch processing unit 106 updates the demand information 110a stored in the memory unit 110 based on the ride reservation information acquired by the reception unit 104.

[0040] The vehicle allocation processing unit 106 determines whether or not a vehicle that satisfies the user's desired conditions indicated in the boarding reservation information is available based on the vehicle information 110b. If the vehicle allocation processing unit 106 determines that a vehicle that satisfies the user's desired conditions is unavailable, the vehicle allocation processing unit 106 makes a predetermined change to the desired conditions and then determines again whether or not a vehicle is available.

[0041] The vehicle allocation processing unit 106 performs processing on the premise that vehicles with no demand currently in operation will wait at a designated base. The vehicle allocation processing unit 106 performs operation management on a trip basis. Here, a trip will be described.

[0042] Figure 2 is a diagram for explaining an example of a trip for one vehicle. The boarding location (departure location) included in the boarding reservation information (demand) is O (Origin), and the disembarking location (destination location) is D (Destination). The arrival time of the vehicle at the boarding location (departure location) is t_O, and the arrival time of the vehicle at the destination is t_D. The time of departure from the base is t_BS, and the time of return to the base is t_BG. In this way, the series of operations from when the vehicle departs the base at time t_BS, passes through the waypoints of each demand (boarding location, disembarking location), and returns to the base at time t_BG is called a trip.

[0043] In the example of FIG. 2, trip 1 and trip 2 are shown. As shown in FIG. 2, multiple trips may be formed for one vehicle during its operating hours in one day. Trip 1 is a series of operations in which the vehicle departs from base BS1 at time t_BS1, arrives at boarding location O1 at time t_O1, arrives at disembarking location D1 at time t_D1, and returns to base BG1 at time t_BG1. Trip 2 is a series of operations in which the vehicle departs base BG2 at time t_BS2, which is later than time t_BG1, arrives at boarding location O2 at time t_O2, arrives at boarding location O3 at time t_O3, arrives at disembarking location D2 at time t_D2, arrives at disembarking location D3 at time t_D3, and returns to base BG2 at time t_BG2.

[0044] The vehicle dispatch processing unit 106 outputs the information specifying the boarding location and the information specifying the disembarking location included in the boarding reservation information to the route search unit 108.

[0045] The route search unit 108 acquires the information specifying the boarding location and the information specifying the disembarking location output by the vehicle dispatch processing unit 106. The route search unit 108 acquires information stored in the memory unit 110, which associates the base ID of the base where the vehicle will wait with the location information of the base. Based on the acquired information specifying the boarding location, the information specifying the disembarking location, the base ID where the vehicle will wait, and the location information of the base, the route search unit 108 selects the base ID of the base where the vehicle to be dispatched to the boarding location is waiting and the base ID of the base to which the vehicle will head after the disembarking location. The base where the vehicle to be dispatched to the boarding location is waiting and the base to which the vehicle will head after the disembarking location may be the same or different. Below, we will continue to explain the case where a first base is selected as the base where the vehicle to be dispatched to the boarding location is waiting and a second base is selected as the base to which the vehicle will head after the disembarking location. Here, the first base and the second base are stored in the memory unit 110.

[0046] The route search unit 108 searches for a route from the first base via the boarding and disembarking locations to the second base based on the acquired information specifying the boarding location and the disembarking location, the base ID of the first base where the vehicle will be waiting, and information associating the location information of the first base, and derives the time required to travel from the first base via the boarding and disembarking locations to the second base on that route.

[0047] For example, the route search unit 108 searches for a route that travels from a first base to a second base via a boarding location and a disembarking location in the shortest distance, and derives the time required to travel from the first base to the second base via the boarding location and a disembarking location on the route. For example, the route search unit 108 derives the time required to travel from the first base to the boarding location, the time required to travel from the boarding location to the disembarking location, and the time required to travel from the disembarking location to the second base. The route search unit 108 outputs information indicating the results of the route search and information indicating the results of the derived times to the vehicle dispatch processing unit 106.

[0048] The vehicle allocation processing unit 106 acquires information indicating the results of the route search and information indicating the results of the required time output by the route search unit 108. The vehicle allocation processing unit 106 determines whether or not vehicle allocation is possible based on the information indicating the results of the acquired route search and the information indicating the results of the required time.

[0049] The vehicle allocation determination method according to this embodiment will be described with reference to Fig. 3. Fig. 3 is a flowchart showing an example of the procedure of the vehicle allocation determination method according to this embodiment.

[0050] The vehicle allocation processing unit 106 executes the process of FIG. 3 for each of all vehicles.

[0051] (Step S1) The vehicle allocation processing unit 106 determines whether a trip can be formed using a new demand alone. Specifically, when a trip formed using a new demand alone is assumed, the vehicle allocation processing unit 106 determines whether the trip formed using the new demand alone overlaps with any existing trips in a chronological order. When the vehicle allocation processing unit 106 determines that there is no overlap with any existing trips in a chronological order, it determines that a trip can be formed using the new demand alone. The process by which the vehicle allocation processing unit 106 determines whether there is any overlap with an existing trip in time series will be described below.

[0052] FIG. 4 is a diagram illustrating an example of the operation of the vehicle dispatch management system according to this embodiment. FIG. 4 shows an example of a trip. In the trip shown in FIG. 4, a vehicle must arrive at the boarding location O1 between time t_O1min and time t_O1max and depart from the boarding location O1 at time t_O1max. The vehicle must also arrive at the drop-off location D1 between time t_D1min and time t_D1max. TW is the time between the departure time from the boarding location and a time a predetermined time before the departure time. TW is defined as the waiting time at the boarding location (departure point) of the demand. TR is the time between the guaranteed arrival time at the drop-off location (arrival at this time at the latest even if there is additional delay) and the time a predetermined time before that time. TR is the time to absorb delays due to trips that are expected to be added in the future, and is defined as the leeway time until arrival. Equation (1) and Equation (2) hold true. t_O1max-t_O1min=TW (1) t_D1max-t_D1min=TR (2) From equation (1), the constraint for the condition t_O1 is t_O1min≦t_O1≦t_O1max. From equation (2), the constraint for t_D1 is t_D1min≦t_D1≦t_D1max.

[0053] An example of the procedure of the process in step S1 is shown in Fig. 5. The process in step S1 will be described with reference to Fig. 5.

[0054] (Step S101) The vehicle allocation processing unit 106 determines a departure base (BS) and an arrival base (BG) based on the vehicle information 110b.

[0055] (Step S102) The vehicle allocation processing unit 106 calculates each time (t_BS, t_O1, t_D1, t_BG) when a trip is formed with a single new demand. The calculation method for each time differs between the case of immediate reservation and the case of advance reservation.

[0056] (In case of immediate reservation) In the case of immediate reservations, the earliest possible time that the vehicle can depart from the base is set as t_BS, and the remaining t_O1, t_D1, and t_BG form a trip by sequentially adding to t_BS the travel time between each point output by the route search unit 108. At this time, the vehicle allocation processing unit 106 sets t_O1max to t_O1 at this time point and t_D1min to t_D1 at this time point. In the case of immediate reservations, when a trip is created, the base departure time t_BS is set to a time later than the estimated reservation confirmation time (current time + dispatch confirmation grace period). The base departure time constraint for immediate reservations is a condition necessary for the vehicle to depart the base at the scheduled time.

[0057] (If you make a reservation in advance) In the case of advance reservations, whether a trip can be formed with a single new demand will be explained separately for the cases where a desired departure time is specified and where a desired arrival time is specified. When a desired departure time is specified, the dispatch processing unit 106 sets the desired departure time as t_O1 and the departure time from the base for arriving at the boarding point O1 at time t_O1 as t_BS. As with the case of immediate reservations, the remaining times t_D1 and t_BG are formed by sequentially adding the travel time between each point output by the route search unit 108 to time t_BS to form a trip. When a desired arrival time is specified, the dispatch processing unit 106 sets the desired arrival time to t_D1max and sets the time t_D1min determined by the arrival time t_D1max to t_D1. As in the case of immediate reservations, the remaining times t_BS, t_O1, and t_BG are calculated by sequentially subtracting the travel times between each point output by the route search unit 108 from the time t_D1 to form a trip.

[0058] From the above, it can be seen that in both cases where immediate reservation and advance reservation are specified, the trip formation for a single new demand can be expressed by the time series relationship in Figure 4.

[0059] (Step S103) The vehicle allocation processing unit 106 determines whether the created new demand-only trip satisfies all of the constraint conditions list.

[0060] The list of constraints is shown below.

[0061] (Constraint a) Does not overlap with the time period of an existing trip The vehicle allocation processing unit 106 determines that the time period from t_BS to t_BG of the new demand single trip does not overlap with the time period of an existing trip.

[0062] (constraint b) Does not overlap with a time period outside of vehicle operation hours or a rest period. The vehicle allocation processing unit 106 determines that the time period from t_BS to t_BG of the new demand single trip does not overlap with a time period outside of vehicle operation hours or a rest period.

[0063] (constraint c) The vehicle's passenger capacity is not exceeded. The vehicle allocation processing unit 106 determines that the trip does not involve passengers exceeding the passenger capacity set for each vehicle.

[0064] (Constraint condition d) If the trip is a demand that includes a request to refuse ride-sharing, the ride-sharing refusal setting is made. If the trip is a demand that includes a request to refuse ride-sharing, the dispatch processing unit 106 realizes the ride-sharing refusal by setting the number of passengers to the passenger capacity even if the number of passengers of the demand is less than the passenger capacity.

[0065] (Constraint e) The time that the vehicle waits at the base (base waiting time) is secured for a predetermined period of time. The vehicle dispatch processing unit 106 determines that the base waiting time is secured for a predetermined period of time. Note that this constraint condition e is optional and not essential.

[0066] (Step S104) If all of the constraint conditions are satisfied, the vehicle allocation processing unit 106 determines that a vehicle can be allocated for a new demand-only trip.

[0067] (Step S105) If even one of the constraint conditions in the constraint condition list is not satisfied, the vehicle allocation processing unit 106 determines that it is impossible to allocate a vehicle for the new demand-only trip.

[0068] Returning to the explanation in Figure 3. As a result of step S1, if a vehicle can be dispatched for a new demand-only trip (step S1, YES), the process proceeds to step S5. On the other hand, if a vehicle cannot be dispatched for a new demand-only trip (step S1, NO), the process proceeds to step S2.

[0069] (Step S2) The vehicle allocation processing unit 106 determines whether there is an existing trip that chronologically overlaps with the new demand-only trip provisionally generated in step S1. If the result of this determination is that a corresponding existing trip exists (step S2, YES), the process proceeds to step S3. On the other hand, if there is no corresponding existing trip (step S2, NO), the process proceeds to step S6.

[0070] (Step S3) The vehicle allocation processing unit 106 determines whether the demand of the new demand single-unit trip provisionally generated in step S1 can be inserted into an existing trip that chronologically overlaps with the new demand single-unit trip.

[0071] An example of the procedure of the process in step S3 is shown in Fig. 6. The process in step S3 will be described with reference to Fig. 6.

[0072] (Step S201) The vehicle allocation processing unit 106 determines the insertion location of a new demand into an existing trip without changing the order of the existing demands based on the idea of ​​the sequential optimum insertion method. As an example, the explanation will be continued for a case where there are "N-1" existing demands in the existing trip and an Nth new demand is to be inserted.

[0073] (Step S202) The dispatch processing unit 106 calculates the times when the boarding location (departure point) O_N and the disembarking location (destination point) D_N of the Nth demand are inserted as new intermediate points, based on the departure time t_BS of the departure base BS of the existing trip.

[0074] Here, calculation of each time when the boarding location (departure point) O_N and the disembarking location (destination point) D_N of the Nth demand are inserted as new waypoints will be explained in three cases: immediate reservation, when the desired departure time is specified in advance reservation, and when the desired arrival time is specified in advance reservation. However, the departure time of each waypoint is determined as follows: Departure point:t_BS Departure point:t_O <t_Omaxのときは、t_Omax If t_Omax<=t_O, then t_O Destination:t_D

[0075] (In case of immediate reservation) The case of an immediate reservation will be described with reference to Figure 7. The dispatch processing unit 106 calculates t_ON by adding the travel time to the departure time of the waypoint immediately before the boarding location O_N, and calculates t_DN by adding the travel time to the departure time of the waypoint immediately before the disembarking location D_N. The dispatch processing unit 106 sets t_ONmax to the t_ON at this time point, and t_DNmin to the t_DN at this time point.

[0076] (If a desired departure time is specified in advance reservation) A case where a desired departure time is specified in an advance reservation will be described with reference to Figure 8. The dispatch processing unit 106 sets the desired departure time to t_ONmax. The dispatch processing unit 106 calculates t_ON by adding the travel time to the departure time from the waypoint immediately before boarding location O_N, and calculates t_DN by adding the travel time to the departure time from the waypoint immediately before disembarking location D_N.

[0077] (If a desired arrival time is specified in advance reservation) A case where a desired arrival time is specified in an advance reservation will be described with reference to Figure 9. The dispatch processing unit 106 sets the desired arrival time to t_DNmax. The dispatch processing unit 106 calculates t_ON by adding the travel time to the departure time from the waypoint immediately before boarding location O_N, and calculates t_DN by adding the travel time to the departure time from the waypoint immediately before disembarking location D_N.

[0078] (Step S203) The dispatch processing unit 106 checks whether a new demand is inserted between the departure base BS and the first waypoint (insertion of boarding location O_N and disembarking location D_N). If the result of this check shows that a new demand is inserted between the departure base BS and the first waypoint, the process proceeds to step S207; otherwise, the process proceeds to step S204.

[0079] (Step S204) The dispatch processor 106 determines whether inserting a new demand into an existing trip satisfies all of the constraint conditions. If the constraint conditions are all satisfied as a result of this determination, the process proceeds to step S205; otherwise, the process proceeds to step S206.

[0080] (Step S205) If all of the constraint conditions are satisfied, the vehicle allocation processing unit 106 outputs a trip resulting from inserting a new demand into an existing trip.

[0081] (Step S206) If there is another place to insert the new demand, the process returns to step S201, otherwise the process of FIG. 6 ends.

[0082] (Step S207) When a new demand is inserted between the departure base BS and the first waypoint, the vehicle allocation processing unit 106 advances the base departure time t_BS by a predetermined time width Tshift and recalculates each time.

[0083] (Step S208) The vehicle allocation processing unit 106 determines whether all of the constraint conditions are satisfied. If the result of this determination is that all of the constraint conditions are satisfied, the process proceeds to step S205, and if not, the process proceeds to step S209.

[0084] (Step S209) The vehicle allocation processing unit 106 determines whether the number of times steps S207-S208 have been repeated is equal to or less than a predetermined value M_shift. If the result of this determination is that the number is equal to or less than the predetermined value M_shift, the process returns to step S207. On the other hand, if the number of times exceeds the predetermined value M_shift, the process proceeds to step S206. As a result, the vehicle allocation processing unit 106 advances the base departure time t_BS by the time width Tshift and executes the operation of calculating each time up to M_shift times until a trip that satisfies all of the list of constraints is found.

[0085] Returning to the explanation in Figure 3. As a result of step S3, if it is possible to insert the new demand into an existing trip that chronologically overlaps with the new demand-only trip provisionally generated in step S1 (YES in step S3), proceed to step S4; otherwise (NO in step S3), proceed to step S8.

[0086] (Step S4) The vehicle allocation processing unit 106 selects the trip (vehicle allocation) with the smallest delay cost from the trips (vehicle allocations) output in step S3 (step S205). An example of a method for calculating the delay cost is shown below.

[0087] (In case of immediate reservation) Delay cost = "Arrival time of new demand" - "Current time" + "Sum of additional delays of existing demands"

[0088] (If you make a reservation in advance) Delay cost = "Arrival time of new demand" - "Departure time of new demand" + "Sum of additional delays of existing demands"

[0089] However, the additional delay of an existing demand refers to a delay of the existing demand that is newly caused by inserting a new demand into an existing trip.

[0090] (Step S5) The dispatch processing unit 106 outputs the trip determined in step S4 as a normal trip. After this, the processing in FIG. 3 ends. A normal trip is a trip that satisfies all of the constraint conditions without changing the user's desired times (desired departure time and desired arrival time). Therefore, a normal trip satisfies the user's desired times (desired departure time and desired arrival time) and all of the constraint conditions.

[0091] (Step S6) If there is no existing trip that chronologically overlaps with the new demand-only trip provisionally generated in step S1 (step S2, NO), the vehicle allocation processing unit 106 shifts at least one of the user's desired departure time and desired arrival time by a predetermined time interval and then determines whether it is possible to allocate a vehicle for the new demand-only trip again. As an example, a case where the desired departure time is shifted will be described here. The vehicle allocation processing unit 106 shifts the desired departure time forward or backward in time by a predetermined time interval Tnear i times (by "Tnear" × i), and then executes step S1 again. i is a preset positive integer, i = 1, 2, . . . , N). The vehicle allocation processing unit 106 shifts the desired departure time forward or backward in time by "Tnear" × i while sequentially setting i from the minimum value "1" to the maximum value "N," and then repeats the execution of step S1. For example, if "Tnear=10 minutes" and "N=2", then "the desired departure time is shifted forward by 10 minutes and then the above step S1 is executed", then "the desired departure time is shifted backward by 10 minutes and then the above step S1 is executed", then "the desired departure time is shifted forward by 20 minutes and then the above step S1 is executed", and finally "the desired departure time is shifted backward by 20 minutes and then the above step S1 is executed". In the repeated execution of step S1, if it is determined that a vehicle can be dispatched for a new demand-only trip in both the case where the desired departure time is shifted forward and the case where the desired departure time is shifted backward, step S6 is terminated. Note that in the case of immediate reservations, due to constraints on the base departure time, the desired departure time is only shifted backward, and is not shifted forward.

[0092] As a result of step S6, if a vehicle can be dispatched for a new demand-only trip (step S6, YES), the process proceeds to step S7. On the other hand, if a vehicle cannot be dispatched for a new demand-only trip (step S6, NO), the process proceeds to step S10.

[0093] (Step S7) The dispatch processing unit 106 outputs the new demand-only trip determined to be dispatchable in step S6 as a nearby trip. After this, the processing in FIG. 3 ends. A nearby trip is a trip that can be dispatched by changing any of the user's desired conditions. Therefore, a nearby trip does not satisfy all of the user's desired conditions.

[0094] (Step S8) When it is impossible to insert the new demand into an existing trip that chronologically overlaps with the new demand-only trip provisionally generated in step S1 (step S3, NO), the dispatch processing unit 106 determines whether there is a trip among the existing trips into which the new demand was attempted to be inserted in step S3 that satisfies the user's desired conditions, which are the constraint conditions of the new demand, other than "boarding location (departure point), disembarking location (destination), desired time (desired departure time, desired arrival time), number of passengers, and refusal of ride-sharing." If this determination shows that there is a corresponding trip (step S8, YES), the process proceeds to step S9. On the other hand, if there is no corresponding trip (step S8, NO), the process proceeds to step S10.

[0095] (Step S9) The vehicle allocation processing unit 106 outputs the existing trip found in step S8 as a nearby trip, and then ends the processing of FIG.

[0096] The nearby trips output in step S9 will be described. The nearby trips output in step S9 are existing trips that do not satisfy all of the user's desired conditions, "desired time (desired departure time, desired arrival time), boarding location (departure point), disembarking location (destination), number of passengers, and refusal of ride-sharing," but for which new demand insertion is possible if the unsatisfied desired conditions are changed. Therefore, the nearby trips output in step S9 are trips for which it is possible to suggest to the user that a ride can be dispatched by changing the unsatisfied desired conditions. The process of attempting to change the user's desired conditions will be described below.

[0097] (If the desired time is not available) As in step S6, the dispatch processor 106 shifts at least one of the user's desired departure time and desired arrival time by a predetermined time interval and then determines again whether a new demand can be inserted into the existing trip. If the result of this determination indicates that a new demand can be inserted into the existing trip, the trip after the desired time change is output as a nearby trip.

[0098] (If the boarding location (departure point) or disembarking location (destination) is not met) When the boarding location (starting point) of the user's desired conditions is within a predetermined distance from the starting point of the existing trip (existing dispatch), or when the drop-off location (destination) of the user's desired conditions is within a predetermined distance from the destination of the existing trip, the dispatch processing unit 106 determines whether it is possible to insert a new demand into the existing trip again after changing at least one of the starting point and destination of the desired conditions to the same as that of the existing trip.If it is possible to insert a new demand into the existing trip as a result of this determination, the trip after changing the starting point or destination is output as a nearby trip.

[0099] (If the number of passengers is not met) When the number of passengers in the existing trip (existing dispatch) plus the number of passengers in the user's desired conditions exceeds the passenger capacity, the dispatch processing unit 106 reduces the number of passengers in the desired conditions and then determines whether it is possible to insert a new demand into the existing trip again.If it is possible to insert a new demand into the existing trip as a result of this determination, the trip after reducing the number of passengers is output as a nearby trip.

[0100] (If carpooling refusal is not met) The dispatch processing unit 106 determines whether it is possible to insert a new demand into the existing trip after changing the user's desired conditions from ride-sharing refusal to ride-sharing permission. If it is possible to insert a new demand into the existing trip as a result of this determination, the trip after changing from ride-sharing refusal to ride-sharing permission is output as a nearby trip.

[0101] (Step S10) If a vehicle cannot be allocated even if the user's desired conditions are changed (NO in step S6 or NO in step S8), the vehicle allocation processing unit 106 outputs information that a vehicle cannot be allocated.

[0102] This concludes the explanation of the vehicle dispatch determination method shown in FIG.

[0103] The above-mentioned vehicle allocation determination method of FIG. 3 is executed for each of all vehicles. The vehicle allocation processing unit 106 selects a trip to be finally output from all normal trips and all nearby trips output by the vehicle allocation determination method of FIG. 3 for each vehicle. This selection method will be explained. First, if at least one normal trip is output for all vehicles, the normal trip with the smallest delay cost among the normal trips is output as the final trip (dispatch). On the other hand, if no normal trip is output, from all nearby trips for all vehicles, the nearby trip closest to the desired time among nearby trips temporally before the user's desired time and the nearby trip closest to the desired time among nearby trips temporally after the user's desired time are output as the final nearby trips (nearby allocation).

[0104] An example of the final trip (dispatch) output is shown in Figure 10. The "dispatch process" in Figure 10 is the process shown in Figure 3.

[0105] In the example of Figure 10(1), normal trip A is output by the dispatch process of vehicle 1, and nearby trips B, C, and D are output by the dispatch process of vehicle 2. In this case, since normal trip A exists, normal trip A is output as the final trip (dispatch).

[0106] In the example of Figure 10(2), nearby trips A and B are output by the dispatch process of vehicle 1, and nearby trips C, D, and E are output by the dispatch process of vehicle 2. In this case, there are no regular trips. Therefore, nearby trip C (scheduled departure time: 13:50), which is earlier than the user's desired departure time of 14:00 and closest to the desired departure time of 14:00, and nearby trip B (scheduled departure time: 14:05), which is later than the user's desired departure time of 14:00 and closest to the desired departure time of 14:00, are output as the final trips (dispatch).

[0107] The vehicle allocation processing unit 106 creates a ride reservation response addressed to the terminal device 20-1, which includes information on the finally output trip (vehicle allocation) and information indicating that a vehicle can be allocated for that trip (vehicle allocation). The vehicle allocation processing unit 106 outputs the created ride reservation response to the communication unit 102. This notifies the user that a vehicle can be allocated for that trip (vehicle allocation). When the user is notified of a regular trip, the user recognizes that a vehicle that meets all of the user's desired conditions is available. On the other hand, when the user is notified of a nearby trip, the user recognizes that a vehicle can be allocated if the user agrees to changes to the desired conditions indicated in the notified vehicle allocation information.

[0108] On the other hand, if it is output that dispatching is not possible for all vehicles, the dispatch processing unit 106 creates a ride reservation response addressed to the terminal device 20-1, including information indicating that dispatching is not possible. The dispatch processing unit 106 outputs the created ride reservation response to the communication unit 102. This notifies the user that dispatching is not possible.

[0109] According to the above-described embodiment, even if a vehicle that satisfies all of the user's desired conditions is unavailable, a vehicle that can be dispatched can be proposed if any of the desired conditions is changed. This eliminates the need for the user to reset the desired conditions (e.g., desired departure time) and search for a vehicle again, thereby improving the convenience of the user when making a reservation. Furthermore, for the vehicle dispatch service provider, this has the effect of preventing the loss of an opportunity to provide a vehicle to the user.

[0110] This will enable, for example, improvements to the overall service quality of on-demand transportation services, thereby contributing to Goal 9 of the United Nations-led Sustainable Development Goals (SDGs), which is to "Build resilient infrastructure, promote sustainable industrialization and foster innovation."

[0111] Although an embodiment of the present invention has been described in detail above with reference to the drawings, the specific configuration is not limited to this embodiment, and design changes and the like are also included within the scope that does not deviate from the gist of the present invention.

[0112] In addition, a computer program for realizing the functions of each of the above-described devices may be recorded on a computer-readable recording medium, and the program recorded on the recording medium may be read and executed by a computer system. Note that the "computer system" here may also include hardware such as an OS and peripheral devices. In addition, "computer-readable recording medium" refers to writable non-volatile memory such as a flexible disk, optical magnetic disk, ROM, or flash memory, portable media such as a DVD (Digital Versatile Disc), or a storage device such as a hard disk built into a computer system.

[0113] Furthermore, the term "computer-readable recording medium" also includes those that retain a program for a certain period of time, such as volatile memory (e.g., DRAM (Dynamic Random Access Memory)) within a computer system that serves as a server or client when a program is transmitted via a network such as the Internet or a communication line such as a telephone line. The program may be transmitted from a computer system storing the program in a storage device or the like to another computer system via a transmission medium or by transmission waves in the transmission medium. Here, the "transmission medium" that transmits the program refers to a medium that has the function of transmitting information, such as a network (communication network) such as the Internet or a communication line (communication line) such as a telephone line. The program may also be a program for implementing some of the functions described above, or may be a so-called differential file (differential program) that can implement the functions described above in combination with a program already stored in the computer system. [Explanation of symbols]

[0114] 1...vehicle dispatch management system, 20-1, 20-2, 20-3...terminal devices, 30...vehicle-mounted device, 100...management server, 102...communication unit, 104...reception unit, 106...vehicle dispatch processing unit, 108...route search unit, 110...storage unit, 110a...demand information, 110b...vehicle information (vehicle dispatch schedule information), 110c...user information, VE...vehicle, NW...network

Claims

1. In a demand-based vehicle dispatch management system that operates vehicles according to reservations, A storage unit that stores vehicle dispatch schedule information indicating a vehicle dispatch schedule; A reception unit that receives a ride reservation request from a user; a vehicle dispatch processing unit that determines whether or not a vehicle that satisfies the desired conditions indicated in the boarding reservation request accepted by the accepting unit is available based on the vehicle dispatch schedule information in the storage unit, and if a vehicle that satisfies the desired conditions is unavailable, makes a predetermined condition change to the desired conditions and then determines again whether or not a vehicle can be dispatched, and responds to the user with information on a vehicle that has been determined to be available; Equipped with When a vehicle dispatch satisfying the desired conditions is not possible, the vehicle dispatch processing unit changes the desired conditions from a ride-sharing refusal to a ride-sharing permission, and then judges again whether a vehicle dispatch is possible. Vehicle dispatch management system.

2. In a demand-based vehicle dispatch management system that operates vehicles according to reservations, A storage unit that stores vehicle dispatch schedule information indicating a vehicle dispatch schedule; A reception unit that receives a ride reservation request from a user; a vehicle dispatch processing unit that determines whether or not a vehicle that satisfies the desired conditions indicated in the boarding reservation request accepted by the accepting unit is available based on the vehicle dispatch schedule information in the storage unit, and if a vehicle that satisfies the desired conditions is unavailable, makes a predetermined condition change to the desired conditions and then determines again whether or not a vehicle can be dispatched, and responds to the user with information on a vehicle that has been determined to be available; Equipped with When a vehicle dispatch that satisfies the desired conditions is not possible, and the departure point of the desired conditions is within a predetermined distance from the departure point of an existing vehicle dispatch, or the destination of the desired conditions is within a predetermined distance from the destination of an existing vehicle dispatch, the vehicle dispatch processing unit changes at least one of the departure point and the destination of the desired conditions to the same as the existing vehicle dispatch and then judges again whether or not a vehicle dispatch is possible. Vehicle dispatch management system.

3. In a demand-based vehicle dispatch management system that operates vehicles according to reservations, A storage unit that stores vehicle dispatch schedule information indicating a vehicle dispatch schedule; A reception unit that receives a ride reservation request from a user; a vehicle dispatch processing unit that determines whether or not a vehicle that satisfies the desired conditions indicated in the boarding reservation request accepted by the accepting unit is available based on the vehicle dispatch schedule information in the storage unit, and if a vehicle that satisfies the desired conditions is unavailable, makes a predetermined condition change to the desired conditions and then determines again whether or not a vehicle can be dispatched, and responds to the user with information on a vehicle that has been determined to be available; Equipped with When it is impossible to dispatch a vehicle that satisfies the desired conditions, if adding the number of passengers of the desired conditions to the number of passengers of an existing vehicle dispatch results in an excess of passenger capacity, the vehicle dispatch processing unit reduces the number of passengers of the desired conditions and then judges again whether or not a vehicle dispatch is possible. Vehicle dispatch management system.

4. A vehicle dispatch reservation management method executed by a demand-type vehicle dispatch management system that operates vehicles according to reservations, comprising: A storage step of storing vehicle dispatch schedule information indicating a vehicle dispatch schedule in a storage unit; A reception step for receiving a ride reservation request from a user; a vehicle dispatch processing step of determining whether or not a vehicle that satisfies the desired conditions indicated in the boarding reservation request accepted in the accepting step is available based on the vehicle dispatch schedule information in the storage unit, and if a vehicle that satisfies the desired conditions is unavailable, making a predetermined change to the desired conditions and then determining again whether or not a vehicle is available, and responding to the user with information on a vehicle that is determined to be available; Including, When it is impossible to allocate a vehicle that satisfies the desired conditions, the vehicle allocation processing step changes the desired conditions from a ride-sharing refusal to a ride-sharing permission, and then judges again whether or not a vehicle can be allocated. How to manage vehicle reservations.

5. A vehicle dispatch reservation management method executed by a demand-type vehicle dispatch management system that operates vehicles according to reservations, comprising: A storage step of storing vehicle dispatch schedule information indicating a vehicle dispatch schedule in a storage unit; A reception step for receiving a ride reservation request from a user; a vehicle dispatch processing step of determining whether or not a vehicle that satisfies the desired conditions indicated in the boarding reservation request accepted in the accepting step is available based on the vehicle dispatch schedule information in the storage unit, and if a vehicle that satisfies the desired conditions is unavailable, making a predetermined change to the desired conditions and then determining again whether or not a vehicle is available, and responding to the user with information on a vehicle that is determined to be available; Including, In the vehicle allocation processing step, when a vehicle that satisfies the desired conditions cannot be allocated, if the departure point of the desired conditions is within a predetermined distance from the departure point of the existing vehicle, or the destination of the desired conditions is within a predetermined distance from the destination of the existing vehicle, at least one of the departure point and the destination of the desired conditions is changed to the same as the existing vehicle, and then it is determined again whether or not a vehicle can be allocated. How to manage vehicle reservations.

6. A vehicle dispatch reservation management method executed by a demand-type vehicle dispatch management system that operates vehicles according to reservations, comprising: A storage step of storing vehicle dispatch schedule information indicating a vehicle dispatch schedule in a storage unit; A reception step for receiving a ride reservation request from a user; a vehicle dispatch processing step of determining whether or not a vehicle that satisfies the desired conditions indicated in the boarding reservation request accepted in the accepting step is available based on the vehicle dispatch schedule information in the storage unit, and if a vehicle that satisfies the desired conditions is unavailable, making a predetermined change to the desired conditions and then determining again whether or not a vehicle is available, and responding to the user with information on a vehicle that is determined to be available; Including, In the case where a vehicle that satisfies the desired conditions cannot be dispatched, if the number of passengers of an existing vehicle that is dispatched is added to the number of passengers of the desired conditions to exceed the passenger capacity, the vehicle dispatch processing step reduces the number of passengers of the desired conditions and then judges again whether or not a vehicle can be dispatched. How to manage vehicle reservations.

7. A computer program for causing a computer to execute the vehicle reservation management method according to any one of claims 4 to 6.

Images