Vehicle allocation management system, vehicle allocation management device, vehicle allocation management method, and program

Abstract

Make effective use of vehicles such as taxis. [Solution] A vehicle dispatch management device capable of communicating with user terminals via a network includes one or more processors, and the processors acquire first vehicle dispatch requests 22a-22c in which the transportation object is a person and second vehicle dispatch requests 22d-22f in which the transportation object is an object from multiple user terminals, and allocate vehicles (e.g., pair candidate vehicles 232b, 232h, 232i) to the first vehicle dispatch requests 22a-22c with priority over the second vehicle dispatch requests 22d-22f.

Description

[Technical Field]

[0001] The present invention relates to a vehicle allocation management system, a vehicle allocation management device, a vehicle allocation management method, and a program for managing vehicle allocation. [Background technology]

[0002] There are known technologies for dispatching a taxi in response to a user's request for dispatching a taxi. For example, Patent Document 1 discloses a technology for estimating the arrival times of the user and the taxi at the user's desired boarding location, matching the estimated results, and dispatching a taxi so as to minimize the difference between the estimated results. [Prior art documents] [Patent documents]

[0003] [Patent Document 1] Japanese Patent Publication No. 2023-027694 Summary of the Invention [Problem to be solved by the invention]

[0004] In recent years, labor regulations in the logistics and transportation industries have been tightened due to amendments to the Work Style Reform Act. This has led to concerns about a decrease in logistics and transportation volume and a shortage of truck drivers. Therefore, other industries, such as the taxi industry, are being considered to see if they can make up for the shortage of logistics and transportation services.

[0005] In view of the above problems, the present invention aims to provide a vehicle dispatch management system, a vehicle dispatch management device, a vehicle dispatch management method, and a program that enable effective use of vehicles such as taxis. [Means for solving the problem]

[0006] In order to solve the above problem, in the vehicle dispatch management system of the present invention, which includes a user terminal and a vehicle dispatch management device capable of communicating with the user terminal via a network, the user terminal includes one or more first processors, and the vehicle dispatch management device includes one or more second processors, and the first processor sends either a first vehicle dispatch request in which the object to be transported is a person or a second vehicle dispatch request in which the object to be transported is an object to the vehicle dispatch management device in accordance with user input, and the second processor acquires the first vehicle dispatch request and the second vehicle dispatch request from the multiple user terminals and allocates vehicles to the first vehicle dispatch request with priority over the second vehicle dispatch request.

[0007] In order to solve the above problem, the vehicle dispatch management device of the present invention, which is capable of communicating with user terminals via a network, includes one or more processors, and the processor acquires, from the multiple user terminals, a first vehicle dispatch request in which the object to be transported is a person and a second vehicle dispatch request in which the object to be transported is an object, and allocates vehicles to the first vehicle dispatch request with priority over the second vehicle dispatch request.

[0008] The processor may allocate the vehicle to the first vehicle dispatch request, and after the allocation of the first vehicle dispatch request is completed, allocate the vehicle to the second vehicle dispatch request.

[0009] The vehicle dispatch requests, including the first vehicle dispatch request and the second vehicle dispatch request, may be associated with a plurality of different request priorities, and the processor may allocate the vehicles to the vehicle dispatch requests in descending order of the request priorities.

[0010] The processor may allocate the vehicle to both the first vehicle dispatch request and the second vehicle dispatch request during a first time period, and may allocate the vehicle only to the first vehicle dispatch request during a second time period different from the first time period without allocating the vehicle to the second vehicle dispatch request.

[0011] The processor may allocate the vehicle to both the first vehicle dispatch request and the second vehicle dispatch request in a first region, and may allocate the vehicle only to the first vehicle dispatch request in a second region different from the first region without allocating the vehicle to the second vehicle dispatch request.

[0012] A business area in which the vehicle can operate is provided, and the processor may allocate the vehicle to the first vehicle dispatch request if the source of transportation is outside the business area and the destination is within the business area, not allocate the vehicle to the first vehicle dispatch request if the source of transportation is outside the business area and the destination is outside the business area, allocate the vehicle to the second vehicle dispatch request if the source of transportation is outside the business area and the destination is closer to the business area than the source of transportation, and not allocate the vehicle to the second vehicle dispatch request if the source of transportation is outside the business area and the destination is farther from the business area than the source of transportation.

[0013] In order to solve the above problem, the vehicle dispatch management method of the present invention involves a computer acquiring a first vehicle dispatch request in which the transportation object is a person and a second vehicle dispatch request in which the transportation object is an object from multiple user terminals, and allocating vehicles to the first vehicle dispatch request with priority over the second vehicle dispatch request.

[0014] In order to solve the above problem, the program of the present invention causes a computer to receive a first vehicle dispatch request in which the transportation object is a person and a second vehicle dispatch request in which the transportation object is an object from multiple user terminals, and allocates a vehicle to the first vehicle dispatch request with priority over the second vehicle dispatch request. [Effects of the Invention]

[0015] According to the present invention, it is possible to make effective use of vehicles such as taxis. [Brief explanation of the drawings]

[0016] [Figure 1] FIG. 1 is a block diagram for explaining an outline of a vehicle dispatch management system. [Figure 2] FIG. 2 is a block diagram illustrating the configuration of a user terminal. [Figure 3] FIG. 3 is a block diagram illustrating the configuration of the vehicle terminal. [Figure 4] FIG. 4 is a block diagram illustrating the configuration of the business server. [Figure 5] FIG. 5 is a block diagram illustrating the configuration of the vehicle dispatch management server. [Figure 6] FIG. 6 is an explanatory diagram for explaining the business area. [Figure 7] FIG. 7 is a sequence diagram showing the flow of processing in a vehicle allocation management method by the vehicle allocation management system. [Figure 8] FIG. 8 is an explanatory diagram for explaining the processing of the dispatch unit. [Figure 9] FIG. 9 is a first explanatory diagram for explaining the pair creation process. [Figure 10] Fig. 10A is a second explanatory diagram for explaining the pair creating process, and Fig. 10B is a third explanatory diagram for explaining the pair creating process. [Figure 11] Fig. 11A is a first explanatory diagram for explaining the matching process, Fig. 11B is a second explanatory diagram for explaining the matching process, and Fig. 11C is a third explanatory diagram for explaining the matching process. [Figure 12] Fig. 12A is a first explanatory diagram for explaining the processing of the dispatch unit, and Fig. 12B is a second explanatory diagram for explaining the processing of the dispatch unit. [Figure 13] Fig. 13A is a first explanatory diagram for describing the matching process. Fig. 13B is a second explanatory diagram for describing the matching process. Fig. 13C is a third explanatory diagram for describing the matching process. Fig. 13D is a fourth explanatory diagram for describing the matching process. Fig. 13E is a fifth explanatory diagram for describing the matching process. [Figure 14]Fig. 14A is a first explanatory diagram for explaining the processing of the dispatch unit, and Fig. 14B is a second explanatory diagram for explaining the processing of the dispatch unit. [Figure 15] FIG. 15 is an explanatory diagram showing the results of matching by the dispatch unit. [Figure 16] Fig. 16A is a first explanatory diagram for explaining the processing of the dispatch unit, and Fig. 16B is a second explanatory diagram for explaining the processing of the dispatch unit. DETAILED DESCRIPTION OF THE INVENTION

[0017] Preferred embodiments of the present invention will be described in detail below with reference to the accompanying drawings. Dimensions, materials, and other specific values ​​shown in the embodiments are merely examples for facilitating understanding of the invention and, unless otherwise specified, do not limit the present invention. In this specification and drawings, elements having substantially the same functions and configurations are designated by the same reference numerals to avoid redundant explanation, and elements not directly related to the present invention are not shown.

[0018] (Vehicle Dispatch Management System 1) FIG. 1 is a block diagram for explaining an overview of a vehicle dispatch management system 1. The vehicle dispatch management system 1 includes multiple user terminals 20, multiple vehicle terminals 30, multiple vehicles 32, one or more business operator servers 40, and one or more vehicle dispatch management servers 50. In the vehicle dispatch management system 1, the commercial vehicles 32, which are the means of transportation for users 2, include not only taxis but also NRS vehicles. Here, NRS is an abbreviation for Japanese ride-sharing or Japanese version of ride-sharing, and refers to a service in which ordinary drivers transport users 2 for a fee using their own cars or other vehicles. Furthermore, transportation refers to transporting users (people) 2 from a boarding location to a dropping-off location, or transporting luggage (items) 4 from a delivery source to a delivery destination. Here, when it is not necessary to distinguish between users 2 and luggage 4, the boarding location of users 2 and the delivery source of luggage 4 may be collectively referred to as the "delivery source," and the dropping-off location of users 2 and the delivery destination of luggage 4 may be collectively referred to as the "delivery destination."

[0019] The user terminal 20 is an electronic device owned by a user 2. The user 2 is, for example, a passenger in a vehicle 32. The user 2 can also request the vehicle 32 to transport luggage 4 instead of riding in the vehicle himself / herself. Examples of the user terminal 20 include a smartphone, a personal computer, and a tablet PC. In the vehicle dispatch management system 1, there are multiple combinations of users 2 and user terminals 20. Note that the user 2 in this embodiment is not limited to one person, and may refer to multiple people who can ride in one vehicle 32.

[0020] FIG. 2 is a block diagram illustrating the configuration of the user terminal 20. The user terminal 20 includes a communication device 120, a processing device 122, a display device 124, an input device 126, and a storage device 128. The communication device 120 is communicatively connected to an external device, such as the vehicle dispatch management server 50, via a base station 5 and a network 6. The processing device 122 includes a semiconductor integrated circuit including a processor such as a central processing unit (CPU), a read-only memory (ROM) storing programs, and a random access memory (RAM) used as a work area. A user application for the vehicle dispatch management system 1 is installed on the user terminal 20. The processing device 122 runs the program to control the user application and function as a vehicle dispatch request unit 160 that supports input of a vehicle dispatch request by the user 2. Here, "dispatch" refers to allocating a vehicle 32 and sending it to a transportation source. The display device 124 includes a liquid crystal display, an organic electroluminescence (EL) display, or the like, and displays various information, such as images of the user application used to make a vehicle dispatch request. The input device 126 includes a touch panel, switches, buttons, keys, a microphone for voice input, etc. superimposed on the display device 124, and accepts input from the user 2, such as information for requesting a vehicle dispatch. The storage device 128 is configured with storage means such as an HDD (Hard Disk Drive), SD memory, SSD (Solid State Drive), etc.

[0021] The vehicle terminal 30 is an electronic device loaned to the driver 3 of the vehicle 32 or owned by the driver 3, and is used when driving the vehicle 32. Therefore, the vehicle terminal 30 is associated with the vehicle 32 together with the driver 3. It is sufficient that the vehicle terminal 30 is ultimately located (present) within the vehicle 32 and can be operated and referenced by the driver 3, and is not limited to being brought into the vehicle when driving begins, but may be installed (fixed) in the vehicle 32 in advance. Examples of the vehicle terminal 30 include a smartphone, a personal computer, a tablet PC, etc.

[0022] FIG. 3 is a block diagram illustrating the configuration of the vehicle terminal 30. The vehicle terminal 30 includes a communication device 130, a processing device 132, a display device 134, an input device 136, and a storage device 138. The communication device 130 is communicatively connected to external devices, such as the business operator server 40 and the vehicle dispatch management server 50, via a base station 5 and a network 6. The processing device 132 includes a semiconductor integrated circuit including a processor (CPU), a ROM storing programs and the like, and a RAM used as a work area. A vehicle application for the vehicle dispatch management system 1 is installed on the vehicle terminal 30. The processing device 132 controls the vehicle application by running the program and functions as a vehicle dispatch response unit 162 that supports the driver 3 in inputting responses to vehicle dispatch requests. The display device 134 includes a liquid crystal display and an organic light-emitting diode (OLED) display, and displays various information to the driver 3, such as a notification that the driver's vehicle 32 has been the subject of a vehicle dispatch request (a vehicle dispatch target notification) and information related to the vehicle dispatch request (the transportation source, transportation destination, and user information related to the user 2). Hereinafter, the target of a vehicle dispatch request may be referred to as the "dispatch target," and the vehicle 32 that has been dispatched may be referred to as the "dispatch target vehicle." The vehicle terminal 30 may function as a fare meter (taxi meter) that automatically calculates a fare based on the distance traveled and the travel time required from the transportation source to the transportation destination. In this case, the display device 134 may, for example, display information indicating the automatically calculated fare to the user 2. A fare meter implemented by such a vehicle terminal 30 may be referred to as a "soft meter" to distinguish it from a dedicated meter fixed to a taxi. The input device 136 includes a touch panel, switches, buttons, keys, a microphone for voice input, etc. superimposed on the display device 134, and receives input from the driver 3, such as acceptance of the dispatch request. The storage device 138 is composed of storage means such as an HDD, SD memory, or SSD. The vehicle terminal 30 can acquire its own location on a map through location identification means such as a GPS (Global Positioning System).

[0023] The driver 3 is a crew member of the vehicle 32. The driver 3 includes a taxi driver and an NRS driver. A taxi driver is a crew member who holds a Class 2 driver's license for a standard vehicle and is a driver in a taxi business (general passenger automobile transportation business). An NRS driver is a driver who holds a Class 1 driver's license for a standard vehicle and is a driver in a ride-sharing business (private vehicle passenger transportation business for a fee). In this embodiment, an example will be described in which a taxi business also manages a ride-sharing business based on Article 78, Paragraph 3 of the Road Transportation Act. Therefore, an NRS driver can be said to be a driver who belongs to a taxi business. An NRS driver differs from a taxi driver in that he or she may not hold a Class 2 driver's license for a standard vehicle or may have poor driver qualifications, driving skills, and knowledge. Furthermore, an NRS driver cannot engage in so-called cruising business, which is to say, searching for users 2 who want to ride while driving the vehicle 32, as a taxi driver can. In addition, in the case of paid passenger transportation by private car based on Article 78, Paragraph 3 of the Road Transportation Act, the NRS driver can charge User 2 a fee (fare) equivalent to that charged for general passenger automobile transportation business as compensation for transporting User 2.

[0024] The vehicle 32 is, for example, a vehicle belonging to a taxi company, and can transport the user 2 for a fee as part of the taxi business. The vehicle 32 can also transport luggage 4 for a fee at the request of the user 2. In the vehicle dispatch management system 1, there are multiple combinations of drivers 3, vehicles 32, and vehicle terminals 30. In this embodiment, a four-wheeled taxi (hire car) is used as an example of the vehicle 32 to be dispatched, but the vehicle 32 is not limited to this example, and may include, for example, a motorcycle (bike taxi) or the like, as long as it is capable of transporting people. In addition, if the driver 3 is an NRS driver, a private car or an idle taxi vehicle can be used as the vehicle 32 to be dispatched.

[0025] FIG. 4 is a block diagram illustrating the configuration of the business operator server 40. The business operator server 40 is an information processing device (computer) owned by a business operator operating a taxi business. The business operator server 40 manages vehicles 32 driven by drivers 3 belonging to the taxi business. The business operator server 40 includes a communication device 140, a processing device 142, a display device 144, an input device 146, and a storage device 148. The communication device 140 is communicatively connected to external devices, such as the vehicle terminal 30 and the dispatch management server 50, via the network 6. The processing device 142 includes a semiconductor integrated circuit including a processor (CPU), a ROM storing programs, and a RAM used as a work area. By running the program, the processing device 142 functions as a vehicle management unit 164 that manages vehicles 32 belonging to the taxi business. The display device 144 includes a liquid crystal display (LCD) or an organic electroluminescence (EL) display, and displays various information, such as information about the driver 3 or the vehicle 32, obtained directly from the vehicle 32 or via the dispatch management server 50. The input device 146 includes a keyboard, a touch panel superimposed on the display device 144, a microphone for voice input, etc., and receives input from an operator at the business. For example, the operator can talk to the driver 3 or check images of the inside and outside of the vehicle, including an image of the driver 3, through the business server 40. The storage device 148 is composed of storage means such as an HDD, SD memory, or SSD.

[0026] FIG. 5 is a block diagram illustrating the configuration of the vehicle dispatch management server 50. The vehicle dispatch management server (vehicle dispatch management device) 50 is an information processing device (computer) that manages vehicles 32 belonging to a taxi company based on a contract between the vehicle dispatch management company and the taxi company. The vehicle dispatch management server 50 is an example of a vehicle dispatch management device with server functionality and is operated by the vehicle dispatch management company. The vehicle dispatch management server 50 can dispatch a vehicle 32 to a user 2 in response to a dispatch request from a user terminal 20. The vehicle dispatch management server 50 includes a communication device 150, a processing device 152, and a storage device 154. The communication device 150 is communicably connected to external devices, such as the user terminal 20, the vehicle terminal 30, and the company server 40, via the network 6. The processing device 152 includes a semiconductor integrated circuit including a processor (CPU), a ROM storing programs and the like, a RAM used as a work area, and the like. By running programs, the processing device 152 functions as functional units such as a user terminal control unit 170, a vehicle dispatch unit 172, and a vehicle terminal control unit 174. The user terminal control unit 170 controls the user application installed in the user terminal 20. The vehicle allocation unit 172 allocates a vehicle 32 in response to a vehicle allocation request. The vehicle terminal control unit 174 controls the vehicle application installed in the vehicle terminal. The storage device 154 is composed of storage means such as an HDD, SD memory, or SSD, and stores information about the user 2 and the vehicle 32.

[0027] In the vehicle dispatch management system 1, when allocating a vehicle 32 in response to a vehicle dispatch request (i.e., when dispatching a vehicle), for example, by matching a plurality of vehicle dispatch requests with a plurality of vehicles 32, one vehicle 32 is allocated to, for example, one vehicle dispatch request from one user 2. Here, matching refers to a process of exclusively associating any vehicle dispatch request with any vehicle 32 in a state where there are multiple vehicle dispatch requests and multiple vehicles 32. Below, an example of allocating one vehicle 32 to one vehicle dispatch request will be described, but if multiple users 2 are allowed to ride in one vehicle 32, so-called carpooling, multiple vehicle dispatch requests from multiple users 2 may be aggregated, and one vehicle 32 may be allocated to the aggregated vehicle dispatch requests.

[0028] (Vehicle 32 operating area) Vehicle 32 has a designated business area in which it can operate. If driver 3 is a taxi driver, vehicle 32 can operate in the business area where the taxi business office to which he belongs is located. For example, if the business area is within Tokyo's special wards, vehicle 32 can operate in Tokyo's 23 wards, Musashino City, and Mitaka City. Such a business area of ​​vehicle 32 is sometimes called a traffic area. Furthermore, if driver 3 is an NRS driver, the business area of ​​vehicle 32 is included in the business area of ​​the taxi driver's vehicle 32, and is often narrower than the business area of ​​the taxi driver's vehicle 32. Here, the business area of ​​vehicle 32 will be explained.

[0029] 6 is an explanatory diagram for explaining business areas. As shown in (1) in FIG. 6, a vehicle 32 can transport a user 2 from a transportation source within a business area 7 indicated by a dashed line to a transportation destination within the same business area 7.

[0030] If the vehicle 32 is a taxi, the destination is not required information to be input in a dispatch request, and therefore, user 2 may not input the destination before boarding the vehicle. In this case, user 2 will verbally communicate the destination directly to the taxi driver after boarding the vehicle 32. In this case, even if the origin of the delivery is within the operating area 7, the destination will not necessarily be within the operating area 7. However, if the taxi driver is unable to transport user 2 because the destination is outside the operating area 7 (another operating area), the taxi driver will have to refuse user 2's ride, resulting in a decrease in user 2's convenience and dispatch efficiency. Therefore, vehicle 32 can transport user 2 from the origin of the delivery within the operating area 7 to a destination outside the operating area 7, as shown by (2) in Figure 6.

[0031] As shown in (2) in Figure 6, after transporting user 2 outside of its business area 7, vehicle 32 returns (returns to its own business area 7) to continue business. If transporting new users 2 is restricted while returning to its own business area 7, vehicle 32 will lose business opportunities and its actual vehicle efficiency will decrease. Therefore, even if vehicle 32 is located outside of its business area 7, as shown in (3) in Figure 6, it can transport user 2 from a source outside of its business area 7 to a destination within its business area 7, as long as the destination is within its own business area 7.

[0032] However, when vehicle 32 is located outside the business area 7, business transporting user 2 to a destination outside the business area 7 is not business within the business area 7 (out-of-area business). Therefore, vehicle 32 cannot transport user 2 from a source outside the business area 7 to a destination outside the business area 7, as shown by (4) in Figure 6.

[0033] In other words, in the vehicle dispatch management system 1, when the vehicle 32 is located within the business area 7, as shown in (1) and (2) in FIG. 6, the vehicle can transport the user 2 to the destination regardless of whether the destination is within or outside the vehicle's own business area 7. On the other hand, in the vehicle dispatch management system 1, when the vehicle 32 is located outside the business area 7, as shown in (3) and (4) in FIG. 6, whether the vehicle can transport the user 2 to the destination depends on whether the destination is within or outside the vehicle's own business area 7. Specifically, when the source of transportation is outside the business area 7 and the destination is within the business area 7, the vehicle dispatch unit 172 allocates the vehicle 32 to a vehicle dispatch request in which the transportation target is user 2. On the other hand, when the source of transportation is outside the business area 7 and the destination is outside the business area 7, the vehicle dispatch unit 172 does not allocate the vehicle 32 to a vehicle dispatch request in which the transportation target is user 2.

[0034] If vehicle 32 is an NRS vehicle, the geographical scope of the vehicle's business may be determined as a different business area from the business area 7 of a taxi vehicle. The business area of ​​an NRS vehicle is usually included in the business area 7 of a taxi vehicle and is often smaller than the business area 7 of a taxi vehicle. The ability to transport within and outside the business area is similar to that of a taxi vehicle, and can be understood by replacing the business area 7 of a taxi vehicle in Figure 6 with the business area of ​​the NRS vehicle. However, when an NRS vehicle returns from outside its business area, it can adopt an extended business area, which evenly expands the business area outward by, for example, about 5 km. Therefore, the size of the business area has the relationship NRS vehicle business area < extended business area ≦ business area. For example, if the destination is within the extended business area, even if it is not within the NRS vehicle's business area, the NRS vehicle can transport user 2 from a source outside its business area to a destination within the extended business area.

[0035] Furthermore, as described above, the vehicle 32 can transport not only the user 2 but also the luggage 4. Here, when the vehicle 32 transports a person such as the user 2, its business area and transportation range are limited as described above, but when transporting luggage 4, the business area and transportation range are not limited. Therefore, the driver 3 can transport luggage 4 regardless of the business area, regardless of the origin or destination.

[0036] However, if the object of transportation is luggage 4, allowing unlimited transportation would cause the following problem. That is, the vehicle 32's primary purpose is to transport the user 2, and it effectively utilizes its free time to transport the luggage 4. Here, if the vehicle 32 transports luggage 4 unlimitedly, it may end up transporting the luggage 4 in a direction away from the business area 7, which would require time to return to the business area 7 where the user 2 can be transported. Therefore, in this embodiment, as shown in (2) in FIG. 6 , the vehicle 32 is only allowed to transport luggage 4 when moving from outside the business area 7 in a direction returning to the business area 7, such as returning to its own business area 7 to continue business after transporting the user 2 outside the business area 7. Specifically, the vehicle dispatch unit 172 assigns the vehicle 32 to a dispatch request in which the object of transportation is luggage 4 when the transportation source is outside the business area 7 and the transportation destination is closer to the business area 7 than the transportation source. On the other hand, if the transportation origin is outside the business area 7 and the transportation destination is farther from the business area 7 than the transportation origin, the vehicle allocation unit 172 does not allocate a vehicle 32 to a vehicle allocation request in which the transportation object is cargo 4.

[0037] (Transportation method) When a vehicle dispatch request is received for user 2 as the transportation target, the vehicle dispatch management server 50 dispatches a vehicle 32 to the transportation origin of user 2. The vehicle 32 then transports user 2 from the transportation origin to the transportation destination. Furthermore, when a vehicle dispatch request is received for baggage 4 as the transportation target, the vehicle dispatch management server 50 dispatches a vehicle 32 to the transportation origin of the baggage. The vehicle 32 then transports baggage 4 from the transportation origin to the transportation destination. When vehicle 32 transports user 2, the transportation destination may be determined or changed during the transportation. Furthermore, in order to protect his or her personal information, user 2 may intentionally select a destination that is slightly away from the original destination (the desired final destination). In contrast, when transporting baggage 4, the transportation destination must be specified in detail because baggage 4 cannot move by itself. This is because, for example, even if a building has a unique address, if it is an apartment building, the floor number and room number may differ, and the delivery method of baggage 4 may also differ, such as hand delivery, delivery locker, or leaving it at the door.

[0038] As described above, when transporting the luggage 4, the driver 3 cannot deliver the luggage 4 unless he / she knows the destination in detail, and therefore personal information about the destination becomes known to the driver 3. This makes it difficult to protect the personal information. Therefore, a system is adopted to appropriately transport the luggage 4 while protecting the personal information. For example, the vehicle dispatch management server 50 first identifies the detailed destination of the luggage 4, and then divides one transportation route from the transportation source to the destination into a transportation route by the vehicle 32 (driver 3) and a transportation route by another transportation means. The vehicle dispatch management server 50 notifies the driver 3 of the transportation route by the vehicle 32 via the vehicle terminal 30. The driver 3 transports the luggage 4 according to this transportation route. Then, the other transportation means takes over from the vehicle 32 and transports the luggage 4 to the destination. Here, for example, a robot or a drone mounted on the vehicle 32 can be used as the other transportation means. At this time, the vehicle dispatch management server 50 may notify the user terminal 20 of the user 2 who requested the vehicle dispatch or the terminal of the recipient at the destination, when the vehicle 32 arrives at the destination, that the luggage 4 will be delivered by a robot or a drone. With this configuration, the luggage 4 can be appropriately delivered without the driver 3 having detailed information about the destination.

[0039] In addition, although an example in which another means of transportation is used to deliver the package 4 to the destination has been described, another means of transportation may also be used to receive the package 4 at the source of delivery. With this configuration, it is possible to prevent the driver 3 from learning not only detailed information about the destination but also detailed information about the source of delivery.

[0040] Note that the vehicle 32 may be driving autonomously without a driver. In this case, the vehicle 32 itself cannot receive the luggage 4 at the delivery point or deliver the luggage 4 at the delivery destination. Therefore, when the vehicle 32 is driving autonomously without a driver, it is possible to properly transport the luggage 4 from the delivery point to the delivery destination by applying other transportation means as described above. However, when the vehicle 32 is driving autonomously without a driver and ride-sharing between the user 2 and the luggage 4 is permitted as described below, there is a risk that the user 2 riding in the vehicle may steal the shared luggage 4. Furthermore, when the vehicle 32 is driving autonomously without a driver and ride-sharing between the user 2 and the luggage 4 is permitted, there is a risk that the recipient may intentionally or mistakenly receive the other shared luggage 4. Therefore, the user 2 may set the vehicle 32 to prohibit transportation by the autonomously driving vehicle 32 if ride-sharing is permitted, or may set the vehicle 32 to prohibit ride-sharing if the dispatched vehicle 32 is an autonomously driving vehicle 32. Furthermore, if user 2 allows carpooling, a box requiring the recipient's authentication to retrieve the luggage 4 may be provided in the vehicle 32, or user 2 may hand over the luggage 4 to the vehicle 32 along with a box requiring the recipient's authentication to retrieve the luggage 4.

[0041] Furthermore, whether the vehicle 32 is driven by a driver 3 or is unmanned and autonomous, the user 2 who requested the vehicle dispatch can hand over the package 4 to the vehicle 32 near the delivery origin, instead of using another means of transportation, or the recipient can pick up the package 4 from the vehicle 32 near the delivery destination, instead of using another means of transportation. In such an example, when the user 2 specifies a recipient through a user application, the vehicle dispatch management server 50 notifies the recipient via the recipient's user application, email, SMS, SNS, etc., of information indicating that the package 4 will be delivered, the pickup location, the estimated arrival date and time, etc. Then, when the vehicle 32 arrives at the pickup location, the vehicle dispatch management server 50 notifies the recipient of this. In this way, the recipient can pick up the package 4 at the pickup location.

[0042] Furthermore, when receiving such a package 4, the identity of the recipient may be verified. For example, when the driver 3 drives the vehicle 32, the driver 3 verifies the identity of the recipient by asking the identification information (e.g., name) of the user 2 who requested the vehicle dispatch from the recipient. Alternatively, the user 2 may communicate the identification information (e.g., name) of the recipient to the driver 3 in advance through a user application when requesting a vehicle dispatch or orally at the time of delivery, and the driver 3 may verify the identity of the recipient by asking the identification information of the recipient. Alternatively, the vehicle dispatch management server 50 may issue a reception number (receiving number) in response to the vehicle dispatch request and notify the recipient, and the driver 3 may verify the identity of the recipient by asking the reception number from the recipient.

[0043] Furthermore, for example, when the vehicle 32 is driven automatically and unmanned, the user 2 may perform authentication using the user terminal 20 (such as NFC authentication, short-range communication such as Bluetooth (registered trademark) authentication, password entry, or a digital key function using a smartphone) before handing over the luggage 4 to the vehicle 32, and the recipient may perform authentication using a predetermined terminal before receiving the luggage 4 from the vehicle 32. Note that, in the above description, an example has been given in which the user 2 performs authentication in a vehicle dispatch request in which the transportation target is luggage 4 and the vehicle 32 is driven automatically and unmanned; however, the user 2 may also perform authentication in a vehicle dispatch request in which the transportation target is user 2 and the vehicle 32 is driven automatically and unmanned.

[0044] (Fee) In this way, the transportation method differs when the object of transportation is user 2 and when the object of transportation is baggage 4. Furthermore, the considerations for safety during transportation of the object of transportation and the compensation details in the event of an accident or the like also differ when the object of transportation is user 2 and when the object of transportation is baggage 4. Therefore, the fee (fare) may be different when the object of transportation is user 2 and when the object of transportation is baggage 4. When the object of transportation is baggage 4, driver 3 may transport it at a lower fee than when the object of transportation is user 2, for example, the fee may be about half of the fee when the object of transportation is user 2. However, this is not limited to such an example, and the fee when the object of transportation is user 2 and the fee when the object of transportation is baggage 4 can be determined individually and arbitrarily based on the provisions of the general passenger automobile transportation business.

[0045] When the object of transportation is a user 2, the fee varies depending on factors such as the transportation distance and whether or not a toll road such as an expressway is used. However, when the object of transportation is luggage 4, the fee may also or instead vary depending on the size and weight of the luggage 4. For example, the larger the size of the luggage 4, the higher the fee, and the heavier the luggage 4, the higher the fee. However, this is not a limitation, and the fee may be fixed regardless of the size and weight of the luggage 4. Furthermore, a minimum fee (initial fee) may be set when the size of the luggage 4 is less than a predetermined size or when the weight of the luggage 4 is less than a predetermined weight.

[0046] In recent years, there have been concerns about a decrease in logistics and transportation volume and a shortage of truck drivers. Therefore, in the taxi industry, as described above, it is expected that vehicles 32 will compensate for the shortage of logistics and transportation services by transporting not only users 2 but also luggage 4. Furthermore, in the taxi industry itself, when the number of vehicles 32 available for dispatch greatly exceeds the number of users 2, the vehicles 32 can be used to transport luggage 4 during their idle time, thereby making effective use of the vehicles 32.

[0047] Here, the transportation of luggage 4 is performed by a vehicle 32 belonging to a taxi company, which differentiates this service from other logistics and transportation services in the following ways. First, the driver 3 has the qualifications, driving skills, and knowledge to transport the user 2. He or she can directly receive the luggage 4 at the destination, place the luggage in a seat that minimizes vibrations from the vehicle 32, and deliver the luggage 4 directly to the destination. Therefore, the user 2 can expect careful and safe transportation, even for luggage 4 that is sensitive to vibrations, such as precision machinery, ceramics, and glass products. Furthermore, the driver 3 directly receives the luggage 4 at the destination, transports it via the shortest route from the destination to the destination, and delivers it directly to the destination. This shortens the transportation time compared to courier services. Furthermore, because the luggage 4 can be placed in a passenger compartment or trunk space large enough to accommodate multiple users 2, transportation is possible even for luggage 4 that occupies a large volume or is heavy, providing greater flexibility in the size and weight of the luggage 4 compared to motorcycle couriers. In this way, when the vehicle 32 belonging to the taxi company transports the luggage 4, the transportation itself generally has a special feeling (luxury).

[0048] However, as described above, the main purpose of the vehicle 32 is to transport the user 2, and the vehicle 32 effectively utilizes its free time to transport the luggage 4. Therefore, the vehicle 32 needs to transport the user 2 with priority over the luggage 4. Below, a specific process will be described in which the vehicle 32 is assigned with priority to a vehicle dispatch request in which the transportation target is the user 2 over a vehicle dispatch request in which the transportation target is the luggage 4.

[0049] (Vehicle allocation management method) FIG. 7 is a sequence diagram showing the processing flow of the vehicle dispatch management method by the vehicle dispatch management system 1. The vehicle dispatch management system 1 extracts one or more vehicles 32 that can be vehicles to be dispatched for each dispatch request from a plurality of vehicles 32, and identifies one vehicle to be dispatched through matching. The vehicle dispatch management system 1 then asks the driver 3 of the vehicle 32 that has been selected as the vehicle to be dispatched to dispatch, and when the driver 3 accepts the inquiry, the dispatch of the vehicle in response to the dispatch request is confirmed. Each process in the vehicle dispatch management method will be described in detail below.

[0050] (Vehicle dispatch request processing S1) When user 2 wishes to board a vehicle 32 or have luggage 4 transported by a vehicle 32, user 2 makes a vehicle dispatch request through the user terminal 20. Specifically, the vehicle dispatch request unit 160 of the user terminal 20 launches a user application for making a vehicle dispatch request. The user application displays a map of a predetermined area including the current location of the user terminal 20, as well as vehicles 32 located near the user terminal 20. For example, when user 2 wishes to board a vehicle 32, user 2 operates a "vehicle dispatch" button, and when user 2 wishes to have luggage 4 transported, user 2 operates a "delivery" button. The vehicle dispatch request unit 160 accepts user 2's vehicle dispatch request through the input device 126. At this time, user 2 can set setting items for the vehicle 32 in which user 2 will board or which will transport luggage 4. The vehicle dispatch request unit 160 transmits the vehicle dispatch request to the vehicle dispatch management server 50, together with information related to the setting items set by user 2.

[0051] In addition to the initial vehicle dispatch request, the setting items include, for example, the source of delivery, the destination of delivery, payment information, vehicle dispatch category, taxi company, vehicle attributes, toll road information, and ride-sharing permission information.

[0052] The transportation origin indicates the location on the map where the user 2 gets into the vehicle 32, or the location on the map where the driver 3 receives the luggage 4. The user 2 can set the user 2's current location as the transportation origin, or can set a desired location different from the user 2's current location as the transportation origin. The transportation destination indicates the location on the map where the user 2 gets off the vehicle 32, or the location on the map where the driver 3 hands over the luggage 4. When the user 2 sets the transportation origin and transportation destination among the setting items, the fare calculated based on the transportation target (user 2 or luggage 4), the set time, the transportation origin, and the transportation destination is displayed on the display device 124. In this way, the user 2 can know in advance the fare to be paid by riding in the vehicle 32. When the user 2 limits the vehicle dispatch targets to taxi vehicles only, the transportation destination is not required input information but can be input arbitrarily. On the other hand, when the user 2 includes NRS vehicles in the vehicle dispatch targets, the transportation destination is required input information.

[0053] Furthermore, if the object of transportation is user 2, the destination can be specified arbitrarily, but if the object of transportation is package 4, the destination is required input information, and detailed information about the destination must also be specified. Therefore, when user 2 requests transportation of package 4, he or she inputs not only the address of the destination, but also information that can specify the floor number and room number if the destination is an apartment building. User 2 also selects the delivery method from hand-delivery, delivery box, leaving at door, etc.

[0054] The payment information is information regarding payment of fees (e.g., fares and other additional fees) associated with the use of the vehicle 32. Note that, when an NRS vehicle is included in the vehicle dispatch target, in addition to inputting the delivery destination, information regarding automatic cashless payment by credit card or the like (e.g., a credit card number) is required as payment information. Furthermore, regardless of the vehicle dispatch target, i.e., regardless of whether the dispatched vehicle 32 is an NRS vehicle or a taxi, information regarding automatic cashless payment by credit card or the like may be required as payment information. Furthermore, regardless of whether the transportation target is the user 2 or the cargo 4, and regardless of whether the driver 3 is a taxi driver or an NRS driver, information regarding automatic cashless payment by credit card or the like may be required as payment information. The vehicle dispatch category indicates the category of the vehicle 32 to be dispatched. For example, if the user 2 desires to dispatch a taxi vehicle, the user 2 selects "taxi vehicles only" as the dispatch category, and if the user 2 does not require a taxi vehicle to be dispatched, the user 2 selects "all vehicles" as the dispatch category.

[0055] The taxi company indicates the taxi business to which the driver 3 belongs. User 2 can specify a desired taxi company by entering information into the taxi company setting items. Vehicle attributes indicate the type and equipment of the vehicle 32. Examples of vehicle attributes include whether the vehicle is a high-class vehicle (a so-called hire car), whether it is wheelchair accessible, and whether it has sliding doors. If the object to be transported is luggage 4 and the luggage 4 occupies a large volume, user 2 may check whether a trunk room is available as a vehicle attribute. If a trunk room is available, user 2 may input the size and weight of the luggage 4 to check whether it can be stored in the trunk room. In this way, user 2 can specify the attributes of the vehicle he or she desires to dispatch by entering information into the vehicle attribute setting items. Toll road information indicates whether a toll road, such as an expressway, will be used. If the toll road information indicates the use of a toll road, toll roads will be actively included in the route from the transportation origin to the transportation destination. The ride-sharing permission information indicates whether or not a vehicle 32 is permitted to share a ride with another user 2 and the luggage 4 of the other user 2. Regardless of whether the user 2 is riding in the vehicle 32 himself or herself or whether the luggage 4 is being transported, the user 2 individually inputs whether or not he or she is willing to ride with the other user 2 and the luggage 4 of the other user 2.

[0056] (Dispatch request accumulation process S2) The user terminal control unit 170 of the vehicle dispatch management server 50 controls the user application of the user terminal 20 and performs processing corresponding to the dispatch request input through the user application. When the user terminal control unit 170 receives a dispatch request from the user terminal 20, it first identifies which of multiple business areas the transportation source in the setting items is included in. The user terminal control unit 170 assigns the same identifier, for example, a taxi business area ID, to dispatch requests sent in the same business area. The user terminal control unit 170 associates the dispatch request received from the user terminal 20, including information on the various setting items, with the business area identifier and the time of receipt of the dispatch request, and sequentially stores them in the storage device 154.

[0057] (Vehicle dispatch request extraction process S3) The vehicle dispatch unit 172 of the vehicle dispatch management server 50 extracts all vehicle dispatch requests that have occurred in a specified business area up to a specified execution timing from among the multiple vehicle dispatch requests stored in the storage device 154. Here, the execution timing indicates the timing at which the vehicle dispatch request extraction process S3 is started for the multiple vehicle dispatch requests, and is expressed, for example, as a time. The execution timing is set periodically and repeatedly at a specified processing interval. Therefore, a new execution timing is set after a specified processing period has elapsed since the vehicle dispatch request extraction process S3 was started at the previous execution timing. Here, the specified processing period is the length of time for which vehicle dispatch requests to be processed at one time are accumulated, and is set to, for example, 5 seconds.

[0058] However, in reality, in the matching started at the previous execution timing, a vehicle to be allocated may not have been determined for a vehicle allocation request. Such vehicle allocation requests for which a vehicle to be allocated has not been determined are carried over to the current execution timing, and matching continues. Therefore, the vehicle allocation unit 172 extracts, as vehicle allocation requests accumulated up to the current execution timing, vehicle allocation requests for which a vehicle to be allocated has not been determined in the previous matching, in addition to vehicle allocation requests accumulated from the previous execution timing to the current execution timing.

[0059] (Vehicle extraction process S4) The vehicle dispatch unit 172 extracts one or more vehicles 32 that satisfy predetermined extraction conditions related to the vehicle dispatch request extracted in the vehicle dispatch request extraction process S3 from among multiple vehicles 32 that can accommodate the user 2. Here, an example of the extraction condition is that the estimated arrival time at the transportation origin is short. Specifically, an example of the extraction condition is that the distance between the transportation origin and the current location of the vehicle 32 is within a predetermined distance (e.g., 10 km) or that the estimated arrival time at the transportation origin is within a predetermined time (e.g., 10 minutes). Note that the distance in this case is the Euclidean distance between the transportation origin and the current location of the vehicle 32, and the estimated arrival time is the time obtained by dividing the Euclidean distance by a predetermined speed (e.g., the average speed of the vehicle 32 when it is operating). Note that the operating state of the vehicle 32 mainly refers to a pick-up state (a state in which the vehicle is traveling toward the transportation origin of the user 2) and a hire state (a state in which the vehicle is traveling with the user 2 on board), and does not include a stopped state in which the vehicle is waiting for a vehicle dispatch request. In addition, the dispatch unit 172 may further limit the number of vehicles 32 to be extracted to a predetermined number (e.g., 10 vehicles) as an extraction condition, in order of the distance between the transportation source and the current location of the vehicle 32 or the estimated arrival time at the transportation source.

[0060] Fig. 8 is an explanatory diagram for explaining the processing of the vehicle dispatch unit 172. Fig. 8 shows six users 2a to 2f who have made vehicle dispatch requests within the business area A, and eleven vehicles 32a, 32b, 32c, 32d, 32e, 32f, 32g, 32h, 32i, 32j, and 32k that exist within the business area A. It is assumed that, of the users 2a to 2f, users 2a to 2c wish to ride in the vehicle themselves, and users 2d to 2f wish to have their luggage 4 transported.

[0061] The vehicle allocation unit 172 sets extraction conditions for each of the vehicle allocation requests extracted in the vehicle allocation request extraction process S3, i.e., for each of the vehicle allocation requests 22a to 22f of the users 2a to 2f. Here, the extraction condition is that the distance between the transportation origin and the current location of the vehicle 32 is equal to or less than a predetermined distance. Therefore, extraction conditions 24a to 24f shown by dashed arcs in FIG. 8 are set for each of the vehicle allocation requests 22a to 22f of the users 2a to 2f.

[0062] The vehicle dispatch unit 172 extracts vehicles 32 that satisfy extraction conditions 24a to 24f for each of the vehicle dispatch requests 22a to 22f of users 2a to 2f. For example, the vehicles 32 that satisfy extraction condition 24a for user 2a's vehicle dispatch request 22a are vehicles 32a, 32b, 32c, 32d, and 32e. The vehicles 32 that satisfy extraction condition 24b for user 2b's vehicle dispatch request 22b are vehicles 32e, 32f, 32g, 32h, and 32i. The vehicles 32 that satisfy extraction condition 24c for user 2c's vehicle dispatch request 22c are vehicles 32d, 32e, 32f, 32h, and 32i. The vehicles 32 that satisfy extraction condition 24d for user 2d's vehicle dispatch request 22d are vehicles 32d, 32e, 32f, and 32i. Furthermore, the vehicles 32 that satisfy the extraction condition 24e of the vehicle allocation request 22e of user 2e are vehicles 32d, 32h, and 32i. Furthermore, the vehicles 32 that satisfy the extraction condition 24f of the vehicle allocation request 22f of user 2f are vehicles 32d, 32i, and 32j. The vehicle allocation unit 172 extracts all of the vehicles 32a, 32b, 32c, 32d, 32e, 32f, 32g, 32h, 32i, and 32j that satisfy any of the extraction conditions 24a to 24f for each of the vehicle allocation requests 22a to 22f and are surrounded by solid lines in FIG. 8, and excludes vehicle 32k that does not satisfy any of the extraction conditions 24a to 24f as a vehicle 32 that may not be allocated.

[0063] (Pair generation process S5) For each vehicle dispatch request 22 extracted in the vehicle dispatch request extraction process S3, the vehicle dispatch unit 172 extracts at least one pair candidate vehicle that satisfies a predetermined pairing condition from the vehicles 32a, 32b, 32c, 32d, 32e, 32f, 32g, 32h, 32i, and 32j extracted in the vehicle extraction process S4, and associates the extracted pair candidate vehicle with the vehicle dispatch request 22. Here, the pairing condition is that the allowable items of the vehicle 32 conform to all of the setting items of the vehicle dispatch request 22. For example, if the vehicle attribute included in the setting items of the vehicle dispatch request 22 is "sliding door compatible," the vehicle dispatch unit 172 determines that the vehicle 32 is "suitable" if the allowable items of the vehicle 32 include sliding doors. Furthermore, for example, if the transportation target in the vehicle dispatch request 22 is baggage 4, and the allowable items of the vehicle 32 include information that "baggage not permitted," the vehicle dispatch unit 172 determines that the vehicle is "not suitable." The vehicle allocation unit 172 determines that the vehicle 32 does not satisfy the pairing conditions if any of the allowable items of the vehicle 32 do not match the setting items of the vehicle allocation request 22. On the other hand, if the allowable items of the vehicle 32 match all of the setting items of the vehicle allocation request 22, the vehicle allocation unit 172 associates the vehicle 32 with the vehicle allocation request 22 as a pair candidate vehicle that satisfies the pairing conditions of the vehicle allocation request 22.

[0064] Fig. 9 is a first explanatory diagram for explaining the pair generation process. Fig. 10A is a second explanatory diagram for explaining the pair generation process. Fig. 10B is a third explanatory diagram for explaining the pair generation process. Here, it is assumed that all of the vehicles 32a, 32b, 32c, 32d, 32e, 32f, 32g, 32h, 32i, and 32j extracted by the vehicle allocation unit 172 are compatible with the setting items of the vehicle allocation requests 22a to 22f of the users 2a to 2f.

[0065] 9, in response to the vehicle allocation request 22a of the user 2a, the vehicle allocation unit 172 extracts vehicles 32 that satisfy the pairing conditions of the vehicle allocation request 22a from the vehicles 32a, 32b, 32c, 32d, 32e, 32f, 32g, 32h, 32i, and 32j, and sets these vehicles as pair candidate vehicles 232a, 232b, 232c, 232d, 232e, 232f, 232g, 232h, 232i, and 232j. Then, the vehicle allocation unit 172 associates the pair candidate vehicles 232a, 232b, 232c, 232d, 232e, 232f, 232g, 232h, 232i, and 232j with the vehicle allocation request 22a of the user 2a. Similarly, the vehicle allocation unit 172 associates pair candidate vehicles 232a, 232b, 232c, 232d, 232e, 232f, 232g, 232h, 232i, and 232j with the vehicle allocation requests 22b to 22f of users 2b to 2f. In this way, one or more pair candidate vehicles 232 are associated with each of the vehicle allocation requests 22a to 22f, as shown in FIG. 10A.

[0066] Here, the vehicle dispatch unit 172 determines whether the vehicle 32 is compatible with all the setting items of the vehicle dispatch request 22. However, this is not limited to the above case. If the vehicle dispatch unit 172 has already determined the compatibility of some of the setting items, such as the desired vehicle dispatch or the sales office, the vehicle dispatch unit 172 may omit determining the compatibility of those setting items. In this way, the processing load on the vehicle dispatch management server 50 can be reduced.

[0067] Next, the vehicle allocation unit 172 estimates the estimated arrival time of the associated pair candidate vehicle 232 at the transportation source for each of the vehicle allocation requests 22a to 22f, and associates it with each of the pair candidate vehicles 232. Since the positional relationship between the user 2 who made the vehicle allocation request 22 and the vehicle 32 differs for each vehicle allocation request 22, the estimated arrival time will differ for each vehicle allocation request 22 even for the same pair candidate vehicle 232.

[0068] Next, the vehicle allocation unit 172 sets a vehicle priority, which is the priority of the target vehicle 32, for the pair candidate vehicle 232 associated with each vehicle allocation request 22. Here, the vehicle priority indicates the order in which the vehicle should be selected as a vehicle to be allocated. When setting the vehicle priority, the vehicle allocation unit 172 recalculates the estimated time of arrival at the transportation origin. At this time, the shorter the recalculated estimated time of arrival, the higher the vehicle priority. The recalculated estimated time of arrival may be calculated by dividing the Euclidean distance by a predetermined speed, as in the case of the extraction condition. Alternatively, the recalculated estimated time of arrival may be calculated by taking into account the travel time of the vehicle 32 taking into account the route until the vehicle 32 arrives at the transportation origin. Furthermore, the vehicle allocation unit 172 may derive the travel time by taking into account, in addition to the route, the traveling direction of the vehicle 32 at the time of extraction of the vehicle 32, the stop time at traffic lights along the route, and the like. Therefore, the vehicle allocation unit 172 can set the vehicle priority using an estimated time of arrival that is equivalent to or more accurate than the estimated time of arrival based on the Euclidean distance used by the vehicle allocation unit 172 as an extraction condition.

[0069] For example, as shown in Figures 10A and 10B, the vehicle dispatch unit 172 rearranges the pair candidate vehicles 232a, 232b, 232c, 232d, 232e, 232f, 232g, 232h, 232i, and 232j associated with the vehicle dispatch request 22a into pair candidate vehicles 232b, 232d, 232c, 232e, 232a, 232f, 232i, 232h, 232g, and 232j in order of shortest recalculated estimated arrival time. Similarly, the vehicle dispatch unit 172 rearranges the pair candidate vehicles 232a, 232b, 232c, 232d, 232e, 232f, 232g, 232h, 232i, and 232j associated with the vehicle dispatch request 22b into pair candidate vehicles 232i, 232h, 232f, 232e, 232g, 232d, 232a, 232b, 232j, and 232c in order of shortest recalculated estimated arrival time. In addition, the vehicle dispatch unit 172 rearranges the pair candidate vehicles 232a, 232b, 232c, 232d, 232e, 232f, 232g, 232h, 232i, and 232j associated with the vehicle dispatch request 22c into pair candidate vehicles 232i, 232e, 232d, 232f, 232h, 232g, 232c, 232b, 232j, and 232a in order of the shortest recalculated estimated arrival time. In addition, the vehicle dispatch unit 172 rearranges the pair candidate vehicles 232a, 232b, 232c, 232d, 232e, 232f, 232g, 232h, 232i, and 232j associated with the vehicle dispatch request 22d into pair candidate vehicles 232d, 232i, 232e, 232f, 232h, 232c, 232b, 232a, 232g, and 232j in order of shortest recalculated estimated arrival time. In addition, the vehicle dispatch unit 172 rearranges the pair candidate vehicles 232a, 232b, 232c, 232d, 232e, 232f, 232g, 232h, 232i, and 232j associated with the vehicle dispatch request 22e into pair candidate vehicles 232i, 232h, 232d, 232j, 232f, 232e, 232g, 232c, 232b, and 232a in order of the shortest recalculated estimated arrival time. In addition, the vehicle dispatch unit 172 rearranges the pair candidate vehicles 232a, 232b, 232c, 232d, 232e, 232f, 232g, 232h, 232i, and 232j associated with the vehicle dispatch request 22f into pair candidate vehicles 232d, 232i, 232j, 232h, 232e, 232c, 232f, 232b, 232g, and 232a in order of shortest recalculated estimated arrival time.

[0070] 10B, vehicle priorities are assigned to one or more pair candidate vehicles 232 for each of the vehicle allocation requests 22a to 22f, and one or more combinations of vehicle allocation requests 22 and pair candidate vehicles 232 are generated. Here, it can be seen that the vehicle priorities of the pair candidate vehicles 232 corresponding to each of the vehicle allocation requests 22a to 22f differ depending on the positional relationship between the users 2a to 2f and the pair candidate vehicles 232.

[0071] 10B, one or more pair candidate vehicles 232 are associated with each of the vehicle allocation requests 22a to 22f in a state where vehicle priorities are assigned, i.e., in the order of shortest estimated arrival times at the transportation origin. Therefore, the vehicle allocation management server 50 can assign a vehicle 32 with the shortest estimated arrival time at the transportation origin by extracting pair candidate vehicles 232 in the order of highest vehicle priority for each of the vehicle allocation requests 22a to 22f.

[0072] Furthermore, here, all vehicles 32 available for dispatch are associated with each of the dispatch requests 22a to 22f, and vehicle priority levels are set. This is because there are cases where the dispatch target vehicle 32 cannot accept the dispatch request. For example, suppose that the vehicle 32 is cruising, accepting a ride request from a user 2 it finds on the road, and simultaneously receives a ride request from a user 2 nearby the road along with the dispatch request 22 from users 2a to 2f. In this case, the vehicle 32 cannot accept the dispatch request 22 because it must pick up the nearby user 2. Therefore, even if the dispatch target vehicle 32 cannot accept the dispatch request for some reason, the dispatch management server 50 can efficiently assign a vehicle 32 with a short estimated time of arrival at the transportation source to each of the dispatch requests 22a to 22f by extracting the pair candidate vehicle 232 with the second (next) highest vehicle priority level.

[0073] However, depending on the relative positions of the user 2 and the vehicle 32, the pair candidate vehicle 232i with the highest vehicle priority may overlap in the vehicle allocation requests 22b, 22c, and 22e, as shown by the dashed line in Fig. 10B, or the pair candidate vehicle 232d with the highest vehicle priority may overlap in the vehicle allocation requests 22d and 22f, as shown by the dashed line in Fig. 10B. In this case, the vehicle allocation management server 50 will not be able to appropriately assign the pair candidate vehicle 232 as the vehicle to be allocated to the vehicle allocation requests 22b to 22f. Therefore, the vehicle allocation unit 172 matches the vehicle allocation request 22 with the pair candidate vehicle 232.

[0074] (Matching process S6) The vehicle allocation unit 172 matches the vehicle allocation requests 22 with the pair candidate vehicles 232 for a plurality of combinations obtained by multiplying the vehicle allocation requests 22 and the pair candidate vehicles 232 associated in the pair generation process S5. In this matching process, the vehicle allocation requests 22 are matched with the pair candidate vehicles 232 so that one pair candidate vehicle with the highest vehicle priority among the at least one pair candidate vehicle 232 associated with each vehicle allocation request 22 does not overlap with at least one pair candidate vehicle 232 associated with another vehicle allocation request 22. For example, the vehicle allocation unit 172 exclusively matches, for each of the vehicle allocation requests 22a to 22f, the pair candidate vehicle 232 with the shortest average (or total) estimated arrival time at the transportation source.

[0075] Furthermore, in this embodiment, the vehicle allocation unit 172 matches pair candidate vehicles 232 with vehicle allocation requests 22a to 22c whose transportation target is user 2, prioritizing them over vehicle allocation requests 22d to 22f whose transportation target is baggage 4. In this way, the priority set for a vehicle allocation request is referred to as a "request priority" to distinguish it from a "vehicle priority." Here, vehicle allocation requests 22a to 22c whose transportation target is user 2 have a higher request priority than vehicle allocation requests 22d to 22f whose transportation target is baggage 4. Therefore, for vehicle allocation requests 22a to 22c with a high request priority, the vehicle allocation unit 172 matches pair candidate vehicles 232 with vehicle allocation requests 22 whose transportation target is user 2, so as not to overlap with one pair candidate vehicle 232 with the highest vehicle priority in another vehicle allocation request 22 whose transportation target is user 2. Then, after completing the matching of the vehicle allocation requests 22a to 22c in which the transportation target is user 2, the vehicle allocation unit 172 matches the vehicle allocation requests 22d to 22f in which the transportation target is baggage 4 and which have a low request priority, with the pair candidate vehicles 232 so as not to overlap with the one pair candidate vehicle 232 with the highest vehicle priority in the other vehicle allocation requests 22. In this way, the vehicle allocation unit 172 first performs matching for the vehicle allocation requests 22a to 22c in which the transportation target is user 2.

[0076] FIG. 11A is a first explanatory diagram illustrating the matching process, FIG. 11B is a second explanatory diagram illustrating the matching process, and FIG. 11C is a third explanatory diagram illustrating the matching process. As shown in FIG. 11A, one or more pair candidate vehicles 232 are associated with each of the vehicle allocation requests 22a to 22c, with vehicle priority assigned. Here, the vehicle allocation unit 172 attempts to extract the pair candidate vehicle 232 with the highest vehicle priority as the vehicle to be allocated for each of the vehicle allocation requests 22a to 22c. In other words, by extracting pair candidate vehicle 232b for vehicle allocation request 22a, pair candidate vehicle 232i for vehicle allocation request 22b, and pair candidate vehicle 232i for vehicle allocation request 22c, the vehicle allocation unit 172 can assign a vehicle 32 with the shortest estimated time of arrival at the transportation source to each of the vehicle allocation requests 22a to 22c.

[0077] Here, the pair candidate vehicle 232b of the vehicle allocation request 22a does not overlap with the pair candidate vehicle 232i with the highest vehicle priority in the other vehicle allocation requests 22b and 22c. Therefore, the vehicle allocation unit 172 may confirm the pair candidate vehicle 232b of the vehicle allocation request 22a as the vehicle to be allocated. However, the pair candidate vehicle 232i with the highest vehicle priority overlaps in the vehicle allocation requests 22b and 22c. Even if the same pair candidate vehicle 232i is simultaneously assigned as the vehicle to be allocated to multiple vehicle allocation requests 22b and 22c, the pair candidate vehicle 232i cannot simultaneously accept both vehicle allocation requests 22b and 22c.

[0078] Therefore, the vehicle allocation unit 172 performs an exclusion process to change the combinations of the vehicle allocation requests 22b, 22c and the pair candidate vehicles 232 so that the pair candidate vehicles 232 with the highest vehicle priority levels in the vehicle allocation requests 22b, 22c are different. Specifically, the vehicle allocation unit 172 assigns the pair candidate vehicle 232i to one of the vehicle allocation requests 22b, 22c in which the pair candidate vehicle 232i overlaps. Then, for the other vehicle allocation requests 22, the vehicle allocation unit 172 assigns the pair candidate vehicle 232 with a lower vehicle priority level until the other vehicle allocation requests 22 and the pair candidate vehicles 232 no longer overlap.

[0079] For example, as shown in FIG. 11B, the vehicle allocation unit 172 assigns pair candidate vehicle 232i to vehicle allocation request 22b, and assigns pair candidate vehicle 232e, which has the next highest vehicle priority after pair candidate vehicle 232i, to vehicle allocation request 22c. In this manner, the combinations in which pair candidate vehicles 232b, 232i, and 232e are assigned to vehicle allocation requests 22a to 22c are defined as pair group A. Similarly, as shown in FIG. 11C, the vehicle allocation unit 172 assigns 232i to vehicle allocation request 22c, and assigns pair candidate vehicle 232h, which has the next highest vehicle priority after pair candidate vehicle 232i, to vehicle allocation request 22b. In this manner, the combinations in which pair candidate vehicles 232b, 232h, and 232i are assigned to vehicle allocation requests 22a to 22c are defined as pair group B. In this manner, it is possible to avoid duplicate assignment of pair candidate vehicles 232 with the highest vehicle priority to vehicle allocation requests 22a to 22c in each of pair groups A and B.

[0080] For example, for each of pair groups A and B, the vehicle allocation unit 172 adds up the estimated arrival times of the vehicles at the transportation source for all combinations of the vehicle allocation request 22 and the pair candidate vehicles 232. Then, the vehicle allocation unit 172 identifies the pair group with the shorter total estimated arrival time as a matching result for the combination of the vehicle allocation request 22 and the vehicle to be allocated. For example, assume that the total estimated arrival times for pair groups A and B are such that pair group B is smaller than pair group A. In this case, the vehicle allocation unit 172 identifies pair group B with the shorter total estimated arrival time as a matching result. When a pair group (for example, pair group B) is identified as a matching result by the matching of the vehicle allocation unit 172, the combination of pair group B is reflected, and pair candidate vehicle 232b becomes the vehicle to be allocated for vehicle allocation request 22a, pair candidate vehicle 232h becomes the vehicle to be allocated for vehicle allocation request 22b, and pair candidate vehicle 232i becomes the vehicle to be allocated for vehicle allocation request 22c.

[0081] Note that the vehicle allocation unit 172 maintains the vehicle priority of the pair candidate vehicles 232 associated with the vehicle allocation requests 22a to 22c even after pair group B is identified as the matching result. This is because, as described above, if the vehicle 32 selected as the vehicle to be allocated cannot accept the vehicle allocation request for some reason, the pair candidate vehicle 232 with the second highest vehicle priority is extracted as the vehicle to be allocated.

[0082] FIG. 12A is a first explanatory diagram illustrating the processing of the vehicle allocation unit 172, and FIG. 12B is a second explanatory diagram illustrating the processing of the vehicle allocation unit 172. As described above, when a pair group is identified and the pair candidate vehicle 232 with the highest vehicle priority is exclusively determined for the vehicle allocation requests 22a to 22c, the pair candidate vehicle 232 is deleted from the pair candidate vehicles 232 associated with other vehicle allocation requests 22. This is because, in one matching process, the pair candidate vehicle 232 has only one opportunity to become a vehicle to be allocated. In other words, once the vehicle terminal control unit 174 notifies the pair candidate vehicle 232 of information indicating that the pair candidate vehicle 232 has become a vehicle to be allocated, the vehicle terminal control unit 174 does not thereafter notify the pair candidate vehicle 232 of information indicating that the pair candidate vehicle 232 has become a vehicle to be allocated for another vehicle allocation request 22, regardless of whether the vehicle allocation request 22 is accepted. Therefore, a pair candidate vehicle 232 that has already become a vehicle to be allocated for a vehicle allocation request 22 will not become a vehicle to be allocated for another vehicle allocation request 22. In this way, for example, pair candidate vehicles 232b, 232h, and 232i matched with vehicle allocation requests 22a to 22c are deleted from pair candidate vehicles associated with other vehicle allocation requests 22, as shown in Fig. 12A. In this way, new combinations are generated in which pair candidate vehicles 232 are associated with each of vehicle allocation requests 22a to 22f in descending order of vehicle priority, as shown in Fig. 12B. Next, vehicle allocation unit 172 performs matching for vehicle allocation requests 22d to 22f in which the transportation target is cargo 4.

[0083] Fig. 13A is a first explanatory diagram for explaining the matching process, Fig. 13B is a second explanatory diagram for explaining the matching process, Fig. 13C is a third explanatory diagram for explaining the matching process, Fig. 13D is a fourth explanatory diagram for explaining the matching process, and Fig. 13E is a fifth explanatory diagram for explaining the matching process. As shown by the dashed lines in Fig. 13A, in vehicle allocation requests 22d to 22f after pair candidate vehicles 232b, 232h, and 232i matched with vehicle allocation requests 22a to 22c are deleted from pair candidate vehicles 232, pair candidate vehicle 232d, which has the highest vehicle priority, is duplicated.

[0084] The vehicle allocation unit 172 allocates the pair candidate vehicle 232d to one of the vehicle allocation requests 22d to 22f in which the pair candidate vehicle 232d overlaps, similar to the vehicle allocation requests 22a to 22c. Then, for the other vehicle allocation requests 22, the vehicle allocation unit 172 allocates pair candidate vehicles 232 with lower vehicle priorities until the other vehicle allocation requests 22 and the pair candidate vehicles 232 no longer overlap.

[0085] 13B, the vehicle allocation unit 172 assigns pair candidate vehicle 232d to vehicle allocation request 22d, assigns pair candidate vehicle 232j, which has the next highest vehicle priority after pair candidate vehicle 232d, to vehicle allocation request 22e, and assigns pair candidate vehicle 232e, which has the next highest vehicle priority after pair candidate vehicles 232d and 232j, to vehicle allocation request 22f. In this manner, the combinations in which pair candidate vehicles 232d, 232j, and 232e are assigned to vehicle allocation requests 22d to 22f are defined as pair group C. Similarly, as shown in FIG. 13C, the vehicle allocation unit 172 assigns pair candidate vehicle 232d to vehicle allocation request 22d, assigns pair candidate vehicle 232j, which has the next highest vehicle priority after pair candidate vehicle 232d, to vehicle allocation request 22f, and assigns pair candidate vehicle 232f, which has the next highest vehicle priority after pair candidate vehicles 232d and 232j, to vehicle allocation request 22e. In this way, the combinations in which pair candidate vehicles 232d, 232f, and 232j are assigned to vehicle allocation requests 22d to 22f are referred to as pair group D. Similarly, the combinations in which pair candidate vehicles 232e, 232d, and 232j are assigned to vehicle allocation requests 22d to 22f are referred to as pair group E, and the combinations in which pair candidate vehicles 232e, 232j, and 232d are assigned to vehicle allocation requests 22d to 22f are referred to as pair group F. In this way, it is possible to avoid duplicate assignment of pair candidate vehicles with the highest vehicle priority to vehicle allocation requests 22d to 22f in each of pair groups C to F.

[0086] As with pair groups A and B, the vehicle allocation unit 172 adds up the estimated arrival times of the vehicles 32 at the transportation origin for all combinations of the vehicle allocation request 22 and the pair candidate vehicles 232 for each of pair groups C to F. Then, the vehicle allocation unit 172 identifies the pair group with the shortest estimated arrival time as a matching result for the combination of the vehicle allocation request 22 and the vehicle to be allocated. For example, suppose that the total estimated arrival times for pair groups C to F are in the relationship of pair group F < pair group E < pair group C < pair group D. In this case, the vehicle allocation unit 172 identifies pair group F with the shortest estimated arrival time as the matching result. When a pair group (for example, pair group F) is identified as a matching result by the matching of the vehicle allocation unit 172, the combination of pair group F is reflected, and pair candidate vehicle 232e becomes the vehicle to be allocated for vehicle allocation request 22d, pair candidate vehicle 232j becomes the vehicle to be allocated for vehicle allocation request 22e, and pair candidate vehicle 232d becomes the vehicle to be allocated for vehicle allocation request 22f.

[0087] In addition, if the vehicle 32 that has become the vehicle to be allocated is unable to accept the allocation request for some reason, the allocation unit 172 extracts the pair candidate vehicle 232 with the second highest vehicle priority as the vehicle to be allocated, and therefore, just as when pair group B is identified as the matching result, even after pair group F is identified as the matching result, the vehicle priority of the pair candidate vehicles 232 associated with the allocation requests 22d to 22f is maintained.

[0088] 14A is a first explanatory diagram illustrating the processing of the vehicle allocation unit 172, and FIG. 14B is a second explanatory diagram illustrating the processing of the vehicle allocation unit 172. As described above, when a pair group is identified and the pair candidate vehicle 232 with the highest vehicle priority is exclusively determined for the vehicle allocation requests 22d to 22f, the pair candidate vehicle 232 is deleted from the pair candidate vehicles 232 associated with the other vehicle allocation requests 22. In this way, for example, pair candidate vehicles 232e, 232j, and 232d matched with the vehicle allocation requests 22d to 22f are deleted from the pair candidate vehicles 232 associated with the other vehicle allocation requests 22, as shown in FIG. 14A. In this way, new combinations are generated in which pair candidate vehicles 232 are associated with each of the vehicle allocation requests 22a to 22f in descending order of vehicle priority, as shown in FIG. 14B.

[0089] Fig. 15 is an explanatory diagram showing the results of matching by vehicle allocation unit 172. When pair groups (for example, pair group B, pair group F) are identified as matching results by matching by vehicle allocation unit 172, as shown in Fig. 15, pair candidate vehicle 232b becomes the vehicle to be allocated for vehicle allocation request 22a, pair candidate vehicle 232h becomes the vehicle to be allocated for vehicle allocation request 22b, pair candidate vehicle 232i becomes the vehicle to be allocated for vehicle allocation request 22c, pair candidate vehicle 232e becomes the vehicle to be allocated for vehicle allocation request 22d, pair candidate vehicle 232j becomes the vehicle to be allocated for vehicle allocation request 22e, and pair candidate vehicle 232d becomes the vehicle to be allocated for vehicle allocation request 22f.

[0090] Here, an example has been described in which matching is performed so that the pair candidate vehicles 232 with the highest vehicle priority do not overlap between vehicle allocation requests 22. However, as can be understood with reference to FIG. 14B , there may be cases where the pair candidate vehicles 232 with the second highest vehicle priority (e.g., pair candidate vehicles 232c and 232f) overlap. Here, if the pair candidate vehicles 232 with the second highest vehicle priority overlap between vehicle allocation requests 22, matching may not be performed for the pair candidate vehicles 232. This is for the following reason. The pair candidate vehicle 232 with the highest vehicle priority is assigned to the vehicle allocation request 22 as the vehicle to be allocated, and the pair candidate vehicle 232 with the second highest vehicle priority is merely a backup in case the pair candidate vehicle 232 with the highest vehicle priority does not accept the vehicle allocation request 22. Nevertheless, there may be cases in which vehicle allocation is not efficient if the pair candidate vehicle 232 with the second highest vehicle priority is exclusively associated with the vehicle allocation request 22.

[0091] 14B, the pair candidate vehicle 232 with the second highest vehicle priority is pair candidate vehicle 232c. Suppose the vehicle allocation unit 172 matches the vehicle allocation requests 22a and 22f with the pair candidate vehicle 232c with the second highest vehicle priority, and for example, the pair candidate vehicle 232 with the second highest vehicle priority for vehicle allocation request 22a is set to pair candidate vehicle 232c, and the pair candidate vehicle 232 with the second highest vehicle priority for vehicle allocation request 22f is changed from pair candidate vehicle 232c to pair candidate vehicle 232f. Then, the pair candidate vehicles 232 for vehicle allocation request 22a are arranged in descending order of vehicle priority, as {232b, 232c, 232a, ...}, and the pair candidate vehicles 232 for vehicle allocation request 22f are arranged in descending order of vehicle priority, as {232d, 232f, 232g, ...}, with pair candidate vehicle 232c removed.

[0092] For example, suppose that pair candidate vehicle 232b, which has the highest vehicle priority, accepts vehicle allocation request 22a, and pair candidate vehicle 232d, which has the highest vehicle priority, does not accept vehicle allocation request 22f. In this case, pair candidate vehicle 232c, which has the second highest vehicle priority, is not selected as the vehicle to be allocated for vehicle allocation request 22a, and pair candidate vehicle 232f, which has the second highest vehicle priority, is selected as the vehicle to be allocated for vehicle allocation request 22f. However, pair candidate vehicle 232c, which has a higher vehicle priority than pair candidate vehicle 232f, should be selected as the vehicle to be allocated for vehicle allocation request 22f. In this way, it is not advisable to match pair candidate vehicle 232, which has the second highest vehicle priority, with vehicle allocation request 22f in mind, when it is unclear whether pair candidate vehicle 232, which has the highest vehicle priority, will accept vehicle allocation request 22a.

[0093] Therefore, the vehicle allocation unit 172 does not perform matching for pair candidate vehicles 232 other than the pair candidate vehicle 232 with the highest vehicle priority order, and allows overlapping pair candidate vehicles 232 between vehicle allocation requests 22. In this way, even if the pair candidate vehicle 232 with the highest vehicle priority order does not accept the vehicle allocation request 22, it is possible to appropriately allocate the pair candidate vehicle 232 with the second highest vehicle priority order.

[0094] Note that if matching is not performed for pair candidate vehicles 232 other than the pair candidate vehicle 232 with the highest vehicle priority, multiple pair candidate vehicles 232 may become vehicles to be allocated for a vehicle allocation request 22. For example, in the example of Figure 14B, pair candidate vehicle 232b matched with vehicle allocation request 22a may not accept vehicle allocation request 22a, and pair candidate vehicle 232d matched with vehicle allocation request 22f may not accept vehicle allocation request 22f. In this case, the pair candidate vehicle 232 with the second highest vehicle priority in vehicle allocation requests 22a and 22f will both be pair candidate vehicle 232c.

[0095] However, it is unlikely, or rather rare, that the timing when pair candidate vehicle 232b refuses to accept vehicle allocation request 22a and the timing when pair candidate vehicle 232d refuses to accept vehicle allocation request 22f will occur at exactly the same time. Here, the vehicle allocation management server 50 designates the pair candidate vehicle 232 with the second-highest vehicle priority as the vehicle to be allocated for the vehicle allocation request 22 whose acceptance was previously refused, and deletes this pair candidate vehicle 232 from the pair candidate vehicles 232 associated with other vehicle allocation requests 22. For example, first, assume that pair candidate vehicle 232b matched with vehicle allocation request 22a does not accept vehicle allocation request 22a, and then pair candidate vehicle 232d matched with vehicle allocation request 22f also does not accept vehicle allocation request 22f. In this case, the vehicle allocation management server 50 designates pair candidate vehicle 232c as the vehicle to be allocated for vehicle allocation request 22a whose acceptance was previously refused, and deletes pair candidate vehicle 232c from the pair candidate vehicles associated with vehicle allocation request 22f. In this way, for example, the pair candidate vehicle 232c will not be the vehicle to be allocated for the vehicle allocation request 22f, and therefore the pair candidate vehicle 232 will not be the vehicle to be allocated for all vehicle allocation requests 22 in duplicate.

[0096] Note that the matching algorithm between the vehicle allocation requests 22 and the pair candidate vehicles 232 is not limited to the above case, and various matching algorithms can be applied as long as at least one pair candidate vehicle 232 in each vehicle allocation request 22, in particular the pair candidate vehicle 232 with the highest vehicle priority, does not overlap with the pair candidate vehicle 232 with the highest vehicle priority in another vehicle allocation request 22. For example, the vehicle allocation unit 172 estimates the estimated arrival time of the vehicle at the transportation source for all combinations of the vehicle allocation request 22 and the pair candidate vehicle 232 for each of a plurality of pair groups A and B. Then, the vehicle allocation unit 172 may identify as the matching result the pair group among the pair groups A and B (or the pair groups C to F) in which the combination of the vehicle allocation request 22 and the pair candidate vehicle 232 with the longest estimated arrival time is the shortest. Furthermore, the vehicle allocation unit 172 may add up the distances (travel distances) to the transportation origin of the vehicles for all combinations of the vehicle allocation request 22 and the pair candidate vehicles 232 for each of the pair groups A and B (or pair groups C to F). In this case, the vehicle allocation unit 172 identifies the pair group with the shortest total distance as the matching result. Note that an existing matching algorithm may be used as the matching algorithm for the vehicle allocation request 22 and the pair candidate vehicles 232.

[0097] As described above, the vehicle dispatching unit 172 matches pair candidate vehicles 232 by prioritizing vehicle dispatch requests 22a to 22c whose transportation target is user 2 over vehicle dispatch requests 22d to 22f whose transportation target is baggage 4. Therefore, as shown in Fig. 15, it is possible to dispatch vehicles 32 whose estimated arrival times are shorter for vehicle dispatch requests 22a to 22c whose transportation target is user 2, while also appropriately dispatching vehicles 32 for vehicle dispatch requests 22d to 22f whose transportation target is baggage 4.

[0098] Here, an example has been described in which two levels of request priority are set, such that a high request priority is set for a vehicle dispatch request 22 whose transportation target is user 2, while a low request priority is set for a vehicle dispatch request 22 whose transportation target is baggage 4. However, the present invention is not limited to this example, and multiple different request priorities may be set for a vehicle dispatch request 22 whose transportation target is user 2, and multiple different request priorities may be set for a vehicle dispatch request 22 whose transportation target is baggage 4. Furthermore, three or more different request priorities may be set for a vehicle dispatch request 22 whose transportation target is user 2 and a vehicle dispatch request 22 whose transportation target is baggage 4.

[0099] For example, assume that the vehicle allocation management system 1 is set to have 10 levels of request priority (1 to 10). Here, it is assumed that the initial value of the request priority of the vehicle allocation request 22 whose transportation target is the user 2 is "5," and the initial value of the request priority of the vehicle allocation request 22 whose transportation target is the cargo 4 is "10." The vehicle allocation unit 172 extracts one or more vehicle allocation requests 22 with the same request priority in descending order of request priority (lowest numerical value) and performs matching. If there are vehicle allocation requests 22 in which the pair candidate vehicles 232 with the highest vehicle priority overlap, the vehicle allocation unit 172 creates multiple pair groups and identifies the pair group with the shortest total estimated arrival time as a matching result, which is a combination of the vehicle allocation request 22 and the vehicle to be allocated. The vehicle allocation unit 172 performs this process for all request priorities. For example, the vehicle allocation unit 172 extracts multiple vehicle allocation requests 22a to 22c whose request priority is "5," performs matching, and identifies pair group B as a matching result, as shown in FIG. 11. Next, the vehicle dispatching unit 172 extracts a plurality of vehicle dispatch requests 22d to 22f with a request priority of "10", performs matching, and identifies pair group F as a matching result, as shown in Fig. 13. With this configuration, it is also possible to dispatch a vehicle 32 with a shorter estimated arrival time preferentially for a vehicle dispatch request 22 whose transportation target is a user 2, and also to dispatch a vehicle 32 appropriately for a vehicle dispatch request 22 whose transportation target is a cargo 4.

[0100] Furthermore, for example, in the taxi business, there may be busy times or congested areas where the supply of vehicles 32 is insufficient to meet the demand for vehicle dispatch. In this case, by paying an additional fee in addition to the regular fee, a user 2 can receive a priority vehicle dispatch service (priority pass) that allows the user 2 to be given priority over other users 2 in vehicle dispatch. A user 2 who uses this priority vehicle dispatch service and pays the additional fee can receive a vehicle earlier than a normal vehicle dispatch request that does not involve the payment of an additional fee. Here, for example, a priority vehicle dispatch service can be realized by setting the request priority of a vehicle dispatch request 22 when using the priority vehicle dispatch service high (for example, to "2").

[0101] FIG. 16A is a first explanatory diagram illustrating the processing of the vehicle allocation unit 172, and FIG. 16B is a second explanatory diagram illustrating the processing of the vehicle allocation unit 172. For example, assume that the vehicle allocation request 22b shown in FIG. 10B uses a priority vehicle allocation service. The vehicle allocation unit 172 first extracts vehicle allocation request 22b with a request priority of "2" as shown in FIG. 16A, performs matching, and assigns pair candidate vehicle 232i with the highest vehicle priority to vehicle allocation request 22b. The vehicle allocation unit 172 then extracts multiple vehicle allocation requests 22a and 22c with a request priority of "5," deletes pair candidate vehicle 232i from the pair candidate vehicles associated with vehicle allocation requests 22a and 22c, and performs matching, assigning pair candidate vehicle 232b with the highest vehicle priority to vehicle allocation request 22a, and assigns pair candidate vehicle 232e with the highest vehicle priority to vehicle allocation request 22c. The vehicle allocation unit 172 then extracts multiple vehicle allocation requests 22d-22f with a request priority of "10," deletes pair candidate vehicles 232i, 232b, and 232e from the pair candidate vehicles associated with vehicle allocation requests 22d-22f, and performs matching. The vehicle allocation unit 172 assigns pair candidate vehicle 232f with the second highest vehicle priority to vehicle allocation request 22d, assigns pair candidate vehicle 232h with the highest vehicle priority to vehicle allocation request 22e, and assigns pair candidate vehicle 232d with the highest vehicle priority to vehicle allocation request 22f. Finally, as indicated by "x" in FIG. 16A, the vehicle allocation unit 172 deletes pair candidate vehicles 232i, 232b, 232e, 232f, 232h, and 232d from the pair candidate vehicles associated with vehicle allocation requests 22a-22f. This configuration, in which vehicles 32 are allocated to vehicle allocation requests 22 in descending order of request priority, enables a prioritized vehicle allocation service to be realized.

[0102] Furthermore, in cases where there are special circumstances, such as when the user 2 needs to ensure that the luggage 4 is delivered to the destination within a specified time, the user 2 can transport the luggage 4 using a priority vehicle dispatch service. For example, if the initial value of the request priority of the vehicle dispatch request 22 for which the transportation target is luggage 4 is "10," the request priority can be increased to "5" by using the priority vehicle dispatch service. For example, assume that the vehicle dispatch request 22e shown in FIG. 10B is a request made using the priority vehicle dispatch service. As shown in FIG. 16B, the vehicle dispatch unit 172 first extracts and matches multiple vehicle dispatch requests 22a, 22b, 22c, and 22e each having a request priority of "5." The vehicle dispatch unit 172 then assigns the pair candidate vehicle 232b with the highest vehicle priority to the vehicle dispatch request 22a, the pair candidate vehicle 232f with the third highest vehicle priority to the vehicle dispatch request 22b, the pair candidate vehicle 232i with the highest vehicle priority to the vehicle dispatch request 22c, and the pair candidate vehicle 232h with the second highest vehicle priority to the vehicle dispatch request 22e. Next, as shown in FIG. 16B, the vehicle allocation unit 172 extracts multiple vehicle allocation requests 22d and 22f with a request priority of "10," deletes pair candidate vehicles 232b, 232f, 232i, and 232h from the pair candidate vehicles 232 associated with vehicle allocation requests 22d and 22f, and performs matching. Then, the vehicle allocation unit 172 assigns pair candidate vehicle 232e, which has the second highest vehicle priority, to vehicle allocation request 22d, and assigns pair candidate vehicle 232d, which has the highest vehicle priority, to vehicle allocation request 22f. Finally, as shown by "x" in FIG. 16B, the vehicle allocation unit 172 deletes pair candidate vehicles 232b, 232f, 232i, 232h, 232e, and 232d from the pair candidate vehicles 232 associated with vehicle allocation requests 22a to 22f. In this way, by setting a high request priority for vehicle allocation requests 22 whose transportation target is baggage 4, it is possible to realize a priority vehicle allocation service even for the transportation of baggage 4.

[0103] In addition, taxi businesses and the like may provide a vehicle dispatch reservation service (AI reservation) in which a vehicle 32 is reserved by specifying a desired boarding location and desired boarding time in advance. However, when a vehicle dispatch request 22 including a vehicle dispatch reservation is received from a user 2, the vehicle 32 is not yet dispatched at the time the vehicle dispatch reservation is received. Then, a predetermined time (e.g., 5 minutes) before the desired boarding time, the vehicle dispatch unit 172 performs a matching process with the other vehicle dispatch requests 22 described above. At this time, for example, by setting the request priority of the vehicle dispatch request 22 including the vehicle dispatch reservation high (e.g., to "3"), it becomes possible to appropriately dispatch a vehicle to the reserved desired boarding location and desired boarding time. Furthermore, if it is expected that there will be few vehicles 32 near the desired boarding location just before the desired boarding time, the request priority may be changed from "3" to "2" to "1" accordingly. In this way, a vehicle dispatch reservation service can be realized by allocating vehicles 32 to vehicle dispatch requests 22 in descending order of request priority.

[0104] Furthermore, as described above, the vehicle allocation unit 172 matches a pair candidate vehicle 232 with a vehicle allocation request 22 whose transportation target is user 2, preferentially over a vehicle allocation request 22 whose transportation target is baggage 4. In other words, a pair candidate vehicle 232 is not matched with a vehicle allocation request 22 whose transportation target is baggage 4. In this case, depending on the number of vehicles 32, a vehicle to be allocated may not be assigned to a vehicle allocation request 22 whose transportation target is baggage 4 at the current execution timing, and the request may be postponed to the next execution timing. However, if the request priority remains "10" at the next execution timing, there is a risk that a vehicle to be allocated may not be assigned. Therefore, for example, the vehicle allocation unit 172 may respond by changing the request priority from "10" to "9" to "8" to "7" to "6" to "5" ... depending on the number of times the matching process has been postponed. In this way, by configuring the system to increase the request priority of a vehicle dispatch request 22 with a low request priority depending on the number of times the matching process is carried over, it is possible to avoid a situation where a vehicle to be dispatched is not assigned to the vehicle dispatch request 22.

[0105] In this way, by matching multiple vehicle dispatch requests 22 with multiple vehicles at once, the relative positions of user 2 and vehicles can be determined comprehensively compared to when vehicle dispatch requests 22 are matched sequentially and individually, enabling more efficient vehicle dispatch.

[0106] (Vehicle dispatch notification process S7) Returning to FIG. 7 , the vehicle terminal control unit 174 of the vehicle dispatch management server 50 controls the vehicle application of the vehicle terminal 30 and performs vehicle dispatch management through the vehicle application. The vehicle terminal control unit 174 notifies the vehicle terminal 30 arranged in the vehicle 32 that has become the dispatch target vehicle for the dispatch request 22 of information indicating that the vehicle 32 has become the dispatch target vehicle (dispatch target notification). This dispatch target notification corresponds to a prompt to the driver 3 of the dispatch target vehicle as to whether or not to accept the dispatch request 22. In this way, the driver 3 of the vehicle 32 recognizes that his / her vehicle 32 has become the dispatch target vehicle, and becomes able to consider whether or not to accept the dispatch request 22.

[0107] (Acceptance response processing S8) When the vehicle dispatch response unit 162 of the vehicle terminal 30 arranged in the vehicle receives information indicating that the vehicle has become a vehicle to be dispatched from the vehicle terminal control unit 174, the vehicle dispatch response unit 162 notifies the driver 3 of this fact, for example, via the display device 134. When notifying the information, the vehicle terminal 30 may also display information about the vehicle dispatch request 22 (for example, the delivery origin, user information about the user 2) on the display device 134. Note that if a delivery destination has been input by the user 2, for example, after the vehicle 32 arrives at the delivery origin of the user 2, the vehicle terminal 30 may display the information about the delivery destination on the display device 134 as information about the vehicle dispatch request 22. When the driver 3 accepts the vehicle dispatch request 22, the driver 3 accepts the vehicle dispatch request 22 via the input device 136 of the vehicle terminal 30, for example, by tapping a position corresponding to a "Request Accept" button displayed on the display device 134. The vehicle allocation response unit 162 transmits to the vehicle allocation management server 50 information (acceptance response) regarding the acceptance of the vehicle allocation request 22, including the acceptance of the vehicle allocation request 22.

[0108] If the driver 3 cannot accept the vehicle allocation request 22 for some reason, the driver 3 taps the "request reject" button displayed on the input device 136 of the vehicle terminal 30 to reject the vehicle allocation request 22, or does not tap the position corresponding to "request accept." The vehicle terminal control unit 174 waits for a predetermined time (e.g., 10 seconds) from the time the vehicle allocation target notification is sent, and if it does not receive information regarding acceptance of the vehicle allocation request 22 (acceptance response) from the vehicle terminal 30 during the waiting time, it determines that the driver 3 of the vehicle to be allocated has not accepted the vehicle allocation request 22. In this case, the vehicle allocation unit 172 determines the vehicle 32 with the second highest vehicle priority among the vehicles 32 associated with the vehicle allocation request 22 in the matching process S6 as the new vehicle to be allocated. Next, the vehicle terminal control unit 174 notifies the vehicle terminal 30 of the other vehicle 32 that has become the new vehicle to be allocated of information indicating that the vehicle has become the vehicle to be allocated (vehicle allocation target notification).

[0109] (Vehicle dispatch completion notification process S9) When the vehicle terminal control unit 174 receives information (acceptance response) regarding acceptance of the vehicle allocation request 22 from the vehicle terminal 30, it confirms the allocation of the vehicle to be allocated in response to the vehicle allocation request 22 and transmits a vehicle allocation completion notification indicating that the vehicle allocation has been confirmed to the vehicle terminal 30. At this time, the display device 134 of the vehicle terminal 30 displays information regarding the vehicle allocation request 22, such as the transportation origin and the route to the transportation origin. With this configuration, the driver 3 of the vehicle 32 can grasp the information regarding the vehicle allocation request 22, travel an appropriate route toward the transportation origin, and quickly find the user 2. Note that when the vehicle to be allocated is a vehicle with requirements (an NRS vehicle or a specified vehicle), the vehicle terminal control unit 174 may display other information, such as the transportation destination, in addition to the transportation origin as information regarding the vehicle allocation request 22 on the display device 134.

[0110] (User vehicle dispatch completion notification process S10) When the user terminal control unit 170 confirms the dispatch of the vehicle to be dispatched in response to the vehicle dispatch request 22, it transmits a vehicle dispatch completion notification to the user terminal 20 indicating that the vehicle dispatch has been confirmed. At this time, the display device 124 of the user terminal 20 displays the location, estimated arrival time, etc. of the vehicle 32 that has become the vehicle to be dispatched. In this way, the user 2 can board the vehicle 32 at the transportation source or hand over the luggage 4. Note that if the vehicle dispatch unit 172 is unable to assign a vehicle to be dispatched in response to the vehicle dispatch request 22, the vehicle dispatch request 22 temporarily enters a vehicle dispatch failed (vehicle dispatch impossible) state. In this case, the display device 124 of the user terminal 20 displays information indicating that the vehicle dispatch was not possible and information indicating that the vehicle dispatch request 22 can be executed again. The user 2 will execute the vehicle dispatch request 22 again based on this information.

[0111] In the vehicle dispatch management method using the vehicle dispatch management system 1 described above, information on a plurality of vehicle dispatch requests 22 and a plurality of vehicles 32 is accumulated and matched at once. In this case, by shortening the accumulation time, the frequency of execution of the vehicle dispatch matching process (S6) can be increased, thereby enabling efficient vehicle dispatch while maintaining convenience for the user 2.

[0112] (Time-based restrictions) In the above embodiment, an example was described in which user 2 issues a vehicle dispatch request 22 to board a vehicle for himself or herself or to have his or her luggage 4 transported, without any time-of-day restrictions on transportation. However, this example is not limiting, and transportation of user 2 or luggage 4 may be restricted (prohibited) depending on the time of day. For example, if transportation of luggage 4 is restricted depending on the time of day, the vehicle dispatch request unit 160 of the user terminal 20 launches a user application for requesting a vehicle dispatch, and enables operation of the "Dispatch" button for user 2 to board a vehicle, but disables operation of the "Delivery" button for transporting luggage 4 (grayed out). In addition, at this time, the vehicle dispatch request unit 160 may display on the display device 124 a notice that transportation of luggage 4 is not being accepted during that time period. Furthermore, even if the user terminal control unit 170 of the vehicle dispatch management server 50 receives a vehicle dispatch request 22 for luggage 4 from the user terminal 20, the vehicle dispatch request 22 will not be stored in the storage device 154 if the time period is a time period during which transportation of luggage 4 is restricted. That is, the vehicle allocation management server 50 does not accept a vehicle allocation request 22 in which the transportation target is cargo 4.

[0113] In the vehicle dispatch management system 1, for example, there may be a situation where there are many users 2 requesting rides themselves, but the number of vehicles 32 is insufficient for the users 2 wishing to ride, or it takes a long time to complete vehicle dispatch. Examples of such situations include weekday mornings, weekend (particularly Friday and Saturday) nights, and specific time periods when the weather conditions are rain, localized heavy rain (guerilla downpours), snow, summer days, midsummer days, scorching hot days, tropical nights, etc. Under such circumstances, the vehicle dispatch management server 50 prioritizes transportation for users 2, and therefore limits the acceptance of vehicle dispatch requests 22 whose transportation target is baggage 4 during that time period. On the other hand, in the vehicle dispatch management system 1, for example, there may be a situation where there are few users 2 requesting rides themselves, resulting in a surplus of vehicles 32 for the users 2 wishing to ride. In this way, when it is possible to allocate a vehicle 32 to transport baggage 4, the vehicle dispatch management server 50 actively accepts vehicle dispatch requests 22 whose transportation target is baggage 4. In this way, the vehicle 32 can transport the luggage 4 by effectively utilizing its free time while maintaining its main purpose of transporting the user 2.

[0114] (Regional restrictions) The vehicle dispatch management server 50 may also limit the transportation of users 2 or luggage 4 by region. For example, in regions where many users 2 are present on weekday mornings and weekend nights, or in regions experiencing rainfall, localized heavy rainfall, snowfall, summer days, midsummer days, scorching hot days, tropical nights, etc., the vehicle dispatch management server 50 may limit the acceptance of vehicle dispatch requests 22 whose transportation target is luggage 4 in order to prioritize transportation of users 2. Furthermore, if the vehicle dispatch management server 50 can estimate in advance the regions and time periods in which rainfall, localized heavy rainfall, or snowfall will occur, it may limit the acceptance of vehicle dispatch requests 22 whose transportation target is luggage 4 to those regions and time periods. In this case, the vehicle dispatch management server 50 may estimate the regions and time periods in which rainfall, localized heavy rain, or snowfall will occur based on, for example, a weather forecast. The region may be set arbitrarily and may be a transportation zone or the business area of ​​an NRS driver. Furthermore, it may also be set to a smaller region than the transportation zone or the business area of ​​an NRS driver. When limiting the acceptance of vehicle dispatch requests 22 for transporting luggage 4 in a region and time period in this way, the vehicle dispatch request unit 160 of the user terminal 20 may display on the display device 124 a message that the vehicle is not accepting transport of luggage 4 in that region and time period. In this way, the vehicle 32 can transport luggage 4 by effectively utilizing its free time while still having the primary purpose of transporting the user 2.

[0115] (Ride-sharing) As described above, the vehicle dispatch management system 1 allows ride-sharing between user 2 and another user 2, between user 2 and another user 2's luggage 4, between user 2's luggage 4 and another user 2, and between user 2's luggage 4 and another user 2's luggage 4. User 2 allows ride-sharing with other user 2 or the luggage 4 of another user 2 by setting ride-sharing permission in the ride-sharing permission information and inputting the origin and destination of transportation.

[0116] In this way, when there is a user 2 that allows ride-sharing, the vehicle dispatch unit 172 aggregates multiple vehicle dispatch requests 22 that allow ride-sharing into one vehicle dispatch request 22, regardless of whether the transportation target is the user 2 or the luggage 4. Next, the vehicle dispatch unit 172 derives a route that passes through all of the transportation origins and destinations in the multiple vehicle dispatch requests 22. The vehicle dispatch unit 172 then compares the fee that each user 2 would pay if the user 2 or the luggage 4 were transported along the route derived in this way with the fee that each user 2 would pay if the user 2 or the luggage 4 were transported individually for the multiple vehicle dispatch requests 22. When the vehicle dispatch unit 172 determines that the fee for all of the target users 2 is cheaper if they share a ride than if they are transported individually, it treats the resulting request as one vehicle dispatch request 22 and executes the processes from the vehicle dispatch request extraction process S3. At this time, the dispatch unit 172 sets the shipping origin of the user 2 or luggage 4 who is picked up first in the ride-sharing as the shipping origin of the consolidated ride-sharing request 22, and sets the shipping destination of the user 2 or luggage 4 who is dropped off last in the ride-sharing as the shipping destination of the consolidated ride-sharing request 22.

[0117] The dispatch unit 172 derives the fare for each user 2 by apportioning the fare for the section of the derived route where ride-sharing is performed between the user 2 and the luggage 4 who are riding together. Here, when the user 2 and the luggage 4 ride together, the fare ratio may be set differently so that the fare for the luggage 4 is cheaper for the section where ride-sharing is performed.

[0118] Here, an example has been described in which, if a user 2 who allows carpooling is present, the vehicle dispatch unit 172 assigns a vehicle to be dispatched at the current execution timing in response to the vehicle dispatch request 22 of the user 2. However, the example is not limited to this. If a user 2 who allows carpooling is present and the transportation target is baggage 4, the vehicle dispatch unit 172 can assign a vehicle to be dispatched whose dispatch was confirmed at the previous execution timing (a predetermined time ago) to the vehicle dispatch request 22. That is, if a vehicle dispatch has already been confirmed at the previous execution timing but the user 2 involved in the vehicle dispatch has allowed carpooling, the baggage 4 to be dispatched may be added later. If a user 2 who allows carpooling is present and the transportation target is baggage 4, the vehicle dispatch unit 172 may, for example, determine whether it is possible to add a vehicle to be dispatched whose dispatch was already confirmed at the previous execution timing, and if it is not possible to add a vehicle to be dispatched at the current execution timing.

[0119] Then, when the dispatch of the vehicle to be dispatched in response to the dispatch request 22 is confirmed, the user terminal control unit 170 transmits a dispatch completion notification indicating that the dispatch has been confirmed to the user terminal 20. At this time, the display device 124 of the user terminal 20 displays the location of the vehicle 32 to be dispatched, the estimated arrival time, the route, passengers (users 2 or luggage 4, and the number of passengers), the fare, etc. Here, when all users 2 included in the ride-sharing approve the ride-sharing, the dispatch is completed, and the vehicle 32 heads for the original transportation source.

[0120] In this way, when multiple vehicle dispatch requests 22 are consolidated into a single vehicle dispatch request 22, the arrival time of the vehicle 32 may be delayed or the route may be longer, but user 2 may be able to use the vehicle 32 at a lower cost. Furthermore, since the transportation distance is longer when multiple vehicle dispatch requests 22 are consolidated, the fee charged by driver 3 per transportation becomes higher. Therefore, if user 2 allows carpooling, both user 2 and driver 3 can improve the economic effect and the efficiency of vehicle dispatch. Therefore, when multiple vehicle dispatch requests 22 are consolidated into a single vehicle dispatch request 22, the dispatch unit 172 may increase the request priority of the vehicle dispatch request 22. For example, when a vehicle dispatch request 22 whose transportation target is user 2 and a vehicle dispatch request 22 whose transportation target is cargo 4 are consolidated, the request priority of the vehicle dispatch request 22 whose transportation target is user 2 is originally set to "5." However, when multiple vehicle dispatch requests 22 are combined into one vehicle dispatch request 22, the vehicle dispatch unit 172 increases the request priority of the vehicle dispatch request 22, for example, to "4." In this way, when there is a user 2 who is willing to share a ride, it becomes possible to prioritize the ride. Note that the cases in which the request priority of the vehicle dispatch request 22 is increased in this way are not limited to the case in which a vehicle dispatch request 22 whose transportation target is user 2 is combined with a vehicle dispatch request 22 whose transportation target is baggage 4, but also include the case in which multiple vehicle dispatch requests 22 whose transportation target is user 2 are combined, and the case in which multiple vehicle dispatch requests 22 whose transportation target is baggage 4 are combined.

[0121] Here, by performing ride-sharing, the user 2 can use the vehicle 32 at a discounted rate, and the driver 3 can increase the fee he / she receives for each transport. Also, for the user 2, ride-sharing with luggage 4 requires less care than ride-sharing with another user 2. In this way, allowing ride-sharing with luggage 4 encourages ride-sharing.

[0122] In this way, the vehicle dispatch management system 1 includes a user terminal 20 and a vehicle dispatch management device (e.g., a vehicle dispatch management server 50) that can communicate with the user terminal 20 via a network 6. The user terminal 20 includes one or more first processors (e.g., a CPU), and the vehicle dispatch management device includes one or more second processors (e.g., a CPU). The first processor sends either a first vehicle dispatch request (e.g., vehicle dispatch requests 22a to 22c) whose transportation object is a person (e.g., user 2) or a second vehicle dispatch request (e.g., vehicle dispatch requests 22d to 22f) whose transportation object is an object (e.g., luggage 4) to the vehicle dispatch management device in response to user input. The second processor acquires the first and second vehicle dispatch requests from the multiple user terminals 20 and allocates a vehicle 32 (pair candidate vehicle 232) to the first vehicle dispatch request with priority over the second vehicle dispatch request. With this configuration, it is possible to prioritize dispatching a vehicle 32 with a short estimated arrival time in response to a dispatch request 22 in which the transportation target is a user 2, while also appropriately dispatching a vehicle 32 in response to a dispatch request 22 in which the transportation target is a cargo 4. Furthermore, by having a vehicle 32 belonging to a taxi business transport the cargo 4, efficient and high-value-added transportation becomes possible.

[0123] Furthermore, a vehicle dispatch management device (e.g., vehicle dispatch management server 50) capable of communicating with user terminal 20 via network 6 includes one or more processors (e.g., CPUs), and the processor acquires, from multiple user terminals 20, first vehicle dispatch requests (e.g., vehicle dispatch requests 22a-22c) whose transportation target is a person (e.g., user 2) and second vehicle dispatch requests (e.g., vehicle dispatch requests 22d-22f) whose transportation target is an object (e.g., baggage 4), and allocates a vehicle 32 (pair candidate vehicle 232) to the first vehicle dispatch request with priority over the second vehicle dispatch request. With this configuration, it is possible to prioritize dispatching a vehicle 32 with a shorter estimated arrival time for a vehicle dispatch request 22 whose transportation target is user 2, while also appropriately dispatching a vehicle 32 for a vehicle dispatch request 22 whose transportation target is baggage 4.

[0124] The processor may allocate a vehicle 32 to a first vehicle allocation request (e.g., vehicle allocation requests 22a to 22c), and after completing the allocation of the first vehicle allocation request, allocate a vehicle 32 to a second vehicle allocation request (e.g., vehicle allocation requests 22d to 22f). With this configuration, it is possible to prioritize the allocation of a vehicle 32 with a short estimated arrival time for a vehicle allocation request 22 in which the transportation target is a user 2, while also appropriately allocating a vehicle 32 to a vehicle allocation request 22 in which the transportation target is a cargo 4.

[0125] The vehicle dispatch requests, including the first vehicle dispatch request (e.g., vehicle dispatch requests 22a to 22c) and the second vehicle dispatch request (e.g., vehicle dispatch requests 22d to 22f), may be associated with a plurality of different request priorities (e.g., request priority "5" for the first vehicle dispatch request and request priority "10" for the second vehicle dispatch request), and the processor may allocate vehicles 32 to the vehicle dispatch requests in descending order of request priority. With this configuration, it is possible to prioritize dispatching vehicles 32 with shorter estimated arrival times for vehicle dispatch requests 22 whose transportation target is user 2, while also appropriately dispatching vehicles 32 for vehicle dispatch requests 22 whose transportation target is cargo 4.

[0126] The processor may allocate vehicles 32 to both the first vehicle dispatch requests (e.g., vehicle dispatch requests 22a to 22c) and the second vehicle dispatch requests (e.g., vehicle dispatch requests 22d to 22f) in a first time period, and may allocate vehicles 32 only to the first vehicle dispatch requests in a second time period different from the first time period without allocating vehicles 32 to the second vehicle dispatch requests. With this configuration, the vehicles 32 can limit the transportation of luggage 4 depending on the time period and prioritize the transportation of user 2.

[0127] The processor may allocate vehicles 32 to both first vehicle dispatch requests (e.g., vehicle dispatch requests 22a to 22c) and second vehicle dispatch requests (e.g., vehicle dispatch requests 22d to 22f) in a first region, and may allocate vehicles 32 only to first vehicle dispatch requests in a second region different from the first region without allocating vehicles 32 to second vehicle dispatch requests. This configuration allows vehicles 32 to limit the transportation of luggage 4 depending on the region and give priority to transportation of user 2.

[0128] A business area 7 is provided in which the vehicle 32 can operate, and the processor may allocate the vehicle 32 to a first vehicle dispatch request (e.g., vehicle dispatch requests 22a to 22c) if the origin is outside the business area 7 and the destination is within the business area 7, may not allocate the vehicle 32 to the first vehicle dispatch request if the origin is outside the business area 7 and the destination is outside the business area 7, may allocate the vehicle 32 to a second vehicle dispatch request (e.g., vehicle dispatch requests 22d to 22f) if the origin is outside the business area 7 and the destination is closer to the business area 7 than the origin, and may not allocate the vehicle 32 to the second vehicle dispatch request if the origin is outside the business area 7 and the destination is farther from the business area 7 than the origin. With this configuration, it is possible to avoid a situation in which the vehicle 32 transports the package 4 in a direction away from the business area 7, thereby taking a long time to return to the original business area 7 where the user 2 can be transported.

[0129] In order to solve the above problem, the vehicle allocation management method of the present invention involves a computer acquiring, from a plurality of user terminals 20, first vehicle allocation requests (e.g., vehicle allocation requests 22a-22c) whose transportation target is a person (e.g., user 2) and second vehicle allocation requests (e.g., vehicle allocation requests 22d-22f) whose transportation target is an object (e.g., baggage 4), and allocating a vehicle 32 (pair candidate vehicle 232) to the first vehicle allocation request with priority over the second vehicle allocation request. With this configuration, it becomes possible to prioritize the allocation of a vehicle 32 with a shorter estimated arrival time for a vehicle allocation request 22 whose transportation target is user 2, while also appropriately allocating a vehicle 32 for a vehicle allocation request 22 whose transportation target is baggage 4.

[0130] In order to solve the above problem, the program of the present invention causes a computer to acquire, from a plurality of user terminals 20, first vehicle dispatch requests (e.g., vehicle dispatch requests 22a to 22c) whose transportation target is a person (e.g., user 2) and second vehicle dispatch requests (e.g., vehicle dispatch requests 22d to 22f) whose transportation target is an object (e.g., baggage 4), and allocates a vehicle 32 (pair candidate vehicle 232) to the first vehicle dispatch requests with priority over the second vehicle dispatch requests. With this configuration, it becomes possible to prioritize dispatching a vehicle 32 with a shorter estimated arrival time for a vehicle dispatch request 22 whose transportation target is user 2, while also appropriately dispatching a vehicle 32 for a vehicle dispatch request 22 whose transportation target is baggage 4.

[0131] While the preferred embodiments of the present invention have been described above with reference to the accompanying drawings, it goes without saying that the present invention is not limited to such embodiments. It is clear that those skilled in the art can conceive of various modifications and alterations within the scope of the claims, and it is understood that such modifications and alterations also fall within the technical scope of the present invention.

[0132] Also provided are programs that cause a computer to function as the vehicle dispatch management server 50, and computer-readable storage media such as flexible disks, magneto-optical disks, ROMs, CDs, DVDs, and BDs on which the programs are recorded. Here, the program refers to data processing means written in any language or description method.

[0133] It should be noted that the processes shown in this specification do not necessarily have to be performed in chronological order according to the order shown in the timing chart, and may include parallel or subroutine processes. [Explanation of symbols]

[0134] 1. Vehicle dispatch management system 2 users 3 Driver 20 User terminal 30 Vehicle terminal 32 vehicles 40 Business Server 50 Vehicle dispatch management server (vehicle dispatch management device) 170 User terminal control unit 172 Dispatch Department 174 Vehicle terminal control unit

Claims

1. A user terminal; a vehicle dispatch management device capable of communicating with the user terminal via a network; A vehicle dispatch management system comprising: The user terminal one or more first processors; The vehicle dispatch management device one or more second processors; The first processor: In response to a user's input, transmit to the vehicle dispatch management device either a first vehicle dispatch request in which the transportation object is a person or a second vehicle dispatch request in which the transportation object is an object; The second processor: acquiring the first vehicle dispatch request and the second vehicle dispatch request from a plurality of the user terminals; Allocating a vehicle to the first vehicle allocation request with priority over the second vehicle allocation request Vehicle dispatch management system.

2. A vehicle dispatch management device capable of communicating with a user terminal via a network, one or more processors; the processor: acquires a first vehicle dispatch request in which the transportation object is a person and a second vehicle dispatch request in which the transportation object is an object from the plurality of user terminals; Allocating a vehicle to the first vehicle allocation request with priority over the second vehicle allocation request Vehicle dispatch management device.

3. The processor: Allocating the vehicle to the first vehicle dispatch request; The vehicle allocation management device according to claim 2 , wherein the vehicle is allocated to the second vehicle allocation request after the allocation of the first vehicle allocation request is completed.

4. a plurality of different request priorities are associated with the vehicle dispatch requests including the first vehicle dispatch request and the second vehicle dispatch request; The processor: The vehicle allocation management device according to claim 2 , wherein the vehicles are allocated to the vehicle allocation requests in descending order of the request priority.

5. The processor: allocating the vehicle to both the first vehicle dispatch request and the second vehicle dispatch request during a first time period; The vehicle allocation management device according to claim 2 , wherein, in a second time period different from the first time period, the vehicle is allocated only to the first vehicle allocation request without being allocated to the second vehicle allocation request.

6. The processor: allocating the vehicle to both the first vehicle dispatch request and the second vehicle dispatch request in a first region; The vehicle allocation management device according to claim 2 , wherein in a second region different from the first region, the vehicle is allocated only to the first vehicle allocation request without being allocated to the second vehicle allocation request.

7. A business area is provided in which the vehicle can operate, The processor: If the transportation origin is outside the service area and the transportation destination is within the service area, allocate the vehicle to the first vehicle dispatch request; If the transportation origin is outside the business area and the transportation destination is outside the business area, the vehicle is not allocated to the first vehicle dispatch request; If the transportation source is outside the business area and the transportation destination is closer to the business area than the transportation source, the vehicle is allocated to the second vehicle dispatch request; The vehicle dispatch management device according to claim 2 , wherein if the transportation origin is outside the business area and the transportation destination is farther from the business area than the transportation origin, the vehicle is not assigned to the second vehicle dispatch request.

8. The computer Acquire a first vehicle dispatch request in which the transportation object is a person and a second vehicle dispatch request in which the transportation object is an object from a plurality of user terminals; Allocating a vehicle to the first vehicle allocation request with priority over the second vehicle allocation request Vehicle allocation management method.

9. On the computer, acquires a first vehicle dispatch request in which the transportation object is a person and a second vehicle dispatch request in which the transportation object is an object from a plurality of user terminals; Allocating a vehicle to the first vehicle allocation request with priority over the second vehicle allocation request A program to make it happen.

Images