JP7383330B2 - Dispatch device, dispatch method, and program - Google Patents

Description

The present invention relates to a vehicle dispatching device, a vehicle dispatching method, and a program, and particularly to a vehicle dispatching device, a vehicle dispatching method, and a program that can realize efficient operation.

For example, if among the users who have specified their desired boarding location, there is a user who has attribute information that may make it more difficult to move (for example, she is pregnant or has some kind of disease). , virtual bus stops are installed at locations to reduce the burden on users with attribute information that can be a burden when traveling, even if the travel distance is somewhat unequal from the perspective of other users. An information processing device has been disclosed (for example, see Patent Document 1).

Patent No. 6408118

However, since the information processing device disclosed in Patent Document 1 installs virtual bus stops based on user attribute information, there is a problem that the route becomes inefficient for vehicles. In addition, since the information processing device disclosed in Patent Document 1 places importance on user attribute information, some users may hardly get a vehicle dispatched to a specified vehicle dispatching position depending on their attributes, and it is hardly useful for some users. There was also the issue of ending up with something that doesn't exist.

The present invention was made in order to solve the above-mentioned problems, and an object of the present invention is to provide a vehicle dispatching device, a vehicle dispatching method, and a program that can realize efficient operation.

In order to achieve the above object, the vehicle dispatching device according to the first aspect of the present invention utilizes a vehicle dispatching request in which a user requests dispatching a vehicle to a designated vehicle dispatching position within a predetermined range between predetermined stopping positions. The vehicle travels between the stopping positions via at least one of the vehicle allocation positions specified from each of the vehicle allocation requests received from a plurality of user terminals, and a receiving means that receives information from a user terminal via a network . a candidate generating means for generating a plurality of route candidates, a numerical value calculating means for calculating a numerical value indicating the inconvenience of each of the route candidates generated by the candidate generating means, and a numerical value calculating means based on the numerical value calculated by the numerical value calculating means. and route determining means for determining a route for the vehicle to travel from among the route candidates.

The above-mentioned vehicle dispatching device transmits, via the network, a notification that a vehicle can be dispatched to the user terminal of the user whose specified vehicle dispatching position is included in the route determined by the route determining means. and notifies the user terminal of the user whose designated vehicle allocation position is not included in the route that the vehicle cannot be allocated, and recommends the user to make the request for the next vehicle allocation. The device may further include transmitting means for transmitting the information via the network.

Further, in the above-mentioned vehicle dispatching device, when the number of the vehicle dispatching requests received within a predetermined period exceeds a predetermined upper limit, the transmitting means transmits the In addition to notifying the user terminal that the vehicle cannot be dispatched, a notification recommending the next vehicle dispatch request may be sent to the user via the network.

Furthermore, the vehicle dispatching device excludes, from the route candidates generated by the candidate generation means, routes in which an increase in the traveling period of the vehicle caused by passing through the vehicle dispatching position exceeds a predetermined tolerance range. It may further include an exclusion means.

Further, in the above-mentioned vehicle dispatching device, the route determining means may determine the route candidate with the smallest numerical value calculated by the numerical value calculating means as the route on which the vehicle will travel.

Furthermore, in the above-mentioned vehicle dispatching device, the numerical value calculation means may calculate an added value of a plurality of types of numerical values indicating the inconvenience of each of the route candidates.

Further, in the vehicle allocation method according to the second aspect of the present invention, the user sends a vehicle allocation request via the network from a user terminal to a specified vehicle allocation position within a predetermined range between predetermined stopping positions. a plurality of route candidates for driving between the stop positions via at least one of the vehicle allocation positions identified from each of the vehicle allocation requests received from the plurality of user terminals; a numerical value calculation step of calculating numerical values indicating the inconvenience of each of the route candidates generated by the candidate generating step; a route determining step of determining a route for the vehicle to travel from among the routes.

The program according to the third aspect of the present invention sends a vehicle dispatch request from a user terminal to a computer to dispatch a vehicle to a vehicle dispatch position specified by the user within a predetermined range between predetermined stopping positions. a candidate route for traveling between the stopping positions via at least one of the vehicle allocation positions specified from the reception procedure received via the vehicle allocation request and each of the vehicle allocation requests received from the plurality of user terminals; a candidate generation procedure that generates a plurality of candidates for the route; a numerical value calculation procedure that calculates a numerical value indicating the inconvenience of each of the route candidates generated by the candidate generating procedure; This is for executing a route determination procedure for determining a route for a vehicle to travel from among the candidates.

According to the present invention, it is possible to provide a vehicle dispatching device, a vehicle dispatching method, and a program that can realize efficient operation.

FIG. 1 is a diagram for explaining an overview of a vehicle dispatch system according to the present embodiment. 1 is a diagram illustrating a configuration example of a vehicle dispatch system according to the present embodiment. FIG. 2 is a block diagram showing a configuration example of a user terminal. FIG. 2 is a block diagram showing a configuration example of a vehicle dispatching device. FIG. 2 is a block diagram showing a configuration example of a vehicle terminal. 2 is a flowchart showing details of vehicle allocation processing.

The best mode for carrying out the present invention will be described below.

First, the configuration of a vehicle dispatch system according to an embodiment of the present invention will be described with reference to the drawings.

The vehicle dispatch system according to this embodiment is intended to realize a new transportation system for vehicles such as buses that is located between existing community buses and demand taxis, with the premise that it will be closely linked to local town development. be.

FIG. 1 is a diagram for explaining an overview of a vehicle dispatch system according to the present embodiment.

As shown in FIG. 1, in the vehicle dispatch system according to the present embodiment, one vehicle travels around a fixed route (driving route) at intervals of a predetermined period (for example, about 30 minutes to one hour). Routes have predetermined stopping positions (fixed passing points), such as fixed stops near commercial facilities or large hospitals, but users can freely pass through other than fixed passing points if certain conditions are met. Points can be designated as vehicle allocation positions such as boarding positions and alighting positions. The route changes from time to time depending on the reservation status of the user. A unique algorithm is used to create this route. According to this algorithm, it is possible to score the status of a user's past vehicle allocation reservations, and also to take into account the priorities of other users. For this reason, users may not have their own ride reservations reflected. In this case, the vehicle allocation reservation is given priority to the next lap. The departure time of each fixed passing point is fixed like a bus, but the time required between fixed passing points is assumed to be the above-mentioned route change, and a certain amount of time is allowed. Vehicle allocation locations will be limited to two to three locations between fixed passing points. It is assumed that this vehicle dispatch system can be used not only to transport users, but also to transport goods.

The ride dispatch system according to this embodiment is aimed mainly at elderly people who have lost their means of transportation, such as elderly people who have surrendered their driver's licenses or elderly people who do not originally have a license, rather than young or middle-aged people. The aim is to provide a new mobility solution to these elderly people.

Note that the vehicles expected to be used in the vehicle allocation system according to the present embodiment include not only buses and the like, but also light vehicles and the like, so it is possible to enter even narrow alleys and allow users to board the vehicle.

FIG. 2 is a diagram showing a configuration example of the vehicle dispatch system according to the present embodiment.

As shown in FIG. 2, the vehicle dispatch system 1 includes a plurality of user terminals 2-m (m is a natural number), a vehicle dispatch device 3, and a vehicle terminal 4, which are connected to a network N such as the Internet. are communicably connected to each other via the

The user terminal 2-m is composed of, for example, a general-purpose smartphone or a tablet computer. Note that the user terminal 2-m may be configured from, for example, a general-purpose personal computer.

FIG. 3 is a block diagram showing an example of the configuration of a user terminal.

As shown in FIG. 3, the user terminal 2-m includes a storage section 21, a touch panel 22, a communication section 23, and a control section 24, which are connected via a bus or the like.

The storage unit 21 is composed of, for example, a nonvolatile memory such as a general-purpose flash memory. Various application programs are installed in the storage unit 21. In this embodiment, an application program (hereinafter referred to as a "vehicle dispatch reservation application") for realizing a vehicle dispatch reservation is installed in the storage unit 21. Note that the ride reservation application is not limited to being installed in the storage unit 21 as an independent application program; for example, by accessing a specific website and performing user operations on that website each time. It may also be in the form of processing.

The touch panel 22 is composed of, for example, a general-purpose touch panel that combines a liquid crystal display device and a pointing device. The touch panel 22 displays various screens and accepts various operations by the user. In this embodiment, the user taps the icon of the vehicle reservation application displayed on the touch panel 22 to start the vehicle reservation application.

Further, the user specifies a free passing point within a predetermined range between predetermined stopping positions (fixed passing points) on the vehicle allocation position designation screen of the vehicle allocation reservation application displayed on the touch panel 22. Note that the user may specify free passing points, etc. when registering as a new user. Here, the predetermined range is a range within which the vehicle can move within a time period that is the sum of the time the vehicle normally travels between fixed passing points plus a predetermined time. Users can specify free passing points in more detail than in conventional on-demand bus services, for example, even the eaves of the user's home. Therefore, users can move very comfortably even on rainy days, and the burden on their bodies can be reduced. The user can also specify fixed passing points.

Furthermore, on the vehicle dispatch reservation screen of the vehicle dispatch reservation application displayed on the touch panel 22, the user specifies the vehicle dispatch position, such as the boarding position and the disembarkation position, from among the pre-registered free passing points, and also provides additional information such as the inability to carpool. After entering the information, the user instructs the user to reserve a seat in the vehicle (dispatch reservation). Note that if the user is an elderly person who has difficulty using the Internet, a caregiver or relative of the user may make the reservation for the ride. Furthermore, if the vehicle dispatch reservation application is not installed in the storage unit 21 or if the user terminal 2-m is configured from a personal computer, the user may not be able to make a vehicle dispatch reservation on the website operated by the vehicle dispatch system 1. It is possible. Additionally, users may reserve a ride over the phone.

Then, the touch panel 22 displays whether the vehicle can be dispatched or not, and if the vehicle cannot be dispatched, displays the next dispatch timing (for example, the time when the next vehicle will pass the previous fixed passing point, etc.) and informs the user that the next vehicle will be dispatched next time. Recommends reservations for vehicles.

The communication unit 23 is composed of, for example, a general-purpose wireless communication device. In the present embodiment, the communication unit 23 receives a registration application for registering a free passing point specified by the user, and a vehicle allocation position specified by the user within a predetermined range between predetermined stopping positions (fixed passing points). A vehicle allocation request is sent to the vehicle allocation device 3 via the network N. Further, the communication unit 23 receives a vehicle allocation permission notification transmitted from the vehicle allocation device 3 via the network N, which notifies whether the vehicle allocation is possible or not.

The control unit 24 includes, for example, a CPU (Central Processing Unit), a ROM (Read Only Memory), and a RAM (Random Access Memory). The CPU controls various operations of the user terminal 2-m by appropriately executing various programs stored in the ROM and the storage unit 21 using the RAM as a work memory.

In the present embodiment, the control unit 24 activates the vehicle dispatch reservation application stored in the storage unit 21 in response to the user tapping the vehicle dispatch reservation application icon displayed on the touch panel 22 .

Then, in response to the user specifying a free passing point in the ride dispatch application, the control unit 24 sends a registration application for specifying the free passing point specified by the user from the communication unit 23 via the network N. The information is transmitted to the dispatch device 3.

In addition, the control unit 24 responds to the user's instruction to make a vehicle allocation reservation after specifying a vehicle allocation position from among the free passing points registered in advance in the vehicle allocation reservation application and inputting additional information such as not allowing carpooling. Then, the communication unit 23 transmits to the vehicle dispatching device 3 via the network N a vehicle dispatching request that can specify the vehicle dispatching position such as the boarding position and the disembarking position specified by the user and the accompanying information.

Thereafter, in response to receiving the vehicle allocation permission notification transmitted from the vehicle allocation device 3 via the network N, the control unit 24 notifies the operator by displaying on the touch panel 22 whether or not the vehicle can be allocated. , displays the next vehicle dispatch timing on the touch panel 22, and recommends the user to reserve the next vehicle dispatch.

The vehicle dispatching device 3 shown in FIG. 2 is composed of, for example, a general-purpose server computer, a general-purpose database (DataBase; DB), and the like.

FIG. 4 is a block diagram showing a configuration example of the vehicle dispatching device.

As shown in FIG. 4, the vehicle dispatching device 3 includes a communication section 31, a storage section 32, and a control section 33, which are connected via a bus or the like.

The communication unit 31 includes, for example, an NIC (Network Interface Card). The communication unit 31 performs wireless communication with the user terminal 2-m and the vehicle terminal 4 via the network N. In the present embodiment, the communication unit 31 receives a registration application and a vehicle allocation request transmitted from the user terminal 2-m via the network N, and sends a vehicle allocation permission notification via the network N to the user terminal 2-m. or send it to. Further, the communication unit 31 transmits a route notification to the vehicle terminal 4 via the network N, notifying the determined vehicle route.

The storage unit 32 is composed of, for example, a general-purpose hard disk drive. Various application programs are installed in the storage unit 32. In this embodiment, the storage unit 32 is installed with a route planning program that creates a vehicle route using a unique algorithm. If the vehicle allocation location specified by the user is reflected on the route created by this unique algorithm, the vehicle will be dispatched safely, but the vehicle allocation location specified by another user will be given priority, etc. If the vehicle allocation position is not reflected, the vehicle will not be dispatched.

The storage unit 32 also stores, for each fixed transit point i (i is a natural number), a combination (unit route) of free transit points that can be passed through (stopped over), and the time loss caused by the transit (how many minutes is delayed due to the transit). A route DB is provided in which data for associating data such as

The control unit 33 includes, for example, a CPU, a ROM, a RAM, and the like. The CPU controls various operations of the vehicle dispatching device 3 by appropriately executing programs stored in the ROM and the storage unit 32 using the RAM as a work memory.

In this embodiment, the RAM of the control unit 33 is provided with a vehicle allocation position counter that counts the number of vehicle allocation positions specified by the user for each fixed passing point. The CPU of the control unit 33 functions as a receiving unit, a candidate generating unit, an excluding unit, a numerical value calculating unit, a route determining unit, and a transmitting unit by executing the route planning program stored in the storage unit 32. .

First, in response to the communication unit 31 receiving a registration application transmitted from the user terminal 2-m via the network N, the control unit (receiving means) 33 controls the free passing point specified from the registration application. Determine whether registration is possible.

When the control unit 33 determines that the free passing point specified from the registration application is registrable, it newly registers the free passing point and generates a route pattern that passes through the newly registered free passing point. and register it in the root DB. Specifically, the control unit 33 first generates a unit route via the newly registered free passing point for each fixed passing point interval i. Here, the generated unit route includes, in addition to a unit route that only passes through the newly registered free passing point, multiple routes such as the newly registered free passing point and one or more other already registered free passing points. Unit routes via free passage points are also included. Next, the control unit 33 calculates the time loss caused by passing through the free passage point for each generated unit route. Then, the control unit 33 registers the generated unit route and the calculated time loss in association with each other in the route DB.

Furthermore, each time the communication unit 31 receives a vehicle allocation request transmitted from the user terminal 2-m via the network N, the control unit (receiving means) 33 determines the boarding position and the alighting position specified from the vehicle allocation request. The value n(i) (n is a natural number) of the vehicle allocation position counter provided corresponding to the existing fixed passing point interval i is each incremented by 1.

Then, the control unit 33 determines whether the value n(i) of the vehicle allocation position counter has reached a preset upper limit value B(i)max for vehicle allocation reservation. When the value n(i) of the vehicle allocation position counter reaches the upper limit value B(i)max of the vehicle allocation reservation, the control unit (transmission means) 33 determines whether the vehicle allocation can be reserved for the current vehicle within a predetermined period ( For example, if the number of vehicle dispatch requests received within a period of 30 minutes to 1 hour exceeds the predetermined upper limit B(i)max, the vehicle dispatch reservations between fixed passing points i will be closed and the number of vehicle dispatch requests received within a period of 30 minutes to 1 hour will be closed and the number of vehicle dispatch requests received within a period of 30 minutes to 1 hour will be closed. The communication unit 31 notifies the user terminal 2-m that has sent the vehicle dispatch request that the vehicle cannot be dispatched, and also uses the communication unit 31 via the network N to send a vehicle dispatch permission notification to recommend the user to make a reservation for the next vehicle. 2-m.

After that, if there is a vehicle dispatch reservation specifying the same boarding position and alighting position for the next vehicle from this user terminal 2-m, the control unit 33 gives priority to the route including that position in the next vehicle. If there is no reservation for a vehicle, it may be determined that the vehicle has been boarded or the reservation for a vehicle has been canceled. On the other hand, if the value n(i) of the vehicle allocation position counter has not reached the upper limit value B(i)max of the vehicle allocation reservation, the control unit 33 performs the vehicle allocation such as the boarding position and the alighting position specified from the vehicle allocation request. The location and additional information are stored in RAM.

Next, the control unit (candidate generation means) 33 generates vehicle route candidates in response to the arrival of the vehicle allocation request deadline, which is visited every predetermined period (for example, 30 minutes). More specifically, the control unit (candidate generation means) 33 selects a parking position (fixed passing position) via at least one of the vehicle allocation positions specified from each of the vehicle allocation requests received from the plurality of user terminals 2-m. Generate multiple route candidates between points).

Specifically, the control unit (candidate generation means) 33 first starts from a fixed passing point, which is the current location of the vehicle, and generates fixed passing points k (1≦k<i) points ahead from there. For each point i, a unit route candidate R(i) that passes through at least one of the vehicle allocation positions specified from each of the vehicle allocation requests received from the plurality of user terminals 2-m is detected from the route DB. and list them. For example, if the vehicle is a tour bus, the number of fixed passing points is 10, the current fixed passing point is the 9th fixed passing point, and when k = 3, the 9th and 10th fixed passing points Since it is a point and a tour, we go back to the beginning and list unit route candidates R(i) for each fixed passing point i at each of the first fixed passing points. Here, even if the upper limit number of free passing points that can be stopped at between fixed passing points i is N(i)max (for example, "3"), other passengers are already in the vehicle before reaching between fixed passing points i. If there is a passenger on board (if there is luggage on board), the number of locations that the vehicle can actually pass through (for example, "1 (=3-2)") will decrease. Therefore, the control unit (candidate generation means) 33 divides the cases for each vehicle allocation position N(i) (0≦N(i)≦N(i)max) actually passed between fixed passing points i, and n(i)P0+n(i)P1+n(i)P2+...+n(i)PN(i) permutations are listed as unit root candidates R(i). For example, the control unit (candidate generation means) 33 determines that if the value n(i) of the vehicle allocation position counter provided corresponding to the fixed passing point interval i of interest is "5", the upper limit number N of vehicle allocation positions that can be stopped by is "5". (i) When max is "3", 5P0+5P1+5P2+5P3 (=1+5+10+10=26) permutations are listed as unit route candidates R(i).

Then, the control unit (candidate generation means) 33 combines the unit route candidates R(i) listed for each fixed passing point interval i, and starts from the fixed passing point, which is the current location of the vehicle, from there. Up to the next fixed passing point, (n(1)P0+n(1)P1+n(1)P2+...+n(1)PN(1))×(n(2)P0+n(2)P1+n(2)P2+... +n(2)PN(2))×...×(n(k)P0+n(k)P1+n(k)P2+...+n(k)PN(k)) route candidates are generated.

Subsequently, the control unit (exclusion means) 33 calculates, for each route candidate, the time loss (increase in the travel period of the vehicle) caused by passing through the free passing point.

Specifically, the control unit (exclusion means) 33 first calculates the time loss corresponding to the unit route candidate R(i) for each i fixed pass point after the fixed pass point that is the current location of the vehicle. Detect from DB. Subsequently, the control unit (exclusion means) 33 adds up the time loss of unit route candidates R(i) detected from the route DB for each route candidate, thereby determining the distance between the fixed passing points of each route candidate. Calculate the time loss for each i.

Then, the control unit (exclusion means) 33 executes an exclusion process to exclude routes in which the time loss exceeds a predetermined allowable range from the route candidates, and performs an exclusion process for each fixed passing point after the fixed passing point that is the current location of the vehicle. Only routes with time losses at passing points within a predetermined tolerance are left as candidates.

Further, the control unit (numerical calculation means) 33 calculates, for each route candidate remaining after the exclusion process, a total disutility Fsum, which is the sum of a plurality of numerical values indicating the inconvenience of each route candidate. Note that the control unit (numerical calculation means) 33 may calculate one type of disutility indicating the inconvenience of each route candidate.

Here, "disutility" can be called an inconvenience index, and is expressed by a function that can also be an objective function of an optimization problem. In this embodiment, the total disutility Fsum is the sum of four types of disutility functions (numerical values): boarding disutility F1, waiting disutility F2, congestion disutility F3, and operator disutility F4. That is, Fsum=F1+F2+F3+F4. Note that the number of types of disutility functions (numeric values) to be added is not limited to "4" but is arbitrary.

The ride disutility F1 is some monotonically increasing univariate function of the ride time t. Simply, it is a proportional function of t multiplied by a coefficient a1.

The waiting disutility F2 is set to "0" when the vehicle for which the dispatch reservation is made is available, and is a monotonically increasing univariate function of the waiting time T until the next vehicle when the vehicle for which the dispatch reservation is reserved is unavailable. Simply, it is a quadratic function obtained by multiplying the square of T by a coefficient a2.

The congestion disutility F3 is a function that quantifies the degree of congestion inside the vehicle being boarded, the presence or absence of combinations in which carpooling is not possible, and the like. Simply, it is a monotonically increasing univariate function of the number of people in the car Nc, a quadratic function that is the square of Nc multiplied by a coefficient a3, or the degree of compatibility between specific people or specific luggage is quantified. It is something. Note that the combinations of specific persons or specific packages and their compatibility may be stored in a separate database.

The operator disutility F4 is a function that quantifies the degree of inconvenience of the vehicle for the operator. More specifically, it is a function that quantifies the bad attitude of each possible passenger, as well as the degree and presence or absence of a criminal conviction.

Subsequently, the control unit (route determining means) 33 sorts the route candidates based on the value of the total disutility Fsum, more specifically, in order of the total disutility Fsum, and determines the value of the total disutility Fsum. The route with the smallest value is selected and formulated (determined) as the route for the vehicle to travel this time.

Note that in reality, it is assumed that there will be many cases where the value of the total disutility Fsum will be a small difference. Therefore, the control unit (route determining means) 33 may predetermine a range that is considered to be a close difference as a constant, and list all top routes that fall within that range as candidates. Further, the control unit (route determining means) 33 may decide in advance to unconditionally list up any route within the top rank, and then list all routes that fall within that rank as candidates. . Then, the person in charge may select and formulate the current route for the vehicle from among the route candidates listed.

Then, the control unit (transmission means) 33 transmits a route notification notifying the determined vehicle route to the vehicle terminal 4 via the network N.

In addition, the control unit (transmission means) 33 transmits a vehicle allocation permission notification based on the result of route planning from the communication unit 31 to the user terminal 2-m that transmitted the vehicle allocation request via the network N. Specifically, the control unit (transmission means) 33 notifies the user terminal 2-m of the user whose designated (determined) route includes the specified vehicle allocation position that the vehicle can be allocated. Send. On the other hand, the control unit (transmission means) 33 notifies the user terminal 2-m of the user whose specified vehicle allocation position is not included in the planned (determined) route that the vehicle cannot be allocated, and also notifies the user that the specified vehicle allocation position is not included in the route. The communication unit 31 transmits, via the network N, a vehicle allocation permission notification recommending the next vehicle allocation request.

The vehicle terminal 4 shown in FIG. 2 is mounted on a vehicle and is composed of, for example, a computer having a wireless communication function.

FIG. 5 is a block diagram showing a configuration example of a vehicle terminal.

As shown in FIG. 5, the vehicle terminal 4 includes a communication section 41, a display section 42, and a control section 43, which are connected via a bus or the like.

The communication unit 41 is composed of, for example, a general-purpose wireless communication device. In this embodiment, the communication unit 41 receives a route notification transmitted from the vehicle dispatching device 3 via the network N.

The display unit 42 includes, for example, a general-purpose liquid crystal display (LCD). In this embodiment, the display unit 42 displays the vehicle route drawn up by the vehicle dispatching device 3 on the screen.

The control unit 43 includes, for example, a CPU, a ROM, a RAM, and the like. The CPU controls various operations of the vehicle terminal 4 by using the RAM as a work memory and appropriately executing programs stored in the ROM.

In the present embodiment, in response to the communication unit 41 receiving a route notification transmitted from the vehicle dispatching device 3 via the network N, the control unit 43 displays the route notified by the route notification on the screen of the display unit 42. By displaying the vehicle route on the top, the vehicle driver is notified of the vehicle route drawn up by the vehicle dispatch device 3. Then, the driver can dispatch the vehicle to the user by driving the vehicle according to the vehicle route established by the vehicle dispatching device 3. In addition, the driver determines whether or not a user is actually on board, and prevents the planned vehicle routes from overlapping.

Next, operations performed by the vehicle dispatch system 1 having the above configuration will be described with reference to the drawings.

The control unit 24 of the user terminal 2-m specifies the vehicle allocation position such as the boarding position and the alighting position from among the free passage points that the user has registered in advance in the ride reservation application, and also inputs incidental information such as whether carpooling is not possible. After that, in response to the instruction to reserve a vehicle, the communication unit 23 sends a vehicle dispatch request that can specify the vehicle dispatch location such as the boarding position and the disembarking position specified by the user, as well as incidental information, to the vehicle dispatch device via the network N. Send to 3.

Every time the communication unit 31 receives a vehicle dispatch request transmitted from the user terminal 2-m via the network N, the control unit 33 of the vehicle dispatch device 3 determines the boarding position and the alighting position specified from the vehicle dispatch request. The value n(i) of the vehicle allocation position counter provided corresponding to the fixed passing point interval i is each incremented by 1.

Then, the control unit 33 determines whether the value n(i) of the vehicle allocation position counter has reached a preset upper limit value B(i)max for vehicle allocation reservation. When the value n(i) of the vehicle allocation position counter reaches the upper limit value B(i)max for vehicle allocation reservations, the control unit 33 closes the vehicle allocation reservation between the fixed passing points i and notifies that the vehicle cannot be allocated. A vehicle allocation availability notification is transmitted from the communication unit 31 to the user terminal 2-m via the network N. On the other hand, if the value n(i) of the vehicle allocation position counter has not reached the upper limit value B(i)max of the vehicle allocation reservation, the control unit 33 performs the vehicle allocation such as the boarding position and the alighting position specified from the vehicle allocation request. The location and additional information are stored in RAM.

Thereafter, in response to the fact that the deadline for the vehicle allocation request, which occurs every predetermined period, has come, the control unit 33 starts the vehicle allocation process.

FIG. 6 is a flowchart showing details of the vehicle allocation process.

In the vehicle allocation process shown in FIG. 6, the control unit (candidate generation means) 33 lists candidates for vehicle routes (step S601).

Next, in step S601, the control unit (exclusion means) 33 calculates the time loss caused by passing through the vehicle allocation position for each route candidate (step S602).

Subsequently, the control unit (exclusion means) 33 executes an exclusion process to exclude from the route candidates routes in which the time loss calculated in step S602 exceeds a predetermined tolerance range, and calculates the time at each fixed passing point. Only routes whose loss is within a predetermined allowable range are left as candidates (step S603).

Furthermore, the control unit (numerical calculation means) 33 calculates the total disutility Fsum, which is the sum of multiple types of numerical values indicating the inconvenience of each route candidate, for each route candidate remaining after the exclusion process in step S603. Calculate (step S604).

Next, the control unit (route determining means) 33 selects and formulates the current route for the vehicle to travel from among the route candidates based on the value of the total disutility Fsum calculated in step S604 (step S604). S605).

Then, the control unit (transmission means) 33 sends a route notification notifying the vehicle route determined in step S605 to the vehicle terminal 4 via the network N, thereby transmitting the determined vehicle route to the vehicle terminal 4. The information is displayed on the screen of the display unit 42 to notify the driver of the vehicle (step S606).

Further, the control unit 33 (transmission means) 33 sends a vehicle allocation permission notification based on the result of route planning from the communication unit 31 to the user terminal 2-m that transmitted the vehicle allocation request via the network N. By transmitting the information, the availability of vehicle allocation is displayed on the touch panel 22 of the user terminal 2-m to notify the user (step S607), and then the vehicle allocation process is ended. When the user is notified that the vehicle can be dispatched, the user can board the vehicle from the boarding position designated by the user or get off the vehicle from the boarding position designated by the user.

As explained above, in the vehicle dispatch system 1 according to the present embodiment, the control unit (receiving means) 33 of the vehicle dispatch device 3 is configured to send a vehicle to a vehicle dispatch position specified by the user within a predetermined range between predetermined stopping positions. A vehicle allocation request for requesting vehicle allocation is received from the user terminal 2-m via the network. Next, the control unit (candidate generation means) 33 causes the vehicle to travel between the stop positions via at least one of the vehicle allocation positions specified from each of the vehicle allocation requests received from the plurality of user terminals 2-m. Generate multiple route candidates. Subsequently, the control unit (exclusion means) 33 excludes, from among the route candidates generated by the candidate generation means, routes in which the increase in the travel period of the vehicle caused by passing through the vehicle allocation position exceeds a predetermined tolerance range. do. Furthermore, the control unit (numerical calculation means) 33 calculates the total disutility Fsum, which is the sum of a plurality of numerical values indicating the inconvenience of each route candidate. Then, the control unit (route determining means) 33 determines the route on which the vehicle will travel from among the route candidates based on the numerical value calculated by the numerical value calculating means. Thereafter, the control unit (transmission means) 33 sends a vehicle allocation permission notification to the user terminal 2-m of the user whose route determined by the route determining means includes the designated vehicle allocation position via the network N to the effect that the vehicle can be allocated. Send via. On the other hand, the control unit (transmission means) 33 notifies the user terminal 2-m of the user whose route does not include the specified vehicle allocation position that the vehicle cannot be allocated, and also informs the user that the vehicle allocation position specified in the route is not included. A vehicle dispatch permission notification recommending a vehicle dispatch request is transmitted via the network N. Furthermore, if the number of vehicle dispatch requests received within a predetermined period exceeds a predetermined upper limit, the control unit (transmission means) 33 sends a message to the user terminal 2-m that transmitted the vehicle dispatch requests exceeding the predetermined upper limit. In addition to notifying the user that the vehicle cannot be dispatched, a vehicle dispatch permission notification is sent via the network N to the user recommending the next vehicle dispatch request.

Thereby, the vehicle dispatch system 1 according to the present embodiment can realize efficient operation.

Note that the present invention is not limited to the above-described embodiments, and various modifications and applications are possible. Hereinafter, modifications of the above embodiment that are applicable to the present invention will be described.

In the above embodiment, the programs executed by the CPUs of the control units 24, 33, and 43 were described as being stored in advance in the ROM and the storage units 21 and 32, but the present invention is not limited to this. Instead, by applying a program for executing the above-mentioned processing to an existing general-purpose computer, it can be made to function as the user terminal 2-m, the dispatch device 3, and the vehicle terminal 4 according to the above embodiment. Good too.

Such a program can be provided in any way, such as storing it on a computer-readable recording medium (flexible disk, CD (Compact Disc)-ROM, DVD (Digital Versatile Disc)-ROM, etc.) and distributing it. Alternatively, the program may be stored in a storage on a network such as the Internet and provided by downloading the program.

Furthermore, in the case where the above processing is executed between an OS (Operating System) and an application program, or by cooperation between the OS and an application program, only the application program may be stored in a recording medium or storage. It is also possible to superimpose a program on a carrier wave and distribute it via a network. For example, the program may be posted on a bulletin board system (BBS) on a network and distributed via the network. The above-described process may be executed by starting this program and executing it under the control of the OS in the same way as other application programs.

1 Vehicle dispatch system 2-m User terminal 3 Vehicle dispatch device 4 Vehicle terminals 21, 32 Storage section 22 Touch panel 23, 31, 41 Communication section
42 Display section 24, 33, 43 Control section

Claims (5)

Receiving means for receiving a vehicle dispatch request from a user terminal via a network, requesting dispatch of the vehicle to a vehicle dispatch position specified by the user within a predetermined range between predetermined stopping positions;
Candidate generation means for generating a plurality of route candidates for traveling between the stopping positions via at least one of the vehicle allocation positions specified from each of the vehicle allocation requests received from the plurality of user terminals;
Numeric value calculation means for calculating a numerical value indicating the inconvenience of each of the route candidates generated by the candidate generation means;
route determining means for determining the route candidate with the smallest numerical value calculated by the numerical value calculating means as the route to be traveled by the vehicle;
A notification that a vehicle can be dispatched is sent via the network to the user terminal of the user whose specified vehicle dispatch position is included in the route determined by the route determination means, while A notification is sent to the user terminal of the user that does not include the specified vehicle allocation location that the vehicle cannot be allocated, and a notification is sent to the user via the network to recommend the request for the next vehicle allocation. a transmission means for transmitting;
Equipped with
If the number of the vehicle dispatch requests received within a predetermined period exceeds a predetermined upper limit, the transmitting means cannot dispatch a vehicle to the user terminal that has transmitted the vehicle dispatch requests exceeding the predetermined upper limit. transmitting a notification to the user via the network recommending the dispatch request to the next vehicle;
A vehicle dispatch device characterized by: Further comprising an exclusion means for excluding, from the route candidates generated by the candidate generation means, routes in which an increase in the travel period of the vehicle caused by passing through the vehicle allocation position exceeds a predetermined tolerance range;
The vehicle dispatching device according to claim 1 , characterized in that: The numerical value calculation means calculates a sum of a plurality of numerical values indicating the inconvenience of each of the route candidates.
The vehicle dispatching device according to claim 1 or 2, characterized in that: A vehicle dispatching method executed by a vehicle dispatching device, the vehicle dispatching method comprising:
a receiving step of receiving a vehicle dispatch request from a user terminal via a network, requesting dispatch of the vehicle to a vehicle dispatch position specified by the user within a predetermined range between predetermined stopping positions;
a candidate generation step of generating a plurality of route candidates for traveling between the stopping positions via at least one of the vehicle allocation positions specified from each of the vehicle allocation requests received from the plurality of user terminals;
a numerical value calculation step of calculating a numerical value indicating the inconvenience of each of the route candidates generated in the candidate generation step;
a route determining step of determining the route candidate with the smallest numerical value calculated in the numerical value calculating step as the route on which the vehicle will travel;
While transmitting a notification that a vehicle can be dispatched to the user terminal of the user whose designated vehicle dispatch position is included in the route determined in the route determination step via the network, A notification is sent to the user terminal of the user that does not include the specified vehicle allocation location that the vehicle cannot be allocated, and a notification is sent to the user via the network to recommend the request for the next vehicle allocation. a sending step to send;
Equipped with
In the sending step, if the number of the vehicle dispatch requests received within a predetermined period exceeds a predetermined upper limit, the user terminal that has transmitted the vehicle dispatch requests exceeding the predetermined upper limit cannot be dispatched. transmitting a notification to the user via the network recommending the dispatch request to the next vehicle;
A vehicle dispatch method characterized by : to the computer,
a receiving procedure for receiving a vehicle allocation request from a user terminal via a network, which requests dispatch of the vehicle to a vehicle allocation position specified by the user within a predetermined range between predetermined stopping positions;
a candidate generation procedure for generating a plurality of route candidates for traveling between the stopping positions via at least one of the vehicle allocation positions specified from each of the vehicle allocation requests received from the plurality of user terminals;
a numerical value calculation procedure for calculating a numerical value indicating the inconvenience of each of the route candidates generated by the candidate generation procedure;
a route determining step of determining the route candidate with the smallest numerical value calculated by the numerical value calculating step as the route to be traveled by the vehicle;
A notification that a vehicle can be dispatched is sent via the network to the user terminal of the user whose specified vehicle dispatch position is included in the route determined by the route determination procedure; A notification is sent to the user terminal of the user that does not include the specified vehicle allocation location that the vehicle cannot be allocated, and a notification is sent to the user via the network to recommend the request for the next vehicle allocation. The sending procedure to send,
A program for executing
In the transmission procedure, if the number of vehicle dispatch requests received within a predetermined period exceeds a predetermined upper limit, the user terminal that has transmitted the vehicle dispatch requests exceeding the predetermined upper limit cannot be dispatched. transmitting a notification to the user via the network recommending the dispatch request to the next vehicle;
A program characterized by :

Images