JP7187951B2 - Matching program, matching method and matching device - Google Patents

Description

The present invention relates to a matching program, matching method and matching device.

Vehicles of transportation companies may be forwarded in an empty state with no cargo loaded on the vehicle on the return trip to the registered country after passing the outbound trip to the destination. On the other hand, a shipper may find it difficult to dispatch a vehicle for a cargo that he/she wants to transport. In this way, a matching service is provided that matches the cargo requested by the carrier and the vehicle requested by the shipper, that is, the so-called freight and vehicle request.

JP 2018-5856 A

However, the use of the matching service is restrained due to the increase in transportation costs associated with the use of the matching service.

In one aspect, an object of the present invention is to provide a matching program, a matching method, and a matching device that can promote the use of matching services.

In one aspect, the matching program includes a vehicle request specifying conditions including a loading location, loading time, loading location and unloading time, a scheduled location where the vehicle will be empty, and an estimated arrival time at the scheduled location. A cargo claim request specifying conditions including conditions is received, and the cargo claim request is extracted by matching between a scheduled empty vehicle location specified in the cargo request request and a loading location specified in the vehicle request request. A computer is caused to set distance and/or travel time ranges according to the number of entries to the matching.

It can promote the use of matching services.

FIG. 1 is a diagram illustrating an example of the correlation of related parties. FIG. 2 is a diagram illustrating a configuration example of a matching system according to the first embodiment; FIG. 3 is a diagram showing an example of a coin demand range. FIG. 4A is a diagram showing an example of a matching service. FIG. 4B is a diagram illustrating an example of a method for excluding currency requests. 5 is a diagram illustrating an example of a functional configuration of a matching device according to the first embodiment; FIG. FIG. 6 is a diagram showing an example of the correspondence relationship between the permissible movement time and the total number of entries. FIG. 7 is a diagram showing an example of matching of the second location condition. FIG. 8 is a diagram showing an example of price condition matching. FIG. 9 is a diagram showing an example of a method for excluding coin request requests. FIG. 10 is a flowchart (1) illustrating the procedure of matching processing according to the first embodiment. FIG. 11 is a flowchart (2) illustrating a procedure of matching processing according to the first embodiment; FIG. 12 is a flowchart (3) illustrating a procedure of matching processing according to the first embodiment; FIG. 13 is a diagram showing an example of master data. FIG. 14A is a diagram showing an example of the correspondence relationship between the first commission rate and the cumulative contract count. FIG. 14B is a diagram showing an example of the correspondence relationship between the second fee rate and the cumulative number of specified parcel types. FIG. 15 is a flowchart illustrating the procedure of commission rate calculation processing according to the second embodiment. FIG. 16 is a diagram showing an example of master data. FIG. 17 is a diagram showing an example of time zone distribution specification. FIG. 18 is a diagram showing an example of the commission rate and the total number of entries. FIG. 19 is a flowchart illustrating the procedure of commission rate calculation processing according to the second embodiment. FIG. 20 is a diagram illustrating a hardware configuration example of a computer that executes matching programs according to the first and second embodiments.

A matching program, matching method, and matching apparatus according to the present application will be described below with reference to the accompanying drawings. Note that this embodiment does not limit the disclosed technology. Further, each embodiment can be appropriately combined within a range that does not contradict the processing contents.

[Persons involved in the matching service]
FIG. 1 is a diagram illustrating an example of the correlation of related parties. As shown in Figure 1, users who use the matching service for freight and vehicle requests include Ko 1 to Ko n and Ko 1 to Ko m. exist. Hereinafter, A1 to An may be referred to as "A", and Otsu1 to Otsum may be referred to as "Otsu".

Of these, Party A corresponds to the vehicle request side. For example, Party A includes 3PL (3-Party Logistics) to which logistics operations are entrusted by the true shipper in addition to the true shipper. In addition, B corresponds to the demand side. For example, Party B includes transportation companies and sole proprietors for whom Party A is the main contractor, as well as 3PLs who are the ordering parties of Party A. In addition, Hei corresponds to businesses that provide matching services to Party A and Party B.

[System configuration]
FIG. 2 is a diagram illustrating a configuration example of a matching system according to the first embodiment; As shown in FIG. 2, the matching system 1 has a matching service that provides a matching service for allocating the vehicle of Party B to Party A by matching the request for requesting goods received from Party B with the request for requesting a vehicle received from Party A. A device 10 is included.

The matching device 10 is a computer that provides the matching service described above. For example, the matching device 10 is operated by Hei.

As one embodiment, the matching device 10 can be implemented by installing a matching program that realizes functions corresponding to the above-described matching service as package software or online software on a desired computer. For example, the matching device 10 may be implemented on-premises as a server that provides the above matching service, or may be implemented as a cloud that provides the above matching service through outsourcing.

For example, the matching device 10 accepts a cargo request request in which conditions such as location, time, luggage and price are specified from Party B, and a vehicle request request in which conditions such as location, time, luggage and price are specified from Party A. accept. Then, the matching device 10 matches the freight request received from B and the vehicle request received from A. After that, the matching device 10 dispatches the vehicle of B, who is the issuer of the currency request, to A who is the issuer of the vehicle request that matches the conditions specified in the currency request.

In the matching system 1 shown in FIG. 2, the matching device 10 can cooperate with the operation management system 30 to accept a request for money request from B from the aspect of managing the matching service.

The operation management system 30 is a system that provides an operation management service that supports operation management of vehicles such as trucks and buses. For example, the above operation management service is used by Party B. In addition, the above operation management service is provided by C, which is also the provider of the above matching service, as an example only, and may be provided by a third party other than C. Although FIG. 2 illustrates an example in which one operation management system 30 cooperates with the matching device 10 , the matching device 10 may cooperate with a plurality of operation management systems 30 .

For example, as part of the operation management service described above, the operation management system 30 can provide services such as creation of daily driving reports by vehicle crew members, management of vehicle dynamics, vehicle allocation management, etc., as well as support for the creation of operation plans. We can provide services such as support services for creating operation plans to be used. For example, in the operation plan creation support service mentioned above, using driving data collected from vehicles or probe data of commercial vehicles for which driving data has been collected and analyzed, the departure and destination points and dates and times can be specified. An operating route corresponding to the conditions is formulated. Hereinafter, among the operation routes determined in the operation plan, the route from the departure point such as the vehicle registration to the destination is referred to as "outbound route", and the route returning from the destination to the departure point is referred to as "return route". may be described as

Furthermore, in the operation management system 30, in addition to the operation plan creation support service, an operation plan change support service is provided. For example, the above-mentioned operation plan change support service is used when there is a discrepancy in road and traffic conditions between the phase in which the operation is actually carried out according to the operation plan and the phase in which the operation plan is created. is useful from some aspects. In the current situation, it is difficult to smoothly change the operation plan when there is a deviation in road and traffic conditions. This is because the determination of whether or not to change the operation plan, as well as the content of changes such as the route and the estimated time of arrival at the destination, is left to the individual skill of the operation manager, for example, empirical rules. For this reason, the decision to change the operation plan may be delayed due to the fact that it is not possible to determine whether the operation plan needs to be changed or whether the details of the change in the operation plan cannot be foreseen. For these reasons, in the above operation plan change support service, there is a difference between the current position and date and time acquired from a vehicle equipped with a digital tachograph and the planned position and arrival date and time of the route determined in the operation plan. If the permissible range is exceeded, the operation plan is changed based on the route and required time recalculated using the most recent travel results on the condition that approval is received from the terminal used by the operation manager.

Here, as an example only, the operation management system 30 makes a freight demand request to the matching device 10 based on the operation plan when the operation plan is formulated by the above operation plan creation support service. For example, at the time when the operation plan is formulated, there is a case where the dispatch plan for the outbound route has been formulated, but the dispatch plan for the return route has not yet been formulated. In this case, the vehicle changes from the actual vehicle to the empty vehicle at the stage of arriving at the destination on the outbound route. In this way, from the aspect of avoiding an empty car forwarding on the return trip, the above matching service is used by Party B. For example, the operation management system 30 specifies, as location conditions, the destination of the outbound route, the vehicle registration itself, or the vehicle registration area that indicates the direction of the vehicle registration when viewed from the destination. As the condition of , a cargo claim request is sent to the matching device 10 in which the scheduled date and time of arrival at the destination of the outbound route is specified.

Here, as an example only, the example in which the freight demand request is automatically issued from the operation management system 30 to the matching device 10 at the time of formulating the operation plan is given, but the present invention is not limited to this. For example, the request may be manually issued from a terminal operated by Party B, for example, a terminal of an operation manager.

Further, in the matching system 1 shown in FIG. 2, the matching device 10 cooperates with the shipper side systems 50A to 50C from the aspect of managing the above matching service, and receives a vehicle request request from Party A. Hereinafter, the shipper-side systems 50A to 50C may be referred to as the "shipper-side system 50".

The consignor side system 50 corresponds to an example of various systems operated by Party A. For example, the consignor side system 50 corresponds to a person in charge of ordering to B, a person in charge of checking loading and unloading by the crew of B's vehicle, and a computer used by these persons in charge. In addition, the shipper side system 50 is an SCM (Supply Chain Management) system built for the purpose of optimizing the supply chain, an ordering system used by the true shipper and its 3PLs to place orders with B, etc. I don't mind.

The shipper-side system 50 transmits to the matching device 10 a vehicle request request in which the loading and unloading places of the cargo are designated as the location conditions, and the desired date and time of loading and unloading are set as the time conditions. do.

[One aspect of the challenge]
A fee may be charged by Hei to Party A and Party B for the use of the above matching service. From the aspect of avoiding this fee, Party A and Party B may conduct direct transactions without going through the above matching service. For example, if it can be confirmed that Party A and Party B are mutually trustworthy business partners in transactions conducted through the above matching service in the past, from the next time onwards, direct transactions will be conducted without going through the above matching service. Sometimes.

Through this direct transaction, Party A on the vehicle seeking side has the advantage of trading at a low price equivalent to the above matching service fee, while Party B on the cargo seeking side can receive a high price equivalent to the above matching service fee. There are advantages to trading.

If such direct transactions are rampant, there is a risk that the number of entries of cargo request and vehicle request to the above-mentioned matching service will decrease. Furthermore, if the number of entries to the matching service decreases, it becomes difficult to establish matching, so it is conceivable that the quality of the matching service will deteriorate. For these reasons, measures such as discounting the fees for the above-mentioned matching services may be taken from the aspect of increasing motivation to participate in the above-mentioned matching services.

However, there is a limit to discounts on fees for the above matching services. In other words, even if the fees for the above-mentioned matching service are discounted, it is difficult to make the fare lower for Party A and higher for Party B than when the above-mentioned direct transaction is conducted.

[One aspect of problem-solving approach]
Therefore, the matching device 10 according to the present embodiment provides a range of distances from which cargo requests are extracted by matching using the distance between the unloading location specified in the cargo request and the loading location specified in the vehicle request. is set according to the number of entries to the matching service. Hereinafter, the range of distances from which a currency request is extracted may be referred to as a “money request range”.

FIG. 3 is a diagram showing an example of a coin demand range. FIG. 3 shows the unloading point P1 specified in the request for request of Otsu 1 and the place of unloading P2 specified in the request for request of Otsu 2. Here, if the number of entries to the matching service of Otsu 2 is greater than the number of entries to the matching service of Otsu 1, that is, if the number of entries of Otsu 2 > the number of entries of Otsu 1, the calculation is performed as shown in FIG. A currency range is set. As shown in FIG. 3, a range smaller than the coin requesting range R2, which has a larger number of entries than that of the coin requesting range R2, is set in the coin requesting range R1 of the first party. On the other hand, in the coin requesting range R2 of Otsu 2, a range larger than the coin requesting range R1, which has a smaller number of entries than that of Otsu 2, is set.

In this way, by changing B's currency request range according to the number of entries to the matching service described above, there will be a difference in the amount of matching opportunities for B. In Fig. 3, A's loading area, which is included only in Otsu 1's cargo request range R1, is indicated by an unfilled rectangular mark, while Otsu 1's cargo request range R1 and Otsu 2's cargo request range R2 Included instep loading areas are indicated by solid rectangular marks. For example, in the example of FIG. 3, since the cargo request range R1 of Otsu 1 includes only one loading port of A, the chance of matching can be obtained only once. On the other hand, the cargo request range R2 of Party B 2 includes one loading port of Party A, which is also included in the cargo request range R1 of Party B 1, and the cargo of Party A that is not included in the cargo request range R1 of Party B 1. Since 19 loading ports are included, a total of 20 matching opportunities can be obtained.

For example, in the case of Otsu 2's freight request, which has many matching opportunities, the possibility of matching with A's vehicle request is increased. For example, even if the price terms specified in B2's claim request are higher than those specified in B1's claim request, the price is 19 times higher than B1's claim request. Since matching can be carried out, the possibility of matching in terms of price also increases.

In this way, the number of matching opportunities changes according to the number of entries to the matching service described above, so it is possible to provide incentives for Party B's participation in the matching service, and as a result, increase the motivation for Party B to participate in the matching service. be able to.

Therefore, according to the matching device 10 according to the present embodiment, it is possible to promote the use of matching services.

[An aspect of other issues]
While the above matching service contributes to meeting the needs of Party A and Party B, the work performance of the vehicle crew may exceed the labor standards due to the operation by matching. For example, when matching is established, the continuous working hours and continuous driving hours of the crew members of B may be longer than when the operation plan was formulated. In this case, at the time when the train operation plan was formulated, even if the crew's work record, such as continuous working hours and continuous driving time, was within the labor standard, the labor record exceeded the labor standard due to the establishment of matching. Sometimes. As a result, there is a risk that transport safety will be compromised and compliance will be violated in terms of labor standards.

[One aspect of problem-solving approach]
Therefore, the matching device 10 according to the present embodiment, when the labor performance based on the required time when the matching operation based on the car request request is added to the operation route corresponding to the money request request exceeds the labor standard, are excluded from matching with car request requests.

FIG. 4A is a diagram showing an example of a matching service. Fig. 4A shows, as an example only, an operation plan in which an operation route for a return trip that starts from the registered address of B and returns to the registered address of B by turning around from the outbound route with the destination of the unloading location of B is formulated. An example in which a matching operation is added to the return route is shown. As shown in FIG. 4A, the return route of the operation plan includes a matching operation in which the cargo is loaded from the unloading port of the outward trip via the loading port of A, and the cargo is transported to the unloading port of A and unloaded. ing. When matching operations are added in this way, operation routes for which matching operations are added to the operation plan using driving data collected from vehicles or probe data of commercial vehicles for which driving data has been collected and analyzed is recalculated. Furthermore, based on the required time on the operation route to which the matching operation is added, as an example of the work record, the continuous working hours corresponding to the hours worked continuously by the crew of B are calculated.

In this way, whether or not the freight demand request is excluded from matching with the vehicle demand request depends on whether or not the continuous working hours calculated from the required time after adding the matching operation exceeds the threshold stipulated in the labor standards. to decide. The labor standards may be, for example, the standards stipulated by the Labor Standards Act, or the standards independently established by each company or matching system so as to comply with the Labor Standards Act.

FIG. 4B is a diagram illustrating an example of a method for excluding currency requests. In the example shown in FIG. 4B, of the five cargo request requests r1 to r5, the cargo request requests r1, There are three of them: currency demand request r4 and currency demand request r5. Of these three requests, the request r1 is the only request for which the continuous working hours calculated from the required time after the addition of the matching operation is within the threshold value set by the labor standard, for example, 13 hours. . In this case, only the cargo request r1 is successfully matched with the vehicle request. On the other hand, cargo demand requests r4 and r5, which have more than 13 hours of continuous work, can be closer to A's loading port than cargo demand r1, can arrive at A's loading port earlier, or have a lower fare. Even if it is, it is excluded from the matching target with the vehicle request request.

Therefore, according to the matching device 10 of the present embodiment, it is possible to prevent the labor record of the vehicle driver from exceeding the labor standard due to the matching operation. As a result, the safety of transportation can be improved, and furthermore, the risk of violating compliance in terms of labor standards can be suppressed.

[Configuration of matching device 10]
FIG. 5 is a diagram illustrating an example of the functional configuration of the matching device 10 according to the first embodiment. As shown in FIG. 5 , the matching device 10 has a communication I/F (InterFace) section 11 , a storage section 13 and a control section 15 . Although FIG. 5 shows the solid line representing the data transfer relationship, for the convenience of explanation, only the minimum portion is shown. That is, input/output of data regarding each processing unit is not limited to the illustrated example, and input/output of data other than illustrated, for example, between the processing unit and the processing unit, between the processing unit and data, and between the processing unit and the external Input/output of data between devices may be performed.

The communication I/F unit 11 corresponds to an interface that controls communication with other devices such as the operation management system 30 and the consignor side system 50 .

As one embodiment, the communication I/F unit 11 corresponds to a network interface card such as a LAN (Local Area Network) card. For example, the communication I/F unit 11 receives an operation plan from the operation management system 30 or a cargo request generated from the operation plan, or receives a vehicle request from the consignor side system 50 . In addition, the communication I/F unit 11 notifies the operation management system 30 of a vehicle request that has been successfully matched with the vehicle request, or information of the issuer of the vehicle request, or notifies the vehicle request. The system 50 on the side of the consignor is notified of the cargo claim request that has been successfully matched with the cargo claim request or of the issuer of the cargo claim request.

The storage unit 13 is a functional unit that stores data used for an OS (Operating System) executed by the control unit 15, application programs such as the matching program described above, and various programs such as middleware.

As one embodiment, the storage unit 13 can be implemented as an auxiliary storage device in the matching device 10 . For example, an HDD (Hard Disk Drive), an optical disk, an SSD (Solid State Drive), or the like can be used as the storage unit 13 . Note that the storage unit 13 does not necessarily have to be implemented as an auxiliary storage device, and can be implemented as a main storage device in the operation management device 10 . In this case, various semiconductor memory elements such as RAM (Random Access Memory) and flash memory can be used for the storage unit 13 .

The storage unit 13 stores operation plan information 13a, cargo request information 13b, entry information 13c, and vehicle request information 13d as an example of data used in the program executed by the control unit 15. FIG.

In addition to the data shown in FIG. 5, the storage unit 13 may store other electronic data. For example, the storage unit 13 stores traveling data collected from a digital tachograph mounted on a vehicle such as a truck or bus, or probe data of a commercial vehicle from which traveling data has been collected and analyzed. In addition to the road map information, the storage unit 13 also stores account information regarding the matching services of A and B.

The description of the operation plan information 13a, the freight request information 13b, the entry information 13c, and the vehicle request information 13d shown in FIG. do.

The control unit 15 is a processing unit that performs overall control of the matching device 10 .

As one embodiment, the control unit 15 can be implemented by a hardware processor such as a CPU (Central Processing Unit) or an MPU (Micro Processing Unit). Here, as examples of processors, CPUs and MPUs have been exemplified. Learning Unit) or GPGPU (General-Purpose computing on Graphics Processing Units). Alternatively, the control unit 15 may be realized by hardwired logic such as ASIC (Application Specific Integrated Circuit) or FPGA (Field Programmable Gate Array).

The control unit 15 virtually realizes the following processing units by developing the above matching program on a work area of a RAM implemented as a main storage device (not shown). Here, an example is given in which a matching program in which functions corresponding to the above matching service are packaged is executed, but a program packaged further including functions corresponding to the above operation management service is executed. It may be assumed that In addition, among the functions provided by the above-mentioned matching service, the above-mentioned claim range setting function or the above-mentioned claim request exclusion function may be executed as a program module or a library may be referenced. I don't mind.

As shown in FIG. 5, the control unit 15 has a first reception unit 15a, a second reception unit 15b, and a matching processing unit 17.

The first reception unit 15a is a processing unit that receives a coin request. Here, as an example only, an example in which the first receiving unit 15a generates a freight claim request based on the operation plan notified from the operation management system 30 will be described. It may be notified from the operation management system 30 .

As one embodiment, the first reception unit 15a generates a freight claim request based on the operation plan notified from the operation management system 30. FIG. For example, when an operation plan is notified from the operation management system 30, the first reception unit 15a adds the operation plan to the entry of the operation plan information 13a of the storage unit 13 and saves it. An example of such an operation plan schema is the required time of the operation route, the departure point, the destination, the rest points, the distribution bases to be transit points, the nodes such as major branches, the scheduled arrival date and time at each node, It includes items such as the status of a vehicle or an empty vehicle. In addition, the operation plan may include vehicle attribute information such as vehicle ID (IDentification), vehicle number, vehicle type, maximum gross weight and load capacity, as well as the type of cargo carried by the vehicle. do not have. With reference to such an operation plan, the first reception unit 15a sets various conditions used for matching with the vehicle request, such as location, time, package, and price.

(1) Location
The first reception unit 15a sets two points OD, an origin and a destination, where B wishes to conduct a transportation transaction with A as location conditions. For example, the first reception unit 15a can set the destination determined in the operation plan, for example, the last unloading point on the outward route as the starting point. Hereinafter, the final unloading point on the outward trip may be referred to as the "outward unloading point." Here, just as an example, from the aspect of minimizing empty vehicle forwarding, the example of setting the outbound unloading point as the starting point was given, but the point located in the direction of the vehicle registration area when viewed from the outbound unloading point is set as the starting point. I don't mind if it happens. For example, the first reception unit 15a can set the rest point as the starting point when the rest point is set on the operation route of the return trip in the operation plan. Furthermore, from the aspect of increasing the chances of successful matching of the location of the claim request, a region can be set as the starting point instead of a point. For example, it is possible to divide the prefectures of Japan into a predetermined number, for example, about 20 areas, and set the areas including outward unloading points and rest points as starting points.

Further, the first reception unit 15a can set the departure point determined in the operation plan, for example, the vehicle registration address, as the end point. At this time, from the aspect of increasing the chances of successful matching of the location of the currency request, an area can be set as the end point instead of the location. For example, it is possible to divide the prefectures of Japan into a predetermined number of areas, for example, about 20 areas, and set the area including the registered land as the end point. Also, the end point does not necessarily have to be set to the location or area of the vehicle registration itself. For example, the first reception unit 15a can set a point or direction located in the direction of the vehicle registration when viewed from the outbound unloading area as the end point.

(2) Time The first reception unit 15a sets the time zone in which B wishes to conduct a transportation transaction with A as a time condition. For example, the first reception unit 15a can set the time slot based on the expected arrival date and time at the destination determined in the operation plan, for example, the outbound unloading port. As an example only, the first receiving unit 15a can set a time period corresponding to a section from the expected arrival date and time at the outbound unloading port to a predetermined unit period n, for example, 3 hours later, as the time condition. At this time, the start date and time of the time period is not necessarily limited to the expected arrival date and time at the outward unloading port. For example, when a rest point is set on the operation route of the return trip in the operation plan, the first reception unit 15a sets the break end date and time as the start date and time of the section, and sets the date and time after n hours as the end date and time of the section. You can also

(3) Package The first reception unit 15a can set the type of package that can be loaded on the vehicle of B as a package condition. For example, the first reception unit 15a can set the same type of item as the item of the package to be transported by the vehicle in the operation plan as the condition of the package. It should be noted that the items of luggage may not necessarily be specified. However, cargo request requests in which the item of luggage is not specified are excluded from the matching partners of vehicle request requests in which the item of luggage is specified.

(4) Price The first reception unit 15a can set the lower limit fare unit price desired by B as a price condition. For example, the first reception unit 15a refers to the fare unit price information in which the lower limit fare unit price desired by each B is set, specifies the fare unit price of the vehicle targeted for the operation plan, and specifies the fare unit price of the vehicle. The freight unit price determined can be set as a condition of the package. For example, in the case of a distance-based fare, the fare unit information can be an entry in which the fare per unit distance, for example, 1 km, is set for each load amount such as 1 t, 2 t, .

After the conditions such as place, time, package, and price are set in this way, the first receiving unit 15a adds the currency demand request with the conditions set to the currency demand information 13a entry in the storage unit 13 . Further, the first receiving unit 15a increments the cumulative number of entries for B, which is the issuer of the currency request, out of the entry information 13c associated with the cumulative number of entries for each of B. The term "cumulative number of entries" as used herein refers to the cumulative number of times B has participated in the above-mentioned matching service.

Here, an example was given in which the various conditions specified in the freight claim request are automatically set based on the operation plan acquired from the operation management system 30. It is also possible to receive edits to automatically set conditions from a terminal or the like, or to manually set conditions.

The second reception unit 15b is a processing unit that receives vehicle request requests.

(1) Location As one aspect, the second reception unit 15b sets two locations OD, ie, the starting point and the ending point, at which Party A wishes to conduct a transportation transaction with Party B as location conditions. For example, the second receiving unit 15b can set the loading area of A received from the consignor side system 50 or the area including the loading area as a starting point. In addition, the second reception unit 15b can set the unloading place of A received from the consignor side system 50 or the area including the unloading place as the end point. These two OD points can be automatically set by extracting the packages registered in the SCM system or ordering system for which transportation has not yet been ordered, or by the person in charge of placing the order or the crew of the vehicle of B. It is also possible to set manually via a terminal used by the person in charge of checking the unloading or unloading.

(2) Time The second reception unit 15b sets the time zone in which Party A wishes to conduct a transportation transaction with Party B as a time condition. For example, the second reception unit 15b can receive the pick-up date and time of the cargo at the loading port of A from the consignor side system 50, and set the received pick-up date and time as the start date and time of the time period. Further, the second reception unit 15b can receive the delivery date and time of the cargo to the unloading place of A from the consignor side system 50, and can set the accepted delivery date and time of the cargo as the end date and time of the time period. Such a time period can be automatically set by extracting the scheduled pick-up date and time and scheduled delivery date and time for the luggage registered in the SCM system and ordering system for which the vehicle request is requested. Manual settings can also be made via a terminal used by a person in charge of checking loading and unloading by the crew of the vehicle.

(3) Package The second reception unit 15b can set the type of package that Party A wishes to transport as a condition of the package. For example, the second reception unit 15b can set the type of package received from the shipper-side system 50. FIG. Such types of luggage can be automatically set by extracting the type of luggage registered in the SCM system or ordering system for which a vehicle request is requested, or by the person in charge of ordering or the crew of B's vehicle Manual settings can also be made via a terminal used by the person in charge of checking loading and unloading. It should be noted that the item of luggage may not necessarily be specified. However, vehicle request requests in which the item of luggage is not specified are excluded from the matching partners of vehicle request requests in which the item of luggage is specified.

(4) Price The second reception unit 15b can set the upper limit of the fare desired by Party A as a price condition. For example, the second reception unit 15b can set the upper limit of the freight received from the shipper-side system 50 . The upper limit of such fares can be automatically set by extracting the estimated transportation cost of the cargo registered in the SCM system or ordering system for which a vehicle request is requested, or by the person in charge of ordering or the vehicle of B. It is also possible to set manually via a terminal used by a person in charge of checking loading and unloading by crew members.

After the conditions such as place, time, package, and price are set in this manner, the second reception unit 15b adds the vehicle request request with the conditions set to the entry of the vehicle request information 13d in the storage unit 13 .

The matching processing unit 17 is a processing unit that matches cargo requests and vehicle requests. As shown in FIG. 5, the matching processing unit 17 includes an extraction unit 17a, an exclusion unit 17b, and an association unit 17c.

The extraction unit 17a is a processing unit that extracts a cargo request that meets the conditions specified in the vehicle request. The extraction unit corresponds to an example of the setting unit. In the following, as an example only, an example will be described in which the matching of the cargo request and the vehicle request is repeatedly executed at predetermined intervals, such as every 10 minutes, 30 minutes, or 1 hour.

As one embodiment, the extracting unit 17 a calculates the above-described currency request range for each currency request of the currency request information 13 b stored in the storage unit 13 . Specifically, the extraction unit 17a selects one coin request for which matching is not established among the coin request requests included in the coin request information 13b. Subsequently, the extracting unit 17a refers to the operation plan corresponding to the currently selected currency demand request in the operation plan information 13a, and calculates the required time for the outward operation route. Hereinafter, the time required for the outward operation route may be referred to as "outward operation time". After that, the extraction unit 17a determines whether or not the outbound travel time is equal to or longer than a predetermined threshold value Th1, for example, 5 hours. At this time, if the outbound travel time is equal to or greater than the threshold Th1, the extraction unit 17a refers to the first rule and calculates the currency demand range from the cumulative number of entries of B, who is the issuer of the currency demand request. On the other hand, if the outbound travel time is less than the threshold Th1, the extraction unit 17a refers to the second rule and calculates the currency demand range from the cumulative number of entries of B, who is the issuer of the currency demand request. Such calculation of the currency requesting range is repeatedly executed until all the currency requesting requests included in the currency requesting information 13b are selected.

FIG. 6 is a diagram showing an example of the correspondence relationship between the permissible movement time and the total number of entries. The vertical axis of the graph shown in FIG. 6 indicates the time during which B's vehicle is allowed to move from the starting point specified in B's claim request, hereinafter referred to as the permitted travel time, and the horizontal axis of the graph indicates the cumulative number of entries. Point. As shown in FIG. 6, both the first rule applied when the outward travel time is 5 hours or more, and the second rule applied when the outward travel time is less than 5 hours, The greater the total number of entries made by B, the greater the allowable movement time is set. Also, in both the first rule and the second rule, the smaller the cumulative number of entries made by B, the smaller the allowable movement time is set. On the other hand, according to the first rule, the range of extending or contracting the allowable movement time is larger than that of the second rule, and according to the second rule, the range of extending or contracting the allowable movement time is larger than that of the first rule. small.

For example, according to the first rule, the permissible movement time in the range of 0.5 hours to 5 hours is used for calculating the commodity request range. On the other hand, in the second rule, the permissible movement time in the range of 0.4h to 2h is used for calculating the commodity request range.

Thus, the coin requesting range is calculated based on the movement permissible time associated with the cumulative number of entries. For example, a range in which the vehicle can travel within the allowable movement time from the starting point such as the outbound unloading port is calculated as the cargo demand range.

This currency requesting range can be calculated using the above travel data, as an example. For example, the extraction unit 17a includes travel data obtained by collecting time-series data of time, position, speed, and distance from a digital tachograph mounted on a vehicle traveling on a road, and includes an outbound unloading point as a starting point or passing point. Extract driving data. Subsequently, the extracting unit 17a maps the location of the commercial vehicle after the above-mentioned allowable travel time after departing from or passing through the outward unloading point for each travel data that includes the outward unloading point as a starting point or passing point. plot. After that, the extraction unit 17a calculates an area including the location of the commercial vehicle plotted on the map, for example, a convex hull, as the cargo seeking range corresponding to the travel permissible time.

After the cargo request range is calculated for each cargo request in this way, the extracting unit 17a selects the cargo request included in the cargo request information 13b and the vehicle request included in the vehicle request information 13d for which matching has not been established. Execute the following processing for those that are That is, the extracting unit 17a performs matching of the time condition, matching of the luggage condition, matching of the first location condition, matching of the second location condition, and matching of the price condition in this order, thereby obtaining the vehicle request specified by the vehicle request request. match the claim request that matches each condition.

More specifically, the extraction unit 17a selects one time zone in order from the current time, that is, the time zone closest to the matching execution time. Subsequently, the extraction unit 17a extracts the cargo request and the vehicle request corresponding to the selected time period specified by the cargo request or the vehicle request among the cargo request and the vehicle request for which matching has not been established. Perform time condition matching to extract requests.

After that, the extraction unit 17a selects one item from the items defined as the type of package. Here, since the cargo request and the vehicle request include those for which no item is specified, all items are selected from the aspect of matching the cargo request and the vehicle request for which no item is specified. After that, no item designation shall be selected. Subsequently, the extraction unit 17a extracts the cargo request and the vehicle request for which the item specified in the cargo request or the vehicle request matches the selected item among the cargo request and the vehicle request extracted by the matching of the time condition. Perform matching of luggage conditions to extract vehicle request. Note that the extracting unit 17a performs matching of cargo conditions for extracting the cargo request and the vehicle request, assuming that the cargo request without item designation and the vehicle request without item designation match the items.

Furthermore, the extraction unit 17a selects one pair of the area of the origin O and the area of the end point D. Hereinafter, the pair of the starting point O area and the ending point D may be referred to as an "OD pair". Subsequently, the extracting unit 17a extracts cargo request requests and vehicle request requests that are extracted by matching the cargo conditions, and the OD pair specified in the cargo request request or the vehicle request request matches the selected OD pair. Perform a first location condition matching to extract the request and the car request.

After that, the extraction unit 17a performs matching of the price condition and the second location condition. That is, the extracting unit 17a extracts, for each vehicle request extracted by matching the first location condition, the upper limit fare including the fee, which is obtained by discounting the fee for the matching service from the upper fare limit specified in the vehicle request. Calculate the value. Then, the extracting unit 17a selects the vehicle request request with the highest upper limit of the fare including the handling charge among the vehicle request requests extracted by the matching of the first location condition.

After that, the extracting unit 17a extracts cargo request requests in which the unloading place where the vehicle is scheduled to be available specified in the currently selected vehicle request request is within the cargo request range, among the cargo request requests extracted by the matching of the first location condition. Perform a second location condition matching that extracts .

FIG. 7 is a diagram showing an example of matching of the second location condition. In the example of FIG. 7, if the number of entries to the matching service of B1 is greater than the number of entries to the matching service of B2, that is, under the condition that the number of entries of B1 > the number of entries of B2, B1 and that of Otsu 2 are calculated. Furthermore, in the example of FIG. 7, both the outbound travel times specified in the currency demand request of Otsu 1 and the currency demand request of Otsu 2 are equal to or greater than the above threshold value Th1, and movement is permitted based on the above first rule. Time shall be set. Furthermore, in the example of FIG. 7, the number of entries to the matching service of B1 corresponds to a travel allowance of 5 hours, while the number of entries to the matching service of B2 corresponds to a travel allowance of 1 hour. .

As shown in FIG. 7, a range larger than that of Otsu 2, whose number of entries is smaller than that of Otsu 1, is set to Otsu 1's currency requesting range. On the other hand, in the coin requesting range of Exhibit Otsu 2, a range smaller than that of Exhibit Otsu 1, which has a higher number of entries than that of Exhibit Otsu 2, is set. In this case, the loading port of A2 specified in the vehicle request of A2 is also included in the cargo request range of B1 and the cargo request range of B2. On the other hand, A1's loading port specified in A1's car request request is only included in B1's cargo request range. For this reason, the travel time of 2h from the outbound unloading place of Otsu 1 to the loading place of A2 is longer than the travel time of 1h from the outbound unloading place of Otsu 2 to the loading place of A2. It is conceivable that the cargo request will miss the matching contract with the vehicle request of A2. Even in this case, there is no other matching partner for the car request of A1. In this way, Otsu 1 has more entries than Otsu 2, and as a result, the chances of matching with the car request of A 1 increase, and as a result, there is a possibility that the cargo request of Otsu 1 will be matched. is rising.

After the matching of the second location condition is executed in this way, the extracting unit 17a extracts, for each cargo request extracted by the matching of the second location condition, the fare unit price specified in the cargo request, Based on the actual vehicle section of A's loading area and A's unloading area specified in the vehicle request request, the lower limit of the fare including the fee is calculated with the above-mentioned matching service fee increased. Then, the extracting unit 17a determines that the lower limit value of the fare including the charge among the coin request requests extracted by matching the second location condition is equal to or less than the upper limit value of the fare including the charge, and Perform price term matching to extract the claim request with the highest .

By matching such price conditions, it is possible to increase the possibility that B's currency request will be successfully matched, and increase the possibility that B's currency request will be matched with a high-price vehicle request.

FIG. 8 is a diagram showing an example of price condition matching. Here, in the example shown in FIG. 8, the time condition, luggage condition, first place condition and second place condition are changed between the vehicle request requests of A1 to A3 and the cargo request requests of B1 to B4. All shall conform.

The upper part of FIG. 8 shows the upper limit of fares including fees for A1 to A3, and the lower limit of fares including fees for Otsu 1 to Otsu 4. In this case, a matching partner is extracted preferentially from the car request request of A2, which has the highest fare upper limit value including the fee. The upper limit of the fare including the handling fee of A2 is higher than the lower limit of the fare including the handling charge of Otsu 1 to Otsu 4. Therefore, the car request request of A2 can be matched with any of the freight request requests of B1 to B4, but the freight request request of B1, which has the highest lower fare limit, is extracted. Subsequently, the matching partner of the vehicle request of A1, which has the highest upper limit value of the fare including the handling fee after the vehicle request of A2, is extracted. In this case, the lower limit of the fare including the fee of the third party and the fourth party is the lower limit of the fare including the handling charge of the third party and the fourth party. On the other hand, since the lower limit of the fare including the commission of Otsu 2 exceeds the upper limit of the fare including the commission of A 1, the freight request of Otsu 2 is not matched with the vehicle request of A 1. In addition, regarding the lower limit of the fare including the commission of the third party and the fourth party, the lower limit of the fare including the handling charge of the third party is closer to the upper limit of the fare including the handling fee of the first. Therefore, Otsu No. 3's cargo request is extracted as a matching partner for A's car request request. Finally, the matching partner of the vehicle request of A3, which has the highest upper limit value of the fare including the fee after the vehicle request of A1, is extracted. In this case, only the lower limit of the fare including the handling charge of the 4th Party is equal to or lower than the upper limit of the fare including the handling charge of the 3rd Party. On the other hand, since the lower limit of the fare including the handling charge of Otsu 2 exceeds the upper limit of the fare including the handling charge of A3, the freight request of Otsu 2 is also excluded from the matching partner of the vehicle request of A3. Therefore, Otsu 4's cargo request is extracted as a matching partner for A 3's vehicle request. As a result of the above, as shown in the lower part of Fig. 8, the matching of the freight request of Otsu 1 and the vehicle request of A 2 is established, and the matching of the freight request of Otsu 3 and the vehicle request of A 1 is established. Furthermore, the matching between Otsu 4's freight demand request and A 3's vehicle demand request is established. Therefore, it is possible to increase the possibility that B's currency request will be successfully matched, and increase the possibility that B's currency request will be matched with a high-price vehicle request.

Returning to the description of FIG. 5, the excluding unit 17b is a processing unit that excludes, among the monetary requests extracted by the extracting unit 17a, the monetary request whose labor record exceeds the labor standard from the matching partners of the vehicle request.

As an embodiment, when the extraction unit 17a extracts a currency demand request by matching price conditions, the excluding unit 17b selects B, which is the issuer of the currency demand request, from among the operation plans included in the operation plan information 13a. Refer to the operation plan of After that, the excluding unit 17b adds the actual vehicle section of the loading and unloading points specified in the vehicle request of A, who is the matching partner of B, to the return route of the operation plan of B. Then, the excluding unit 17b calculates the operation route of the return trip and the required time of the operation route based on the operation plan in which the actual vehicle section of the matching partner is added to the return trip. Hereinafter, the time required for the return route may be referred to as "return route operation time".

The operation route of this return trip and the time required for the operation route can be calculated as follows. For example, the exclusion unit 17b uses the above travel data to calculate an operating route that satisfies specified conditions.

For example, the exclusion unit 17b refers to travel data for a predetermined period of time in the past, for example, six months, departs or passes through the area around the outbound unloading point as the departure point, and the loading and unloading points of A as the relay point. Search for a route that passes through and arrives at or passes through Party B's vehicle registration as the destination. Then, the excluding unit 17b clusters the same routes out of the routes retrieved from the travel data, and counts the number of times the route has been traveled for each of the same routes. After that, the excluding unit 17b extracts a route for which the number of times of travel is equal to or greater than a predetermined threshold value as a candidate for the operation route of the return route.

Further, the excluding unit 17b uses the above-described probe data to calculate the return travel time for each return travel route candidate. Here, the probe data described above is obtained by collecting travel data while the vehicle travels and analyzing the data. Here, a commercial freight vehicle that must be equipped with a digital tachograph is taken as an example, but travel data collected from any vehicle equipped with a traffic monitoring device similar to a digital tachograph, that is, automobiles in general, can also be used. More specifically, travel data in which time, position, speed, distance, etc. are associated with each individual number that identifies an individual digital tachograph is collected to the platform via a mobile network or the like. Between the travel data collected for each digital tachograph in this way, the road is divided by a predetermined unit, such as 50 m, and the time is divided by a predetermined unit, such as hour, minute, or second. For each time segment, the platform executes statistical processing to tally the traffic volume and travel time of vehicles traveling in that road segment in that time segment. At this time, the platform can also identify the vehicle type, for example, super-large, large, general, etc., from the individual number of the digital tachograph, etc., and aggregate the traffic volume of each vehicle type. In addition, the platform can aggregate vehicle traffic and travel time by direction of travel. As a result, probe data is obtained in which vehicle travel amounts by vehicle type and traveling direction are associated with each road section and time section.

For example, the excluding unit 17b calculates the return travel time by accumulating the travel time in each road section from the departure point to the destination of the candidate return travel route. When accumulating the travel time in this way, the required travel time can be calculated with high accuracy by using the travel time corresponding to the day of the week and the time zone in which the road section is traveled. can do. Then, the excluding unit 17b extracts the candidate with the shortest return travel time from among the candidates for the return travel route as the return travel route. As a result, it is possible to calculate the operation route and return trip operation time of the operation plan for the return trip to which the matching operation is added.

After that, the excluding unit 17b calculates the continuous work hours and the continuous operation hours from the return trip operation time of the return trip operation plan to which the matching operation is added. For example, the excluding unit 17b can calculate the continuous working hours by totaling the outbound operation time calculated when the operation plan is formulated and the return operation time in the return operation plan to which the matching operation is added. In addition, the exclusion unit 17b extracts a continuous operation section that does not include a rest point or a reservation for a berth where loading or unloading is performed from the return trip operation route, and then extracts the continuous operation section from the return trip operation time. The corresponding partial return trip operation time is calculated as the continuous operation time. After that, the excluding unit 17b makes a request for continuous work exceeding a predetermined threshold Th2, for example, 13 hours, or a request for continuous work exceeding a predetermined threshold Th3, for example, 4 hours, in the operation plan for the return trip to which the matching operation is added. Excluding cargo requests exceeding the vehicle request from the matching partner of the vehicle request.

FIG. 9 is a diagram showing an example of a method for excluding coin request requests. In the example of FIG. 6, the vehicle operation plan is from departure point A via berth B and berth C to the vehicle registration area. Bookings for berth B and berth C are specified at 13:00 and 15:00 respectively. Note that berth B does not use a berth reservation system for berth reservation registration management, and berth C uses a berth reservation system. In the conventional operation plan, the reliability of the predicted arrival dates and times for berths B and C is low, so the vehicle needs to leave the departure point A at 8:30 with plenty of time to spare. On the other hand, in the operation plan formulated by the operation management system 30, the reliability of the predicted arrival dates and times at berths B and C is high, so the travel time from departure point A to berth B is 210 minutes. , the departure for departure point A can be set to 9:00. In this way, the operation management system 30 can formulate an accurate operation plan, and can reduce the useless restraint time of the crew.

Suppose that the following car request request is established as a matching partner while the car is on its way to berth C after departing from berth B. For example, it is assumed that the vehicle request is to load (apple) at berth X at 16:00 and arrive at berth Y at 17:00. In this case, the operation management system 30 determines that the vehicle becomes empty when the unloading work at berth C is completed based on the current location of the vehicle and the operation plan. Berth C uses a berth reservation system, so it is assumed that accurate cargo handling times can be provided. In addition, it can be said that the current location here is the starting point of the outward route.

Here, it is assumed that there is a delay in work in berth B and that a waiting state occurs before berth B. In conjunction with this, it is assumed that the start of the unloading work at berth B was delayed from 13:30. In conjunction with this, suppose that the operation plan formulated by the operation management system 30 was scheduled to depart from Berth B at 14:00, but the departure is delayed by 30 minutes at 14:30. In this case, the operation management system 30 implements an operation plan that corrects the scheduled arrival time of berth C to 15:30 by monitoring the departure of berth B delayed by 30 minutes through the operation plan change support service. can be done. By correcting the operation plan in this way, it is possible to review the time based on the progress of the operation.

On the other hand, it is assumed that there will be no delay in the work at Berth B, and that Berth C can depart at the scheduled 15:30. In this case, the matching device 10 is based on the operation plan to which the matching operation specified in the cargo demand request "loading (apple) at berth X at 16:00 and arriving at berth Y at 17:00" is added. to calculate continuous operating hours and continuous working hours. Then, as shown in compliance (labor standard 1), if the continuous driving time of the operation plan with matching operation added exceeds the threshold set by the labor standard, for example, 5 hours, it is excluded from the matching partner of the car request request. . In addition, as shown in compliance (labor standard 2), even if the continuous working time of the operation plan to which the matching operation is added exceeds the threshold set by the labor standard, for example, 13 hours, it will be excluded from the matching partner of the vehicle request request. be. Through these measures, the safety of transportation can be improved, and the risk of violating compliance in terms of labor standards can be suppressed.

In addition, in the above matching operation "Loading (Ringo) at berth X at 16:00, arriving at berth Y at 17:00", it is assumed that the section from berth X to berth Y is 30 minutes, This is not necessarily the specification of conditions in accordance with the Road Traffic Act. Therefore, the matching device 10 determines that the actual travel time between berth X and berth Y specified in the vehicle request request is the distance of the roads included in the operation route of berth X and berth Y and the speed limit set for each road. If it is shorter than the minimum required time obtained from the upper limit of , the actual vehicle time longer than the minimum required time, such as 60 minutes as the required time calculated using the above travel data, is reset to the shipper side system 50 Notice.

The association unit 17c is a processing unit that associates a cargo request and a vehicle request.

As one aspect, the associating unit 17c selects, among the currency requesting requests extracted by the extracting unit 17a through price condition matching, the currency requesting requests that are not excluded as matching partners by the excluding unit 17b, and which are extracted by the extracting unit 17a based on the price conditions. Associate with a car request extracted by matching. This association results in successful matching of freight and vehicle requests. When the matching is successful in this manner, the association unit 17c notifies the operation management system 30 of the vehicle request successfully matched with the freight request or of the issuer of the vehicle request. In addition, the association unit 17c notifies the shipper-side system 50 of the cargo request that has been successfully matched with the vehicle request, or of the issuer of the cargo request. After that, when both Party A and Party B confirm that the contract is OK, the matching is concluded.

[Process flow]
10 to 12 are flowcharts (1) to (3) showing the procedure of matching processing according to the first embodiment. This matching process is, for example, repeatedly performed at predetermined intervals, such as every 10 minutes, 30 minutes, or every hour.

As shown in FIG. 10, the extraction unit 17a selects one unmatched coin request from among the coin request contained in the coin request information 13b (step S101). Subsequently, the extracting unit 17a refers to the operation plan corresponding to the currency demand request selected in step S101 among the operation plan information 13a, and calculates the outbound travel time (step S102).

After that, the extraction unit 17a determines whether or not the outbound travel time calculated in step S102 is a predetermined threshold value Th1, for example, 5 hours or more (step S103). At this time, if the outbound route operation time is equal to or greater than the threshold Th1 (Yes in step S103), the extracting unit 17a refers to the first rule to determine the currency demand range from the cumulative number of entries of B, who is the issuer of the currency demand request. Calculate (step S104).

On the other hand, if the outbound travel time is not equal to or greater than the threshold Th1 (step S103 No), the extracting unit 17a refers to the second rule and calculates the currency demand range from the total number of entries of B, who is the issuer of the currency demand request. (Step S105).

After that, the processing from step S101 to step S105 is repeatedly executed until all coin request requests for which matching is not established are selected (step S106 No). Then, when all coin request requests for which matching has not been established have been selected (step S106 Yes), the process proceeds to step S107.

Subsequently, the extracting unit 17a selects one time zone in order from the current time, that is, the time zone closest to the execution time of matching (step S107). After that, the extracting unit 17a extracts the cargo request and the vehicle request corresponding to the time period specified in the cargo request or vehicle request in step S107, among the cargo request and vehicle request for which matching is not established. A vehicle request is extracted (step S108).

Then, the extraction unit 17a selects one item from the items defined as the type of package (step S109). Subsequently, the extracting unit 17a extracts a cargo request that matches the item selected in step S109 from among the cargo request and vehicle request extracted in step S108. and extract a vehicle request (step S110).

Furthermore, the extraction unit 17a selects one pair of the area of the origin O and the area of the end point D (step S111). Subsequently, the extraction unit 17a extracts a request in which the OD pair specified in the cargo request or vehicle request, among the cargo request and vehicle request extracted in step S110, matches the OD pair selected in step S111. A freight request and a vehicle request are extracted (step S112).

After that, as shown in FIG. 11, the extracting unit 17a extracts, for each vehicle request extracted in step S112, a fare including the matching service fee discounted from the fare upper limit specified in the vehicle request. A fare upper limit is calculated (step S113). Subsequently, the extracting unit 17a selects the vehicle request request with the highest upper limit of the fare including the handling charge among the vehicle request requests extracted in step S112 (step S114).

After that, the extraction unit 17a extracts cargo request requests extracted in step S112 where the unloading place where the vehicle is scheduled to be vacant and specified in the vehicle request request selected in step S114 is within the cargo request range. is extracted (step S115).

After that, for each cargo request extracted in step S115, the extracting unit 17a extracts the fare unit price specified in the cargo request, the actual vehicle at the loading location and the unloading location specified in the vehicle request. The lower limit of the fare including the fee for the matching service is calculated based on the section (step S116).

Then, the extracting unit 17a finds that the lower limit value of the fare including the handling fee is equal to or less than the upper limit value of the fare including the handling fee among the fare requesting requests extracted in step S115, and that the lower limit value of the fare including the handling fee is the highest among them. A currency request is extracted (step S117).

After that, the exclusion unit 17b refers to the operation plan of B, which is the issuer of the currency demand request extracted in step S117, among the operation plans included in the operation plan information 13a, and determines the return route of the operation plan of B. Add the actual vehicle section of the loading and unloading points specified in the vehicle request of Party A, who is the matching partner of Party B. After that, the excluding unit 17b calculates the required time for the operation route of the return trip as the return trip travel time based on the operation plan in which the actual vehicle section of the matching partner is added to the return trip (step S118).

Then, the excluding unit 17b determines that the continuous working time obtained from the return trip operation time calculated in step S118 and the outbound trip operation time calculated at the time of formulating the operation plan is within a threshold Th2 defined by the labor standard, for example, 13 hours. It is determined whether or not there is (step S119).

At this time, if the continuous work time is within the threshold value Th2 (step S119 Yes), the excluding unit 17b determines that rest points and loading or unloading are performed on the return route operation route out of the return route operation time calculated in step S118. It is determined whether or not the continuous operation time corresponding to the section in which the train is continuously operated without including the reservation of the berth to be used is within the threshold value Th3 defined by the labor standard, for example, 5 hours (step S120).

Here, if the continuous working time exceeds the threshold Th2, or if the continuous operating time exceeds the threshold Th3 (No in step S119 or step S120), the excluding unit 17b selects the currency request extracted in step S117 in step S114. excluded from the matching partner of the received car request request (step S121). In this case, from among the currency requesting requests extracted in step S115, the currency requesting request having the highest lower limit fare including the handling charge next to the currency requesting request excluded in step S121 is re-extracted (step S117), and the subsequent processing is performed. repeat.

Further, when the continuous work time is within the threshold Th2 and the continuous driving time is within the threshold Th3 (Yes in step S119 and Yes in step S120), the associating unit 17c extracts the vehicle request selected in step S114 and the vehicle request selected in step S117. associated with the received coin request (step S122). This association results in successful matching of freight and vehicle requests. In this case, it is also possible to notify the issuer of the cargo request and the issuer of the vehicle request that the matching is established.

After that, if all the vehicle request requests extracted in step S112 have not been selected (step S123 No), if there are any cargo request requests for which matching has not been established among the cargo request requests extracted in step S112 ( Step S124 Yes), the processing from step S114 to step S122 is repeatedly executed.

If all vehicle request requests extracted in step S112 are selected, or if there is no cargo request for which matching is not established among the cargo request requests extracted in step S112 (step S123 Yes or step S124 No), the process proceeds to step S125 shown in FIG.

After that, as illustrated in FIG. 12, the extraction unit 17a determines whether or not all combinations of OD pairs have been selected (step S125). At this time, if all combinations of OD pairs have not been selected (No at step S125), the above steps S111 to S124 are repeated. Then, when all combinations of OD pairs have been selected (step S125 Yes), the extraction unit 17a determines whether or not all package types have been selected (step S126).

At this time, if all the types of packages have not been selected (No at step S126), the processes from step S109 to step S125 are repeated. After that, when all types of packages have been selected (step S126 Yes), the extraction unit 17a determines whether or not all time periods have been selected (step S127).

Then, if all the time periods have not been selected (No at step S127), the processes from step S107 to step S126 are repeated. Then, when all the time periods have been selected (step S127 Yes), the process ends.

[One aspect of the effect]
As described above, the matching device 10 according to the present embodiment extracts the cargo request by matching using the distance between the unloading location specified in the cargo request and the loading location specified in the vehicle request. set the range of distances to be used according to the number of entries to the matching service. In this way, the number of matching opportunities changes according to the number of entries to the matching service described above, so it is possible to provide incentives for Party B's participation in the matching service, and as a result, increase the motivation for Party B to participate in the matching service. be able to. Therefore, according to the matching device 10 according to the present embodiment, it is possible to promote the use of matching services.

[Another aspect of the effect]
In addition, the matching device 10 according to the present embodiment recalculates the required time when the matching operation is added to the operation plan corresponding to the currency demand request, and the labor performance based on the recalculated required time does not meet the labor standard. If it exceeds, the freight request is excluded from matching with the vehicle request. Therefore, according to the matching device 10 according to the present embodiment, it is possible to suppress the labor record of the vehicle driver from exceeding the labor standard due to the matching operation. As a result, the safety of transportation can be improved, and furthermore, the risk of violating compliance in terms of labor standards can be suppressed.

Although embodiments of the disclosed apparatus have been described so far, the present invention may be embodied in various forms other than the embodiments described above. Therefore, other embodiments included in the present invention will be described below.

[Fees to Party A]
The matching device 10 can also give an incentive to A's participation in the matching service by discounting the matching service commission that C imposes on A.

FIG. 13 is a diagram showing an example of master data. As shown in FIG. 13, for the master data of Party A, for example, data in which items such as shipper basic information, participating OD pairs, and package attributes are associated can be adopted. The "shipper basic information" referred to here refers to basic information about the shipper. included. For example, the shipper code corresponds to an example of shipper identification information, and can be generated according to a predetermined code, for example, alphabetic characters, numbers, and combinations thereof. In addition, the "total number of entries" refers to the cumulative number of times that Party A has participated in the above matching service. In addition, "cumulative number of contracts" refers to the cumulative value of the number of times Party A has contracted transportation transactions through the above-mentioned matching service. be able to. In addition, "total number of luggage types specified" refers to the cumulative value of the number of times Party A specified the type of luggage in the vehicle request. be able to. In addition, "the number of times of running away" refers to the number of times that Party A has run away by conducting direct transactions with Party B without performing the above matching service. For example, every time a predetermined cycle, for example, one month elapses, it is determined whether or not the cumulative number of entries for the previous month is less than the cumulative number of entries for the month before last. On top of that, when the cumulative number of entries in the previous month is less than the cumulative number of entries in the month before last, the number of rushes is incremented by one. Further, the "latest breakout date" refers to the date and time when the latest breakthrough was performed. For example, the point in time when the breakthrough count was last incremented can be registered as the latest breakthrough date.

In addition, "participating OD pair" refers to an OD pair used as a typical pattern when Party A participates in the above matching service. "Package attribute" refers to attribute information of a package, and further includes items such as items, details, weight, volume, and packing style, for example. Among these, "items" refer to categories in which types of packages are classified. Further, "details" refer to categories in which items are classified in more detail. In addition, "weight" refers to the weight of the package that Party A asks Party B to transport. In addition, "capacity" refers to the volume of the cargo that Party A asks Party B to transport. The term "packing style" refers to the external appearance of a package, and corresponds to, for example, packaging forms such as pallets, skids, cases, and cartons.

Under such a situation where the master data is registered, for example, the matching device 10, at the stage where the upper limit of the fare including the handling fee of Party A is calculated in step S113 shown in FIG. You can discount the fees that Hei imposes on A. In addition, the matching device 10 can discount the fee that C imposes on A in accordance with the total number of specified baggage types during the entire period at the stage where the upper limit of the fare including the fee is calculated for A in step S113 shown in FIG. can. Either one or both of the fee discounts according to the total number of contracted contracts for the entire period and the total number of designated parcel types for the entire period can be applied.

Below, as an example, Hei imposes a matching service fee on Party A's lower fare limit. 1 fee rate", and the fee rate based on the total number of designated parcel types for the entire period may be referred to as the "second fee rate".

FIG. 14A is a diagram showing an example of the correspondence relationship between the first commission rate and the cumulative contract count. The vertical axis of the graph shown in FIG. 14A indicates the commission rate of the matching service charged to Party A, and the horizontal axis of the graph indicates the cumulative number of contracts. As shown in FIG. 14A, the first commission rate is set to a lower value as the cumulative contract count increases. More specifically, the first commission rate is set at a maximum of 3.0% and a minimum of 1.8%. That is, when the cumulative number of contracts is 10 or less, the first commission rate is 3.0%, but when the cumulative number of contracts reaches 100, the first commission rate is up to 1.8%. discounted.

FIG. 14B is a diagram showing an example of the correspondence relationship between the second fee rate and the cumulative number of specified parcel types. The vertical axis of the graph shown in FIG. 14B indicates the commission rate of the matching service, and the horizontal axis of the graph indicates the ratio (%) of the cumulative number of specified package types to the cumulative number of contracts, that is, the cumulative number of specified package types/cumulative contracts. Refers to the number of times x 100. As shown in FIG. 14B, the second commission rate is set to a lower value as the ratio (%) of the cumulative number of specified parcel types to the cumulative number of contracts increases. More specifically, the second commission rate has a maximum of +2.0% and a minimum of -0.3. That is, when the ratio (%) of the cumulative number of specified parcel types to the cumulative number of contracts is 20% or less, the second commission rate is added by 2.0%. For example, if the total number of times Party A designates the type of cargo is less than 20% of the total number of times Party A concludes transportation transactions through the matching service, 2.0% will be added as a penalty. means that Furthermore, if the total number of times Party A designates the type of cargo reaches 30% of the number of times Party A concludes transportation transactions through the matching service, the penalty becomes 0%. In addition, when the cumulative number of times Party A designates the type of cargo reaches 100% of the number of times Party A concludes transportation transactions through the matching service, the discount rate will be 1.8%. .

FIG. 15 is a flowchart illustrating the procedure of commission calculation processing according to the second embodiment. This process can be repeatedly executed at a predetermined cycle, for example, once a week, every other week, every month, every other month, or the like. As shown in FIG. 15, the matching device 10 selects one shipper code from among the shipper codes contained in the master data of A (step S301).

Then, the matching device 10 determines whether or not the cumulative number of contracts in the previous month for Party A having the shipper code selected in step S301 is less than the cumulative number of contracts in the month before last, that is, the cumulative number of contracts in the previous month<the cumulative number of contracts in the month before last. It is determined whether or not (step S302).

Here, if the cumulative number of executions in the previous month < the cumulative number of executions in the month before last (Yes in step S302), there is a possibility that the total number of executions in the previous month is less than the total number of executions in the month before last, and this is directly being traded. It is presumed that the instep ran away. In this case, the matching device 10 initializes the total number of contracts for the entire period to a predetermined initial value, for example zero (step S303).

In addition, when the cumulative number of contracts in the previous month<the cumulative number of contracts in the month before last (step S302, No), the matching device 10 skips the process of step S303 and proceeds to the process of step S304.

After that, the matching device 10 calculates the first commission rate from the total number of contracts for the entire period (step S304). Furthermore, the matching device 10 calculates a second commission rate from the ratio of the total number of specified parcel types over the entire period to the total number of contracts over the entire period (step S305). Then, as an example, matching device 10 calculates the first commission rate and the second commission rate by adding the first commission rate calculated in step S304 and the second commission rate calculated in step S305. A total commission rate is calculated by integrating the commission rates (step S306).

Then, the processes from step S301 to step S306 are repeatedly executed until all shipper codes included in the master data of A are selected (step S307 No). After that, when all shipper codes included in the master data of Party A have been selected (step S307 Yes), the process is terminated.

Using the total commission rate calculated in this way, the matching device 10 can calculate the upper limit of the fare including the commission of Party A. For example, in the process of step S113 shown in FIG. value can be calculated.

Party A's upper limit of fare including handling fee = upper limit of fare specified by Party A x (1 - overall commission rate) (1)

In the example of the first commission rate shown in FIG. 14A and the second commission rate shown in FIG. Calculated. In this way, the commission can be discounted as the cumulative number of contracts increases, so it is possible to give an incentive to participate in Party A's matching service. Furthermore, since the handling fee can be discounted as the cumulative number of designated parcel types increases, incentives can be given to entry of parcel items. This makes it possible to improve the collection efficiency of statistical data on parcel items and promote the secondary use of the statistical data.

Although the example in which the total specified number of package types is incremented by one when the item of the package is specified is given here, the method for counting the cumulative number of specified package types is not limited to this. For example, the total specified number of package types may be incremented by 1 only after the details of the package are entered, or when the details are specified in addition to the specification of the items of the package, the cumulative number of specified package types is further added. may be incremented by . As a result, it is possible to improve the collection efficiency of the statistical data of parcel details and promote the secondary use of the statistical data.

[Bee's fee]
In the above example 1, as an incentive for participation in the matching service that He gives to Party B, an example of changing the currency claim range according to the cumulative number of entries was given, but it is also possible to give Party B other incentives. do not have. For example, the matching device 10 may discount the matching service commission that C imposes on B.

FIG. 16 is a diagram showing an example of master data. As shown in FIG. 16, data in which items such as business operator basic information, time zone distribution designation, participating OD pairs, and parcel attributes are associated can be adopted as B's master data, for example. The "business operator basic information" referred to here refers to basic information about the transportation business, and further includes details such as business operator code, credit information, total number of entries, number of times of rushing, and date of latest rushing. For example, "business operator code" corresponds to an example of identification information of a transportation business operator, and can be generated according to a predetermined code, for example, alphabetic characters, numbers, and combinations thereof. In addition, "credit information" refers to the credit information of B's C, for example, B's payment status for the above-mentioned matching service, such as late payment history. In addition, the "cumulative number of entries" refers to the cumulative number of times B has participated in the above matching service. In addition, "the number of times of running away" refers to the number of times that Party B has run away by directly trading with Party A without performing the above matching service. For example, every time a predetermined cycle, for example, one month elapses, it is determined whether or not the cumulative number of entries for the previous month is less than the cumulative number of entries for the month before last. On top of that, when the cumulative number of entries in the previous month is less than the cumulative number of entries in the month before last, the number of rushes is incremented by one. Further, the "latest breakout date" refers to the date and time when the latest breakthrough was performed. For example, the point in time when the breakthrough count was last incremented can be registered as the latest breakthrough date.

In addition, "participating OD pair" refers to an OD pair used as a typical pattern when B participates in the above matching service. "Package attribute" refers to attribute information of a package, and further includes items such as items, details, weight, volume, and packing style, for example. Among these, "items" refer to categories in which types of packages are classified. Further, "details" refer to categories in which items are classified in more detail. In addition, "weight" refers to the weight of the package that Party A asks Party B to transport. In addition, "capacity" refers to the volume of the cargo that Party A asks Party B to transport. The term "packing style" refers to the external appearance of a package, and corresponds to, for example, packaging forms such as pallets, skids, cases, and cartons.

Here, the term “time zone distribution specification of lower limit value” refers to an item for specifying the lower limit value of fares distributed over a plurality of time zones. That is, in the above-described first embodiment, the example in which one time zone is specified in one claim request was given, but a plurality of time zones may be specified in one claim request. . At this time, the same lower limit value of fares may not necessarily be designated for a plurality of time periods.

For example, from the perspective of realizing a flexible price limit, the lower the fare limit is lowered during times when the motivation for transportation transactions is high for Party B, and the lower limit for freight charges is raised during times when the motivation for transportation transactions is low for Party B. settings. In other words, when the time period in which Party B wishes to conduct a transportation transaction in a cargo request is from yy time on the xx day to yy+n time on the xx day, and the lower limit of the fare in that time period is set to "100%", 5 before and after including the time period For example, "yy-3n hour to yy-2n hour", "yy-2n hour to yy-n hour", "yy-n hour to yy hour", "yy+n hour to yy+2n" Accept ratio settings.

In the example shown in FIG. 16, a blank is set in the time period “yy-3n hour to yy-2n hour”, and the ratio “80%” is set in the time period “yy-2n hour to yy-n hour”. A ratio of “90%” is set for the time period “yy−n hour to yy hour”, and a ratio “70%” is set for the time period “yy+n hour to yy+2n”. In this case, the limit price is as shown in FIG. FIG. 17 is a diagram showing an example of time zone distribution specification. As shown in Fig. 17, according to the time zone distribution specification set in the master data shown in Fig. 16, when B specifies the time zone and fare unit price in the cargo demand request, the following bids are possible. be. For example, no bids are made during the time period "yy-3n o'clock to yy-2n o'clock", and no matching is performed in this time period. Next, in the time period "yy-2n o'clock to yy-n o'clock", participants participate in matching with an offer price of 80% of the lower limit of the fare determined individually for each car request from the fare unit price. Next, in the time period "yy-n hour to yy hour", you participate in the matching with an offer price that is 90% of the lower limit of the fare determined individually for each car request from Party A from the fare unit price. Next, in the time period "yy+n o'clock to yy+2n", participants participate in matching with an offer price that is 70% of the lower limit of the fare that is determined individually for each car request request of Party A from the fare unit price. Here, as an example, an example in which a ratio of 100% or less is set is given, but it goes without saying that a ratio exceeding 100% may be set in the time zone distribution specification. .

Under such a situation where the master data is registered, for example, the matching device 10, at the stage where the lower limit of the fare including the handling fee is calculated in step S116 shown in FIG. You can discount the fees that Hei imposes on B.

FIG. 18 is a diagram showing an example of the correspondence relationship between the commission rate and the cumulative contract count. The vertical axis of the graph shown in FIG. 18 indicates the matching service commission rate charged to B, and the horizontal axis of the graph indicates the cumulative number of contracts. As shown in FIG. 18, the commission rate is set to a lower value as the cumulative contract count increases. More specifically, the commission rate is set at a maximum of 3.0% and a minimum of 1.5%. That is, the commission rate is 3.0% when the cumulative number of contracts is 3 or less, while the commission rate is discounted to 1.5% when the cumulative number of contracts reaches 20.

FIG. 19 is a flowchart illustrating the procedure of commission calculation processing according to the second embodiment. This process can be repeatedly executed at a predetermined cycle, for example, once a week, every other week, every month, every other month, or the like. As shown in FIG. 18, the matching device 10 selects one company code from among the company codes contained in B's master data (step S501).

Then, the matching device 10 determines whether or not the cumulative number of contracts in the previous month for B having the operator code selected in step S501 is less than the cumulative number of contracts in the month before last, i.e., the cumulative number of contracts in the previous month < the cumulative number of contracts in the month before last It is determined whether or not there is (step S502).

Here, if the total number of executions in the previous month < the total number of executions in the month before last (Yes in step S502), there is a possibility that the total number of executions in the previous month is less than the total number of executions in the month before last, and this is directly being traded. It is presumed that B ran out of the way. In this case, the matching device 10 initializes the total number of contracts for the entire period to a predetermined initial value, for example zero (step S503).

Further, if the cumulative number of contracts in the previous month is not less than the cumulative number of contracts in the month before last (step S502, No), the matching device 10 skips the process of step S503 and proceeds to the process of step S504.

After that, the matching device 10 calculates a commission rate from the cumulative number of contracts during the entire period (step S504). Then, the processes from step S501 to step S504 are repeatedly executed until all the company codes included in the master data of B are selected (step S505 No). After that, when all the company codes included in B's master data have been selected (step S505 Yes), the process is terminated.

Using the fare rate calculated in this way, the matching device 10 can calculate the upper limit of the fare including the commission for B. For example, in the processing of step S116 shown in FIG. It is possible to calculate the lower limit of the fare including the handling fee.

B's lower limit of fare including commission = Lower limit of fare specified by B x (1 + commission rate) (2)

Taking the example of the commission rate shown in FIG. 18, the commission rate is calculated in the numerical range of 1.5% to 3.0% by the above formula (2). In this way, the commission can be discounted as the cumulative number of contracts increases, so it is possible to give B a further incentive to participate in the matching service.

Here, when the upper limit of the fare specified by Party A is A, the upper limit of the fare including the handling charge of Party A is B, the lower limit of the fare including the handling charge of B is C, and the lower limit of the fare specified by B is D. , and these have the magnitude relationships of (3) and (4) below. Then, price matching is established when the following (5) is established. In this case, the fee for the matching service of C will be as shown in (6) below. If price matching is established with B>C, B's fare will increase to B by adding (BC) to C.

A>B (3)
C>D (4)
B≧C (5)
A-B+C-D (6)

Also, each component of each illustrated device may not necessarily be physically configured as illustrated. In other words, the specific form of distribution and integration of each device is not limited to the one shown in the figure, and all or part of them can be functionally or physically distributed and integrated in arbitrary units according to various loads and usage conditions. Can be integrated and configured. For example, the first reception unit 15a, the second reception unit 15b, or the matching processing unit 17 may be connected via a network as an external device of the matching device 10. FIG. In addition, different devices each have the first reception unit 15a, the second reception unit 15b, or the matching processing unit 17, and are connected to a network and cooperate with each other to realize the functions of the matching device 10 described above. good too. In addition, different devices each have all or part of the operation plan information 13a, the freight request information 13b, the entry information 13c, and the vehicle request information 13d stored in the storage unit 13, and are connected to a network and cooperate with each other. , the functions of the matching device 10 described above may be realized.

[Matching program]
Moreover, various processes described in the above embodiments can be realized by executing a prepared program on a computer such as a personal computer or a work station. Therefore, an example of a computer that executes a matching program having functions similar to those of the above embodiments will be described below with reference to FIG.

FIG. 20 is a diagram illustrating a hardware configuration example of a computer that executes matching programs according to the first and second embodiments. As shown in FIG. 20, the computer 100 has an operation section 110a, a speaker 110b, a camera 110c, a display 120, and a communication section . Furthermore, this computer 100 has a CPU 150 , a ROM 160 , an HDD 170 and a RAM 180 . Each part of these 110 to 180 is connected via a bus 140 .

As shown in FIG. 20, the HDD 170 stores a matching program 170a that exhibits the same functions as the first reception section 15a, the second reception section 15b, and the matching processing section 17 shown in the first embodiment. This matching program 170a may be integrated or separated, like each component of the first receiving section 15a, the second receiving section 15b, or the matching processing section 17 shown in FIG. That is, the HDD 170 does not necessarily store all the data shown in the first embodiment, and the HDD 170 only needs to store data used for processing.

Under such an environment, the CPU 150 reads the matching program 170 a from the HDD 170 and develops it in the RAM 180 . As a result, matching program 170a functions as matching process 180a, as shown in FIG. The matching process 180a expands various data read from the HDD 170 into an area assigned to the matching process 180a among the storage areas of the RAM 180, and executes various processes using the expanded various data. For example, examples of processing executed by the matching process 180a include processing shown in FIGS. 10 to 12, 15, and 19. FIG. Note that the CPU 150 does not necessarily have to operate all the processing units described in the first embodiment, as long as the processing units corresponding to the processes to be executed are virtually realized.

Note that the matching program 170a described above does not necessarily have to be stored in the HDD 170 or the ROM 160 from the beginning. For example, the matching program 170a is stored in a “portable physical medium” such as a flexible disk inserted into the computer 100, so-called FD, CD-ROM, DVD disk, magneto-optical disk, IC card, or the like. Then, the computer 100 may acquire and execute the matching program 170a from these portable physical media. Also, the matching program 170a is stored in another computer or server device connected to the computer 100 via a public line, the Internet, LAN, WAN, etc., and the computer 100 obtains and executes the matching program 170a from these. You may make it

In this embodiment, the case where the vehicle allocation plan for the return route has not yet been formulated has been described as an example. The matching system 1 is not limited to the present embodiment, but also for vehicles for which an outbound route allocation plan has not been formulated and vehicles for which a vehicle allocation plan for moving from the unloading area to the next loading area has not been formulated. It is possible to match requests. For example, in the initial operation plan, the vehicle departs from Toyama Prefecture, loads the shipper's cargo in Tokyo, and transports the cargo to Toyama Prefecture. In this operation plan, the vehicle moves from Toyama Prefecture, which is the departure point, to Tokyo while the vehicle is empty, resulting in waste. Regarding the movement from Toyama Prefecture to Tokyo by empty train in the above operation plan, if the matching system 1 can match the cargo transportation business that receives the cargo in Niigata Prefecture and unloads it in Tokyo, waste on the outward trip will be reduced. be able to.

When performing freight and vehicle request matching on an outbound route or an intermediate route, the matching system 1 calculates the travel time from the departure point registered in the initial operation plan to the loading port to be matched, and / or the initial It can be an incentive to extend the travel time from the loading port registered in the operation plan to the unloading port to be matched according to the number of entries of B.

For example, when the matching system 1 matches the outbound route from the departure point in the operation plan with an empty car to the first loading point, the conditions including the loading point, the loading time, the unloading place and the unloading time is specified, and a cargo request is accepted that specifies conditions including the departure place of the vehicle, the scheduled place where the vehicle will load the cargo, and the estimated time of arrival at the scheduled place. The matching system 1 performs matching between the departure location specified in the cargo request and the loading location specified in the vehicle request, or the scheduled location specified in the cargo request and the vehicle request. A range of distances and/or travel times from which the cargo request is extracted in matching between designated unloading points is set according to the number of entries to the matching.

For example, when the matching system 1 performs matching at an intermediate point in the operation plan, a vehicle request specifying conditions including a loading place, loading time, unloading place and unloading time, and a vehicle when the vehicle becomes empty A first scheduled place and a first scheduled time of arrival at the first scheduled place, and a second scheduled place where the vehicle is to be loaded after the first scheduled place, and where the vehicle is to be moved to after the first scheduled place. and a cargo claim request specifying conditions including a location and a second scheduled time of arrival at the second scheduled location. The matching system 1 performs matching between the first scheduled location specified in the cargo request and the loading location specified in the vehicle request, and/or the second destination specified in the cargo request. For matching between the scheduled location and the unloading location specified in the vehicle request, the range of distance and/or travel time from which the cargo request is extracted is set according to the number of entries to the matching.

The following notes are further disclosed with respect to the embodiments including the above examples.

(Appendix 1) A vehicle request specifying conditions including loading place, loading time, unloading place and unloading time, and specified conditions including the scheduled place where the vehicle will be empty and the estimated time of arrival at the said scheduled place accepts the requested claim request and
The range of distance and/or travel time from which the cargo request is extracted in the matching between the scheduled empty vehicle location specified in the cargo request and the loading location specified in the vehicle request is added to the matching. set according to the number of entries,
A matching program characterized by causing a computer to execute processing.

(Appendix 2) The matching program according to appendix 1, wherein a larger range is set for the range as the number of entries increases.

(Appendix 3) The matching program according to appendix 1, wherein the number of entries is reset when the number of entries per predetermined unit period decreases.

(Appendix 4) A vehicle request specifying conditions including loading place, loading time, loading place and unloading time, departure place of the vehicle, planned place where the vehicle will load the goods, and said planned place Accepts a request for a claim with specified conditions, including an estimated time of arrival at
Matching between the departure location specified in the cargo request and the loading location specified in the vehicle request, or the scheduled location specified in the cargo request and the discharge location specified in the vehicle request. setting a range of distances and/or travel times over which the claim request is extracted in a matching between according to the number of entries to the matching;
A matching program characterized by causing a computer to execute processing.

(Appendix 5) A vehicle request specifying conditions including a loading location, loading time, loading location and unloading time, 1 scheduled time and a second scheduled time of arrival at a second scheduled location where the vehicle is to load the cargo and the second scheduled location, which is a point to which the vehicle travels after the first scheduled location. Accepts a claim request with specified conditions including and
matching between a first scheduled location specified in the cargo request and a loading location specified in the vehicle request and/or a second scheduled location specified in the cargo request and the request; for matching between unloading points specified in car requests, setting the range of distances and/or travel times from which the cargo request is extracted according to the number of entries to the matching;
A matching program characterized by causing a computer to execute processing.

(Appendix 6) A vehicle request specifying conditions including the loading place, loading time, unloading place and unloading time, and conditions including the scheduled place where the vehicle will be empty and the estimated time of arrival at the said scheduled place are specified accepts the requested claim request and
The range of distance and/or travel time from which the cargo request is extracted in the matching between the scheduled empty vehicle location specified in the cargo request and the loading location specified in the vehicle request is added to the matching. set according to the number of entries,
A matching method characterized in that processing is executed by a computer.

(Appendix 7) The matching method according to appendix 6, wherein the range is set larger as the number of entries increases.

(Appendix 8) The matching method according to appendix 6, wherein the number of entries is reset when the number of entries per predetermined unit period decreases.

(Appendix 9) A vehicle request specifying conditions including a loading place, a loading time, an unloading place and an unloading time, a departure place of a vehicle, a scheduled place where the vehicle will load the cargo, and the said scheduled place Accepts a request for a claim with specified conditions, including an estimated time of arrival at
Matching between the departure location specified in the cargo request and the loading location specified in the vehicle request, or the scheduled location specified in the cargo request and the discharge location specified in the vehicle request. setting a range of distances and/or travel times over which the claim request is extracted in a matching between according to the number of entries to the matching;
A matching method characterized in that processing is executed by a computer.

(Appendix 10) A vehicle request specifying conditions including a loading place, a loading time, a loading place and an unloading time, a first scheduled place where the vehicle is empty, and a 1 scheduled time and a second scheduled time of arrival at a second scheduled location where the vehicle is to load the cargo and the second scheduled location, which is a point to which the vehicle travels after the first scheduled location. Accepts a claim request with specified conditions including and
matching between a first scheduled location specified in the cargo request and a loading location specified in the vehicle request and/or a second scheduled location specified in the cargo request and the request; for matching between unloading points specified in car requests, setting the range of distances and/or travel times from which the cargo request is extracted according to the number of entries to the matching;
A matching method characterized in that processing is executed by a computer.

(Appendix 11) A vehicle request specifying conditions including loading place, loading time, unloading place and unloading time, and specified conditions including the scheduled place where the vehicle will be empty and the estimated time of arrival at the said scheduled place a receiving unit that receives the requested currency request;
The range of distance and/or travel time from which the cargo request is extracted in the matching between the scheduled empty vehicle location specified in the cargo request and the loading location specified in the vehicle request is added to the matching. a setting unit for setting according to the number of entries;
A matching device comprising:

(Supplementary Note 12) The matching device according to Supplementary Note 11, wherein the range is set to a larger range as the number of entries increases.

(Supplementary note 13) The matching device according to Supplementary note 11, wherein the number of entries is reset when the number of entries per predetermined unit period decreases.

(Appendix 14) A vehicle request specifying conditions including a loading place, a loading time, an unloading place and an unloading time, a departure place of a vehicle, a planned place where the vehicle loads the goods, and the said planned place a reception unit that receives a cargo request specifying conditions including an estimated time of arrival at
Matching between the departure location specified in the cargo request and the loading location specified in the vehicle request, or the scheduled location specified in the cargo request and the discharge location specified in the vehicle request. a setting unit that sets a range of distance and/or travel time from which the currency request is extracted in matching between, according to the number of entries to the matching;
A matching device comprising:

(Appendix 15) A vehicle request specifying conditions including a loading place, a loading time, a loading place and an unloading time, 1 scheduled time and a second scheduled time of arrival at a second scheduled location where the vehicle is to load the cargo and the second scheduled location, which is a point to which the vehicle travels next to the first scheduled location. a receiving unit that receives a claim request specifying conditions including and;
matching between a first scheduled location specified in the cargo request and a loading location specified in the vehicle request and/or a second scheduled location specified in the cargo request and the request; a setting unit for setting a distance and/or travel time range from which the cargo request is extracted for matching between unloading points specified in the car request, according to the number of entries to the matching;
A matching device comprising:

1 matching system 10 matching device 11 communication I/F unit 13 storage unit 13a operation plan information 13b money request information 13c entry information 13d vehicle request information 15 control unit 15a first reception unit 15b second reception unit 17 matching processing unit 17a extraction unit 17b exclusion unit 17c association unit 30 operation management system 50A, 50B, 50C consignor side system

Claims (6)

A vehicle request specifying conditions including a loading location, loading time, unloading location, and unloading time, and a cargo request specifying conditions including a scheduled location at which a vehicle will become vacant and an estimated time of arrival at the scheduled location. accept requests and
The range of distance and/or travel time from which the cargo request is extracted in the matching between the scheduled empty vehicle location specified in the cargo request and the loading location specified in the vehicle request is added to the matching. Set to a larger range as the number of entries increases,
extracting the vehicle request and the cargo request matching the loading time and the estimated arrival time, and extracting the cargo request for which the loading area specified in the vehicle request is within the range for each vehicle request. to match the
A matching program characterized by causing a computer to execute processing. 2. The matching program according to claim 1, wherein said number of entries is reset when the number of entries per predetermined unit period decreases. a vehicle request specifying conditions including a loading location, a loading time, a loading location, and an unloading time; a vehicle departure location; a scheduled departure time from the departure location; , accepting a cargo demand request specifying conditions including the estimated time of arrival at the scheduled place;
Matching between the departure location specified in the cargo request and the loading location specified in the vehicle request, or the scheduled location specified in the cargo request and the discharge location specified in the vehicle request. setting a range of distance and/or travel time from which the claim request is extracted in matching between
extracting a vehicle request and a cargo request matching the loading time and the scheduled departure time, or a vehicle request and a cargo request request matching the unloading time and the scheduled arrival time, and extracting each vehicle request Matching a cargo request request in which the loading area specified in the vehicle request request is within the range, or a cargo request request in which the unloading area specified in the vehicle request request is within the range,
A matching program characterized by causing a computer to execute processing. A vehicle request specifying conditions including a loading location, a loading time, an unloading location, and an unloading time, and a first scheduled location at which the vehicle is vacant and a first scheduled arrival time at the first scheduled location. and a second scheduled location where the vehicle is to load the cargo, and a second scheduled time of arrival at the second scheduled location, which is a point to which the vehicle travels after the first scheduled location. Accepts requests with specified conditions,
matching between a first scheduled location specified in the cargo request and a loading location specified in the vehicle request and/or a second scheduled location specified in the cargo request and the request; for matching between unloading points specified in car requests, setting a range of distances and/or travel times from which the cargo request is extracted to a larger range as the number of entries to the matching increases;
extracting a vehicle request and a cargo request that match the loading time and the first scheduled time and/or a vehicle request and a cargo request that match the unloading time and the second scheduled time; , a cargo request in which the loading port specified in the vehicle request request is within the range, and/or a cargo request in which the unloading port specified in the vehicle request request is within the range. matching requests,
A matching program characterized by causing a computer to execute processing. A vehicle request specifying conditions including a loading location, loading time, unloading location, and unloading time, and a cargo request specifying conditions including a scheduled location at which a vehicle will become vacant and an estimated time of arrival at the scheduled location. accept requests and
The range of distance and/or travel time from which the cargo request is extracted in the matching between the scheduled empty vehicle location specified in the cargo request and the loading location specified in the vehicle request is added to the matching. Set to a larger range as the number of entries increases,
Extracting vehicle request and cargo request that match the loading time and the estimated arrival time, and cargo request for which the loading area specified in the vehicle request is within the range for each of the vehicle request. to match the
A matching method characterized in that processing is executed by a computer. A vehicle request specifying conditions including a loading location, loading time, unloading location, and unloading time, and a cargo request specifying conditions including a scheduled location at which a vehicle will become vacant and an estimated time of arrival at the scheduled location. a reception unit that receives requests;
The range of distance and/or travel time from which the cargo request is extracted in the matching between the scheduled empty vehicle location specified in the cargo request and the loading location specified in the vehicle request is added to the matching. a setting unit that sets a larger range as the number of entries increases;
Extracting vehicle request and cargo request that match the loading time and the estimated arrival time, and cargo request for which the loading area specified in the vehicle request is within the range for each of the vehicle request. a matching unit that matches
A matching device comprising:

Images