JP7571315B2 - Vehicle allocation management system, vehicle allocation management method, and computer program - Google Patents

Description

The present invention relates to a vehicle dispatch management system, a vehicle dispatch management method, and a computer program.

On-demand transportation is known, which provides shared rides to meet the demands of multiple users. On-demand transportation is a shared-ride public transportation service in which users make reservations in advance and the service operates according to the reservations. For on-demand transportation, for example, the vehicle dispatch management technology described in Patent Document 1 is known. Patent Document 1 describes a vehicle dispatch management technology based on trip units that takes into account departure from and return to a base, in order to realize an operation in which non-service vehicles are kept waiting at a base, which is particularly necessary when using self-driving cars in on-demand transportation.

JP 2022-17083 A

However, while the conventional vehicle dispatch management technology described above can realize shared vehicle dispatch, it cannot realize both shared vehicle dispatch and vehicle dispatch for package delivery.

The present invention was made in consideration of these circumstances, and its purpose is to realize both shared vehicle dispatch and vehicle dispatch for package delivery in a demand-based vehicle dispatch management system that operates vehicles according to reservations.

One aspect of the present invention is a demand-type vehicle dispatch management system that operates vehicles in response to reservations, the system including: a vehicle dispatch schedule information storage unit that stores vehicle dispatch schedule information indicating a vehicle dispatch schedule; a dedicated delivery period information storage unit that stores dedicated delivery period information indicating a dedicated delivery period for each store; a reception unit that receives a ride reservation request from a ride requesting user, the ride reservation request including information specifying a boarding location where a person will board and information specifying a drop-off location where the person will disembark, and receives a delivery reservation request from a delivery requesting user, the delivery reservation request including information specifying the store where a package will be received and information specifying a delivery location where the package will be delivered; and a vehicle dispatch calculation unit that calculates a vehicle dispatch schedule information for the ride reservation request based on the vehicle dispatch schedule information and the dedicated delivery period information when the reception unit receives the ride reservation request. and a vehicle dispatch processing unit that executes a vehicle dispatch calculation for a boarding reservation request and outputs information on a new vehicle dispatch that does not overlap with a dedicated delivery period based on a result of executing a vehicle dispatch calculation for the boarding reservation request, and if the reception unit receives a delivery reservation request, executes a vehicle dispatch calculation for the delivery reservation request based on the vehicle dispatch schedule information and the dedicated delivery period information, and outputs information on a new vehicle dispatch within the dedicated delivery period based on a result of executing the vehicle dispatch calculation for the delivery reservation request, wherein if a vehicle dispatch within a certain dedicated delivery period cannot be obtained for the delivery reservation request, the vehicle dispatch processing unit creates a new dedicated delivery period in a time zone that does not overlap with a vehicle dispatch plan already planned at the time of the delivery reservation request , and outputs information on a new vehicle dispatch within the newly created dedicated delivery period.
One aspect of the present invention is a vehicle dispatch management system in which, in the above-mentioned vehicle dispatch management system, the vehicle dispatch processing unit is capable of outputting new vehicle dispatch information that overlaps with a dedicated delivery period in response to a ride reservation request accepted by the reception unit after a specified deadline for delivery-related acceptance.
One aspect of the present invention is the vehicle dispatch management system described above, in which the dedicated delivery periods for the multiple stores do not overlap.
One aspect of the present invention is the vehicle dispatch management system described above, wherein the dedicated delivery period is the same for the multiple stores.
One aspect of the present invention is the vehicle dispatch management system described above, in which an upper limit is set on the number of vehicles that can be dispatched in one dedicated delivery period.
One aspect of the present invention is a vehicle dispatch management system in which, in the above-mentioned vehicle dispatch management system, when a vehicle dispatch is obtained in response to a delivery reservation request, the vehicle dispatch processing unit outputs information about a new vehicle dispatch that will minimize the number of times it passes through the store.
One aspect of the present invention is a vehicle dispatch management system in which, when an existing vehicle dispatch schedule is found in which a ride reservation request or a delivery reservation request can be incorporated, the vehicle dispatch processing unit outputs vehicle dispatch information resulting from incorporating the request into the existing vehicle dispatch schedule.
One aspect of the present invention is a vehicle dispatch management system in which, in the above-mentioned vehicle dispatch management system, the vehicle dispatch processing unit incorporates a ride reservation request or a delivery reservation request between any of all of the waypoints and bases in the existing vehicle dispatch schedule when the existing vehicle dispatch schedule is not yet in operation, and, in the case where the existing vehicle dispatch schedule is in operation, incorporates a ride reservation request or a delivery reservation request between any of all of the waypoints and bases in the existing vehicle dispatch schedule where a vehicle has not yet arrived.
One aspect of the present invention is a vehicle dispatch management system in which, in the above-mentioned vehicle dispatch management system, when a vehicle dispatch that satisfies a ride reservation request or a delivery reservation request cannot be obtained, the vehicle dispatch processing unit outputs information on a new vehicle dispatch obtained by changing part of the request.
One aspect of the present invention is a vehicle dispatch management system in which, in the above-mentioned vehicle dispatch management system, the reception unit sets the deadline for accepting delivery reservation requests for one of the stores to a time that is a certain amount of time before the scheduled time that the vehicle is to arrive at the one of the stores based on the vehicle dispatch schedule information.

One aspect of the present invention is a vehicle dispatch management method executed by a demand-type vehicle dispatch management system that operates vehicles in response to reservations, the method including a vehicle dispatch schedule information storage step of storing vehicle dispatch schedule information indicating a vehicle dispatch schedule, a dedicated delivery period information storage step of storing dedicated delivery period information indicating a dedicated delivery period for each store, a reception step of receiving a ride reservation request from a ride requesting user, the ride reservation request including information specifying a boarding location where a person will board and information specifying a drop-off location where the person will disembark, and receiving a delivery reservation request from a delivery requesting user, the delivery reservation request including information specifying the store where a package will be received and information specifying a delivery location where the package will be delivered, and a reception step of, when a ride reservation request is received, issuing a ride reservation request based on the vehicle dispatch schedule information and the dedicated delivery period information. and a vehicle allocation processing step of: executing a vehicle allocation calculation for a dedicated delivery period and outputting information on a new vehicle allocation that does not overlap with the dedicated delivery period based on a result of executing the vehicle allocation calculation for the boarding reservation request; and, if a delivery reservation request is accepted, executing a vehicle allocation calculation for the delivery reservation request based on the vehicle allocation schedule information and the dedicated delivery period information, and outputting information on a new vehicle allocation within the dedicated delivery period based on a result of executing the vehicle allocation calculation for the delivery reservation request, wherein, if a vehicle allocation within a certain dedicated delivery period cannot be obtained for the delivery reservation request, the vehicle allocation processing step creates a new dedicated delivery period in a time zone that does not overlap with the vehicle allocation plan already planned at the time of the delivery reservation request , and outputs information on a new vehicle allocation within the newly created dedicated delivery period.

One aspect of the present invention includes a vehicle dispatch schedule information storage step for storing vehicle dispatch schedule information indicating a vehicle dispatch schedule in a computer of a demand-type vehicle dispatch management system that operates vehicles in response to reservations, a dedicated delivery period information storage step for storing dedicated delivery period information indicating a dedicated delivery period for each store, a reception step for receiving a ride reservation request from a ride request user, the reception step including information specifying a boarding location where a person will board and information specifying a drop-off location where the person will drop off, and a delivery reservation request from a delivery request user, the delivery reservation request including information specifying the store where a package will be received and information specifying a delivery location where the package will be delivered, and a reception step for calculating a vehicle dispatch schedule for the ride reservation request based on the vehicle dispatch schedule information and the dedicated delivery period information when the ride reservation request is received. and a vehicle allocation processing step of: executing a vehicle allocation calculation for a ride reservation request, and outputting information on a new vehicle allocation that does not overlap with a dedicated delivery period based on a result of executing the vehicle allocation calculation for the ride reservation request, and, if a delivery reservation request is accepted, executing a vehicle allocation calculation for the delivery reservation request based on the vehicle allocation schedule information and the dedicated delivery period information, and outputting information on a new vehicle allocation within the dedicated delivery period based on a result of executing the vehicle allocation calculation for the delivery reservation request, wherein, if a vehicle allocation within a certain dedicated delivery period cannot be obtained for the delivery reservation request, the vehicle allocation processing step creates a new dedicated delivery period in a time zone that does not overlap with a vehicle allocation plan already planned at the time of the delivery reservation request , and outputs information on a new vehicle allocation within the newly created dedicated delivery period.

The present invention has the effect of realizing both shared vehicle dispatch and vehicle dispatch for baggage delivery in a demand-based vehicle dispatch management system that operates vehicles according to reservations.

1 is a block diagram showing an example of the configuration of a vehicle dispatch management system according to an embodiment; FIG. 2 is a diagram for explaining an example of a trip according to an embodiment. FIG. 1 illustrates an example of a dedicated delivery period according to one embodiment. FIG. 1 illustrates an example of a dedicated delivery period according to one embodiment. 11 is a flowchart illustrating an example of an overall procedure of a vehicle dispatch process according to an embodiment. 1 is a flowchart illustrating an example of a procedure of a vehicle dispatch determination method for shuttle vehicle dispatch according to an embodiment. FIG. 2 is a diagram illustrating an example of an operation of the vehicle dispatch management system according to an embodiment. 1 is a flowchart illustrating an example of a procedure of a vehicle dispatch determination method according to an embodiment. 1 is a flowchart illustrating an example of a procedure of a vehicle dispatch determination method according to an embodiment. FIG. 2 is a diagram illustrating an example of an operation of the vehicle dispatch management system according to an embodiment. FIG. 2 is a diagram illustrating an example of an operation of the vehicle dispatch management system according to an embodiment. FIG. 2 is a diagram illustrating an example of an operation of the vehicle dispatch management system according to an embodiment. 1 is a flowchart illustrating an example of a procedure of a vehicle dispatch determination method for dispatching a delivery vehicle according to an embodiment. 11 is a flowchart illustrating an example of a trip selection process for delivery vehicle dispatch according to an embodiment. FIG. 13 is a diagram illustrating an example of a trip (dispatch) output according to an embodiment.

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

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

The vehicle dispatch management system 1 according to this embodiment dispatches vehicles that can carry multiple people in one vehicle through a shared ride (hereinafter referred to as shuttle vehicle dispatch) and vehicles that can deliver packages (hereinafter referred to as delivery vehicle dispatch). Note that when there is no particular distinction between shuttle vehicle dispatch and delivery vehicle dispatch, they may simply be referred to as vehicle dispatch.

In this embodiment, vehicle dispatch management is performed on a trip basis. A trip refers to a series of vehicle operations from a base departure time, passing through one or more demand stopovers, and returning to the base at the base return time. In shuttle dispatch, the stopover is the departure point (boarding location) or destination (drop-off location). In delivery dispatch, the stopover is the departure point (store where the package is received) or destination (delivery location where the package is delivered).

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

The terminal device 20-1 is used by a user. The user performs an operation to reserve a vehicle on the terminal device 20-1.

A user reserving a shuttle service (a ride requesting user) specifies the desired conditions for the shuttle service when reserving a vehicle. The desired conditions for the shuttle service include the departure point (boarding location), destination (drop-off location), desired time (desired time to depart from the departure point (desired departure time)) and desired time to arrive at the destination (desired arrival time)), number of passengers, whether or not to share a ride, etc.

Based on the operation of the boarding requesting user, the terminal device 20-1 creates a boarding reservation request addressed to the management server 100, including boarding reservation information (pick-up and drop-off demand). The boarding reservation information includes information indicating the boarding requesting user's desired pick-up and drop-off conditions. The terminal device 20-1 transmits the created boarding reservation request to the management server 100.

The management server 100 receives the ride reservation request sent by the terminal device 20-1. The management server 100 stores location information of the base where the vehicle will be waiting. The management server 100 acquires the ride reservation information included in the received ride reservation request, and searches for a route from the first base via the boarding location and disembarking location to the first or second base based on the acquired ride reservation information and the stored location information of the base. Based on the route search results, the management server 100 creates a new operation schedule for the vehicle departing from the first base at the first time, passing through the boarding location and disembarking location, and returning to the first or second base at the second time.

The management server 100 determines whether or not it is possible to operate a new operation schedule that satisfies the user's desired conditions based on the created new operation schedule and the existing operation schedules of one or more vehicles. At this time, if the management server 100 determines that it is not possible to operate a new operation schedule that satisfies the user's desired conditions, it may make a specified condition change to the desired conditions and then determine again whether or not it is possible to operate a new operation schedule.

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

A user reserving a delivery vehicle (delivery request user) specifies desired delivery conditions when reserving a vehicle. Desired delivery conditions include the departure point (store), destination (delivery location), desired time (desired time to depart from the departure point (desired departure time) and desired time to arrive at the destination (desired arrival time)), number of packages, etc.

The terminal device 20-1 creates a delivery reservation request addressed to the management server 100, including delivery reservation information (delivery demand), based on the operation of the delivery request user. The delivery reservation information includes information indicating the desired delivery conditions of the delivery request user. The terminal device 20-1 transmits the created delivery reservation request to the management server 100.

The management server 100 receives the delivery reservation request sent by the terminal device 20-1. The management server 100 acquires the delivery reservation information included in the received delivery reservation request, and searches for a route from the first base to the first or second base, via the store and delivery location, based on the acquired delivery reservation information and the stored location information of the base. Based on the route search results, the management server 100 creates a new vehicle operation schedule that departs from the first base at a first time, passes through the store and delivery location, and returns to the first or second base at a second time.

The management server 100 determines whether or not it is possible to operate a new operation schedule that satisfies the user's desired conditions based on the created new operation schedule and the existing operation schedules of one or more vehicles. At this time, if the management server 100 determines that it is not possible to operate a new operation schedule that satisfies the user's desired conditions, it may make a specified condition change to the desired conditions and then determine again whether or not it is possible to operate a new operation schedule.

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

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

The following describes the terminal device 20-1, the terminal device 20-2, the terminal device 20-3, the vehicle-mounted device 30, and the management server 100 included in the vehicle dispatch management system 1.

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

The terminal device 20-1 is a mobile device carried by the user U. The user U uses the terminal device 20-1 to reserve a shuttle vehicle or a delivery vehicle. The terminal device 20-1 uses a vehicle reservation app. The vehicle reservation app may be installed on the terminal device 20-1 or may be a web application. The vehicle reservation app creates ride reservation information or delivery reservation information based on the user's operation on the terminal device 20-1.

Ride reservations and delivery reservations include instantaneous reservations and advance reservations. Instantaneous reservations are made when a ride or delivery is desired immediately, and the boarding location or store, drop-off location, or delivery location is specified. Examples of information specifying the boarding location and information specifying the drop-off location are place names and some information indicating a location. Examples of information specifying a store are store names and store numbers. An example of information specifying a delivery location is an address. When an instantaneous reservation is made, the ride reservation information includes information specifying the boarding location, drop-off location, number of passengers, whether or not carpooling is possible, etc. When an instantaneous reservation is made, the delivery reservation information includes information specifying the store, delivery location, number of packages, etc.

On the other hand, advance reservations are when a departure time and arrival time are desired; with a boarding reservation, the boarding location, disembarking location, desired departure time, and desired disembarking time are specified, while with a delivery reservation, the store, delivery location, desired departure time, and desired arrival time are specified. When an advance reservation is made, the boarding reservation information includes information specifying the boarding location, disembarking location, desired time (desired departure time and desired arrival time), number of passengers, whether or not carpooling is possible, etc. When an advance reservation is made, the delivery reservation information includes information specifying the store, delivery location, desired time (desired departure time and desired arrival time), number of packages, etc.

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

The terminal device 20-2 is, for example, a device used by a person CO sitting in the driver's seat of the vehicle. For example, the terminal device 20-2 may be fixed to the driver's seat like a car navigation system. An example of a person CO sitting in the driver's seat of the vehicle is the driver. However, if the vehicle is an autonomous vehicle, the conductor may use the terminal device 20-2. The terminal device 20-2 uses a train operation app. The train operation app may be installed in the terminal device 20-2, or may be a web application.

The operation application causes the terminal device 20-2 to receive information related to vehicle operation, such as information specifying a pick-up location for shuttle dispatch, information specifying a drop-off location, and route information, transmitted by the management server 100. The operation application causes the terminal device 20-2 to display the pick-up location, drop-off location, and route information on a map displayed on the display unit, based on the received information related to vehicle operation.
The operation application causes the terminal device 20-2 to receive information related to vehicle operation, such as information for identifying a store for dispatching a delivery vehicle, information for identifying a delivery location, and route information, transmitted by the management server 100. The operation application causes the terminal device 20-2 to display the store, delivery location, and route information on a map displayed on the display unit, based on the received information related to vehicle operation.

The operation app causes the terminal device 20-2 to perform processes related to vehicle operation. When a location on a map displayed on the display unit of the terminal device 20-2 that corresponds to a boarding location or store, a drop-off location, or a delivery location is pressed, the operation app causes the terminal device 20-2 to create operation information addressed to the management server 100, which includes information indicating the time of pressing and information indicating the boarding location or store, or the drop-off location or delivery location that corresponds to the pressed location. The operation app causes the terminal device 20-2 to transmit the created operation information to the management server 100.

The terminal device 20-3 is a device used by a passenger PA in the vehicle. For example, the terminal device 20-3 may be fixed to the driver's seat like a car navigation system. The terminal device 20-3 may be used by a user who does not normally carry a smartphone or tablet. The terminal device 20-3 uses an operation status notification management app. The operation status notification management app may be installed on the terminal device 20-3 or may be a web application.

The operation status notification app causes the terminal device 20-3 to receive pick-up and drop-off vehicle boarding information, disembarking information, and route information transmitted by the management server 100. The operation status notification app causes the terminal device 20-3 to display boarding and disembarking locations and route information on a map displayed on the display unit, based on the received user boarding information, disembarking information, and route information.
The operation status notification app causes the terminal device 20-3 to receive store information, delivery information, and route information for the delivery vehicle sent by the management server 100. The operation status notification app causes the terminal device 20-3 to display stores, delivery locations, and route information on a map displayed on the display unit, based on the received store information, delivery information, and route information for the user.
However, depending on the environment in which the terminal device 20-3 is used, the contents displayed on the terminal device 20-3 may be restricted in consideration of privacy.

(In-vehicle device)
The on-board device 30 is mounted on the vehicle VE. The on-board device 30 uses an on-board application. The on-board application may be installed on the on-board device 30 or may be a web application. The on-board application causes the on-board device 30 to transmit position information and CAN (Controller Area Network) data of the vehicle VE to the management server 100. If the vehicle VE in which the on-board device 30 is mounted is an autonomous vehicle, the on-board device 30 cooperates with the autonomous driving system of the vehicle VE. In this case, the on-board application causes the on-board device 30 to receive route information transmitted by the management server 100 and outputs the received route information to the autonomous driving system.

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

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

The communication unit 102 is realized by a communication module. The communication unit 102 communicates with other devices such as the terminal device 20-1, the terminal device 20-2, the terminal device 20-3, and the vehicle-mounted device 30 via the network NW. The communication unit 102 receives a ride reservation request or a delivery reservation request sent by the terminal device 20-1. The communication unit 102 also sends a ride reservation response or a delivery reservation response output by the vehicle allocation processing unit 106 to the terminal device 20-1. The communication unit 102 sends a vehicle allocation request output by the vehicle allocation processing unit 106 to the vehicle-mounted device 30.

The storage unit 110 is realized by, for example, a RAM, a ROM, a HDD, a flash memory, or a hybrid storage device that combines a plurality of these. The storage unit 110 stores a program (vehicle dispatch management app) executed by the management server 100. The storage unit 110 also stores identification information (hereinafter referred to as "base ID") of a base where a vehicle is waiting and location information of the base in association with each other. The storage unit 110 also stores various data required for the management server 100 to dispatch a vehicle. For example, the storage unit 110 stores demand information 110a, vehicle information 110b, user information 110c, and delivery-only period information 110d as data required for dispatching a vehicle. The storage unit 110 according to this embodiment corresponds to the dispatch schedule information storage unit and the delivery-only period information storage unit.

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

Vehicle information 110b includes one or more pieces of vehicle-related information that associate vehicle identification information (hereinafter referred to as "vehicle ID"), information indicating the vehicle's operating schedule, information indicating the vehicle's capacity, information indicating whether or not passengers can share the vehicle, information indicating the waiting area base, such as a base ID, rest time information, conductor information, current location information, and status information.
In this embodiment, the vehicle information 110b corresponds to dispatch schedule information indicating a dispatch schedule for each vehicle. The dispatch schedule information is information for determining whether a new vehicle can be dispatched, and includes an existing operation schedule, a capacity of the vehicle, whether or not a vehicle can be shared, and the like.

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

The dedicated delivery period information 110d is information indicating a dedicated delivery period that is determined in advance for each store. A vehicle can be dispatched to a store only during the dedicated delivery period for that store. The dedicated delivery period may be, for example, a specific date or day of the week, or a specific time period. For example, the dedicated delivery period may be a specific time period on a specific day of the week. For example, the dedicated delivery period may be a specific time period on a specific date. For example, the dedicated delivery period may be a specific time period on odd or even days. For example, the dedicated delivery period may be a specific time period every day. For example, the dedicated delivery period may be all day on a specific date or day of the week.

Figure 2 is a diagram showing an example of a trip according to this embodiment. In Figure 2, two trips A and B are set for vehicle VE during its operating hours. The example in Figure 2 is an example in which two delivery reservation requests, demands 1 and 2, and one ride reservation request, demand 3, are generated. Demand 1 is a delivery demand for delivering parcels from a store (store 1) to a delivery location (D1). Demand 2 is a delivery demand for delivering parcels from the store (store 1) to a delivery location (D2). Demand 3 is a transportation demand for transporting passengers from a boarding location (O3) to a disembarking location (D3).

Trip A is a delivery trip. In Trip A, a vehicle VE departs from a departure base (BS) to a store (Shop 1), picks up packages to be delivered to each delivery location D1 and D2 at the store (Shop 1), delivers the packages to the delivery location D1, delivers the packages to the delivery location D2, and returns to the arrival base (BG). This trip A is generated so as to be completed within the dedicated delivery period of the store (Shop 1).
Trip B is a pick-up/drop-off trip. In Trip B, a vehicle VE departs from a departure base (BS) to a boarding location (O3), picks up passengers at the boarding location (O3), then proceeds to a disembarking location (D3) to disembark the passengers, and then returns to a arrival base (BG). This trip B is generated so as not to overlap with the dedicated delivery period of the store (Store 1).

Figures 3 and 4 are diagrams showing examples of dedicated delivery periods according to this embodiment. In the example of Figure 3, the dedicated delivery periods for multiple stores do not overlap. In Figure 3, the dedicated delivery period for store (store 1) does not overlap with the dedicated delivery period for store (store 2). In the example of Figure 4, the dedicated delivery period for multiple stores is the same. In Figure 4, the dedicated delivery period for store (store 1) is the same as the dedicated delivery period for store (store 2).

The reception unit 104 receives the ride reservation request received by the communication unit 102 and acquires ride reservation information included in the received ride reservation request. The dispatch processing unit 106 updates the demand information 110a (pick-up demand) stored in the memory unit 110 based on the ride reservation information acquired by the reception unit 104.
The reception unit 104 receives the delivery reservation request received by the communication unit 102 and acquires the delivery reservation information included in the received delivery reservation request. The dispatch processing unit 106 updates the demand information 110a (delivery demand) stored in the storage unit 110 based on the delivery reservation information acquired by the reception unit 104.

The dispatch processing unit 106 executes a dispatch calculation for the boarding reservation request based on the vehicle information 110b and the dedicated delivery period information 110d, and outputs dispatch information that does not overlap with the dedicated delivery period based on the execution result of the dispatch calculation for the boarding reservation request. In the dispatch calculation for the boarding reservation request, the dispatch processing unit 106 determines whether or not a vehicle can be dispatched that satisfies the desired pick-up and drop-off conditions of the boarding request user indicated in the boarding reservation information. At this time, if the dispatch processing unit 106 determines that a vehicle cannot be dispatched that satisfies the desired pick-up and drop-off conditions of the boarding request user, it may make a specified condition change to the desired pick-up and drop-off conditions and then determine again whether or not a vehicle can be dispatched.

The vehicle dispatch processing unit 106 executes a vehicle dispatch calculation for the delivery reservation request based on the vehicle information 110b and the dedicated delivery period information 110d, and outputs information on vehicle dispatch within the dedicated delivery period based on the result of executing the vehicle dispatch calculation for the delivery reservation request. In the vehicle dispatch calculation for the delivery reservation request, the vehicle dispatch processing unit 106 determines whether or not a vehicle can be dispatched that satisfies the desired delivery conditions of the delivery request user indicated in the delivery reservation information. At this time, if the vehicle dispatch processing unit 106 determines that a vehicle cannot be dispatched that satisfies the desired delivery conditions of the delivery request user, it may make a specified condition change to the desired delivery conditions and then determine again whether or not a vehicle can be dispatched.

The vehicle dispatch processing unit 106 processes vehicles that do not have demand for operations on the assumption that they will wait at a designated base. The vehicle dispatch processing unit 106 performs operation management on a trip basis.

The entire vehicle dispatch process according to this embodiment will be described with reference to FIG. 5. FIG. 5 is a flowchart showing an example of the overall procedure of the vehicle dispatch process according to this embodiment.

(Step SP1) The dispatch processing unit 106 determines whether the new demand received by the reception unit 104 is a pick-up/drop-off demand or a delivery demand. If it is a pick-up/drop-off demand, the process proceeds to step SP2, and if it is a delivery demand, the process proceeds to step SP3.

(Step SP2) The vehicle dispatch processing unit 106 performs dispatch calculations for the shuttle demand for each vehicle VE (dispatch calculations for ride reservation requests).

(Step SP3) The vehicle allocation processing unit 106 performs a vehicle allocation calculation for the delivery demand for each vehicle VE (a vehicle allocation calculation for a delivery reservation request).

(Step SP4) The dispatch processing unit 106 determines whether or not at least one normal trip has been found among all vehicles VE. If at least one normal trip has been found, proceed to step SP5; if no normal trip has been found, proceed to step SP6. A normal trip is a trip that satisfies all dispatch constraints without changing the user's desired time (desired departure time and desired arrival time). Therefore, a normal trip satisfies the user's desired time (desired departure time and desired arrival time) and also satisfies all dispatch constraints. An example of a constraint condition for a shuttle dispatch is dispatching a vehicle that does not overlap with a dedicated delivery period. An example of a constraint condition for a delivery dispatch is dispatching a vehicle within a dedicated delivery period.

(Step SP5) The dispatch processing unit 106 outputs one of the normal trips with the smallest delay cost as the final dispatch.

(Step SP6) The dispatch processing unit 106 outputs up to two of the nearby trips as final nearby trips (nearby dispatch): the trip closest to the desired time among those before the desired time, and the trip closest to the desired time among those after the desired time. A nearby trip is a trip for which dispatch is possible by changing any of the user's desired conditions. Therefore, nearby trips do not satisfy all of the user's desired conditions.

Below, we will explain the vehicle dispatch process in detail, dividing it into shuttle dispatch and delivery dispatch.

[Shuttle service]
The vehicle dispatch process for dispatching a shuttle vehicle will be described.
The vehicle dispatch processing unit 106 outputs, to the route search unit 108, information specifying the boarding location and information specifying the disembarking location, which are included in the boarding reservation information, as information regarding shuttle vehicle dispatch.
The route search unit 108 acquires information specifying the boarding location and information specifying the disembarking location output by the vehicle dispatch processing unit 106 as information related to shuttle dispatch. The route search unit 108 acquires information that associates the base ID of the base where the vehicle is to be waited and the position information of the base stored in the storage unit 110. Based on the acquired information specifying the boarding location and the information specifying the disembarking location, the base ID where the vehicle is to be waited and the position information of the base, the route search unit 108 selects the base ID of the base where the vehicle to be dispatched to the boarding location is waiting and the base ID of the base where the vehicle is to head to after the disembarking location. The base where the vehicle to be dispatched to the boarding location is waiting and the base where the vehicle is to head to after the disembarking location may be the same or different. Below, the case where the first base is selected as the base where the vehicle to be dispatched to the boarding location is waiting and the second base is selected as the base where the vehicle is to head to after the disembarking location will be described. Here, the first base and the second base are stored in the storage unit 110.

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

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

The vehicle dispatch processing unit 106 acquires information indicating the results of the route search output by the route search unit 108 and information indicating the result of the derived time required. The vehicle dispatch processing unit 106 determines whether or not a vehicle can be dispatched based on the information indicating the results of the route search output by the route search unit 108 and the information indicating the result of the derived time required.

The method of determining whether or not a vehicle is to be dispatched for a shuttle service according to this embodiment will be described with reference to FIG. 6. FIG. 6 is a flowchart showing an example of the procedure of the method of determining whether or not a vehicle is to be dispatched for a shuttle service according to this embodiment.

The dispatch processing unit 106 executes the process shown in FIG. 6 for each vehicle.

(Step S1) The dispatch processing unit 106 determines whether a trip can be formed by a new demand alone. Specifically, when a trip formed by a new demand alone is assumed, the dispatch processing unit 106 determines whether the trip formed by the new demand alone has a portion that overlaps with an existing trip in a chronological order. When the dispatch processing unit 106 determines that the trip does not have a portion that overlaps with an existing trip in a chronological order, the dispatch processing unit 106 determines that a trip can be formed by the new demand alone.
The process in which the vehicle allocation processing unit 106 determines whether there is any overlap with an existing trip in time series will be described below.

FIG. 7 is a diagram showing an example of the operation of the vehicle dispatch management system according to the present embodiment. FIG. 7 shows an example of a trip. In the trip shown in FIG. 7, the vehicle must arrive at the boarding location O1 between time t_O1min and time t_O1max, and depart from the boarding location O1 at time t_O1max. In addition, the vehicle must arrive at the disembarking location D1 between time t_D1min and time t_D1max. TW is the time between the time of departure from the boarding location and the time a predetermined time before the departure time. TW is defined as the time during which the demand can wait at the boarding location (departure point). TR is the time between the time at which arrival at the disembarking location is guaranteed (even if there is an additional delay, the vehicle will arrive at this time at the latest) and the time a predetermined time before that time. TR is the time for absorbing delays due to trips that are expected to be added in the future, and is defined as the leeway time until arrival. Equation (1) and equation (2) hold.
t_O1max−t_O1min=TW (1)
t_D1max-t_D1min=TR (2)
From the formula (1), the constraint of the condition t_O1 is t_O1min≦t_O1≦t_O1max. From the formula (2), the constraint of t_D1 is t_D1min≦t_D1≦t_D1max.

Figure 8 shows an example of the procedure for processing step S1. The processing of step S1 will be explained with reference to Figure 8.

(Step S101) The dispatch processing unit 106 determines the departure base (BS) and arrival base (BG) based on the vehicle information 110b.

(Step S102) The dispatch processing unit 106 calculates each time (t_BS, t_O1, t_D1, t_BG) when a trip is formed by a single new demand. The method of calculating each time differs depending on whether the reservation is immediate or advanced.

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

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

From the above, we can see that in both cases where immediate booking is specified and where advance booking is specified, trip formation for a new demand alone is represented by the time series relationship in Figure 7.

(Step S103) The dispatch processing unit 106 determines whether the newly created demand-only trip satisfies all of the constraint conditions list.

The constraints for shuttle dispatch are listed below.

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

(Constraint b)
Does not overlap with a time period outside vehicle operation hours, a rest period, or a dedicated delivery period. The vehicle dispatch processing unit 106 determines that the time period from t_BS to t_BG of the new demand single trip does not overlap with a time period outside vehicle operation hours, a rest period, or a dedicated delivery period.

(Constraint c)
The vehicle's passenger capacity is not exceeded. The vehicle allocation processing unit 106 determines that the trip does not include passengers exceeding the passenger capacity set for each vehicle.

(Constraint d)
When a trip of a demand includes a request for refusing to share a ride, a setting for refusing to share a ride is performed. When a trip of a demand includes a request for refusing to share a ride, the dispatch processing unit 106 realizes the refusal to share a ride by setting the number of passengers to the passenger capacity even if the number of passengers of the demand is less than the passenger capacity.

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

(Step S104) If all of the constraint conditions are satisfied, the dispatch processing unit 106 determines that dispatching a new demand-only trip is possible.

(Step S105) If any of the constraint conditions in the constraint condition list is not satisfied, the dispatch processing unit 106 determines that dispatching a vehicle for a new demand-only trip is not possible.

Returning to FIG.
As a result of step S1, if a vehicle can be dispatched for a trip based on a new demand alone (step S1, YES), the process proceeds to step S5. On the other hand, if a vehicle cannot be dispatched for a trip based on a new demand alone (step S1, NO), the process proceeds to step S2.

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

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

Figure 9 shows an example of the processing procedure for step S3. The processing for step S3 will be explained with reference to Figure 9.

(Step S201) The dispatch processing unit 106 determines the insertion location of the new demand into the existing trip without changing the order of the existing demands based on the idea of the sequential optimal insertion method. As an example, the explanation will continue with the case where there are "N-1" existing demands in the existing trip and the Nth new demand is to be inserted.

As a method for determining an insertion location for inserting a new demand into an existing trip, the following method may be used.
(Example of a method for determining an insertion location) In this example, the location where a new demand can be inserted is changed depending on whether the existing trip is in operation or not. When the existing trip is not yet in operation, a new demand can be inserted between all waypoints and bases of the existing trip. On the other hand, when the existing trip is in operation, a new demand can be inserted between all waypoints and bases of the existing trip where the vehicle VE has not yet arrived. Note that, taking into consideration the safety of operation, a new demand may be inserted only between the last waypoint and the base where the vehicle VE returns to.

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

Here, calculation of each time when the boarding location (starting point) O_N and the disembarking location (destination) D_N of the Nth demand are inserted as new waypoints will be explained in three cases: immediate reservation, desired departure time specified in advance reservation, and desired arrival time specified in advance reservation. The departure time of each waypoint is determined as follows.
Starting point: t_BS
Departure point: When t_O<t_Omax, t_Omax
When t_Omax<=t_O, t_O
Destination: t_D

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

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

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

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

(Step S204) The dispatch processing unit 106 determines whether the insertion of a new demand into an existing trip satisfies all of the constraint conditions. If the result of this determination is that all of the constraint conditions are satisfied, the process proceeds to step S205, and if not, the process proceeds to step S206.

(Step S205) If all of the constraint conditions are satisfied, the dispatch processing unit 106 outputs the trip resulting from inserting the new demand into the existing trip.

(Step S206) If there is another place to insert a new demand, return to step S201; otherwise, end the process in FIG. 9.

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

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

(Step S209) The dispatch processing unit 106 determines whether the number of times steps S207-S208 are repeated is equal to or less than a predetermined value M_shift. If the result of this determination is that the number of times is equal to or less than the predetermined value M_shift, the process returns to step S207. On the other hand, if the number of times is greater than the predetermined value M_shift, the process proceeds to step S206. As a result, the dispatch processing unit 106 advances the base departure time t_BS by the time width Tshift and calculates each time up to M_shift times until a trip that satisfies all of the constraint conditions is found.

Returning to FIG.
As a result of step S3, if it is possible to insert the new demand into an existing trip that chronologically overlaps with the new demand individual trip tentatively generated in step S1 (YES in step S3), the process proceeds to step S4; otherwise (NO in step S3), the process proceeds to step S8.

(Step S4) The dispatch processing unit 106 selects the trip (dispatch) with the minimum delay cost from the trips (dispatch) output in step S3 (step S205). An example of a method for calculating the delay cost is shown below.

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

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

However, additional delay of existing demand refers to a delay of existing demand that occurs newly due to the insertion of new demand into an existing trip.

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

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

As a result of step S6, if dispatching a vehicle for a new demand-only trip is possible (step S6, YES), proceed to step S7. On the other hand, if dispatching a vehicle for a new demand-only trip is not possible (step S6, NO), proceed to step S10.

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

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

(Step S9) The dispatch processing unit 106 outputs the existing trips found in step S8 as nearby trips. After this, the processing in FIG. 6 ends.

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

(If the desired time is not available)
As in step S6, the dispatch processor 106 shifts at least one of the user's desired departure time and desired arrival time by a predetermined time interval and then judges again whether a new demand can be inserted into the existing trip. If the result of this judgment indicates that a new demand can be inserted into the existing trip, the dispatch processor 106 outputs the trip after the desired time has been changed as a nearby trip.

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

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

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

(Step S10) If a vehicle cannot be dispatched even if the user's desired conditions are changed (step S6 is NO or step S8 is NO), the dispatch processing unit 106 outputs a message indicating that a vehicle cannot be dispatched.

The above explains the method for determining whether to dispatch a shuttle vehicle.

[Delivery vehicle allocation]
A method for managing delivery vehicles will be described.
The vehicle allocation processing unit 106 outputs, to the route search unit 108, information for specifying the store and information for specifying the delivery location, which are included in the delivery reservation information, as information regarding delivery vehicle allocation.
The route search unit 108 acquires the information for identifying the store and the information for identifying the delivery location output by the vehicle dispatch processing unit 106 as information related to delivery dispatch. The route search unit 108 acquires information that associates the base ID of the base where the vehicle is to be waited and the position information of the base stored in the storage unit 110. Based on the acquired information for identifying the store and the information for identifying the delivery location, the information for identifying the base ID where the vehicle is to be waited and the position information of the base, the route search unit 108 selects the base ID of the base where the vehicle to be dispatched to the store is waiting and the base ID of the base to which the vehicle will head after the delivery location based on the acquired information for identifying the store and the information for identifying the delivery location, and the information for associating the base ID where the vehicle is to be waited and the position information of the base. The base where the vehicle to be dispatched to the store is waiting and the base to which the vehicle will head after the delivery location may be the same or different. Below, the case where the first base is selected as the base where the vehicle to be dispatched to the store is waiting and the second base is selected as the base to which the vehicle will head after the delivery location will be described. Here, the first base and the second base are stored in the storage unit 110.

The route search unit 108 searches for a route from the first base via the store and the delivery location to the second base based on the acquired information identifying the store and the delivery location, the base ID of the first base where the vehicle is waiting, and information associating the location information of the first base, and derives the time required to travel from the first base via the store and the delivery location to the second base on that route.

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

The vehicle dispatch processing unit 106 acquires information indicating the results of the route search output by the route search unit 108 and information indicating the result of the derived time required. The vehicle dispatch processing unit 106 determines whether or not a vehicle can be dispatched based on the information indicating the results of the route search output by the route search unit 108 and the information indicating the result of the derived time required.

The vehicle dispatch determination method for dispatching a delivery vehicle according to this embodiment will be described with reference to FIG. 13. FIG. 13 is a flowchart showing an example of the procedure of the vehicle dispatch determination method for dispatching a delivery vehicle according to this embodiment.

The dispatch processing unit 106 executes the process shown in FIG. 13 for each vehicle.

(Step S301) The vehicle dispatch processing unit 106 confirms the dedicated delivery period (designated dedicated delivery period) for store O1 designated by the delivery request user when making the delivery reservation request. The designated dedicated delivery period may be included in the delivery reservation information, or may be obtained separately from the delivery reservation information. For example, the reception unit 104 may present the dedicated delivery period for store O1 indicated in the delivery reservation information to the terminal device 20-1, the delivery request user may confirm the presented dedicated delivery period, and the terminal device 20-1 may notify the management server 100 of the confirmed dedicated delivery period.

(Step S302) The vehicle dispatch processing unit 106 determines whether or not there is an existing trip within the designated dedicated delivery period. The existing trip is an existing trip related to the delivery vehicle dispatch of store O1. If there is no existing trip, proceed to step S303, and if there is an existing trip, proceed to step S304.

(Step S303) The dispatch processing unit 106 determines whether a trip can be formed using the new demand alone. Specifically, when assuming a trip formed using the new demand alone, the dispatch processing unit 106 determines whether the trip formed using the new demand alone is within the designated dedicated delivery period and does not overlap with existing trips in terms of time series. When the dispatch processing unit 106 determines that the trip is within the designated dedicated delivery period and does not overlap with existing trips in terms of time series, it determines that a trip can be formed using the new demand alone.

The processing procedure of step S303 is the same as that shown in FIG. 8 above. The processing of step S303 will be explained with reference to FIG. 8.

(Step S101) The dispatch processing unit 106 determines the departure base (BS) and arrival base (BG) based on the vehicle information 110b.

(Step S102) The vehicle dispatch processing unit 106 calculates each time (t_BS, t_O1, t_D1, t_BG) when a trip is formed by the new demand alone. Time t_BS is the time when the vehicle VE departs from base BS, time t_O1 is the time when the vehicle VE arrives at store O1, time t_D1 is the time when the vehicle VE arrives at delivery location D1, and time t_BG is the time when the vehicle VE returns to base BG. The condition for a trip to be formed by the new demand alone is that all times t_BS, t_O1, t_D1, and t_BG are within the designated delivery dedicated period of store O1. The calculation method for each time is shown below.

The earliest time that the vehicle can depart from the base after the start time of the designated dedicated delivery period is set as t_BS, and the remaining t_O1, t_D1, and t_BG are formed by sequentially adding the travel time between each point output by the route search unit 108 to t_BS to form a trip. This allows the trip to be packed as close together as possible from the beginning of the dedicated delivery period, improving the efficiency of delivery vehicle dispatch.

When creating a trip, the base departure time t_BS is set to a time later than the expected reservation confirmation time (current time + dispatch confirmation grace period). This base departure time constraint is a necessary condition for the vehicle to depart from the base at the scheduled time.

(Step S103) The dispatch processing unit 106 determines whether the newly created demand-only trip satisfies all of the constraint conditions list.

The constraints for delivery dispatch are listed below.

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

(Constraint b)
All times t_BS, t_O1, t_D1, and t_BG are within the designated dedicated delivery period (the dedicated delivery period of store O1). The dispatch processing unit 106 determines that the time period from t_BS to t_BG of the new demand single trip is within the designated dedicated delivery period (the dedicated delivery period of store O1).

(Step S104) If all of the constraint conditions are satisfied, the dispatch processing unit 106 determines that dispatching a new demand-only trip is possible.

(Step S105) If any of the constraint conditions in the constraint condition list is not satisfied, the dispatch processing unit 106 determines that dispatching a vehicle for a new demand-only trip is not possible.

Returning to FIG.
As a result of step S303, if a vehicle can be dispatched for a trip based on a new demand alone (step S303, YES), the process proceeds to step S306. On the other hand, if a vehicle cannot be dispatched for a trip based on a new demand alone (step S303, NO), the process proceeds to step S307.

(Step S304) The dispatch processing unit 106 determines whether it is possible to insert a new demand into an existing trip that exists within the designated dedicated delivery period. The existing trip is an existing trip related to the dispatch of a delivery vehicle for store O1.

The processing procedure of step S304 is the same as that of FIG. 9 described above. The processing of step S304 will be explained with reference to FIG. 9.

(Step S201) The dispatch processing unit 106 determines the insertion location of the new demand into the existing trip without changing the order of the existing demands based on the idea of the sequential optimal insertion method. As an example, the explanation will continue with the case where there are "N-1" existing demands in the existing trip and the Nth new demand is to be inserted.

As a method for determining an insertion location for inserting a new demand into an existing trip, the following method may be used.
(Example of a method for determining an insertion location) In this example, the location where a new demand can be inserted is changed depending on whether the existing trip is in operation or not. When the existing trip is not yet in operation, a new demand can be inserted between all waypoints and bases of the existing trip. On the other hand, when the existing trip is in operation, a new demand can be inserted between all waypoints and bases of the existing trip where the vehicle VE has not yet arrived. Note that, taking into consideration the safety of operation, a new demand may be inserted only between the last waypoint and the base where the vehicle VE returns to.

(Step S202) The dispatch processing unit 106 calculates each time when the delivery location D_N of the Nth demand is inserted as a new intermediate destination based on the departure time t_BS of the departure base BS of the existing trip.

Here, calculation of each time when inserting a delivery location D_N of an N-th demand as a new waypoint will be explained for three cases: a case of immediate reservation and a case where a desired arrival time is specified in advance reservation. However, the departure time of each waypoint is determined as follows.
Starting point: t_BS
Store O1: t_O1
Delivery location D_N: t_DN

(In case of immediate reservation)
The vehicle dispatch processing unit 106 calculates t_DN by adding the travel time to the departure time from the waypoint immediately preceding the delivery location D_N.

(If a desired arrival time is specified in advance reservation)
The vehicle dispatch processing unit 106 sets the desired arrival time to t_DN.

(Step S203) The dispatch processing unit 106 checks whether there is a new demand insertion (insertion of delivery location D_N) between store O1 and the first waypoint (delivery location). If the result of this check shows that there is a new demand insertion between store O1 and the first waypoint (delivery location), the process proceeds to step S207, and if not, the process proceeds to step S204.

(Step S204) The dispatch processing unit 106 determines whether inserting a new demand into an existing trip satisfies all of the constraint conditions for dispatching a delivery vehicle. If the result of this determination is that all of the constraint conditions for dispatching a delivery vehicle are satisfied, the process proceeds to step S205; if not, the process proceeds to step S206.

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

(Step S206) If there is another place to insert a new demand, return to step S201; otherwise, end the process in FIG. 9.

(Step S207) When a new demand is inserted between store O1 and the first stopover (delivery location), the dispatch processing unit 106 advances the base departure time t_BS by a predetermined time width Tshift and recalculates each time. However, the limit for advancing the base departure time t_BS is the start of the dedicated delivery period for store O1.

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

(Step S209) The dispatch processing unit 106 determines whether the number of times steps S207-S208 are repeated is equal to or less than a predetermined value M_shift. If the result of this determination is equal to or less than the predetermined value M_shift, the process returns to step S207. On the other hand, if the number of times exceeds the predetermined value M_shift, the process proceeds to step S206. As a result, the dispatch processing unit 106 advances the base departure time t_BS by the time width Tshift and calculates each time up to M_shift times until a trip is found that satisfies all of the list of constraint conditions related to delivery dispatch.

Returning to FIG.
As a result of step S304, if it is possible to insert a new demand into the existing trip (YES in step S304), the process proceeds to step S305, and if not (NO in step S304), the process proceeds to step S307.

(Step S305) The dispatch processing unit 106 selects the trip (delivery dispatch) with the smallest delay cost from the trips (delivery dispatch) output in step S304 (step S205). An example of a method for calculating the delay cost is shown below.

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

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

However, additional delay of existing demand refers to a delay of existing demand that occurs newly due to the insertion of new demand into an existing trip.

(Step S306) The dispatch processing unit 106 outputs the trip determined in step S303 or S305 as a normal trip. After this, the processing in FIG. 6 ends. A normal trip is a trip that satisfies all of the constraint conditions list related to delivery dispatch without changing the user's desired time (desired departure time and desired arrival time). Therefore, a normal trip satisfies the user's desired time (desired departure time and desired arrival time) and also satisfies all of the constraint conditions list related to delivery dispatch.

(Step S307) The dispatch processing unit 106 outputs that dispatching a vehicle is not possible.

In addition, for delivery vehicle dispatch, similarly to the above-mentioned shuttle vehicle dispatch, the dispatch processing unit 106 may output nearby trips. A nearby trip for delivery vehicle dispatch is a trip that satisfies all of the constraint conditions list for delivery vehicle dispatch but does not satisfy the user's desired time (desired departure time or desired arrival time).
The vehicle allocation processing unit 106 may also execute a trip selection process for delivery vehicle allocation shown in Fig. 14. The trip selection process for delivery vehicle allocation according to this embodiment will be described with reference to Fig. 14.

(Step S401) The dispatch processing unit 106 determines whether or not at least one regular trip has been found among the extracted trips. If the result of this determination is that at least one regular trip has been found, the process proceeds to step S402, and if no regular trip has been found, the process proceeds to step S403.

(Step S402) The dispatch processing unit 106 outputs, from the extracted normal trips, the one trip with the smallest number of stops at store O1 among the trips with the smallest delay cost as the final delivery dispatch (normal trip).

(Step S403) The dispatch processing unit 106 outputs, among the extracted nearby trips, a maximum of two trips as the final delivery dispatch (nearby trips): the trip with the fewest number of stops at store O1 among the trips before the desired time (e.g., the desired arrival time at the delivery location) that are closest to the desired time, and the trip with the fewest number of stops at store O1 among the trips after the desired time that are closest to the desired time.

In addition, when a delivery vehicle cannot be allocated within a certain dedicated delivery period in response to a delivery reservation request, the vehicle allocation processing unit 106 may output information on a delivery vehicle allocated within another dedicated delivery period different from the certain dedicated delivery period. For example, when a delivery vehicle cannot be allocated within the existing dedicated delivery period for store O1 in response to a delivery reservation request for store O1, the vehicle allocation processing unit 106 may set a new dedicated delivery period for store O1 and output information on a delivery vehicle allocated within the newly set dedicated delivery period for store O1. The newly set dedicated delivery period is dynamically generated during operating hours, during a time period that does not overlap with existing trips or break times.

In addition, when a vehicle cannot be allocated within a certain dedicated delivery period in response to a delivery reservation request, the vehicle allocation processing unit 106 may extend the certain dedicated delivery period and output information on vehicle allocation within the extended dedicated delivery period. For example, when a vehicle cannot be allocated within an existing dedicated delivery period for store O1 in response to a delivery reservation request for store O1, the vehicle allocation processing unit 106 may extend the existing dedicated delivery period and output information on vehicle allocation within the extended existing dedicated delivery period. An upper limit may be set for the extension time of the dedicated delivery period.

In addition, an upper limit may be set for the number of vehicles that can be allocated to one dedicated delivery period. For example, the vehicle allocation processing unit 106 may limit the number of vehicles that can be allocated to a dedicated delivery period for store O1 in response to a delivery reservation request for store O1 to a predetermined upper limit. The upper limit for the number of vehicles that can be allocated to a dedicated delivery period may be set for each store, or may be set commonly for all stores.

The above is an explanation of the method for determining vehicle dispatch for delivery.

In addition, for a ride reservation request received by the reception unit 104 after a predetermined reception deadline for delivery, the vehicle allocation processing unit 106 may further output vehicle allocation information that overlaps with the dedicated delivery period based on the execution result of vehicle allocation calculation for the ride reservation request. For example, the reception unit 104 may only accept delivery reservation requests until the product order deadline of the store O1, but may also accept ride reservation requests after the product order deadline. For a ride reservation request received by the reception unit 104 after the product order deadline of the store O1, the vehicle allocation processing unit 106 may output a shuttle vehicle allocation that overlaps with the dedicated delivery period of the store O1.
Furthermore, the reception unit 104 may set the deadline for accepting delivery reservation requests for a store to a time a certain time before the scheduled time that a vehicle will arrive at the store based on the vehicle information 110b (vehicle allocation schedule information). For example, the reception unit 104 may obtain the scheduled time that a vehicle VE for delivery to the store O1 will arrive at the store O1 based on the vehicle information 110b (vehicle allocation schedule information), and set the deadline for accepting delivery reservation requests for the store O1 to a time a certain time before the obtained scheduled time.

Figure 15 shows an example of the output of the final trip (dispatch). Figure 15 shows an example of the output of a shuttle dispatch as an example of this embodiment, but the same applies to delivery dispatch.

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

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

The dispatch processing unit 106 creates a ride reservation response addressed to the terminal device 20-1, including information on the finally output trip (dispatch) and information indicating that dispatch is possible for that trip (dispatch). The dispatch processing unit 106 outputs the created ride reservation response to the communication unit 102. This notifies the user that dispatch is possible according to that trip (dispatch). When a normal trip is notified to the user, the user recognizes that a vehicle can be dispatched that meets all of the user's desired conditions. On the other hand, when a nearby trip is notified to the user, the user recognizes that dispatch is possible if the user agrees to changes to the desired conditions indicated in the notified dispatch information, among the user's desired conditions.

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

According to the above-described embodiment, in a demand-based vehicle dispatch management system that operates vehicles according to reservations, it is possible to realize both shared vehicle dispatch (pick-up and drop-off vehicle dispatch) and vehicle dispatch for delivery of luggage (delivery vehicle dispatch).

In addition, delivery vehicle dispatches will require fewer stops at stores, with a minimum of one stop, reducing the burden on both the store and the vehicle operator. Furthermore, delivery demand can be consolidated into one trip, significantly reducing the overall vehicle operating time.

Furthermore, this will make it possible to improve the overall service quality of on-demand transportation services, for example, and contribute to Goal 9 of the United Nations' Sustainable Development Goals (SDGs), which is to "build resilient infrastructure, promote sustainable industrialization and foster innovation."

The above describes an embodiment of the present invention in detail with reference to the drawings, but the specific configuration is not limited to this embodiment and includes design modifications and the like that do not deviate from the gist of the present invention.

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

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

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

Claims (12)

In a demand-based vehicle dispatch management system that operates vehicles according to reservations,
A vehicle dispatch schedule information storage unit that stores vehicle dispatch schedule information indicating a vehicle dispatch schedule;
A dedicated delivery period information storage unit that stores dedicated delivery period information indicating a dedicated delivery period for each store;
A ride reservation request is received from a ride requesting user, the request including information specifying a boarding location where the person will board and information specifying a disembarking location where the person will disembark;
A reception unit that receives a delivery reservation request from a delivery request user, the request including information specifying the store where the package will be received and information specifying a delivery location where the package will be delivered;
When the reception unit receives a boarding reservation request, it executes a vehicle allocation calculation for the boarding reservation request based on the vehicle allocation schedule information and the delivery dedicated period information, and outputs new vehicle allocation information that does not overlap with the delivery dedicated period based on a result of executing the vehicle allocation calculation for the boarding reservation request;
a vehicle allocation processing unit that, when the reception unit receives a delivery reservation request, executes vehicle allocation calculation for the delivery reservation request based on the vehicle allocation schedule information and the dedicated delivery period information, and outputs information on new vehicle allocation within the dedicated delivery period based on a result of execution of the vehicle allocation calculation for the delivery reservation request;
Equipped with
When a vehicle cannot be allocated within one dedicated delivery period in response to a delivery reservation request, the vehicle allocation processing unit creates a new dedicated delivery period in a time slot that does not overlap with a vehicle allocation plan already planned at the time of the delivery reservation request , and outputs information on a new vehicle allocation within the newly created dedicated delivery period.
Vehicle dispatch management system. The vehicle dispatch processing unit is capable of outputting new vehicle dispatch information that overlaps with the delivery dedicated period in response to a ride reservation request that is accepted by the acceptance unit after a predetermined acceptance deadline for delivery.
The vehicle dispatch management system according to claim 1 . The delivery-only periods for the plurality of stores do not overlap;
The vehicle dispatch management system according to claim 1 . The delivery dedicated period is the same for a plurality of said stores;
The vehicle dispatch management system according to claim 1 . There is a limit on the number of vehicles that can be included in a single delivery period.
The vehicle dispatch management system according to claim 1 . the vehicle allocation processing unit, when a vehicle is allocated in response to a delivery reservation request, outputs information on a new vehicle allocation that will minimize the number of times the vehicle will pass through the store;
The vehicle dispatch management system according to claim 1 . When an existing vehicle dispatch schedule in which the ride reservation request or the delivery reservation request can be incorporated is found, the vehicle dispatch processing unit outputs information on a vehicle dispatch resulting from incorporating the request into the existing vehicle dispatch schedule.
The vehicle dispatch management system according to claim 1 . The vehicle dispatch processing unit includes:
If the existing vehicle dispatch schedule is not yet in service, incorporate a ride reservation request or a delivery reservation request between any of the waypoints and bases among all the waypoints and bases in the existing vehicle dispatch schedule;
If the existing vehicle dispatch schedule is in operation, incorporate a ride reservation request or a delivery reservation request into any of the waypoints and bases where the vehicle has not yet arrived among all the waypoints and bases in the existing vehicle dispatch schedule;
The vehicle dispatch management system according to claim 7. When a vehicle dispatch satisfying the ride reservation request or the delivery reservation request is not obtained, the vehicle dispatch processing unit outputs information on a new vehicle dispatch obtained by modifying a part of the request.
The vehicle dispatch management system according to claim 1 . the reception unit sets a time a certain time before a scheduled time when the vehicle is to arrive at the one of the stores based on the dispatch schedule information as a deadline for receiving delivery reservation requests for the one of the stores;
The vehicle dispatch management system according to claim 1 . A vehicle dispatch management method executed by a demand-based vehicle dispatch management system that operates vehicles according to reservations, comprising:
a vehicle dispatch schedule information storage step of storing vehicle dispatch schedule information indicating a vehicle dispatch schedule;
A dedicated delivery period information storage step for storing dedicated delivery period information indicating a dedicated delivery period for each store;
A ride reservation request is received from a ride requesting user, the request including information specifying a boarding location where the person will board and information specifying a disembarking location where the person will disembark;
A receiving step of receiving a delivery reservation request from a delivery request user, the delivery reservation request including information for identifying the store where the package is to be received and information for identifying a delivery location where the package is to be delivered;
When a boarding reservation request is received, a vehicle allocation calculation is performed for the boarding reservation request based on the vehicle allocation schedule information and the delivery dedicated period information, and new vehicle allocation information that does not overlap with the delivery dedicated period is output based on the execution result of the vehicle allocation calculation for the boarding reservation request;
a vehicle allocation processing step for, when a delivery reservation request is received, executing vehicle allocation calculation for the delivery reservation request based on the vehicle allocation schedule information and the dedicated delivery period information, and outputting information on new vehicle allocation within the dedicated delivery period based on a result of executing the vehicle allocation calculation for the delivery reservation request;
Including,
The vehicle allocation processing step, when a vehicle cannot be allocated within a certain dedicated delivery period in response to a delivery reservation request, creates a new dedicated delivery period in a time slot that does not overlap with a vehicle allocation plan already planned at the time of the delivery reservation request , and outputs information on a new vehicle allocation within the newly created dedicated delivery period.
Vehicle allocation management methods. The computer of the demand-based vehicle dispatch management system that operates vehicles according to reservations,
a vehicle dispatch schedule information storage step of storing vehicle dispatch schedule information indicating a vehicle dispatch schedule;
A dedicated delivery period information storage step for storing dedicated delivery period information indicating a dedicated delivery period for each store;
A ride reservation request is received from a ride requesting user, the request including information specifying a boarding location where the person will board and information specifying a disembarking location where the person will disembark;
A receiving step of receiving a delivery reservation request from a delivery request user, the delivery reservation request including information for identifying the store where the package is to be received and information for identifying a delivery location where the package is to be delivered;
When a boarding reservation request is received, a vehicle allocation calculation is performed for the boarding reservation request based on the vehicle allocation schedule information and the delivery dedicated period information, and new vehicle allocation information that does not overlap with the delivery dedicated period is output based on the execution result of the vehicle allocation calculation for the boarding reservation request;
a vehicle allocation processing step for, when a delivery reservation request is received, executing vehicle allocation calculation for the delivery reservation request based on the vehicle allocation schedule information and the dedicated delivery period information, and outputting information on new vehicle allocation within the dedicated delivery period based on a result of executing the vehicle allocation calculation for the delivery reservation request;
Run the command,
The vehicle allocation processing step, when a vehicle cannot be allocated within a certain dedicated delivery period in response to a delivery reservation request, creates a new dedicated delivery period in a time slot that does not overlap with a vehicle allocation plan already planned at the time of the delivery reservation request , and outputs information on a new vehicle allocation within the newly created dedicated delivery period.
Computer program.

Images