JP2005275678A - Vehicle dispatching service support method, and device - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To realize a vehicle dispatching service with consideration to a demand of a user. <P>SOLUTION: A first step is provided for receiving a vehicle dispatching service request including a vehicle dispatch desired position, information of a destination, and information of whether to give priority to time until the vehicle dispatching service is received or priority to a fee by the vehicle dispatching service support device from the user, and searching an optimum meeting spot and a combination of dispatch vehicles in response to whether it is a time priority request or a fee priority request, and a second step is provided for instructing a vehicle dispatching service to a vehicle on the basis of the retrieved information, and sending the information to the user. <P>COPYRIGHT: (C)2006,JPO&NCIPI

Description

  The present invention relates to a waiting time (hereinafter referred to as waiting time) until a user who receives a dispatch service (hereinafter referred to as a user) receives a dispatch in the vicinity of the desired meeting place (or the current position of the user) requested by the user. Alternatively, if there is a place where the usage fee for the dispatch service can be reduced, the information is sent to the user, and if guidance is possible, the guidance is conducted to improve the convenience of the user. The present invention relates to a service support method and apparatus.

2. Description of the Related Art Conventionally, for example, a system described in Patent Document 1 below is known as a system that provides a dispatch service such as a taxi with the current position of a user or a position designated by the user as a fixed meeting place.
JP 2002-222493 A

However, in the conventional system described above, even if there are conditions that allow the user to move a short distance to reduce waiting time or reduce the usage fee, the user specifies it without searching for such conditions. A dispatch service is provided with the designated meeting place as a “fixed meeting place”. For this reason, it is not possible to provide a vehicle dispatch service that considers the user's request, for example, “It is better to have a low fee because it is acceptable to walk a certain distance” and “I want to hurry even if the fee is high” There's a problem.
For example, as shown in FIG. 10, when a user U at the entrance of the park PK wants to receive a taxi TX dispatch service, the user U passes through a sidewalk SW provided between the roads R1 and R2. If the taxi TX is guided to the point P1, the travel distance is significantly shorter than the taxi TX traveling to the current location of the user U through the route RT1, and the usage fee can be reduced. However, the conventional system uses the method of dispatching the vehicle to the current location specified by the user without presenting the user with any options such as lowering the fee if going to the point P1, so even a little fee It is not possible to implement a service that dispatches vehicles considering the needs of users such as better prices.

  An object of the present invention is to provide a vehicle allocation service support method and apparatus capable of realizing a vehicle allocation service in consideration of a user's request such that a lower usage fee is better and a shorter waiting time is better. .

In order to achieve the above object, the vehicle dispatch service support method according to the present invention provides information on whether to give priority to a vehicle dispatch position, destination information, time to receive a vehicle dispatch service, or to charge a fee. The vehicle allocation service request including the vehicle allocation service request is received by the vehicle allocation service support device, and the shortest route from the vehicle allocation start position to the vehicle allocation desired location is searched from the map database according to the time priority request or the charge priority request, and the searched route And a second step of instructing the vehicle of the vehicle allocation service.
Further, in the first step, the map database is searched for whether there is a candidate meeting place that can be a new meeting when the user moves from the desired dispatch position within the allowable time or allowable distance of the user. The waiting candidate sites that become the shortest route according to the charge priority request and the time priority request from the current positions of a plurality of vehicles waiting to be dispatched among the candidate locations including the requested waiting location and the desired dispatch location And the optimum vehicle is selected, the selected meeting candidate site is notified to the user as the optimum meeting place, and the user is instructed to move to the optimum meeting place, or the move is possible In the second step, the vehicle is instructed to dispatch the optimal vehicle under the condition that the response indicating that Characterized in that it indicates the movement to the best meeting place.

The vehicle allocation service support method according to the present invention provides an information provision request relating to a vehicle allocation service including information on whether to give priority to a vehicle allocation position, destination information, time to receive a vehicle allocation service, or to prioritize a fee. A first step of searching the map database for the shortest route from the dispatch start position to the desired dispatch location according to whether the time priority request or the charge priority request is received, and the usage fee and the dispatch in the searched route And a second step of notifying the user of the arrival time of the vehicle to the desired position.
Further, in the first step, a search is made from the map database as to whether or not there is a candidate meeting place that can be a new meeting place when the user moves from the desired dispatch position within the allowable time or allowable distance of the user. The waiting candidate that becomes the shortest route according to the charge priority request and the time priority request from the current positions of a plurality of vehicles that are waiting for the dispatching instruction among the candidate places including the desired dispatching position and the searched waiting candidate positions The ground and the optimum vehicle are selected, and the usage fee and time until the selected vehicle reaches the optimum meeting position is notified to the user in the second step.

The vehicle allocation service support apparatus according to the present invention receives a vehicle allocation service request including information on whether to prioritize a vehicle allocation position, destination information, time to receive a vehicle allocation service, or information on whether to prioritize a fee. A first means for searching the map database for the shortest route from the start position of dispatching to the desired dispatch position according to whether the priority request or the charge priority request, and a second means for instructing the vehicle on the retrieved route. It is characterized by providing.
Further, the first means searches the map database to determine whether or not there is a candidate meeting place that can be a new meeting place when the user moves from the desired dispatch position within the allowable time or allowable distance of the user. The waiting candidate that becomes the shortest route according to the charge priority request and the time priority request from the current positions of a plurality of vehicles that are waiting for the dispatching instruction among the candidate places including the desired dispatching position and the searched waiting candidate positions Select a location and an optimal vehicle, notify the user of the selected candidate meeting location as an optimal meeting location, and receive a command indicating that the user can move to the optimal meeting location, or move In response to receiving a response indicating that it is possible, the optimal vehicle is instructed to dispatch by the second means, and the optimal vehicle is also indicated to the user. Characterized in that it instructs the movement into the blood alignment location.

The vehicle allocation service support apparatus according to the present invention provides an information provision request relating to a vehicle allocation service including information on whether to prioritize the time to receive the vehicle allocation service or information on whether to prioritize the vehicle allocation service. A first means for searching the map database for the shortest route from the start position to the desired dispatch location according to whether the time priority request or the charge priority request, and the vehicle to the usage fee and the desired dispatch location on the retrieved route And a second means for notifying the user of the arrival time.
Further, the first means searches the map database to determine whether or not there is a candidate meeting place that can be a new meeting place when the user moves from the desired dispatch position within the allowable time or allowable distance of the user. The waiting candidate that becomes the shortest route according to the charge priority request and the time priority request from the current positions of a plurality of vehicles that are waiting for the dispatching instruction among the candidate places including the desired dispatching position and the searched waiting candidate positions A land and an optimal vehicle are selected, and the usage fee and time until the selected vehicle reaches the optimal waiting position is notified to the user by the second means.

  According to the present invention, in order to receive the vehicle allocation service, the user selects the optimum route according to the request of the user who wants to shorten the time until the vehicle allocation service is received or to reduce the fee. As a result, the number of choices of the user increases, and it is possible to contribute to the realization of a dispatch service according to the user's request.

Hereinafter, the present invention will be described in detail with reference to the drawings.
FIG. 1 is a system configuration diagram showing an embodiment of the present invention. A dispatch service support server (support device) 1 having a keyboard 2, a mouse 3, a display device 4, a map information database 14, and a vehicle information database 15 is shown. The vehicle 7 is provided with a portable information terminal 6 such as a mobile phone that makes a vehicle allocation request, and in response to a vehicle allocation service request from the user, an optimal route according to the user's request is selected and the vehicle 7 is allocated. Is configured to do.
Although only one vehicle 7 is shown in FIG. 1, there are specifically a plurality of vehicles.
The dispatch service support server 1 receives a dispatch service request from the user's portable information terminal 6 via the network 5 such as the Internet, and the dispatch service request from the user through the telephone line network. There is a form in which an optimum route is searched by inputting a user's current position, a specified dispatch position, a destination, and the like.
Below, the case where a dispatch service request is received from the portable information terminal 6 via the network 5, the optimum route is selected, and the dispatch instruction is given is described as an example.

The dispatch service server 1 includes a CPU 10, a memory 11, and a wireless device 12.
The memory 11 stores a vehicle allocation service support program 13.
The vehicle allocation service support program 13 includes a service request reception unit 131, a route search unit 132, a traffic jam information acquisition unit 133, a vehicle position acquisition unit 134, a vehicle allocation instruction unit 135, and an information provision unit 136.
The wireless device 12 communicates with a wireless device mounted on the vehicle 7, acquires the current position information of the vehicle 7 detected by a current position detection device such as an in-vehicle GPS at predetermined time intervals, and acquires the vehicle position. The information is passed to the acquisition unit 134, the current position information of the vehicle 7 in the vehicle information database 15 is updated, and the vehicle allocation instruction information (voice or display message) to the user's desired position output by the vehicle allocation instruction unit 135 is transmitted to the vehicle 7. To do.

FIG. 2 shows a data configuration example of the road information stored in the map information database 14 and the point name-position information relation table.
The road information database 2010 stores road information of a section that reaches the next node with the intersection of the road and the road as a node. That is, as shown in the example of FIG. 2, for each node ID (2011), the position information (latitude and longitude information) 2012, section distance 2013, speed limit 2014, road name 2015, traffic conditions 2016, traffic jam information 2017, toll fee 2018, and next node ID (2019) are stored.
The traffic condition 2016 indicates conditions such as a large vehicle impossibility, a vehicle impossibility, and entry prohibition in a designated time zone.
The traffic jam information 2017 is information when a traffic jam occurs, and a traffic jam distance is stored. This traffic jam information 2017 is periodically acquired by the traffic jam information acquisition unit 133 from the traffic control organization and stored.
The toll is a toll for passing through each road, and for toll roads, the toll is stored.
On the other hand, the spot name-position information relation table 2020 is a table for referring to which point on the latitude and longitude the desired dispatch position designated by the user by the spot name corresponds to each spot name as shown in the figure. For each 2021, the latitude and longitude information 2022 is stored.
When the route search unit 132 performs a route search, if the desired vehicle allocation position is specified by a location name, the location information 2022 on the latitude and longitude of the desired allocation location is referenced with reference to this location name-position information relationship table 2020. Is obtained, a node having position information closest to the position indicated by the position information is searched, and a desired dispatch position is specified on the road of the node.
A waiting candidate table 2030 is also provided. This waiting candidate table 2030 is a table in which candidate locations for waiting places are registered such that when a user wants to dispatch a vehicle from the user, the shortest time or fee is further reduced by moving the user from the desired vehicle dispatching position. It is.
As candidate locations for meeting places, as illustrated in Fig. 3 (a), for example, "Area Post Office, Sakuramachi Elementary School, AK Hotel, RR Bus Stop" The intersection name ”is selected, and the point name 2031 and position information 2302 are registered. In addition to these, “Points where roads where users and vehicles can meet each other (including intersections)”, “Points that require a significant detour to return to the same point when entering the road ahead. May be a candidate site.
The vehicle allocation service support program 13 refers to this waiting candidate location table 2030 and the desired vehicle allocation position designated by the user, and the vehicle or vehicle where the fee is further reduced within the range where the user can move from the vehicle allocation desired location. Search for a meeting place where the arrival time of becomes even shorter.

FIG. 3B shows an example of information stored in the vehicle information database 15. Current position information 3012, the number of people that can be boarded 3013, a travelable distance 3014, a boarding state 3015 for each vehicle ID (3011). , Vehicle allocation service fee (basic fee) 3016, distance-based service fee 3017, and the like are stored.
The current position information 3012 is updated by the vehicle position acquisition unit 134 at predetermined time intervals.
The boarding state 3015 indicates a state such as running to an empty vehicle, an actual vehicle, or a desired dispatch service position.

FIG. 4 and FIG. 5 are flowcharts showing an outline of the processing of the dispatch service support server 1.
When the vehicle allocation service support server 1 receives the vehicle allocation service request from the portable information terminal 6 of the user, the vehicle allocation service support server 1 accepts the request and sequentially stores it in the vehicle allocation service request information table 60 as shown in FIG. 6 (step 401).
The dispatch service request received from the user includes information on desired dispatch location name 6012, user name 6013, destination 6015, usage form 6016, request type 6017, priority type 6018, user movable range 6019, and reservation date and time 6020. It is.
The usage form 6016 distinguishes whether to use the dispatch service immediately or to reserve the date and time to use the dispatch service, and information on immediate or reservation is registered.
The request type 6017 distinguishes whether to request a vehicle allocation or to request information related to a vehicle allocation, and information about a vehicle allocation request or information provision is registered.
The priority type 6018 distinguishes whether the time priority service that prioritizes the arrival time to the vehicle dispatch desired position or the charge priority service that prioritizes the charge is requested. Alternatively, information on charge priority is registered.
The user moveable range 6019 indicates the time or distance of the range in which the user can move from the desired dispatch position, or the name of the spot, and is “within 5 minutes from the desired dispatch position”, “500 m from the desired dispatch position. Information such as “within” and “from the desired dispatch position to the AB bus stop” are registered.
The reservation date and time 6020 indicates the reservation date and time for receiving the vehicle dispatch service.
As the position information 6012, registered is information obtained by converting the desired dispatch position 6012 into position information on latitude and longitude by the point name-position information relation table 2020 in FIG.

If the information related to the vehicle allocation service request is registered in the vehicle allocation service request information table 60, it is next determined by the request type 6017 whether the vehicle allocation service request is a vehicle allocation request or information provision (step 402).
If the request type is a vehicle allocation request, the priority type 6018 determines whether it is a time priority request or a charge priority request (step 403).
Then, a charge priority route search process (step 404) or a time priority route search process (step 405) is performed according to the priority type, and a vehicle dispatch instruction is given to the vehicle 7 according to the search result (step 406).
On the other hand, if the request type is information provision, it is determined by the priority type 6018 whether it is a time priority request or a charge priority request (step 407).
Then, according to the priority type, the charge priority route search process (step 408) or the time priority route search process (step 409) is performed, and the information providing unit 136 performs the user's portable information terminal via the network 5 according to the search result. The search result information is transmitted to 6 and information is provided to the user (step 410).
For users who do not have a portable information terminal, the operator notifies the search result information by voice through a telephone line.

FIG. 7 is a flowchart showing details of the time priority route search processing.
First, it is determined whether or not the user is willing to move from the desired dispatch position (step 701). If the intention is displayed, within the permissible time or permissible distance specified by the user. When the user moves from the desired vehicle allocation position, all the candidate candidate locations that can be newly allocated compared to the desired vehicle allocation location are searched from the candidate location table 2030 in the map information DB 14 (step 702). For example, as shown in FIG. 9, all the waiting candidate sites W1 to W5 registered in the candidate site table 2030 are searched within the range in which the user can move from the desired dispatch position.
Next, the desired vehicle allocation position designated by the user is also included in one waiting candidate location, and for each combination of each waiting candidate location searched in step 702 and a plurality of vehicles that can be dispatched waiting for a dispatch instruction, The shortest route to each candidate meeting place is searched from the map information DB 14, and the required time T when the route is traveled at the speed limit is calculated (step 703).
Next, the calculated congestion information of each route is searched from the map information DB 14 (step 704).
Considering the traffic jam information of each route, the required time T is corrected to Td (step 705). The required time Td can be calculated by dividing the route length considering traffic information by the speed limit.
Next, a candidate meeting place and a vehicle having the shortest time among the required times Td are selected and determined as an optimum meeting place and an optimum dispatch vehicle, respectively (step 706).
For example, W5 and the vehicle TX1 are selected from the candidate meeting places W1 to W5 in FIG.
If the difference in required time is very small, the one closer to the desired dispatch position is adopted.
Also, if there are a plurality of the shortest required times, the one where the candidate meeting place is closer to the desired dispatch location or the one where the fee is low (not increasing) is selected by referring to the pay information.
Then, the determined meeting place is notified to the user and the vehicle (step 707).
In addition, if the location where the vehicle is desired to be dispatched is not possible within the user's allowable time or within the allowable distance and there is no place where the vehicle can be allocated, it is outside the user's allowable time or allowable distance. The most possible place where the vehicle can be dispatched is obtained, the user is inquired as to whether or not it is possible to move to that place, and the processing after step 701 may be performed according to the response.

On the other hand, if the user has not indicated the intention to move, the shortest route for a plurality of vehicles waiting for a dispatch instruction to reach the desired dispatch location and the required time T when traveling at the speed limit on that route are calculated. Calculate (step 708).
Next, the traffic information of each route is searched from the map information DB 14 (step 709). Then, considering the traffic information of each route, the required time T is corrected to Td (step 710).
Next, the vehicle having the shortest time among the required times Td is selected and determined as the optimal dispatch vehicle (step 711).
If the difference in required time is very small, the one closer to the desired dispatch position is adopted.

  With the above processing, the user who gives priority to the time until receiving the dispatch service can receive the dispatch service with the shortest waiting time.

FIG. 8 is a flowchart showing details of the charge priority route search process.
First, it is determined whether or not the user is willing to move from the desired dispatch position (step 801). If the intention is displayed, within the allowable time or allowable distance specified by the user. When the user moves from the desired vehicle allocation position, all the candidate candidate locations that can be newly allocated compared to the desired vehicle allocation location are searched from the candidate location table 2030 in the map information DB 14 (step 802). For example, as shown in FIG. 9, all the waiting candidate sites W1 to W5 registered in the candidate site table 2030 are searched within the range in which the user can move from the desired dispatch position.
Next, the desired vehicle allocation position specified by the user is also included in one waiting candidate location, and each vehicle is assigned to each waiting candidate location for all combinations of each waiting candidate location and a plurality of vehicles that can be dispatched while waiting for a dispatch instruction. The shortest route to be reached is searched from the map information DB 14, and an estimated fee F when the route is traveled at the speed limit is calculated (step 803).
Next, the calculated toll 2018 for each route is searched from the map information DB 14 (step 804).
Considering the toll 2018 of each route, the estimated fee F is corrected to Fd (step 805). The estimated fee Fd can be calculated based on the toll fee 2018, the dispatch service fee (basic fee) 3016 of each vehicle, the service fee 3017 in distance units, and the distance of each route.
Next, a candidate meeting place and a vehicle having the lowest charge among the estimated charges Fd are selected and determined as an optimum meeting place and an optimum dispatch vehicle (step 806).
For example, W5 and the vehicle TX1 are selected from the candidate meeting places W1 to W5 in FIG.
If the difference in estimated charges is negligible, the one closer to the desired dispatch position is adopted.
Then, the determined meeting place is notified to the user and the vehicle (step 807).
In addition, if the location where the vehicle is desired to be dispatched is not possible within the user's allowable time or within the allowable distance and there is no place where the vehicle can be allocated, it is outside the user's allowable time or the allowable distance. The most possible place where the vehicle can be dispatched is obtained, the user is inquired as to whether or not it is possible to move to that place, and the processing after step 701 may be performed according to the response.

On the other hand, if the user has not indicated the intention to move, the shortest route for a plurality of vehicles waiting for a dispatch instruction to reach the desired dispatch location and the required time T when traveling at the speed limit on that route are calculated. Calculate (step 808).
Next, the traffic information of each route is searched from the map information DB 14 (step 809). Then, considering the traffic information of each route, the required time T is corrected to Td (step 810).
Next, the vehicle having the shortest time among the required times Td is selected and determined as the optimal dispatch vehicle (step 811).
If the difference in required time is very small, the one closer to the desired dispatch position is adopted.

With the above processing, when receiving a vehicle dispatch service, a user who gives priority to the fee can receive the vehicle dispatch service at the lowest fee.
In the above embodiment, a case where a taxi dispatch service is performed has been described. However, the present invention can be applied in the same manner to a vehicle dispatch service for delivering various kinds of luggage, a dispatch service to a hospital for a sick person, and the like. It is.
When making a reservation for a vehicle allocation service, the difference is whether the vehicle allocation service is executed immediately or on the reservation date, and the reservation vehicle allocation service can be easily realized.
In addition, a meeting place where the minimum fee or the shortest time is selected from the current vehicle position is selected, but depending on how the meeting place is selected, the destination may be far from the destination.
Therefore, the shortest route connecting the three points of the vehicle position, the candidate meeting point, and the destination may be searched for each vehicle, and the vehicle with the lowest charge or the shortest time and the optimum meeting place may be determined. As a result, it is possible to realize an optimal dispatch service that takes into consideration all the routes to the destination.
The processing for this can be easily realized by performing the shortest route search between three points including the destination in the processing of FIGS.

It is a system configuration figure showing an embodiment of a dispatch service support device of the present invention. It is a figure which shows the example of a data structure of a map information database. It is a figure which shows the data structural example of a vehicle information database. It is a flowchart which shows the outline | summary of a process of a dispatch service support apparatus. 5 is a flowchart showing a continuation of FIG. It is a figure which shows the data structural example of dispatch service request information. It is a flowchart which shows the detail of a time priority path | route search process. It is a flowchart which shows the detail of a charge priority route search process. It is a figure which shows the example of a user's movable range and a meeting candidate site. It is a figure explaining the problem of the conventional dispatch service.

Explanation of symbols

DESCRIPTION OF SYMBOLS 1 Vehicle allocation service support server 5 Network 6 Portable information terminal 7 Vehicle 12 Radio 13 Vehicle allocation service support program 14 Map information database 15 Vehicle information provision unit 132 Route search unit 133 Traffic jam information acquisition unit 134 Vehicle position acquisition unit 135 Vehicle allocation instruction unit 136 Information Provision department

Claims (8)

The dispatch service support device accepts a dispatch service request including information on whether to prioritize the time to receive the dispatch service from the user, the location information, the destination information, and the dispatch service. A first step of searching a map database for a shortest route from a vehicle allocation start position to a vehicle allocation desired location according to a request, and a second step of instructing a vehicle on a vehicle allocation service on the searched route, Vehicle dispatch service support method.   In the first step, the map database is searched for whether there is a candidate meeting place that can be a new meeting when the user moves from the desired dispatch position within the allowable time or distance of the user. From the current positions of a plurality of vehicles that are waiting for a dispatch instruction among the candidate places including the desired dispatch location and the waiting candidate locations, the waiting candidate location that is the shortest route according to the charge priority request, the time priority request, and the optimum The vehicle is selected, the selected candidate meeting place is notified to the user as the optimum meeting place, and the user is instructed to move to the optimum meeting place, or is movable In the second step, the optimal vehicle is instructed to dispatch the vehicle under the condition that the response is received. Dispatch service support method according to claim 1, characterized in that an instruction to move to Chi alignment location. The dispatch service support device accepts an information provision request related to a dispatch service including information on whether to prioritize the time to receive the dispatch service from the user, the location information, the destination information, and the dispatch service. The first step of searching from the map database for the shortest route from the starting position of dispatching to the desired location of dispatching according to whether the request is a priority request or a charge priority request, and the use fee on the retrieved route and the arrival time of the vehicle to the desired location of dispatching are used. A vehicle allocation service support method comprising: a second step of notifying a person in charge.   In the first step, a search is made from the map database as to whether or not there is a candidate meeting place that can be a new meeting place when the user moves from a desired dispatch position within an allowable time or an allowable distance of the user, A waiting candidate location that becomes the shortest route according to a charge priority request, a time priority request, from the current positions of a plurality of vehicles that are waiting for a dispatch instruction among the candidate locations including the searched waiting candidate locations and the desired dispatch location, and 4. The vehicle allocation service support according to claim 3, wherein an optimal vehicle is selected, and a usage fee and time until the selected vehicle reaches the optimal waiting position is notified to the user in the second step. Method. Accepting a vehicle allocation service request including information on whether to prioritize the time to receive the vehicle allocation service, information on the desired location, destination, and vehicle delivery service from the user, depending on whether the time priority request or the fee priority request A vehicle allocation service support apparatus comprising: a first means for searching a map database for a shortest route from a vehicle allocation start position to a vehicle allocation desired position; and a second unit for instructing a vehicle to perform a vehicle allocation service using the searched route. .   The first means searches the map database for whether or not there is a candidate meeting place that can be a new meeting place when the user moves from a desired dispatch position within an allowable time or an allowable distance of the user, A waiting candidate location that becomes the shortest route according to a charge priority request, a time priority request, from the current positions of a plurality of vehicles that are waiting for a dispatch instruction among the candidate locations including the searched waiting candidate locations and the desired dispatch location, and Select the optimal vehicle, notify the user of the selected candidate meeting location as the optimal meeting location, and receive the instruction from the user that it is possible to move to the optimal meeting location, or move In response to a certain response, the optimal vehicle is instructed to dispatch by the second means, and the optimal waiting is also given to the user. Dispatch service support method according to claim 5, characterized in that an instruction to move to thereby place. Accepts a request to provide information related to a dispatch service including information on whether to prioritize the time to receive the dispatch service, the location information, the destination information, and the dispatch service from the user. The first means for searching from the map database for the shortest route from the start position to the desired dispatch location according to the map, and the user is notified of the usage fee on the retrieved route and the arrival time of the vehicle to the desired dispatch location. 2. A vehicle dispatch service support apparatus comprising: two means.   The first means searches the map database for whether or not there is a candidate meeting place that can be a new meeting place when the user moves from a desired dispatch position within an allowable time or an allowable distance of the user, A waiting candidate location that becomes the shortest route according to a charge priority request, a time priority request, from the current positions of a plurality of vehicles that are waiting for a dispatch instruction among the candidate locations including the searched waiting candidate locations and the desired dispatch location, and 8. The vehicle allocation service support according to claim 7, wherein an optimal vehicle is selected, and a usage fee and time until the selected vehicle reaches the optimal waiting position is notified to the user by the second means. apparatus.

Images