Cargo management device, cargo management method, and program

Abstract

To efficiently manage a loading article of a vehicle.SOLUTION: A vehicle allocation device comprises: a storage unit that stores loading status data indicating a loading status of a vehicle; and a control unit. In response to reception of a vehicle allocation request (loading request) that can specify a loading article of the vehicle and a priority order p for the loading article, the control unit determines whether or not a loading article in a predetermined order (e.g., first order) of the priority order p can be loaded onto the vehicle among the loading articles specified from the loading request (step S607) based on the loading status of the vehicle indicated in the loading status data; if the control unit determines that the loading article of the predetermined order can be loaded (step S608; Yes), the control unit updates the loading status of the vehicle indicated by the loading status data to a status in which the loading articles in the predetermined order have been increased (step S609), and determines whether or not a loading article of a next order (e.g., second order) of the predetermined order can be loaded (step S607).SELECTED DRAWING: Figure 6

Description

[Technical field]

[0001] The present invention relates to a cargo management device, a cargo management method, and a program, and more particularly to a cargo management device, a cargo management method, and a program that can efficiently manage the cargo of a vehicle. [Background technology]

[0002] If, for example, there is a user among the users who have specified their desired boarding location who has attribute information that may place a greater burden on travel (e.g., being pregnant or suffering from some kind of illness), an information processing device has been disclosed that sets up a virtual bus stop at a location that reduces the burden on users with attribute information that may place a greater burden on travel, even if this results in a somewhat unequal relationship in terms of travel distance compared to the remaining users (see, for example, Patent Document 1). [Prior art documents] [Patent documents]

[0003] [Patent Document 1] Patent No. 6408118 Summary of the Invention [Problem to be solved by the invention]

[0004] However, the information processing device disclosed in Patent Document 1 has a problem that the route is inefficient for vehicles because the virtual bus stops are set based on the attribute information of the user. In addition, the information processing device disclosed in Patent Document 1 places importance on the attribute information of the user, so there is a problem that some users are rarely dispatched to the designated dispatch location depending on the attribute, making it almost useless for some users. In addition, the information processing device disclosed in Patent Document 1 has a problem that it cannot efficiently manage the cargo of the vehicle.

[0005] The present invention has been made to solve the above-mentioned problems, and has an object to provide a cargo management device, a cargo management method, and a program capable of efficiently managing cargo on a vehicle. [Means for solving the problem]

[0006] In order to achieve the above-mentioned object, a cargo management device according to a first aspect of the present invention comprises a memory unit that stores loading status data indicating the loading status of a vehicle, and a control unit that, in response to receiving a loading request capable of identifying the cargo of the vehicle and the priority order of the cargo, determines whether or not the cargo of a predetermined rank in the priority order among the cargo identified from the loading request can be loaded onto the vehicle based on the loading status of the vehicle indicated by the loading status data, and if it is determined that the cargo of the predetermined rank can be loaded, updates the loading status of the vehicle indicated by the loading status data to a state in which the cargo of the predetermined rank has been increased, and determines whether or not the cargo of the next highest rank in the predetermined rank can be loaded.

[0007] In the above-mentioned cargo management device, the memory unit may store a first cargo increase / decrease pattern table that registers, for each loading state of the vehicle, a cargo increase / decrease pattern indicating an increase / decrease in the cargo and identification information that can identify the loading state after the cargo increase / decrease, and the control unit may determine whether the cargo of the specified rank can be loaded onto the vehicle by determining whether the identification information corresponding to the cargo increase / decrease pattern indicating an increase / decrease in the cargo of the specified rank caused by the loading request is registered in the first cargo increase / decrease pattern table corresponding to the loading state of the vehicle indicated by the loading state data.

[0008] In addition, in the above-mentioned cargo management device, the memory unit may pre-store standard values ​​for the characteristics of the cargo, and the control unit may calculate the degree of inconsistency between the characteristics of the cargo of the specified rank and the standard values, and if it determines that the cargo of the specified rank can be loaded based on the calculated degree of inconsistency, detect the identification information from the first cargo increase / decrease pattern table, and update the loading state of the vehicle indicated by the loading state data to the loading state after the increase / decrease of the cargo indicated by the detected identification information.

[0009] Furthermore, in the above-mentioned cargo management device, when a plurality of standard values ​​are stored in the memory unit, the first cargo increase / decrease pattern table registers the cargo increase / decrease pattern and the identification information in correspondence with each standard value, and the control unit detects from the first cargo increase / decrease pattern table the identification information corresponding to the cargo increase / decrease pattern indicating the increase / decrease of the cargo in the specified order caused by the loading request, the identification information corresponding to the standard value having the lowest degree of discrepancy (exceeding a threshold value defined as necessary), and updates the loading state of the vehicle indicated by the loading state data to the loading state after the increase / decrease of the cargo indicated by the detected identification information.

[0010] In addition, in the above-mentioned cargo management device, the loading status data stores the loading status of the vehicle in an identifiable manner for each of the stopping positions of the vehicle (including not only the fixed passing points described below but also the free passing points described below, and a point where cargo (people or luggage) is transferred to the vehicle is defined as a "stopping position". "Between stopping positions" means between adjacent stopping positions. The same applies below), and the control unit determines whether the cargo of the specified rank can be loaded onto the vehicle for each of the stopping positions based on the loading status between each of the stopping positions of the vehicle indicated by the loading status data, and if the cargo of the specified rank can be loaded at all of the stopping positions, determines that the cargo of the specified rank can be loaded, and if the cargo of the specified rank cannot be loaded at any of the stopping positions, determines that the cargo of the specified rank cannot be loaded.

[0011] Furthermore, in the above-mentioned cargo management device, the control unit may be equipped with a receiving means for receiving a dispatch request from a user terminal via a network, the dispatch request including the loading request and requesting dispatch to a dispatch location specified by the user within a predetermined range between predetermined stop locations, a candidate generation means for generating a plurality of candidate routes that travel between the stop locations via at least one of the dispatch locations identified from each of the dispatch requests received from the plurality of user terminals, an exclusion means for excluding from the candidate route generated by the candidate generation means a route in which the increase in the vehicle's travel period caused by loading the cargo and passing through the dispatch location exceeds a predetermined tolerance range, a numerical calculation means for calculating a numerical value indicating the inconvenience of each of the candidate route generated by the candidate generation means, and a route determination means for determining the candidate route with the smallest numerical value calculated by the numerical calculation means as the route along which the vehicle will travel.

[0012] In the above-described cargo management device, the numerical value calculation means may calculate, as the numerical value indicating the inconvenience, a numerical value indicating the effort of a driver of a vehicle caused by the loading of the cargo.

[0013] Furthermore, the above-mentioned cargo management device may further include a transmission means for sending a notification that a vehicle can be dispatched via the network to the user terminal of the user whose route determined by the route determination means includes the specified dispatch location, while notifying the user terminal of the user whose route does not include the specified dispatch location that a vehicle cannot be dispatched and sending a notification via the network to the user recommending that the user submit the next dispatch request to a vehicle, and when the number of dispatch requests received within a specified period of time exceeds a specified upper limit, the transmission means may notify the user terminal that sent the dispatch request that exceeds the specified upper limit that a vehicle cannot be dispatched, and send a notification via the network to the user recommending that the user submit the next dispatch request to a vehicle.

[0014] In addition, a cargo management method according to a second aspect of the present invention is a cargo management method using a cargo management device having a memory unit that stores loading status data indicating the loading status of a vehicle, and is characterized in that it includes the steps of: in response to a loading request received by a control unit that can identify the cargo of a vehicle and the priority order of the cargo, determining whether or not the cargo of a predetermined rank in the priority order among the cargo identified from the loading request can be loaded onto the vehicle based on the loading status of the vehicle indicated by the loading status data; and, if the control unit determines that the cargo of the predetermined rank can be loaded, updating the loading status of the vehicle indicated by the loading status data to a state in which the cargo of the predetermined rank has been increased, and determining whether or not the cargo of the next highest rank in the predetermined rank can be loaded.

[0015] Furthermore, a program according to a third aspect of the present invention is configured to cause a computer of a cargo management device, which has a memory unit that stores loading status data indicating the loading status of a vehicle, to execute, in response to receiving a loading request that can identify the cargo of a vehicle and the priority order of the cargo, a procedure for determining whether or not the cargo of a predetermined rank in the priority order among the cargo identified from the loading request can be loaded onto the vehicle based on the loading status of the vehicle indicated by the loading status data, and a procedure for updating the loading status of the vehicle indicated by the loading status data to a state in which the cargo of the predetermined rank has been increased, and determining whether or not the cargo of the next highest rank in the predetermined rank can be loaded.

[0016] In addition, a vehicle dispatching device according to a fourth aspect of the present invention comprises a receiving means for receiving a vehicle dispatch request from a user terminal via a network, the vehicle dispatch request requesting dispatch to a vehicle dispatch location specified by a user within a predetermined range between predetermined stop locations, a candidate generating means for generating a plurality of candidate routes for traveling between the stop locations via at least one of the vehicle dispatch locations identified from each of the vehicle dispatch requests received from a plurality of the user terminals, a numerical calculation means for calculating a numerical value indicating the inconvenience of each of the candidate routes generated by the candidate generating means, and a route determination means for determining a route to be traveled by a vehicle from among the candidate routes based on the numerical value calculated by the numerical calculation means.

[0017] The above-mentioned vehicle dispatch device may further include a transmitting means for transmitting a notification via the network to the user terminal of the user whose route determined by the route determination means includes the specified vehicle dispatch location that a vehicle can be dispatched, while notifying the user terminal of the user whose route does not include the specified vehicle dispatch location that a vehicle cannot be dispatched and transmitting a notification via the network to the user recommending the next vehicle dispatch request.

[0018] In addition, in the above-mentioned vehicle dispatch device, when the number of vehicle dispatch requests received within a specified period exceeds a specified upper limit, the transmitting means may notify the user terminal that sent the vehicle dispatch request that exceeded the specified upper limit that a vehicle cannot be dispatched, and may send a notification to the user via the network recommending the next vehicle dispatch request.

[0019] Furthermore, the above-mentioned vehicle dispatch device may further include an exclusion means for excluding, from the route candidates generated by the candidate generation means, a route in which an increase in the vehicle's traveling period caused by passing through the vehicle dispatch location exceeds a predetermined tolerance range.

[0020] In the above vehicle dispatching device, the route determination means may determine the route candidate having the smallest value calculated by the value calculation means as the route along which the vehicle will travel.

[0021] Furthermore, in the above vehicle dispatching device, the numerical value calculation means may calculate an added value of a plurality of numerical values ​​indicating the inconvenience of each of the candidate routes.

[0022] In addition, a vehicle dispatch method according to a fifth aspect of the present invention includes a receiving step of receiving a vehicle dispatch request from a user terminal via a network, the vehicle dispatch request requesting dispatch to a vehicle dispatch location specified by a user within a predetermined range between predetermined stop locations; a candidate generation step of generating a plurality of candidate routes that travel between the stop locations via at least one of the vehicle dispatch locations identified from each of the vehicle dispatch requests received from the plurality of user terminals; a numerical calculation step of calculating a numerical value indicating the inconvenience of each of the candidate routes generated by the candidate generation step; and a route determination step of determining a route to be traveled by a vehicle from among the candidate routes based on the numerical value calculated by the numerical calculation step.

[0023] The program according to the sixth aspect of the present invention causes a computer to execute the following steps: a receiving step of receiving, via a network, from a user terminal, a vehicle dispatch request requesting dispatch to a vehicle dispatch location specified by a user within a predetermined range between predetermined stop locations; a candidate generation step of generating multiple candidate routes for traveling between the stop locations via at least one of the vehicle dispatch locations identified from each of the vehicle dispatch requests received from the multiple user terminals; a numerical calculation step of calculating a numerical value indicating the inconvenience of each of the candidate route generated by the candidate generation step; and a route determination step of determining a route to be traveled by a vehicle from among the candidate routes based on the numerical value calculated by the numerical calculation step. Effect of the Invention

[0024] According to the present invention, it is possible to provide a cargo management device, a cargo management method, and a program capable of efficiently managing cargo on a vehicle. [Brief description of the drawings]

[0025] [Figure 1] FIG. 1 is a diagram for explaining an overview of a vehicle dispatch system according to an embodiment of the present invention. [Diagram 2] 1 is a diagram illustrating an example of the configuration of a vehicle dispatch system according to an embodiment of the present invention. [Diagram 3] FIG. 2 is a block diagram showing an example of the configuration of a user terminal; [Figure 4] FIG. 2 is a block diagram showing a configuration example of a vehicle dispatching device. [Diagram 5] FIG. 2 is a block diagram showing a configuration example of a vehicle terminal. [Figure 6] 13 is a flowchart showing details of a loading state update process. [Figure 7] 13 is a flowchart showing details of a pattern matching process. [Figure 8] 13 is a flowchart showing details of a vehicle dispatch process. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0026] The best mode for carrying out the present invention will now be described.

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

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

[0029] FIG. 1 is a diagram for explaining an overview of a vehicle dispatch system according to this embodiment.

[0030] As shown in FIG. 1, in the vehicle dispatch system according to this embodiment, one vehicle travels around a fixed route (traveling route) at intervals of a predetermined period (for example, about 30 minutes to 1 hour). On the route, fixed stop positions (fixed passing points) such as fixed stops near commercial facilities and large hospitals are predefined, but if a user satisfies certain conditions, the user can specify free passing points other than the fixed passing points as dispatch positions such as boarding positions and disembarking positions. The route changes from moment to moment depending on the reservation status of the user. A unique algorithm is used to formulate this route. According to this algorithm, the status of the user's past vehicle dispatch reservations, etc. can be scored, and the priority of other users can be taken into consideration. For this reason, the user's own vehicle dispatch reservation may not be reflected. In this case, the vehicle dispatch reservation is taken into consideration with priority given to the next round. The departure time of each fixed passing point is fixed like a bus, but the required time between fixed passing points is set to a certain amount of time in anticipation of the above-mentioned route changes. The number of vehicle dispatch positions between the fixed passing points is limited to 2 to 3. It should be noted that this vehicle dispatch system is intended to be capable of transporting not only users, but also goods such as luggage and animals.

[0031] The vehicle dispatch system of this embodiment primarily targets elderly people who have lost their means of transportation, such as elderly people who have surrendered their driver's licenses or elderly people who never had a license in the first place, rather than young or middle-aged people, and provides a new transportation solution for such elderly people.

[0032] In addition, the vehicles expected to be used in the vehicle dispatch system of this embodiment include not only buses, but also general light cars and ordinary (medium-sized) cars, so it is possible to enter narrow alleys and pick up passengers.

[0033] FIG. 2 is a diagram showing an example of the configuration of a vehicle dispatch system according to this embodiment.

[0034] As shown in Figure 2, the vehicle dispatch system 1 comprises multiple user terminals 2-L (L is a natural number), a vehicle dispatch device (cargo management device) 3, and a vehicle terminal 4, which are connected to each other so that they can communicate with each other via a network N such as the Internet.

[0035] The user terminal 2-L is configured, for example, by a general-purpose smartphone, tablet computer, etc. The user terminal 2-L may be configured, for example, by a general-purpose personal computer, etc.

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

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

[0038] The storage unit 21 is composed of, for example, a non-volatile memory such as a general-purpose flash memory. Various application programs are installed in the storage unit 21. In this embodiment, an application program for realizing a vehicle reservation (hereinafter, referred to as a "vehicle reservation application") is installed in the storage unit 21. Note that the vehicle reservation application is not limited to a form in which it is installed in the storage unit 21 as an independent application program, and may be a form in which, for example, a specific website is accessed and user operations and processing are performed on the website each time.

[0039] The touch panel 22 is configured, for example, by 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 app displayed on the touch panel 22 to start the vehicle reservation app.

[0040] Furthermore, the user specifies a free passing point within a predetermined range between predetermined stop positions (fixed passing points) on the vehicle dispatch location specification screen of the vehicle dispatch reservation app displayed on the touch panel 22. The user may specify a free passing point when registering a new user. Here, the predetermined range is a range in which the vehicle can travel between fixed passing points within a time that is the time it normally takes for the vehicle to travel between the fixed passing points plus a predetermined time. The user can specify the free passing point more precisely than with conventional on-demand bus services, for example, the user can specify up to the eaves of the user's house. This allows the user to travel very comfortably even on rainy days, and reduces physical strain. The user can also specify a fixed passing point.

[0041] Furthermore, the user specifies a vehicle dispatch location such as a boarding location and a disembarking location from among pre-registered free passing points on the vehicle dispatch reservation screen of the vehicle dispatch reservation app displayed on the touch panel 22. The user also selects a type of cargo to be loaded onto the vehicle from a cargo type list displayed on the vehicle dispatch reservation screen, requests that the cargo be loaded onto the vehicle, and instructs to reserve a seat in the vehicle (vehicle dispatch reservation) after specifying a priority order p (p is a natural number) of the cargo and inputting actual measured values ​​of the characteristics.

[0042] In this embodiment, the cargo includes not only baggage but also users and animals. That is, for example, when users and baggage are loaded onto a vehicle, the users are also considered as a type of baggage, and both the users and the baggage are included in the cargo. The types of cargo are broadly classified into users, baggage, and animals. The types of cargo are further classified according to the characteristics of the users, baggage, and animals.

[0043] The characteristics of the load include the characteristics of the user, such as whether or not the user is willing to share a ride, whether or not the user is in poor health, whether or not the user is elderly (e.g., 65 years or older), whether or not the user is large (e.g., 180 cm or more or 100 kg or more), whether or not the user is prone to motion sickness, and the characteristics of the luggage, such as the dimensions (size), weight, whether or not the luggage can be turned sideways, whether or not the luggage can be turned upside down, whether or not the luggage is important, how easily the luggage can be broken, softness, how easily the luggage can be scratched, etc. For example, even if the size of the luggage, such as the dimensions, is within the same range, if the susceptibility to scratching is different, the luggage may be classified into different types since the characteristics are different. Conversely, even if the size of the luggage, such as the dimensions, is not within the same range (even if the characteristics of the luggage are different), the types of the luggage may be intentionally classified as the same.

[0044] In this embodiment, an upper limit is set for the number of cargo items that can be loaded on a vehicle at one time per user. If the number of cargo items does not exceed the upper limit, the priority order p of all cargo items selected by the user from the cargo item type list is set to "1". In contrast, if the number of cargo items to be loaded on a vehicle exceeds the upper limit, the user must specify a priority order for each of the cargo items selected from the cargo item type list. Specifically, the user specifies "1" for the priority order p of the type of cargo items that the user wishes to load on the vehicle together (e.g., one user and one piece of luggage such as a supermarket shopping bag, etc.), and specifies "2" for the priority order p of the type of cargo items that the user wishes to load on the vehicle together (e.g., one piece of luggage such as a cardboard box, etc.) if possible.

[0045] Furthermore, if there is a difference between the characteristics of the cargo, such as the dimensions and weight of the cargo, indicated by the cargo type on the vehicle reservation screen and the actual measured values ​​of the cargo characteristics, such as the dimensions and weight of the cargo actually being loaded, and the user needs to understand this difference, they can input the actual measured values.

[0046] If the user is an elderly person who has difficulty using the Internet, the user's caregiver or a relative may make the vehicle reservation. If the vehicle reservation application is not installed in the storage unit 21 or if the user terminal 2-L is configured as a personal computer, the user can make the vehicle reservation on a website operated by the vehicle dispatch system 1. Furthermore, the user may make the vehicle reservation by telephone.

[0047] The touch panel 22 displays whether the vehicle can be dispatched, 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 pass point, etc.) and recommends the user to make a reservation for the next vehicle dispatch. The touch panel 22 also displays the cargo that can be loaded onto the vehicle among the cargo that the user has requested to be loaded onto the vehicle.

[0048] The communication unit 23 is composed of, for example, a general-purpose wireless communication device. In this embodiment, the communication unit 23 transmits to the dispatch device 3 via the network N a registration application for registering a free passing point designated by the user, and a dispatch request for dispatching a vehicle to a dispatch location designated by the user within a predetermined range between predetermined stopping locations (fixed passing points). In this embodiment, the dispatch request includes a loading request that can identify the load of the vehicle and the priority p of the load. In addition, the communication unit 23 receives a dispatch possibility notification that notifies whether a vehicle can be dispatched, transmitted from the dispatch device 3 via the network N.

[0049] The control unit 24 is composed of, for example, a CPU (Central Processing Unit), a ROM (Read Only Memory), and a RAM (Random Access Memory), etc. The CPU uses the RAM as a working memory and appropriately executes various programs, etc. stored in the ROM and the storage unit 21, thereby controlling various operations of the user terminal 2-L.

[0050] In this embodiment, the control unit 24 starts the vehicle reservation application stored in the storage unit 21 in response to the user tapping on the icon of the vehicle reservation application displayed on the touch panel 22.

[0051] Then, in response to the user specifying a free pass point in the ride-dispatch app, the control unit 24 transmits a registration application capable of identifying the free pass point specified by the user from the communication unit 23 via the network N to the ride-dispatch device 3.

[0052] In addition, the control unit 24 specifies a dispatch location from among the free passing points registered in advance by the user in the dispatch reservation app, selects the type of cargo to be loaded onto the vehicle from the cargo type list, and requests that the cargo be loaded onto the vehicle. After specifying the priority order p of the cargo and inputting the actual measured values ​​of the characteristics, etc., in response to the dispatch reservation instruction, the control unit 24 transmits a dispatch request that can identify the dispatch location, such as the boarding position and disembarking position specified by the user, as well as the type code indicating the type of cargo, the priority order p, and the actual measured values ​​of the characteristics, etc., from the communication unit 23 to the dispatch device 3 via the network N.

[0053] Thereafter, in response to receiving a notification of whether or not a vehicle can be dispatched transmitted from the dispatch device 3 via the network N, the control unit 24 notifies the user of whether or not a vehicle can be dispatched by displaying the same on the touch panel 22, and if a vehicle cannot be dispatched, displays the next timing of dispatching a vehicle on the touch panel 22 and recommends the user to make a reservation for the next vehicle dispatch. In addition, the control unit 24 displays on the touch panel 22 the cargo items that can be loaded onto the vehicle among the cargo items that the user has requested to be loaded onto the vehicle.

[0054] The vehicle dispatch device 3 shown in FIG. 2 is configured, for example, from a general-purpose server computer and a general-purpose database (DataBase; DB).

[0055] FIG. 4 is a block diagram showing an example of the configuration of a vehicle dispatching device.

[0056] As shown in FIG. 4, the vehicle dispatch device 3 includes a communication unit 31, a storage unit 32, and a control unit 33, which are connected via a bus or the like.

[0057] The communication unit 31 is composed of, for example, a NIC (Network Interface Card) or the like. The communication unit 31 performs wireless communication with the user terminal 2-L and the vehicle terminal 4 via the network N. In this embodiment, the communication unit 31 receives a registration application and a vehicle dispatch request transmitted from the user terminal 2-L via the network N, and transmits a dispatch availability notification to the user terminal 2-L via the network N. In addition, the communication unit 31 transmits a route notification notifying the vehicle terminal 4 of the planned vehicle route via the network N.

[0058] 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, a route planning program that plans a vehicle route using a unique algorithm is installed in the storage unit 32. If the vehicle dispatch position specified by the user is reflected on the route planned by this unique algorithm, the vehicle will be dispatched successfully. However, if the vehicle dispatch position specified by the user is not reflected because a vehicle dispatch position specified by another user is given priority, the vehicle will not be dispatched.

[0059] The storage unit 32 also includes a route DB, an attribute value table, a standard value table, a matching type code table, a basic DB, a first loaded item increase / decrease pattern table, and a second loaded item increase / decrease pattern table.

[0060] The route DB preregisters data as route patterns that correspond to combinations of free passing points (unit routes) that can be passed through (stopped at) for each fixed passing point i (i is a natural number) and for each bus service, as well as the time loss caused by passing through them (how many minutes of delay will be caused by passing through them).

[0061] The attribute value table stores attribute values ​​that represent the characteristics of the cargo by numbers in association with each type code. For example, the attribute value indicates the size and weight of the cargo, which is the cargo, as well as whether the cargo is important or not by "0" or "1". The attribute value may also indicate the importance of the cargo by a number between "0" and "100".

[0062] The standard value table registers standard values ​​of the characteristics of the cargo represented by the attribute values ​​(for example, the basic size of the cargo dimensions, etc.). Even if the cargo type is the same, the standard value table may register multiple standard values ​​that differ according to the cargo characteristics such as the cargo dimensions and weight.

[0063] The collation type code table registers a plurality of collation type codes that define a characteristic function Fp(x) for specifying a matching condition with a standard value, in association with a unique serial number p (p is a natural number).

[0064] The matching type code may specify that the matching condition is met only if the load characteristic is a perfect match with the standard value, or that the matching condition is met if the difference between the load characteristic and the standard value is within a predetermined range. More specifically, there may be a matching type code that specifies that the matching condition is met if the load characteristic is below the standard value within a predetermined range, but not if the load characteristic is slightly above the standard value.

[0065] The characteristic function Fp(x) is a function used in pattern matching, which will be described later, and is constructed by dividing and joining multiple straight lines and curves (e.g., quadratic functions, cubic functions, etc.) at any point on the x-axis as necessary. For example, when the characteristic function Fp(x) is constructed from multiple straight lines, it becomes a broken line graph (generally with some discontinuity along the way). Note that when the characteristic function Fp(x) is divided at any point on the x-axis, it is not necessary for the graph to be continuous and smooth before and after the division point. Specifically, the characteristic function Fp(x) is expressed by defining a formula (e.g., y=a0x+b, etc.) for each of any division points on the x-axis to which the variable x to be substituted has been applied, and listing these.

[0066] The basic DB registers a large number (basically as large a number as the hard disk capacity of the computer that serves as the storage unit 32 allows) of loading state patterns that indicate the loading state inside the vehicle (for example, two users, three cardboard boxes that can store A4-sized documents, and five envelopes of letter pack size, etc.) in association with a unique serial number r (r is a natural number) that is identification information. The basic DB registers a loading state pattern that indicates a state in which the inside of the vehicle is completely empty in association with the serial number "0". The basic DB also registers a loading state pattern that indicates a virtual state in which the inside of the vehicle is full and in an overflow state in association with the maximum value rMax of the serial number r. The loading state pattern represents the loading state inside the vehicle by combining the type code and attribute value of the vehicle's cargo. Note that for the serial number "0" (empty state) and rMax (virtual full state), the type code and attribute value of the cargo that indicate the loading state inside the vehicle are not necessary, so they do not need to be registered.

[0067] If the types of cargo are intentionally made the same even though the size ranges of the cargo dimensions are not the same (the cargo characteristics are different), multiple loading condition patterns may be registered in the basic DB in association with the type codes. Also, if different standard values ​​are registered in the standard value table according to the cargo characteristics such as the cargo dimensions and weight even though the cargo types are the same, multiple loading condition patterns may be registered in association with the multiple standard values ​​in the basic DB.

[0068] Here, as a rule of the vehicle dispatch system 1, small items will not be accepted for loading onto a vehicle unless they are placed in a cardboard box or the like of a certain size or larger. This makes it possible to limit the minimum size of items loaded onto a vehicle, thereby preventing an increase in loading condition patterns.

[0069] Furthermore, it is not necessary to pre-register all loading condition patterns in the basic DB. Each time a new loading condition occurs, the loading condition pattern indicating that condition can be registered in sequence, either manually or mechanically using a predetermined algorithm.

[0070] The first cargo increase / decrease pattern table assumes that a cargo increase / decrease occurs due to a new reservation for a ride from the current loading state (for example, an additional elderly passenger boards the vehicle between specific stopping points, and in return the loading of one A4-sized cardboard box is cancelled), and enumerates all combinations of increases / decrease possible and registers (lists) them as patterns.

[0071] Specifically, the first cargo increase / decrease pattern table is provided for each serial number r corresponding to a loading state pattern indicating a current loading state. Each first cargo increase / decrease pattern table registers a cargo increase / decrease pattern indicating an increase / decrease in cargo caused by a new vehicle dispatch reservation in association with a serial number r (capable of identifying the loading state after the cargo increase / decrease) corresponding to a loading state pattern indicating a loading state in a vehicle in which cargo has been increased or decreased by the new vehicle dispatch reservation. In addition, when a plurality of standard values ​​for the same cargo type are registered in the standard value table, each first cargo increase / decrease pattern table stores a different first cargo increase / decrease pattern and a serial number r in association with each standard value.

[0072] As described above, by establishing rules such as limiting the number of cargo items that can be loaded onto a vehicle per user at one time, the number of patterns of cargo increase / decrease can be reduced. When cargo items increase / decrease (especially increases) due to a new vehicle reservation, it is assumed that the driver of the vehicle will verify the identity of the user and the contents of the luggage when loading. If cargo items increase / decrease frequently, the driver will have to spend more time and effort on the verification, resulting in a large loss of time. For this reason, even in practice, it is extremely realistic to introduce rules such as limiting the number of cargo items that can be loaded onto a vehicle per user at one time.

[0073] By introducing such a first cargo load increase / decrease pattern table, even if the number of loading condition patterns registered in the basic DB becomes extremely large and there is an increase or decrease in cargo load at the time of booking a vehicle dispatch, it is no longer necessary to search and compare to extract the loading condition pattern that is closest to the loading condition between the stopping positions after the increase or decrease from the vast number of loading condition patterns registered in the basic DB, thereby reducing the time required for search and comparison.

[0074] The second load increase / decrease pattern table registers (lists up) the differences between the load state pattern between the current stop positions and the load state pattern between the next stop positions as a list of all possible combination patterns.

[0075] Specifically, the second cargo increase / decrease pattern table registers, in association with a unique serial number s (s is a natural number), a cargo increase / decrease pattern indicating an increase / decrease in cargo resulting from a new vehicle dispatch reservation, the time loss resulting from the transfer of the cargo (the increase in the vehicle's traveling period), and a workload value that quantifies the effort (workload) of the vehicle driver.

[0076] By introducing such a second cargo load increase / decrease pattern table, as with the first cargo load increase / decrease pattern table, it is possible to prevent the number of loading state patterns from becoming extremely large, which would result in a long search time when directly referencing the basic DB, and in the event that a cargo transfer occurs, the attribute values ​​associated with each combination pattern of the transfer can be referenced and extracted to quickly calculate the above-mentioned time loss and increase in workload value.

[0077] The list of cargo increase / decrease patterns registered in the second cargo increase / decrease pattern table is the same as that in the first cargo increase / decrease pattern table and can be shared, but the information associated with the increase / decrease patterns is different from that in the first cargo increase / decrease pattern table. The total number of combinations of cargo increase / decrease patterns registered (listed) in the first and second cargo increase / decrease pattern tables monotonically and accelerates in accordance with the size of the upper limit number of cargo items that can be loaded on the vehicle at one time per user. Therefore, in order to be able to refer to and search the first and second cargo increase / decrease pattern tables at a sufficiently high speed, it is necessary to keep the upper limit number of cargo items that can be loaded on the vehicle at one time per user to an appropriately small value (for example, about 2 to 3), taking into account the processing speed and disk capacity of the computer.

[0078] Furthermore, the storage unit 32 stores data representing a loading state (hereinafter referred to as "loading state data") and data representing a boarding / disembarking state (hereinafter referred to as "boarding / disembarking state data").

[0079] The loading state data stores, for each section between the stopping positions, a serial number r corresponding to a loading state pattern indicating the loading state between the stopping positions.

[0080] Between the stopping positions where no cargo is loaded, the serial number "0" corresponding to the loading state pattern indicating the vehicle is completely empty is stored in the loading state data. Even if no cargo is loaded, when it is desired to limit the cargo, for example when the passenger seat is broken and passengers or baggage cannot be loaded there, the cargo is assumed to be virtually loaded, and the serial number r corresponding to the loading state pattern indicating the virtual state may be stored in the loading state data. Also, when the vehicle is a non-return vehicle, in order to limit all cargo, the maximum value rMax of the serial number r corresponding to the loading state pattern indicating the virtual state in which the vehicle is full and overflows may be stored in the loading state data.

[0081] When the dispatch request includes actual measurements of the characteristics of the cargo, such as the dimensions and weight of the cargo, the actual measurements may be stored in the loading status data in addition to the serial number r.

[0082] The boarding / alighting status data registers, for each stop position, a serial number s of the load increase / decrease pattern indicating the load increase / decrease between the stop positions, the total time loss (increase in the vehicle's travel period) caused by loading / unloading the load, and the total workload. Between stop positions where there is no load increase / decrease, a serial number "0" indicating no load increase / decrease is stored in the boarding / alighting status data. Note that, if the dispatch request includes actual measurements of load characteristics such as baggage dimensions and weight, the actual measurements may be stored in the boarding / alighting status data in addition to the serial number s.

[0083] The control unit 33 is composed of, for example, a CPU, a ROM, a RAM, etc. The CPU uses the RAM as a working memory and appropriately executes programs and the like stored in the ROM and the storage unit 32 to control various operations of the vehicle dispatching device 3.

[0084] 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 designated by the user for each interval i between fixed passing points, a priority order counter that counts the priority order p of the cargo, etc. The CPU of the control unit 33 executes a route planning program stored in the storage unit 32, thereby functioning as a receiving means, a candidate generating means, an excluding means, a numerical value calculating means, a route determining means, and a transmitting means.

[0085] First, in response to receiving a registration application transmitted from the user terminal 2-L via the network N at the communication unit 31, the control unit (receiving means) 33 determines whether or not the free passage point identified from the registration application can be registered.

[0086] Then, when the control unit 33 determines that the free pass point specified in the registration application can be registered, it newly registers the free pass point, and generates a route pattern that passes through the newly registered free pass point and registers it in the route DB. Specifically, the control unit 33 first generates a unit route that passes through the newly registered free pass point for each fixed pass point i. Here, the generated unit route includes not only a unit route that passes through only the newly registered free pass point, but also a unit route that passes through multiple free pass points such as the newly registered free pass point and one or more other free pass points that have already been registered. Next, the control unit 33 calculates the time loss caused by passing through the free pass point for each generated unit route. Then, the control unit 33 associates the generated unit route with the calculated time loss and registers them in the route DB.

[0087] Furthermore, each time the control unit (receiving means) 33 receives a dispatch request transmitted from the user terminal 2-L via the network N at the communication unit 31, it increments the value n(i) (n is a natural number) of a dispatch location counter provided corresponding to the fixed pass point interval i at which the boarding location and disembarking location specified in the dispatch request are located by 1. Note that, to simplify the explanation, it is expressed as a function of the number i between the fixed pass points, but strictly speaking, it is defined as a function of the number i between the fixed pass points and the bus service number j (the same applies to other variables and constants with "(i)" described later).

[0088] Then, the control unit 33 judges whether the value n(i) of the vehicle allocation position counter has reached the upper limit value B(i)max of vehicle allocation reservations set in advance. When the value n(i) of the vehicle allocation position counter has reached the upper limit value B(i)max of vehicle allocation reservations, that is, when the number of vehicle allocation requests received within a predetermined period (for example, about 30 minutes to 1 hour) during which vehicle allocation reservations for the current vehicle are possible exceeds the predetermined upper limit value B(i)max, the control unit (transmission means) 33 closes vehicle allocation reservations between the fixed passing points i, notifies the user terminal 2-L that has transmitted the vehicle allocation request that exceeds the predetermined upper limit value that the vehicle cannot be allocated, and transmits a vehicle allocation availability notification recommending the user to make a vehicle allocation reservation for the next vehicle from the communication unit 31 to the user terminal 2-L via the network N.

[0089] Thereafter, if there is a vehicle dispatch reservation from this user terminal 2-L specifying the same boarding and disembarking positions for the next vehicle, the control unit 33 increases the priority of the route including those positions for the next vehicle, and if there is no vehicle dispatch reservation, it may be determined that the user has boarded the current vehicle or that the vehicle dispatch reservation itself has been canceled. On the other hand, if the value n(i) of the vehicle dispatch position counter has not reached the upper limit value B(i)max of the vehicle dispatch reservation, the control unit 33 stores the vehicle dispatch positions such as the boarding and disembarking positions specified from the vehicle dispatch request, the type code of the cargo, the priority order p, and the actual measured values ​​of the characteristics, etc., in association with each other in the RAM.

[0090] Then, the control unit 33 executes the loading state update process.

[0091] In the loading status update process, first, the control unit 33 identifies the stop positions where the boarding and disembarking positions included in the dispatch positions stored in the RAM are located, and also identifies the stop positions passed between the boarding and disembarking positions. Next, the control unit 33 reads out the serial numbers r corresponding to each of the identified stop positions from the loading status data. Then, the control unit 33 detects the first load increase / decrease pattern table corresponding to each of the read serial numbers r. The control unit 33 also sets the value of a priority counter provided in the RAM to "1", which is the initial count value.

[0092] Then, the control unit 33 determines whether or not the type code of the cargo corresponding to the priority p indicated by the value of the priority counter is stored in the RAM. If the type code of the cargo corresponding to the priority p is not stored in the RAM, the control unit 33 determines that all cargo requested by the user to be loaded onto the vehicle by the new dispatch request can be loaded, and ends the loading status update process.

[0093] In response to this, if the type code of the cargo corresponding to the priority level p is stored in the RAM, the control unit 33 identifies the increase in cargo that will occur by loading the cargo with the specified priority level p onto the vehicle.

[0094] Then, the control unit 33 performs a pattern matching process to detect a serial number r corresponding to a load increase / decrease pattern indicating an increase in the specified load from each of the detected first load increase / decrease pattern tables, thereby determining whether or not the load with the designated priority order p can be loaded on the vehicle. That is, the control unit 33 performs a pattern matching process to confirm that there is an increase / decrease pattern corresponding to the serial number r corresponding to the load state pattern indicating the load state between the stop positions of the vehicle indicated by the load state data, and to confirm that the serial number of the load state pattern after the increase / decrease linked to the increase / decrease pattern is not rMax (full state), thereby determining whether or not the load with the priority order p can be loaded on the vehicle between the stop positions. Then, the control unit 33 determines that the load with the priority order p can be loaded if the load with the priority order p can be loaded between all the stop positions, and determines that the load with the priority order p cannot be loaded if the load with the priority order p cannot be loaded between any of the stop positions.

[0095] In the pattern matching process, the control unit 33 first detects an attribute value corresponding to the type code of the cargo to which the priority order p is assigned from the attribute value table. Next, the control unit 33 detects a standard value of the characteristic of the cargo represented by the detected attribute value from the standard value table. Next, the control unit 33 detects a matching type code that defines a characteristic function Fp(x) for specifying a matching condition with the detected standard value from the matching type code table.

[0096] Then, the control unit 33 substitutes the corresponding attribute value and standard value into the characteristic function Fp(x) defined in the matching type code to calculate the degree of mismatch.

[0097] For example, in the case where there is one cargo, the attribute values ​​corresponding to the type code indicating the type of the cargo are the dimensions w×d×h, weight m, and importance fg1, and their standard values ​​are the dimensions W×D×H, weight M, and importance FG1, and the respective special functions are Fp1(x), Fp2(x), and Fp3(x) (p1, p2, and p3 are consecutive numbers), then the degree of discrepancy is defined as follows:

[0098] Disagreement degree=Fp1(Ww)+Fp1(Dd)+Fp1(Hh)+Fp2(Ww)+Fp3(FG1-fg1)

[0099] In addition, when there are two cargo items and the attribute value, standard value, and special function Fp(x) are identical, the degree of inconsistency is a simple sum (addition) of the degrees of inconsistency for each item, as follows:

[0100] Discrepancy rate = Fp1(Ww) + Fp1(Dd) + Fp1(Hh) + Fp2(Ww) + Fp3(FG1-fg1) + Fp1'(Ww) + Fp1'(Dd) + Fp1'(Hh) + Fp2'(Ww) + Fp3'(FG1-fg1)

[0101] Then, the control unit 33 detects the serial number r corresponding to the cargo increase / decrease pattern that matches or is most similar to the specified cargo increase from each of the detected first cargo increase / decrease pattern tables based on the calculated degree of inconsistency, and then ends the pattern matching process. For example, when multiple standard values ​​for the same cargo type are registered in the standard value table, the control unit 33 calculates the degree of inconsistency for each standard value, and detects the serial number r corresponding to the standard value with the lowest degree of inconsistency (highest degree of agreement) from the first cargo increase / decrease pattern table among the multiple serial numbers r corresponding to the cargo increase / decrease pattern indicating the specified cargo increase. If necessary, a threshold can be set separately to set a maximum level of mismatch (or a minimum level of match), and even if a pattern corresponding to the standard value with the lowest level of mismatch (highest level of match) is detected from the first load increase / decrease table, including cases where only one type of standard value is registered, if the mismatch (match) exceeds the threshold, it can be determined that a corresponding increase / decrease pattern does not exist (or that the detected serial number r=rMax, i.e., that the load will be full after the increase / decrease (for convenience of processing), and no increase / decrease is possible here).

[0102] When the control unit 33 detects the serial number r from all of the first cargo increase / decrease pattern tables, it determines that all of the cargo items designated with priority order p can be loaded onto the vehicle, executes a status data update process to update the loading status data and boarding / disembarking status data stored in the memory unit 32, and then terminates the loading status update process.

[0103] In the state data update process, the control unit 33 updates the serial number r stored in the loading state data in association with each of the identified stop positions to the serial number r detected from each of the first loading increase / decrease pattern tables. As a result, the control unit 33 updates the loading state of the vehicle indicated by the loading state data to a state in which the loading item of priority order p has been increased.

[0104] In addition, the control unit 33 reads out the serial number s, the time loss, and the workload value corresponding to each of the cargo increase / decrease patterns indicating an increase and decrease in cargo caused by the new vehicle dispatch reservation from the second cargo increase / decrease pattern table.

[0105] Then, the control unit 33 updates the boarding / alighting status data based on the read serial number s, the time loss, and the workload value, and then ends the status data update process.

[0106] Specifically, the control unit 33 first reads out the serial numbers s corresponding to the stop positions where the read-out boarding positions and disembarking positions are located from the boarding / disembarking status data. Next, the control unit 33 reads out the cargo increase / decrease patterns corresponding to the read-out serial numbers s from the second cargo increase / decrease pattern table. Next, the control unit 33 updates the cargo increase / decrease indicated by the cargo increase / decrease pattern read out from the second cargo increase / decrease pattern table, that is, the increase / decrease of cargo between the stop positions where the boarding positions and disembarking positions are located, based on the increase and decrease of cargo caused by the new vehicle dispatch reservation. Furthermore, the control unit 33 reads out the serial numbers s corresponding to the cargo increase / decrease pattern indicating the increase / decrease of cargo between the stop positions where the updated boarding positions and disembarking positions are located from the second cargo increase / decrease pattern table. Then, the control unit 33 updates each of the serial numbers s stored in the boarding / disembarking status data in association with the stop positions where the boarding positions and disembarking positions are located to the read-out serial numbers s.

[0107] The control unit 33 also updates the total time loss value and the total workload value stored in the boarding / alighting status data in association with the stop positions where the "boarding position" is present by adding the time loss value and the workload value corresponding to the load increase / decrease pattern indicating an "increase" in the load, respectively. The control unit 33 also updates the total time loss value and the total workload value stored in the boarding / alighting status data in association with the stop positions where the "disembarking position" is present by adding the time loss value and the workload value corresponding to the load increase / decrease pattern indicating a "decrease" in the load, respectively.

[0108] After executing the status data update process, the control unit 33 adds 1 to the value of the priority counter stored in the RAM, and then determines whether or not the cargo type code corresponding to the priority p indicated by the value of the priority counter after the increment is stored in the RAM, and if the cargo type code corresponding to the priority p is stored in the RAM, executes the pattern matching process again.

[0109] On the other hand, if the control unit 33 cannot detect the serial number r from all of the first cargo increase / decrease pattern tables, it determines that if all cargo items with the priority order p are loaded onto the vehicle, the vehicle will be full and cannot be loaded, and ends the loading status update process. This allows the control unit 33 to decide whether or not to load cargo items in the order of priority order p specified by the user.

[0110] Next, the control unit (candidate generating means) 33 generates candidates for the vehicle route in response to the deadline for vehicle dispatch requests, which occurs every predetermined period (e.g., 30 minutes, etc.). More specifically, the control unit (candidate generating means) 33 generates multiple candidates for the route that travels between stop positions (fixed passing points) via at least one of the dispatch positions identified from each of the dispatch requests received from the multiple user terminals 2-L.

[0111] Specifically, the control unit (candidate generation means) 33 first starts from the fixed passing point, which is the current location of the vehicle, and for each i of the fixed passing points from the current location to the fixed passing points k (1 ≤ k < i) ahead, detects and lists up candidate unit routes R(i) that pass through at least one of the pick-up positions specified from each of the ride-hailing requests received from the plurality of user terminals 2-L in the route database. For example, when the vehicle is a circular bus, if the number of fixed passing points is 10, the fixed passing point that is the current location is the 9th fixed passing point, and k = 3, then for each fixed passing point i at the 9th and 10th fixed passing points and, since it is circular, the 1st fixed passing point after returning to the first one, the candidate unit routes R(i) are listed up. Here, even if the upper limit number N(i)max of free passing points that can be stopped at between fixed passing points i is, for example, "3", if there are already other users (or luggage is loaded) in the vehicle before reaching between fixed passing points i, the number of pick-up positions that can actually be passed through (for example, "1 (= 3 - 2)") will be reduced by the number of users already in the vehicle (or luggage loaded) (for example, "2"). Therefore, the control unit (candidate generation means) 33 makes a case-by-case classification for each number N(i) of pick-up positions actually passed through between fixed passing points i (0 ≤ N(i) ≤ N(i)max, and is simply defined as the number obtained by subtracting the number of users already in the vehicle (or luggage loaded) between fixed passing points i from N(i)max), and lists up n(i)P0 + n(i)P1 + n(i)P2 + … + n(i)PN(i) permutations as candidate unit routes R(i). For example, when the value n(i) of the pick-up position counter provided corresponding to the fixed passing points i of interest is "5" and the upper limit number N(i)max of pick-up positions that can be stopped at is "3", the control unit (candidate generation means) 33 lists up 5P0 + 5P1 + 5P2 + 5P3 (= 1 + 5 + 10 + 10 = 26) permutations as candidate unit routes R(i).

[0112] Here, the upper limit value B(i)max of vehicle dispatch reservations may be defined in the same manner as N(i) as a value that dynamically changes based on the vehicle's passenger capacity and the number of passengers (baggage load) from moment to moment, or it may be set to a larger constant value in cases where it is desired to intentionally accept a larger number of vehicle dispatch reservation applications and select from those those that are suitable for efficient operation.

[0113] Then, the control unit (candidate generation means) 33 combines the unit route candidates R(i) listed for each interval between fixed pass points i, and generates (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 starting from the fixed pass point that is the vehicle's current location to the kth fixed pass point therefrom.

[0114] Next, the control unit (exclusion means) 33 calculates, for each route candidate, the time loss (the increase in the vehicle's traveling period) caused by passing through a vehicle allocation position and by changing the load.

[0115] Specifically, the control unit (exclusion means) 33 first detects the time loss corresponding to the unit route candidate R(i) for each fixed pass point i after the fixed pass point that is the current location of the vehicle from the route DB. Next, the control unit (exclusion means) 33 adds up the time loss of the unit route candidate R(i) detected from the route DB for each route candidate. The control unit (exclusion means) 33 also reads out the total value of the time loss between each stop position indicated by the boarding / alighting status data stored in the storage unit 32. The control unit (exclusion means) 33 then calculates the time loss between each fixed pass point i of the route candidate by further adding up the time loss between each fixed pass point i of the calculated route candidate (time loss caused by passing through a free pass point) and the total value of the time loss between each stop position read out from the boarding / alighting status data (time loss caused by loading and unloading of cargo; the sum of the time losses between each stop position included in the fixed pass point i).

[0116] Then, the control unit (exclusion means) 33 executes an exclusion process to exclude routes in which the time loss exceeds a predetermined tolerance range from the candidate routes, and leaves as candidates only routes in which the time loss at each fixed passing point after the fixed passing point that is the vehicle's current location is within a predetermined tolerance range.

[0117] Furthermore, the control unit (numerical value calculation means) 33 calculates a total disutility Fsum, which is an added value of multiple types of numerical values ​​indicating the inconvenience of each route candidate, for each route candidate remaining after the elimination process. Note that the control unit (numerical value calculation means) 33 may calculate one type of disutility indicating the inconvenience of each route candidate.

[0118] Here, "disutility" can be considered an index of inconvenience, and is expressed by a function that can also be the objective function of an optimization problem. In this embodiment, the total disutility Fsum is the sum of five types of disutility functions (numeric values), such as riding disutility F1, waiting disutility F2, congestion disutility F3, operator disutility F4, and workload disutility. In other words, Fsum = F1 + F2 + F3 + F4 + F5. Note that the number of types of disutility functions (numeric values) to be added is not limited to "5" and is arbitrary.

[0119] The disutility of riding F1 is some monotonically increasing univariate function of riding time t. Simply put, it is a proportional function of t multiplied by a coefficient a1.

[0120] The waiting disutility F2 is set to "0" when the reserved vehicle is available, and is some monotonically increasing one-variable function of the waiting time T until the next vehicle when the reserved vehicle is not available. Simply put, it is a quadratic function of T squared multiplied by a coefficient a2.

[0121] The congestion disutility F3 is a function that quantifies the degree of congestion in the vehicle and the presence or absence of combinations that are not compatible with carpooling. Simply put, it is a function of one monotonically increasing single variable of the number of passengers Nc in the vehicle, a quadratic function of the square of the number of passengers Nc in the vehicle multiplied by a coefficient a3, or a function that quantifies the compatibility of combinations of specific people or specific luggage. The combinations of specific people or specific luggage and their compatibility may be stored in a separate database. If the number of passengers in the vehicle (the number of luggage loads) Nc exceeds the vehicle's passenger capacity (the amount of luggage that can be loaded), or if the combination of specific people or specific luggage is not compatible, the value of this congestion disutility F3 can be set to infinity or an extremely large value equivalent thereto, so that the candidate is not selected in the route candidate selection stage described below.

[0122] The operator disutility F4 is a function that quantifies the degree of inconvenience for the operator of the vehicle. More specifically, it is a function that quantifies the bad attitude of each potential passenger, the degree of and the presence or absence of a history of last-minute cancellations, etc.

[0123] The workload disutility F5 is a function that quantifies the effort of the vehicle driver. In this embodiment, the boarding / alighting state data stored in the storage unit 32 stores a total workload value that quantifies the effort of the vehicle driver for each stop position. The workload disutility F5 is a numerical value (total workload value) that indicates the effort of the vehicle driver caused by the loading of cargo. Note that the value of F5 is stored for each stop position, but when calculating the total disutility Fsum described below, the sum of F5 between each stop position included in the fixed pass point i is taken in accordance with the other disutilities F1 to F4, and F5 between the fixed pass points i is calculated and used.

[0124] Next, the control unit (route determination means) 33 sorts the route candidates based on the value of the total disutility Fsum, more specifically, in order of the value of the total disutility Fsum, and selects and formulates (determines) the route with the smallest value of the total disutility Fsum as the route for the vehicle to travel this time.

[0125] In practice, it is assumed that there are many cases where the value of the total disutility Fsum is very close. Therefore, the control unit (route determination means) 33 may predetermine the range of what is considered to be a very close difference as a constant, and list all top routes that fall within that range as candidates. The control unit (route determination means) 33 may also predetermine within what rank a route will be unconditionally listed, and list all routes that fall within that rank as candidates. Conversely, when the value of the total disutility Fsum becomes extremely large (such as when the congestion disutility F3 becomes close to infinity due to exceeding the vehicle passenger capacity), a threshold value may be determined separately as a constant, and candidates that exceed that value may not be listed. Then, the person in charge may select and formulate the route for the current vehicle from among the listed route candidates.

[0126] Then, the control unit (transmission means) 33 transmits a route notification notifying the vehicle terminal 4 of the formulated route of the vehicle via the network N. The route notification may include a load increase / decrease pattern indicating an increase / decrease in the load between each fixed pass point i (between each stop position included therein). In this case, the control unit 33 reads out the serial number s corresponding to the fixed pass point i (between each stop position included therein) indicated by the boarding / alighting status data stored in the storage unit 32 from the boarding / alighting status data, and reads out the load increase / decrease pattern corresponding to the read serial number s from the second load increase / decrease pattern table. Then, the control unit 33 may generate a route notification capable of identifying the load increase / decrease pattern between each fixed pass point i (between each stop position included therein).

[0127] The control unit (transmission means) 33 also transmits the route planning result and a vehicle dispatch possibility notification according to the load update process from the communication unit 31 via the network N to the user terminal 2-L that sent the vehicle dispatch request. Specifically, the control unit (transmission means) 33 transmits a vehicle dispatch possibility notification indicating that a vehicle can be dispatched to the user terminal 2-L of a user whose designated dispatch location is included in the planned (decided) route. The vehicle dispatch possibility notification indicating that a vehicle can be dispatched includes a type code indicating the type of cargo that can be loaded onto the vehicle among the cargo requested by the user to be loaded onto the vehicle. On the other hand, the control unit (transmission means) 33 notifies the user terminal 2-L of a user whose designated dispatch location is not included in the planned (decided) route that a vehicle cannot be dispatched, and transmits a vehicle dispatch possibility notification recommending the user to make a next vehicle dispatch request from the communication unit 31 via the network N.

[0128] The vehicle terminal 4 shown in FIG. 2 is mounted on a vehicle and is configured, for example, by a computer having a wireless communication function.

[0129] FIG. 5 is a block diagram showing an example of the configuration of the vehicle terminal.

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

[0131] The communication unit 41 is configured, for example, with a general-purpose wireless communication device, etc. In this embodiment, the communication unit 41 receives a route notification transmitted from the vehicle dispatch device 3 via the network N.

[0132] The display unit 42 is configured, for example, with a general-purpose liquid crystal display (LCD) or the like. In this embodiment, the display unit 42 displays on the screen the vehicle route determined by the dispatch device 3. The display unit 42 may also display on the screen the cargo that is transferred between each fixed passing point i (between each stop position included therein).

[0133] The control unit 43 is composed of, for example, a CPU, a ROM, a RAM, etc. The CPU uses the RAM as a working memory and controls various operations of the vehicle terminal 4 by appropriately executing programs and the like stored in the ROM.

[0134] In this embodiment, in response to receiving a route notification transmitted from the vehicle dispatch device 3 via the network N at the communication unit 41, the control unit 43 notifies the driver of the vehicle of the route of the vehicle that has been formulated by the vehicle dispatch device 3 by displaying the route notified by the route notification on the screen of the display unit 42. In addition, the control unit 43 may notify the driver of the vehicle of the route of the vehicle that has been formulated by the vehicle dispatch device 3 by displaying the cargo that is transferred between each fixed pass point i (between each stop position included therein) on the screen of the display unit 42 based on the cargo increase / decrease pattern between each fixed pass point i (between each stop position included therein) included in the route notification. Then, the driver can dispatch the vehicle to the user by driving the vehicle according to the vehicle route formulated by the vehicle dispatch device 3. In addition, the driver determines whether or not the user is actually on board, so as to prevent the formulated vehicle route from overlapping.

[0135] Next, the operation executed by the vehicle dispatch system 1 having the above configuration will be described with reference to the drawings.

[0136] The control unit 24 of the user terminal 2-L specifies a dispatch location such as a boarding location and a disembarking location from among the free passing points previously registered by the user in the dispatch reservation app, selects the type of cargo to be loaded onto the vehicle from the cargo type list, and requests that the cargo be loaded onto the vehicle. After specifying the priority order p of the cargo and inputting the actual measured values ​​of the characteristics, etc., in response to the dispatch reservation instruction, the control unit 24 transmits a dispatch request that can identify the dispatch location such as the boarding location and a disembarking location specified by the user, as well as the type code indicating the type of cargo, the priority order p, and the actual measured values ​​of the characteristics, etc., from the communication unit 23 to the dispatch device 3 via the network N.

[0137] Each time the control unit 33 of the dispatch device 3 receives a dispatch request transmitted from the user terminal 2-L via the network N via the communication unit 31, it increments by 1 the value n(i) of the dispatch location counter provided corresponding to the fixed passing point i between which the boarding location and disembarking location identified from the dispatch request exist.

[0138] Then, the control unit 33 judges whether the value n(i) of the vehicle dispatch position counter has reached a preset upper limit value B(i)max of vehicle dispatch reservations. When the value n(i) of the vehicle dispatch position counter has reached the upper limit value B(i)max of vehicle dispatch reservations, the control unit 33 closes vehicle dispatch reservations between the fixed passing points i and transmits a vehicle dispatch availability notification to the user terminal 2-L via the network N from the communication unit 31 to notify that a vehicle cannot be dispatched. On the other hand, when the value n(i) of the vehicle dispatch position counter has not reached the upper limit value B(i)max of vehicle dispatch reservations, the control unit 33 stores the vehicle dispatch positions, such as the boarding position and disembarking position, specified from the vehicle dispatch request, as well as the type code of the load, the priority order p, the actual measurement value, and the like, in association with each other in the RAM.

[0139] Then, the control unit 33 executes the loading state update process.

[0140] FIG. 6 is a flowchart showing the details of the loading state update process.

[0141] In the loading status update process shown in FIG. 6, first, the control unit 33 identifies the stop positions at which the boarding positions and disembarking positions included in the dispatch positions stored in the RAM are located, and also identifies the stop positions that will be passed from the boarding positions to the disembarking positions (step S601).

[0142] Next, the control unit 33 reads out the serial numbers r corresponding to the respective stop positions identified in step S601 from the loading state data (step S602).

[0143] Next, the control unit 33 detects the first load item increase / decrease pattern table corresponding to each of the serial numbers r read out in step S602 (step S603).

[0144] Furthermore, the control unit 33 sets the value of a priority counter provided in the RAM to "1", which is the initial count value (step S604).

[0145] Then, the control unit 33 determines whether or not the type code of the load corresponding to the priority level p indicated by the value of the priority level counter is stored in the RAM (step S605).

[0146] If the control unit 33 determines that the cargo type code corresponding to the priority p is not stored in the RAM (step S605; No), it assumes that all cargo requested by the user to be loaded onto the vehicle in the new dispatch request can be loaded, and terminates the loading status update process.

[0147] In contrast, if the control unit 33 determines that the cargo type code corresponding to the priority level p is stored in the RAM (step S605; Yes), it identifies the increase in cargo that will result from loading the cargo with the specified priority level p onto the vehicle (step S606).

[0148] Then, the control unit 33 performs a pattern matching process (step S607) to detect the presence of a cargo increase / decrease pattern indicating an increase in cargo identified in step S606 from each of the first cargo increase / decrease pattern tables detected in step S603, and by detecting that the serial number r corresponding to that cargo increase / decrease pattern is not rMax (step S608), determines whether the cargo with the specified priority p can be loaded onto the vehicle.

[0149] If the control unit 33 detects the serial number r from all of the first cargo increase / decrease pattern tables detected in step S603 (step S608; Yes), it determines that all of the cargo items designated with priority order p can be loaded onto the vehicle and executes a status data update process (step S609).

[0150] Thereafter, the control unit 33 adds 1 to the value of the priority counter provided in the RAM (step S610), and then returns to the process of step S605.

[0151] On the other hand, if the control unit 33 cannot detect a corresponding cargo increase / decrease pattern and a serial number r that is not rMax from all of the first cargo increase / decrease pattern tables detected in step S603 (step S608; No), it determines that if all of the cargo items with the specified priority p are loaded onto the vehicle, the vehicle will be full and unable to be loaded, and terminates the loading status update process.

[0152] FIG. 7 is a flowchart showing the details of the pattern matching process.

[0153] In the pattern matching process shown in FIG. 7, the control unit 33 first detects, from the attribute value table, an attribute value corresponding to the type code of the cargo item to which the priority order p is assigned (step S701).

[0154] Next, the control unit 33 detects the standard values ​​of the characteristics of the loaded object represented by the attribute values ​​detected in step S701 from the standard value table (step S702).

[0155] Next, the control unit 33 detects, from the match type code table, a match type code that defines a characteristic function Fp(x) for prescribing a match condition with the detected standard value (step S703).

[0156] Then, the control unit 33 substitutes the corresponding attribute value and standard value into the characteristic function Fp(x) defined in the matching type code to calculate the degree of mismatch (step S704).

[0157] Then, based on the degree of inconsistency calculated in step S704, the control unit 33 detects the presence of a cargo increase / decrease pattern that matches or is most similar to the identified cargo increase from each of the first cargo increase / decrease pattern tables detected in step S603, and detects a serial number r that is not rMax corresponding to that cargo increase / decrease pattern (step S705), and then terminates the pattern matching process.

[0158] Thereafter, in response to the deadline for vehicle allocation requests, which occurs at predetermined intervals, the control unit 33 starts vehicle allocation processing.

[0159] FIG. 8 is a flowchart showing the details of the vehicle allocation process.

[0160] In the vehicle dispatch process shown in FIG. 8, the control unit (candidate generating means) 33 lists candidates for vehicle routes (step S801).

[0161] Next, the control unit (exclusion means) 33 calculates, for each route candidate in step S801, the time loss caused by passing through vehicle allocation positions and changing over the load (step S802).

[0162] Next, the control unit (exclusion means) 33 executes an exclusion process to exclude routes for which the time loss calculated in step S802 exceeds a predetermined tolerance range from the candidate routes, and only routes for which the time loss at each fixed passing point is within a predetermined tolerance range remain as candidates (step S803).

[0163] Furthermore, the control unit (numerical value calculation means) 33 calculates a total disutility Fsum, which is an added value of multiple types of numerical values ​​indicating the inconvenience of each route candidate, for each route candidate remaining after the elimination process in step S803 (step S804).

[0164] Next, the control unit (route determination means) 33 selects and formulates a route for the current vehicle travel from among the route candidates based on the value of the total disutility Fsum calculated in step S804 (step S805).

[0165] Then, the control unit (transmission means) 33 transmits a route notification notifying the vehicle route formulated in step S805 to the vehicle terminal 4 via the network N, thereby displaying the formulated vehicle route on the screen of the display unit 42 of the vehicle terminal 4 and notifying the driver of the vehicle (step S806). In addition, the control unit (transmission means) 33 may display the cargo transferred between each fixed passing point i (between each stop position included therein) on the screen of the display unit 42 and notify the driver of the vehicle.

[0166] The control unit 33 (transmission means) also transmits a notification of whether or not a vehicle can be dispatched according to the result of the route planning from the communication unit 31 via the network N to the user terminal 2-L that sent the dispatch request, thereby displaying on the touch panel 22 of the user terminal 2-L whether or not a vehicle can be dispatched and, among the cargo requested by the user to be loaded onto the vehicle, which cargo can be loaded onto the vehicle, to notify the user (step S807), and then terminates the dispatch process. When the user is notified that a vehicle can be dispatched, he or she can board the vehicle from the boarding position designated by the user with the cargo that can be loaded onto the vehicle, or disembark from the disembarking position designated by the user.

[0167] As described above, in the vehicle dispatch system 1 according to this embodiment, the vehicle dispatch device (load management device) 3 includes a storage unit 32 that stores loading status data indicating the loading status of the vehicle, and a control unit 33. In response to receiving a vehicle dispatch request (loading request) capable of identifying the load of the vehicle and the priority order p of the load, the control unit 33 determines whether or not the load of a predetermined order (e.g., first order) of the priority order p can be loaded onto the vehicle based on the vehicle loading status indicated by the loading status data (step S607), and if it is determined that the load of the predetermined order can be loaded (step S608; Yes), it updates the loading status of the vehicle indicated by the loading status data to a state in which the load of the predetermined order has been increased (step S609), and determines whether or not the load of the next predetermined order (e.g., second order) can be loaded (step S607).

[0168] This allows the vehicle dispatch device 3 to determine whether or not to load an item in the order of the priority order p, thereby making it possible to efficiently manage the load on the vehicle.

[0169] The storage unit 32 also stores a first cargo increase / decrease pattern table that registers, for each (loading state pattern indicating) the loading state of the vehicle, a cargo increase / decrease pattern indicating an increase / decrease in cargo and identification information (serial number) capable of identifying the loading state after the cargo increase / decrease in association with each other. The control unit 33 determines whether a cargo increase / decrease pattern indicating an increase / decrease in cargo of priority order p caused by a loading request exists in the first cargo increase / decrease pattern table corresponding to the loading state pattern indicating the loading state of the vehicle indicated by the loading state data, and whether a serial number r other than rMax corresponding to the cargo increase / decrease pattern is registered, thereby determining whether the cargo of priority order p can be loaded onto the vehicle (step S608).

[0170] By using such a first cargo increase / decrease pattern table, the vehicle dispatch device 3 can efficiently determine whether or not cargo in a predetermined order can be loaded onto a vehicle.

[0171] Furthermore, the storage unit 32 stores in advance standard values ​​of the characteristics of the cargo. The control unit 33 calculates the degree of inconsistency between the characteristics of the cargo of the priority order p and the standard values ​​(step S704), and detects the presence of a corresponding cargo increase / decrease pattern from the first cargo increase / decrease pattern table and a serial number r that is not rMax corresponding to the cargo increase / decrease pattern based on the calculated degree of inconsistency (step S705). If it is determined that the cargo of the priority order p can be loaded (step S608; Yes), the control unit 33 updates the loading state of the vehicle indicated by the loading state data to the loading state after the increase / decrease of the cargo indicated by the detected serial number r (step S609).

[0172] For example, in the first cargo increase / decrease pattern table, when a plurality of standard values ​​are stored in the storage unit 32, the cargo increase / decrease pattern and the serial number r are registered in association with each standard value. The control unit 33 detects from the first cargo increase / decrease pattern table a serial number r whose degree of inconsistency (below a threshold value defined as necessary and which is not rMax corresponding to the lowest standard value) among the serial numbers r corresponding to cargo increase / decrease patterns indicating an increase / decrease in cargo of the priority order p generated by a vehicle dispatch request (step S705), and updates the vehicle loading state indicated by the loading state data to the loading state after the increase / decrease in cargo indicated by the detected serial number r (step S609).

[0173] In this way, by detecting the load increase / decrease pattern based on the degree of discrepancy between the load characteristics and standard values, it is possible to detect the load increase / decrease pattern that matches or most closely resembles the load increase / decrease, thereby enabling the vehicle load status indicated by the load status data to be updated more accurately and the vehicle's load to be managed efficiently.

[0174] The loading status data stores the loading status of the vehicle for each stop position between fixed passing points i of the vehicle (between each stop position included therein) in such a way that the loading status of the vehicle can be specified. Specifically, the loading status data stores a serial number r corresponding to a loading status pattern indicating the loading status of the vehicle for each stop position of the vehicle. The control unit 33 determines whether or not a load of priority order p can be loaded onto the vehicle for each stop position based on the loading status (serial number r corresponding to a loading status pattern indicating) at each stop position of the vehicle indicated by the loading status data, and determines that the load of priority order p can be loaded if the load of priority order p can be loaded at all stop positions, and determines that the load of priority order p cannot be loaded if the load of priority order p cannot be loaded at any stop position.

[0175] In this way, the control unit 33 determines whether cargo with priority order p can be loaded for each interval between the vehicle's fixed passing points i (between each of the stopping positions contained therein), and if cargo with priority order p cannot be loaded at all of the stopping positions, the control unit 33 does not load the cargo with priority order p, thereby efficiently managing the cargo on the vehicle so that the vehicle does not become filled up with cargo.

[0176] The control unit (receiving means) 33 of the vehicle dispatching device 3 receives a vehicle dispatch request from the user terminal 2-L via the network N, the vehicle dispatch request including a loading request and requesting a vehicle to be dispatched to a vehicle dispatch location designated by the user within a predetermined range between the fixed passing points i. The control unit (candidate generating means) 33 generates a plurality of route candidates that travel between the fixed passing points i via at least one of the vehicle dispatch locations specified from each of the vehicle dispatch requests received from the plurality of user terminals 2-L (step S801). The control unit (excluding means) 33 excludes from the route candidates generated by the candidate generating means a route in which an increase in the vehicle's travel period caused by loading the cargo and passing through the vehicle dispatch location exceeds a predetermined allowable range (step S803). The control unit (numerical value calculating means) 33 calculates a total disutility Fsum, which is an added value of a plurality of types of numerical values ​​indicating the inconvenience of each of the route candidates generated by the candidate generating means (step S804). The control unit (route determination means) 33 determines the route candidate with the smallest total disutility Fsum calculated by the numerical value calculation means as the route along which the vehicle will travel (step S805).

[0177] As a result, the vehicle dispatch system 1 according to this embodiment can achieve efficient operation.

[0178] Moreover, the control unit (numerical value calculation means) 33 calculates a numerical value indicating the effort of the vehicle driver caused by the loading of the cargo (total workload value) as a numerical value indicating the inconvenience.

[0179] This allows the vehicle dispatch device 3 to appropriately manage the labor of vehicle drivers.

[0180] The control unit (transmission means) 33 transmits a notification via the network N to the user terminal 2-L of a user whose designated dispatch location is included in the route determined by the route determination means that a vehicle can be dispatched, while notifying the user terminal 2-L of a user whose route does not include the designated dispatch location that a vehicle cannot be dispatched and transmitting a notification via the network N recommending the user to make a next request for dispatching a vehicle. When the number of dispatch requests received within a specified period exceeds a specified upper limit, the control unit (transmission means) 33 notifies the user terminal 2-L that transmitted the dispatch request that exceeds the specified upper limit that a vehicle cannot be dispatched, and transmits a notification via the network N recommending the user to make a next request for dispatching a vehicle.

[0181] As a result, the vehicle dispatch system 1 according to this embodiment can achieve efficient operation.

[0182] In the vehicle dispatch system 1 according to the present embodiment, the control unit (receiving means) 33 of the vehicle dispatch device 3 receives a vehicle dispatch request from the user terminal 2-L via the network, the vehicle dispatch request being a request for dispatching a vehicle to a vehicle dispatch location designated by the user within a predetermined range between predetermined stop locations. Next, the control unit (candidate generating means) 33 generates multiple route candidates that run between stop locations via at least one of the vehicle dispatch locations identified from each of the vehicle dispatch requests received from the multiple user terminals 2-L. ​​Next, the control unit (excluding means) 33 excludes, from the route candidates generated by the candidate generating means, a route in which an increase in the vehicle's running period caused by passing through the vehicle dispatch location exceeds a predetermined allowable range. Furthermore, the control unit (numerical value calculating means) 33 calculates a total disutility Fsum, which is an added value of multiple types of numerical values ​​indicating the inconvenience of each of the route candidates. Then, the control unit (route determining means) 33 determines a route for the vehicle to run from among the route candidates based on the numerical values ​​calculated by the numerical value calculating means. Thereafter, the control unit (transmission means) 33 transmits a vehicle dispatch possibility notification to the user terminal 2-L of a user whose route determined by the route determination means includes the designated vehicle dispatch location, via the network N, indicating that the vehicle can be dispatched. On the other hand, the control unit (transmission means) 33 transmits a vehicle dispatch possibility notification to the user terminal 2-L of a user whose route does not include the designated vehicle dispatch location, indicating that the vehicle cannot be dispatched, and recommends the user to make a next vehicle dispatch request, via the network N. Furthermore, when the number of vehicle dispatch requests received within a predetermined period exceeds a predetermined upper limit, the control unit (transmission means) 33 notifies the user terminal 2-L that transmitted the vehicle dispatch request exceeding the predetermined upper limit that the vehicle cannot be dispatched, and transmits a vehicle dispatch possibility notification to the user recommending that the user make a next vehicle dispatch request, via the network N.

[0183] As a result, the vehicle dispatch system 1 according to this embodiment can achieve efficient operation.

[0184] The present invention is not limited to the above-described embodiment, and various modifications and applications are possible. Modifications of the above-described embodiment that can be applied to the present invention will be described below.

[0185] In the above embodiment, the programs executed by the CPUs of the control units 24, 33, and 43 have been described as being stored in advance in ROM and memory units 21 and 32, etc., but the present invention is not limited to this, and the programs for executing the above-mentioned processing may be applied to an existing general-purpose computer to function as the user terminal 2-L, dispatch device 3, and vehicle terminal 4 according to the above embodiment.

[0186] Such programs may be provided in any manner; for example, they may be stored on a computer-readable recording medium (such as a flexible disk, a CD (Compact Disc)-ROM, a DVD (Digital Versatile Disc)-ROM, etc.) and distributed, or they may be stored in storage on a network such as the Internet and provided by downloading it.

[0187] Furthermore, when the above processing is performed by sharing between an OS (Operating System) and an application program, or by cooperation between the OS and the application program, only the application program may be stored in a recording medium or storage. Also, the program may be superimposed on a carrier wave and distributed via a network. For example, the above program may be posted on a bulletin board (BBS: Bulletin Board System) on a network and distributed via the network. Then, the program may be started and executed under the control of the OS in the same way as other application programs, thereby enabling the above processing to be performed. [Explanation of symbols]

[0188] 1. Vehicle dispatch system 2-L User terminal 3. Vehicle allocation device (cargo management device) 4 Vehicle terminal 21,32 Storage part 22 Touch Panel 23,31,41 Communications Department 42 Display section 24,33,43 Control section

Claims

1. A storage unit that stores loading state data indicating a loading state of the vehicle; a control unit which, in response to receiving a loading request capable of identifying a load of a vehicle and a priority order of the load, determines whether or not a load of a predetermined priority order among the loads identified from the loading request can be loaded onto the vehicle based on the loading state of the vehicle indicated by the loading state data, and when it is determined that the load of the predetermined priority order can be loaded, updates the loading state of the vehicle indicated by the loading state data to a state in which the load of the predetermined priority order has been increased, and determines whether or not the load of the next predetermined priority order can be loaded; Equipped with The control unit is a receiving means for receiving, via a network, from a user terminal, a vehicle dispatch request including the loading request and requesting dispatch of a vehicle to a vehicle dispatch location designated by the user within a predetermined range between predetermined stopping locations; a candidate generating means for generating a plurality of candidate routes for travel between the stop positions via at least one of the dispatch positions identified from each of the dispatch requests received from the plurality of user terminals; an exclusion means for excluding, from the route candidates generated by the candidate generation means, a route in which an increase in a travel period of the vehicle caused by loading the cargo and passing through the dispatch location exceeds a predetermined allowable range; a numerical value calculation means for calculating a numerical value indicating an inconvenience of each of the route candidates generated by the candidate generation means; a route determination means for determining the route candidate having the smallest value calculated by the value calculation means as the route along which the vehicle will travel; Including, the numerical value calculation means calculates, as the numerical value indicating the inconvenience, a numerical value indicating the effort of a driver of the vehicle caused by loading the cargo; A cargo management device characterized by:

2. A storage unit that stores loading state data indicating a loading state of the vehicle; a control unit which, in response to receiving a loading request capable of identifying a load of a vehicle and a priority order of the load, determines whether or not a load of a predetermined priority order among the loads identified from the loading request can be loaded onto the vehicle based on the loading state of the vehicle indicated by the loading state data, and when it is determined that the load of the predetermined priority order can be loaded, updates the loading state of the vehicle indicated by the loading state data to a state in which the load of the predetermined priority order has been increased, and determines whether or not the load of the next predetermined priority order can be loaded; Equipped with The control unit is a receiving means for receiving, via a network, from a user terminal, a vehicle dispatch request including the loading request and requesting dispatch of a vehicle to a vehicle dispatch location designated by the user within a predetermined range between predetermined stopping locations; a candidate generating means for generating a plurality of candidate routes for travel between the stop positions via at least one of the dispatch positions identified from each of the dispatch requests received from the plurality of user terminals; an exclusion means for excluding, from the route candidates generated by the candidate generation means, a route in which an increase in a travel period of the vehicle caused by loading the cargo and passing through the dispatch location exceeds a predetermined allowable range; a numerical value calculation means for calculating a numerical value indicating an inconvenience of each of the route candidates generated by the candidate generation means; a route determination means for determining the route candidate having the smallest value calculated by the value calculation means as the route along which the vehicle will travel; a transmission means for transmitting, via the network, a notification that a vehicle can be dispatched to the user terminal of the user for which the route determined by the route determination means includes the designated vehicle dispatch location, and for transmitting, via the network, a notification that a vehicle cannot be dispatched to the user terminal of the user for which the route determined by the route determination means does not include the designated vehicle dispatch location, and a notification recommending the user to make the next vehicle dispatch request; Including, When the number of the vehicle dispatch requests received within a predetermined period of time exceeds a predetermined upper limit, the transmission means notifies the user terminal that transmitted the vehicle dispatch request that exceeds the predetermined upper limit that a vehicle cannot be dispatched, and transmits a notification to the user via the network, recommending the next vehicle dispatch request to the user. A cargo management device characterized by:

3. the storage unit stores a first cargo increase / decrease pattern table that registers, for each of the loading states of the vehicle, a cargo increase / decrease pattern indicating an increase / decrease in the cargo and identification information that can identify the loading state after the cargo increase / decrease, in association with each other; the control unit determines whether the cargo of the predetermined rank can be loaded onto the vehicle by determining whether the cargo increase / decrease pattern indicating an increase / decrease of the cargo of the predetermined rank caused by the loading request exists in the first cargo increase / decrease pattern table corresponding to the loading state of the vehicle indicated by the loading state data, and whether the identification information corresponding to the cargo increase / decrease pattern, which does not mean a full state, is registered.

3. The cargo management device according to claim 1 or 2.

4. The loading state data is stored so as to be able to specify the loading state of the vehicle for each interval between stopping positions of the vehicle, The control unit determines whether or not the cargo of the predetermined rank can be loaded onto the vehicle between each of the stop positions based on the loading state between each of the stop positions indicated by the loading state data, and determines that the cargo of the predetermined rank can be loaded if the cargo of the predetermined rank can be loaded between all of the stop positions, and determines that the cargo of the predetermined rank cannot be loaded if the cargo of the predetermined rank cannot be loaded between any of the stop positions.

3. The cargo management device according to claim 1 or 2.

5. A method for managing cargo by a cargo management device including a storage unit that stores loading status data indicating a loading status of a vehicle, the method comprising: a receiving step in which the control unit receives, via a network, from a user terminal, a vehicle dispatch request including a loading request capable of identifying a load on the vehicle and a priority order of the load, the vehicle dispatch request requesting dispatch to a vehicle dispatch location designated by the user within a predetermined range between predetermined stopping locations; a step of the control unit, in response to receiving the loading request, determining whether or not an object of a predetermined rank in the priority order among the objects identified from the loading request can be loaded onto the vehicle based on the loading state of the vehicle indicated by the loading state data; when the control unit determines that the load of the predetermined priority item can be loaded, updating the load status of the vehicle indicated by the loading status data to a state in which the load of the predetermined priority item has been increased, and determining whether the load of the next predetermined priority item can be loaded; a candidate generating step in which the control unit generates a plurality of candidate routes for traveling between the stop positions via at least one of the dispatch positions identified from each of the dispatch requests received from the plurality of user terminals; an exclusion step of the control unit excluding, from the route candidates generated by the candidate generation step, a route in which an increase in a travel period of the vehicle caused by loading the cargo and passing through the dispatch position exceeds a predetermined allowable range; a numerical value calculation step of the control unit calculating a numerical value indicating an inconvenience of each of the route candidates generated by the candidate generating step; a route determination step in which the control unit determines the route candidate having the smallest value calculated in the value calculation step as the route along which the vehicle will travel; Equipped with The numerical value calculation step calculates a numerical value indicating the effort of a driver of a vehicle caused by loading the load as the numerical value indicating the inconvenience. A cargo management method comprising:

6. A method for managing cargo by a cargo management device including a storage unit that stores loading status data indicating a loading status of a vehicle, the method comprising: a receiving step in which the control unit receives, via a network, from a user terminal, a vehicle dispatch request including a loading request capable of identifying a load on the vehicle and a priority order of the load, the vehicle dispatch request requesting dispatch to a vehicle dispatch location designated by the user within a predetermined range between predetermined stopping locations; a step of the control unit, in response to receiving the loading request, determining whether or not an object of a predetermined rank in the priority order among the objects identified from the loading request can be loaded onto the vehicle based on the loading state of the vehicle indicated by the loading state data; when the control unit determines that the load of the predetermined priority item can be loaded, updating the load status of the vehicle indicated by the loading status data to a state in which the load of the predetermined priority item has been increased, and determining whether the load of the next predetermined priority item can be loaded; a candidate generating step in which the control unit generates a plurality of candidate routes for traveling between the stop positions via at least one of the dispatch positions identified from each of the dispatch requests received from the plurality of user terminals; an exclusion step of the control unit excluding, from the route candidates generated by the candidate generation step, a route in which an increase in a travel period of the vehicle caused by loading the cargo and passing through the dispatch position exceeds a predetermined allowable range; a numerical value calculation step of the control unit calculating a numerical value indicating an inconvenience of each of the route candidates generated by the candidate generating step; a route determination step in which the control unit determines the route candidate having the smallest value calculated in the value calculation step as the route along which the vehicle will travel; a transmission step of transmitting, via the network, a notification that a vehicle can be dispatched to the user terminal of the user for which the route determined by the route determination step includes the specified vehicle dispatch location, while transmitting, via the network, a notification that a vehicle cannot be dispatched to the user terminal of the user for which the route determined by the route determination step does not include the specified vehicle dispatch location, and a notification recommending the user to make the next vehicle dispatch request; Equipped with When the number of the dispatch requests received within a predetermined period of time exceeds a predetermined upper limit, the transmission step notifies the user terminal that transmitted the dispatch request that exceeds the predetermined upper limit that a vehicle cannot be dispatched, and transmits a notification to the user via the network recommending the next dispatch request to a vehicle. A cargo management method comprising:

7. A computer of a cargo management device includes a storage unit that stores loading status data indicating a loading status of a vehicle. a receiving step of receiving, from a user terminal via a network, a vehicle dispatch request including a loading request capable of identifying a load on a vehicle and a priority order of the load, the vehicle dispatch request requesting dispatch to a vehicle dispatch location designated by a user within a predetermined range between predetermined stop locations; a step of determining, in response to receiving the loading request, whether or not an object of a predetermined priority among the objects specified in the loading request can be loaded onto the vehicle based on the loading state of the vehicle indicated by the loading state data; a step of updating the loading state of the vehicle indicated by the loading state data to a state in which the load of the load of the vehicle of the predetermined rank has been increased when it is determined that the load of the load of the vehicle of the predetermined rank can be loaded, and determining whether or not the load of the next load of the predetermined rank can be loaded; a candidate generating step of generating a plurality of candidate routes for traveling between the stop positions via at least one of the dispatch positions identified from each of the dispatch requests received from the plurality of user terminals; an exclusion step of excluding, from the route candidates generated by the candidate generation step, a route in which an increase in a travel period of the vehicle caused by loading the cargo and passing through the dispatch location exceeds a predetermined allowable range; a value calculation step of calculating a value indicating inconvenience for each of the route candidates generated by the candidate generation step; a route determination step of determining the route candidate having the smallest value calculated by the value calculation step as the route along which the vehicle will travel; A program for executing the numerical value calculation step calculates, as the numerical value indicating the inconvenience, a numerical value indicating a labor of a driver of the vehicle caused by loading the cargo; A program characterized by:

8. A computer of a cargo management device includes a storage unit that stores loading status data indicating a loading status of a vehicle. a receiving step of receiving, from a user terminal via a network, a vehicle dispatch request including a loading request capable of identifying a load on a vehicle and a priority order of the load, the vehicle dispatch request requesting dispatch to a vehicle dispatch location designated by a user within a predetermined range between predetermined stop locations; a step of determining, in response to receiving the loading request, whether or not an object of a predetermined priority among the objects specified in the loading request can be loaded onto the vehicle based on the loading state of the vehicle indicated by the loading state data; a step of updating the loading state of the vehicle indicated by the loading state data to a state in which the load of the load of the vehicle of the predetermined rank has been increased when it is determined that the load of the load of the vehicle of the predetermined rank can be loaded, and determining whether or not the load of the next load of the predetermined rank can be loaded; a candidate generating step of generating a plurality of candidate routes for traveling between the stop positions via at least one of the dispatch positions identified from each of the dispatch requests received from the plurality of user terminals; an exclusion step of excluding, from the route candidates generated by the candidate generation step, a route in which an increase in a travel period of the vehicle caused by loading the cargo and passing through the dispatch location exceeds a predetermined allowable range; a value calculation step of calculating a value indicating inconvenience for each of the route candidates generated by the candidate generation step; a route determination step of determining the route candidate having the smallest value calculated by the value calculation step as the route along which the vehicle will travel; a transmission step of transmitting, via the network, a notification that a vehicle can be dispatched to the user terminal of the user for which the route determined by the route determination step includes the designated vehicle dispatch location, while transmitting, via the network, a notification that a vehicle cannot be dispatched to the user terminal of the user for which the route determined by the route determination step does not include the designated vehicle dispatch location, and a notification recommending the user to make the next vehicle dispatch request; A program for executing the transmission step, when the number of the dispatch requests received within a predetermined period exceeds a predetermined upper limit, notifies the user terminal that transmitted the dispatch request that exceeds the predetermined upper limit that a vehicle cannot be dispatched, and transmits a notification to the user via the network, recommending the next dispatch request to a vehicle; A program characterized by:

Images