JP2023014739A - Transportation plan package generation method, transportation plan package generation system, matching method, matching system, program, and storage medium - Google Patents

Abstract

To reduce a burden on a transportation client and enable a transportation operator to accept an efficient and highly profitable plan.SOLUTION: A transportation plan package generation method of the present invention generates a package by selecting two or more transportation plans from a plurality of transportation plans so as not to exceed a preliminarily set upper limit operating time. A matching method of the present invention comprises a step of receiving an acceptance application from a business operator terminal with respect to the generated package. A program of the present invention causes a computer to function as a transportation plan package generation system of the present invention or a matching system of the present invention. A storage medium of the present invention has the program recorded therein and is computer-readable.SELECTED DRAWING: Figure 1

Description

The present invention relates to matching between a transportation client and a transportation company.

Conventionally, as a system for matching between a transportation requester and a transportation company, a system is known in which a person wishing to move (transportation requester) can collectively obtain quotations from multiple moving companies (transportation companies). (Patent Document 1).

JP 2015-210568 A

In the case of the system of Patent Literature 1, the transportation requester receives telephone calls and e-mails for quotations from nearly 10 transportation companies.

In addition, from the standpoint of a transportation company, it is necessary to undertake (accept) a project in the presence of multiple competitors, so there is no choice but to lower the price, and even if it is accepted, it is difficult to make a profit. In addition, since projects are entrusted according to the wishes of the operation client, the actual situation is that the transportation route is inefficient.

The present invention has been made in view of such circumstances, and the problem to be solved is a method of generating a transportation project package that reduces the burden on the transportation requester and enables the transportation company to accept the projects efficiently and with high profitability. , a transportation package generation system, a matching method, a matching system, a program and a storage medium.

[Method for creating a transportation item package]
A method of generating a transportation item package according to the present invention is a method of selecting two or more transportation items to generate a package. This is a method of generating a package by selecting two or more transportation cases so as not to exceed them.

[Transportation package generation system]
A transportation item package generation system of the present invention is a system for selecting two or more transportation items to generate a package, and comprises: A storage unit for storing the transportation items received by the reception unit, and two or more transportation items are selected and packaged from among the plurality of transportation items stored in the storage unit so as not to exceed a preset upper limit operating time. is provided with a package generator that generates

[Matching method]
The matching method of the present invention is a method of matching a transportation requester and a transportation company, wherein a requester terminal used by the transportation requester, a business operator terminal used by the transportation business operator, and a matching server are connected through a communication network. A method comprising the steps of: selecting two or more transportation matters and generating a package by said transportation matter package generating method; is.

[Matching system]
The matching system of the present invention is a system for matching a transportation requester and a transportation business, wherein a requester terminal used by the transportation requester, a business operator terminal used by the transportation business, and a matching server are connected through a communication network. and a consignment application receiving unit that receives a consignment application from a business operator terminal for the package generated by the transportation matter package generation system and the transportation matter package generation system.

[program]
The program of the present invention is a program for causing a computer to function as the transportation item package generation system of the present invention or the matching system of the present invention.

[Storage medium]
A storage medium of the present invention is a computer-readable storage medium recording the program of the present invention.

Since the present invention is not a system for collectively requesting quotations from a plurality of transportation companies, the burden on the transportation requester is small, and the transportation business can accept projects efficiently and with high profitability.

BRIEF DESCRIPTION OF THE DRAWINGS The schematic diagram which shows an example of the matching system of this invention. FIG. 3 is a block diagram showing an example of a client terminal and a business operator terminal; (a) is a functional block diagram showing an example of a matching server, (b) is a functional block diagram showing an example of an item database, and (c) is a functional block diagram showing an example of a business operator database. FIG. 4 is a sequence diagram showing an example of the flow of processing when making a provisional application; FIG. 4 is a sequence diagram showing an example of the flow of processing from package generation to completion of matching; FIG. 4 is a sequence diagram showing an example of the flow of processing after completion of moving work; Explanatory drawing of the time concept in this application. (a) and (b) are explanatory diagrams showing an example of a package generation procedure. (a) and (b) are explanatory diagrams showing an example of a package generation procedure. (a) and (b) are explanatory diagrams showing an example of a package generation procedure. (a) to (d) are explanatory diagrams showing an example of a package generation procedure when an exclusion reference time condition and an appearance count condition are included.

(embodiment)
An example of an embodiment of the present invention will be described with reference to the drawings. INDUSTRIAL APPLICABILITY The present invention can be applied to a matching system between a transportation requester (hereinafter simply referred to as "the requester") who requests transportation of various goods and a transportation business operator (hereinafter simply referred to as the "business operator") who undertakes the request. It is possible, but here, the transport case is moving, and the case where it is applied to a system that matches the client requesting the move with the business operator that entrusts the move will be described as an example.

[overall structure]
FIG. 1 shows the overall configuration of the matching system of this embodiment. The matching system of this embodiment includes a client terminal 10 used by a client, a business operator terminal 20 used by a business operator, and a matching server 30 . The client terminal 10, the business operator terminal 20 and the matching server 30 are connected via a communication network N so as to be able to communicate with each other.

[Requester terminal]
The client terminal 10 is a terminal used by a client who requests moving, and is composed of, for example, a PC, a smart phone, a tablet, or the like. As shown in FIG. 2, the client terminal 10 of this embodiment includes a control unit 11, a memory 12, a storage unit 13, a communication unit 14, an input unit 15, and an output unit 16 as main components. are electrically connected through

The control unit 11 controls the operation of the client terminal 10, and is composed of, for example, a CPU (Central Processing Unit) and an MPU (Micro Processing Unit). A program stored in the storage unit 13 is executed by the control unit 11 .

The memory 12 is a main storage device for storing data and instructions, and is composed of, for example, ROM (Read Only Memory) and RAM (Random Access Memory).

The storage unit 13 is an auxiliary storage device that stores programs and data, and is composed of, for example, an HDD (Hard Disk Drive), an SSD (Solid State Drive), a flash memory, or the like.

The communication unit 14 is a communication interface for performing wireless communication (data communication) with the operator terminal 20 and the matching server 30 via the communication network N, and includes a receiving unit 14a and a transmitting unit 14b. The communication unit 14 communicates according to various communication standards such as TCP/IP, Bluetooth Low Energy (registered trademark), Bluetooth (registered trademark), 3G (3rd Generation), 4G (4th Generation), and LTE (Long Term Evolution). is done.

The input unit 15 is a device for inputting information, and includes, for example, a keyboard, touch screen, mouse, voice input device, and the like. The output unit 16 is a device for outputting information, and includes a display, a printer, and the like.

Each client can use this matching system from the browser of his/her own client terminal 10 . This matching system may be used by installing a dedicated application in the client terminal 10 and using the application.

The configuration of the client terminal 10 described here is just an example, and other configurations are possible as long as the intended purpose can be achieved.

[Business operator terminal]
The operator terminal 20 is a terminal used by an operator who entrusts moving, and is composed of, for example, a PC, a smart phone, a tablet, or the like. Since the configuration of the business operator terminal 20 is the same as that of the client terminal 10, the description thereof is omitted here. The operator terminal 20 may have a different configuration from the client terminal 10 as long as the intended purpose can be achieved.

[Matching server]
The matching server 30 is a device that receives requests from the client terminal 10 and the business operator terminal 20 and performs various processes. As an example, the matching server 30 shown in FIG. 3 includes a control unit 31, a memory 32, a storage unit 33, and a communication unit 34 as main components. These elements are electrically connected through a bus 35 .

Although illustration is omitted, the matching server 30 is configured to include an uninterruptible power supply, a backup device, etc. so as to stably provide services to a plurality of client terminals 10 and business operator terminals 20. is preferred.

The control unit 31 comprehensively controls each component connected by the bus 35, and is composed of, for example, a CPU and an MPU. The control unit 31 loads an application program necessary for executing processing from the storage unit 33 to the memory 32 and executes each processing.

The control unit 31 of this embodiment includes a request reception unit 311, an individual quotation determination unit 312, a package generation unit 313, a consignment application reception unit 314, a completion report reception unit 315, a payment processing unit 316, an ID/PW An issuing unit 317 and an information acquiring unit 318 are provided as main components.

The request receiving unit 311 is a functional unit that receives a moving application (request) from the client terminal 10, and the individual quotation determination unit 312 is whether the request submitted from the client terminal 10 satisfies the acceptance criteria set in advance. It is a functional unit that determines whether or not Details of the individual estimate determination unit 312 will be described later.

The package generation unit 313 selects two or more cases from the plurality of cases stored in the storage unit 33 (more specifically, the standby case storage unit 332) so as not to exceed a preset upper limit operating time. This is a functional part that selects and generates a package. A package generation procedure in the package generation unit 313 will be described later. A package in the present application means a group of two or more transportation projects, and a business operator basically applies for and accepts a project for each package.

A consignment application reception unit 314 is a functional unit that receives a consignment application for a package from the operator terminal 20, a completion report reception unit 315 is a functional unit that receives a work completion report from the operator terminal 20, and a settlement processing unit 316 is a A functional unit that executes payment processing based on payment information input from the terminal 10 .

The ID/PW issuing unit 317 is a functional unit that issues an ID and PW required when using the matching system in response to a request from the business operator terminal 20 .

The information acquisition unit 318 uses an API (Application Programming Interface) provided by an external server to obtain location information (for example, latitude and longitude) of the residence before and after moving, distance information between residences before and after moving, This is a functional unit that acquires information such as expressway toll information when expressways are included.

The memory 32 is a main storage device that stores data and instructions, and is composed of, for example, ROM and RAM. The storage unit 33 is an auxiliary storage device that stores programs and data, and is composed of, for example, an HDD, an SSD, a flash memory, or the like. The storage unit 33 stores a program (application program) of the matching system of this embodiment.

As shown in FIG. 3(a), the storage unit 33 of this embodiment mainly includes an item database 33a in which information about items is stored and a company database 33b in which information about companies is stored.

As shown in FIGS. 3B and 3C, the case database 33a includes a provisional application case storage unit 331, a standby case storage unit 332, a packaged case storage unit 333, a commissioned application case storage unit 334, and a confirmed case storage unit. 335, a completed matter storage unit 336, etc., and a business information storage unit 337 is included in the business database 33b.

A provisional application item storage unit 331 stores items provisionally applied from the client terminal 10, and a standby item storage unit 332 stores items before packaging (hereinafter referred to as "standby item") among the actual application items. ), the packaging item storage unit 333 is an area for storing packaged items, and the consignment application item storage unit 334 is an area for storing packaging items for which consignment applications have been received from business operators.

Also, the fixed item storage unit 335 stores a package item for which matching has been confirmed after the requester makes a full application after receiving a consignment application from the company, and the completed item storage unit 336 stores items for which the moving work has been completed. The area/business operator information storage unit 337 is an area for storing data relating to registered business operators.

The communication unit 34 is a communication interface for performing wireless communication (data communication) with the client terminal 10, the business terminal 20, etc. via the communication network N, and uses TCP/IP, Bluetooth Low Energy (registered trademark), and the like. ), Bluetooth (registered trademark), 3G, 4G, LTE, and other communication standards.

The communication unit 34 includes a receiving unit 34a and a transmitting unit 34b. The receiving unit 34a receives a signal from the client terminal 10, the business operator terminal 20, or the like, decodes the received signal, and transmits the decoded signal to the control unit 31. FIG. The transmission unit 34b transmits the information transmitted from the control unit 31 to each client terminal 10. FIG.

The matching server 30 can also be composed of a group of two or more servers such as a web server, an application server, a database server, etc. that are communicatively connected to each other via a LAN.

[Processing on the matching server]
Next, the flow of processing in the matching system of this embodiment will be described with reference to FIGS. 4 to 6. FIG. Each of the following processes is realized by a program stored in the matching server 30. FIG.

First, with reference to FIG. 4, the flow of processing when a requester applies for matching of a moving case will be described.
(1) The client uses his client terminal 10 to access the website provided by the matching server 30 (S001).
(2) Matching server 30 returns a provisional application screen to client terminal 10 (S002). The provisional application screen includes items such as postal code, address, type of building, number of floors to be occupied, presence/absence of an elevator, and vehicle traffic in front of the building as information on the current residence and information on the new residence.
(3) The client uses his/her own client terminal 10 to input moving information and transmits it to the matching server 30 (S003).
(4) After receiving the moving information from the client terminal 10, the matching server 30 returns a parcel information input screen to the client terminal 10 (S004). The luggage information input screen includes items related to the number of household goods such as sofas, tables, chairs, and TV stands. Each household item has a volume set according to its size.
(5) The requester uses his/her own client terminal 10 to input the parcel information and transmits it to the matching server 30 (S005).
(6) The matching server 30, which receives the parcel information from the client terminal 10, compares the moving information and parcel information transmitted from the client terminal 10 with the preset acceptance criteria, and the matter satisfies the acceptance criteria. (S006). The underwriting criteria will be described later.
(7) If it is determined in step (6) that the underwriting criteria are met, a screen for inputting desired dates and the like is returned to the client terminal 10 (S007). The desired schedule etc. input screen includes fields for inputting a schedule for which matching is desired (a schedule for moving) and an e-mail address of the requester.
(8) If it is determined in step (6) that the underwriting criteria are not satisfied, the details of the individual estimated amount are sent to the client terminal 10 (S008).
(9) The client uses his/her own client terminal 10 to input the desired schedule and mail address, and transmits them to the matching server 30 (S009).
(10) The matching server 30, which has received the desired schedule information from the client terminal 10, returns a provisional application confirmation screen to the client terminal 10 (S010).
(11) The client uses his/her own client terminal 10 to click "confirm" on the provisional application confirmation screen displayed on the client terminal 10 (S011).
(12) When "Confirm" is clicked on the client terminal 10, the matching server 30 stores the case in the provisional application case storage unit 331 (S012), and sends a provisional application confirmation email to the client terminal 10. Send (S013).
(13) The client who received the provisional application confirmation mail clicks the URL displayed in the provisional application confirmation mail using his/her own client terminal 10 (S014).
(14) When the URL displayed in the provisional application confirmation mail is clicked on the client terminal 10, the matching server 30 returns a name/telephone number input screen to the client terminal 10 (S015).
(15) The client uses his client terminal 10 to enter his name and telephone number, and transmits them to the matching server 30 (S016).
(16) The matching server 30, which has received the information on the name and telephone number from the client terminal 10, returns the application confirmation screen to the client terminal 10 (S017). On the application confirmation screen, the desired schedule and the fee for each desired schedule are displayed. The setting of the displayed charges will be described later.
(17) The client uses his/her own client terminal 10 to click "confirm" on the application confirmation screen displayed on the client terminal 10 (S018).
(18) When "Confirm" is clicked on the client terminal 10, the matching server 30 transmits a main application completion mail to the client terminal 10 (S019).
(19) When the application completion mail is sent to the requester terminal 10, the matter is stored in the waiting matter storage unit 332 (S020), and the matter transitions to the matching waiting state.

The acceptance criteria in (6) above include, for example, the area before and after the move, the distance from the departure point S to the destination G of each case (hereinafter referred to as "moving distance within the case"), the total volume of the luggage in the case, the The type of cargo in the project, the number of floors of the building before and after the move, the surrounding area conditions before and after the move, and the like can be used. Two or more of these criteria can also be combined.

If the area before and after moving is used as the underwriting criteria, for example, whether the current residence or the new residence entered at the time of provisional application is included in the preset target area (hereinafter referred to as "underwriting target area") If it is determined that both are within the underwriting target area, it will be a package target project, and if both or one of the areas is determined to be outside the target area, it will be subject to individual quotation It can be made into a project.

When using the distance traveled within the project as an underwriting criterion, for example, the distance traveled within the project calculated from the information about the current residence or the residence of the new destination entered at the time of provisional application ”), and if it is determined that the moving distance within the matter is within the matter upper limit distance, it will be the matter to be packaged, and if it is determined that it exceeds the matter upper limit distance It can be set as a project for individual quotation.

When using the total volume of the package as the acceptance criterion, for example, whether the total volume calculated from the package information entered at the time of provisional application is within a preset volume (hereinafter referred to as the "maximum volume of the project"). If it is determined that the total volume is within the upper limit volume of the project, it will be a project for packaging, and if it is determined that it exceeds the upper limit volume of the project, it will be a project for individual quotation. can.

If the type of cargo is used as a criterion for acceptance, for example, whether or not the cargo entered at the time of provisional application includes preset cargo that is not subject to transportation (hereinafter referred to as "non-transportable cargo"). If it is determined that the cargo that is not subject to transportation is included in the cargo desired to be transported, it will be considered as a package target, and if it is determined that cargo that is not subject to transportation is included, an individual quotation will be made. It can be set as a target project.

When using the number of floors of the building before and after moving as the acceptance criteria, for example, the number of floors of the current residence or the new residence entered at the time of provisional application is less than the preset number of floors (hereinafter referred to as "upper floor number of dwelling units"). If it is determined that the number of floors of both dwelling units is less than the maximum number of floors of dwelling units, it will be considered as a package, and the number of floors of dwelling units of both or one of the dwellings will exceed the maximum number of floors of dwelling units. If it is determined that the project is an individual quotation target project, the project can be made to be an individual quotation target project.

When using the surrounding conditions before and after moving as acceptance criteria, for example, based on the information on vehicle traffic in front of the building entered at the time of provisional application, whether there is a road width that allows vehicle traffic to the current residence and the new residence. If it is determined that there is a road width that allows a vehicle to pass in front of both residences, it will be considered as a package project, and it will be determined that there is no road width that allows a vehicle to pass in front of either or both residences. If it is done, it can be set as a project for individual quotation.

If the case is to be treated as a case for individual quotation according to the underwriting criteria, the details of the individual quotation amount are sent to the client terminal 10 (see FIG. 4). Items processed as items subject to individual quotations can be displayed as individual items on the website so that business operators can accept them as individual items. In addition, it is also possible to process the projects for which individual quotations are to be made outside the matching system. For example, a person in charge on the management side who manages the matching system (for example, customer support) can contact the requester or business operator by phone or e-mail to match the matter.

Note that each of the underwriting standards described above is an example, and the underwriting standards may be other than these. In addition, underwriting standards may be set as necessary, and can be omitted if unnecessary.

The desired schedule and the charge for the desired schedule are displayed on the final application confirmation screen of (16). If there are two or more desired dates, the price will be displayed for each date. Also, when using an expressway, the toll including the expressway toll is displayed. Expressway tolls can be obtained using an external map API or the like.

The fee displayed on the application confirmation screen is the amount set in the price list uploaded by the manager of matching server 30 . The administrator of the matching server 30 can set prices according to the situation such as weekdays, weekends, busy seasons, off-peak seasons, etc., and upload the price list in which the prices are set to update the charges as needed. be able to. At this time, along with the price list, it is possible to set a date (application start date) on which the charges described in the price list will be applied.

The flow of processing when applying for matching, which has been described here, is an example, and processing can be performed in a flow other than this. For example, unnecessary steps can be omitted from the steps shown in FIG. 4, or the order of the steps can be changed.

Next, referring to FIG. 5, the flow of processing from the generation of the package to the completion of the main application will be described.
(1) The matching server 30 selects two or more cases from among the cases stored in the waiting case storage unit 332 so as to satisfy a preset combination condition, and generates a package (S101). In this embodiment, the package is set to be generated every hour (for example, after 12:10, then at 13:10). The package generation interval shown here is an example, and the package generation interval can be arbitrarily set or changed. A specific procedure for package generation will be described later.
(2) The matching server 30 stores the generated package in the packaging item storage unit 333 (S102).
(3) The operator uses his/her operator terminal 20 to access the website provided by the matching server 30 (S201). In addition, the business operator performs user registration on the website in advance and obtains a login ID and a login PW.
(4) The matching server 30 returns a login screen to the business operator terminal 20 (S202).
(5) After logging in to the website using the business operator's own terminal 20 (S203), the business searches for new projects (S204).
(6) The matching server 30 that has received the search conditions from the operator terminal 20 returns a search result screen to the operator terminal 20 (S205).
(7) The business operator selects a desired package from the list of packages displayed on the search result screen and applies for acceptance (S206).
(8) When a consignment application from the business operator terminal 20 is accepted, the matter is stored in the consignment application matter storage unit 334 (S207), and the matter transitions to the matching completed state.
(9) The matching server 30 sends a matching completion mail to the client (client terminal 10) of the item included in the package for which the acceptance application was made (S208).
(10) The requester who received the matching completion mail clicks the URL displayed in the matching completion mail using his own client terminal 10 (S209).
(11) When the URL displayed in the matching completion mail is clicked on the client terminal 10, the matching server 30 returns my page to the client terminal 10 (S210).
(12) The requester fills in the required items on his/her own requester terminal 10 and performs the formal application procedure (S211).
(13) When the client terminal 10 completes the formal application procedure, the matching server 30 returns a screen for inputting personal information to the client terminal 10 (S212).
(14) The requester inputs the necessary items from the personal information input screen displayed on the requester terminal 10, and transmits them to the matching server 30 (S213). The personal information entered here includes the name, telephone number, and credit card information of the requester.
(15) Based on the personal information and payment information transmitted from the client terminal 10, credit is given to the payment agent (S214).
(16) When the credit is confirmed, the matter is stored in the confirmed matter storage unit 335 (S215), and the matter transitions to the contract confirmation state.
(17) The matching server 30 sends an application completion email to the client (client terminal 10) who has completed the application procedure (S216), and the business operator (business (S217).

The flow of processing from generation of the package to completion of the application described here is an example, and processing can be performed in a flow other than this. For example, unnecessary steps can be omitted from the steps shown in FIG. 5, or the order of the steps can be changed.

Finally, with reference to FIG. 6, the flow of processing after completion of the moving work will be described.
(1) The business operator uses its own business operator terminal 20 to report to the matching server 30 that the work for the entrusted project has been completed (S301).
(2) When the matching server 30 receives the work completion report transmitted from the business operator terminal 20, the package is stored in the completed item storage unit 336 (S302), and the package transitions to the work completion state.
(3) The matching server 30 performs settlement processing (S303).
(4) After performing the settlement process, the matching server 30 sends a completion report mail to the client (client terminal 10) of the item included in the package (S304).

The flow of processing after completion of the moving work described here is an example, and processing can be performed in a flow other than this. For example, unnecessary steps can be omitted from the steps shown in FIG. 6, or the order of the steps can be changed.

[Package generation procedure]
Next, a procedure for generating a project package executed by the matching server 30 will be described. In this embodiment, two or more projects are selected from the plurality of projects stored in the standby project storage unit 332 so as not to exceed a preset upper limit operating time, and a package is generated. .

Specifically, as shown in Fig. 7, the intra-project travel time for each of the two or more transportation projects, the inter-project transit time required for transportation between the two or more transportation projects, and the load for each of the two or more transportation projects A package is generated by selecting two or more transportation cases so that the total delivery time does not exceed a preset upper limit operating time.

Here, the "intra-project travel time" is the time required to travel from the departure point S to the destination G of each project, and the "inter-project travel time" is the departure from the arrival point G of one project to the departure of the next project. The time required to move to Site S, the "loading and unloading time" is the time required for loading and unloading of each project, and the "upper limit operating time" is the upper limit of the operating time per day. means.

In addition, the "departure point S" and "arrival point G" in the present application do not necessarily have to be specified by the addresses before and after the move, and the postal code of the residence before and after the move, the nearest station, the nearest post office, the nearest school, the nearest It is also possible to specify the "departure point S" and the "arrival point G" by the location (latitude/longitude, address, postal code, etc.) of a store or the like.

The intra-project travel time and the inter-project travel time can be obtained by various methods, for example, using a map API or the like that is open to the public. The intra-issue travel time and the inter-issue travel time can also be acquired by other methods.

When using a map API or the like, the location information (for example, latitude and longitude) before and after the move is acquired, and using the acquired information, the matching server 30 calculates the travel time within a project and the travel time between projects. It is also possible to obtain information on the time required to move within a project or between projects by using the . In the latter case, the matching server 30 side does not need to calculate the intra-case moving time and the inter-case moving time.

Any time can be set in advance for the unloading time and the upper limit operating time. For example, the unloading time can be set to 30 minutes, 60 minutes, 90 minutes, 120 minutes, etc., and the maximum operating time can be set to 360 minutes, 420 minutes, 480 minutes, etc. The unloading time and the upper operating time may be other than this.

As shown in FIGS. 8(a)(b) to 10(a)(b), when five items are stored in the waiting item storage unit 332, a package is generated by the following procedure.
(1) Calculate or obtain the intra-project travel time for each of the five projects (Fig. 8(a)).
(2) Select one case as the first case based on the intra-case travel time calculated or acquired in (1) above (FIG. 8B). In this example, of the five cases, the one with the longest intra-case travel time is designated as the first case.
(3) Next, the inter-case moving distance from the arrival point G of the first case to the departure point S of the cases other than the first case is calculated (Fig. 9(a)).
(4) Based on the moving distance between cases calculated or obtained in (3) above, a case different from the first case is selected as the second case (FIG. 9(b)). In this example, of the four cases excluding the first case, the second case is the one with the shortest travel time from the destination G of the first case to each of the destinations G of the candidates for the second case.
(5) Calculate an inter-case travel distance, which is a travel distance from the arrival point G of the second case to the departure point S of the cases other than the first and second cases (FIG. 10(a)).
(6) Based on the moving distance between cases calculated or obtained in (5) above, a transportation case different from the first and second cases is selected as the third case (FIG. 10(b)). In this example, among the three cases excluding the first case and the second case, the one with the shortest travel time from the destination G of the second case to each of the destinations G of the candidates for the third case is regarded as the third case. there is

Here, a case of combining and packaging three projects is described as an example, but the number of projects can be more or less than three. If the number of cases is less than 3, follow the procedures (1) to (4) above. If the number of cases is more than 3, follow the same procedures as (5) and (6) above for the fourth and subsequent cases. Repeat as many times as necessary.

For convenience of explanation, in the above example, five cases are stored in the waiting case storage unit 332. However, the number of moving cases that are actually registered is larger than this. Each process of (6) is performed for all cases stored in the waiting case storage unit 332 . In practice, two or more packages are generated, and depending on the project, there are cases where the package is redundantly incorporated into two or more packages.

Basically, a package can be generated by going through steps (1) to (6) above, but in the case of steps (1) to (6), there are many cases where the movement time within the case is short. , and it tends to be difficult to incorporate projects that take a long time to move within the project. In this case, another condition can be added to make it easier for projects with long intra-project moving times to be included in the package, and all projects can be leveled.

Conditions to be added include, for example, an exclusion reference time condition and an appearance count condition. The "exclusion standard time condition" here means the inter-case moving time between the immediately preceding matter (nth matter) and the next matter candidate (n+1th matter candidate) and the The condition is that the total time including the travel time is within a preset exclusion reference time.

The "appearance count condition" is a condition that the number of times (appearance count) included in two or more generated packages is the minimum. For example, if there are three packages, package A, package B, and package C, the number of appearances of the items included in all packages is counted as 3 times, and the number of occurrences of items included in package A and package C is counted as 3. The number of occurrences is counted as 2 times.

When the exclusion standard time condition is added, if the total time of the inter-item moving time between the immediately preceding item and the next item candidate and the intra-item moving time of the next item candidate is shorter than the exclusion standard time, the item is considered as the next item candidate. , if the total time is longer than the exclusion reference time, the case is excluded from the next case candidates.

In addition, the "nth case" here refers to the immediately preceding case, such as the first case to the second case, the second case to the third case, etc., and the "n+1th case" refers to the second case to the first case. It is a relative concept that points to the next project, such as the third project against the second project, and the second project.

Also, when adding the appearance count condition, the number of times each item appears in one or more generated packages is counted during package generation, and the minimum number of times is counted. is selected as the next project.

For example, as shown in FIG. 11A, when there are four candidates for the second case following the first case, as shown in FIG. The fourth candidate whose total time of the moving time between cases and the moving time within the next case candidate is longer than the exclusion reference time is excluded from the second case candidates.

Next, as shown in FIG. 11(c), the number of occurrences of each of the remaining three candidates for the second case is compared, and the one with the smallest number of occurrences (the second candidate) is excluded from the candidates for the second case. . After that, as shown in FIG. 11D, for the remaining two candidates for the second case, the travel time from the arrival point G of the first case to the arrival point G of the second case candidate (the The third candidate having the longest inter-case moving time between candidates and the intra-case moving time of the second candidate is excluded from the second candidate, and the last remaining first candidate is adopted as the second case. Although illustration is omitted, the third case may also be selected in the same procedure.

In this way, by adding the exclusion reference time condition and the occurrence number condition to the upper limit operating time, it becomes easier to incorporate projects with long intra-project movement times into the package, and all projects can be leveled.

Note that both the exclusion reference time condition and the appearance count condition can be added as conditions, or only one of them can be added. The exclusion reference time condition and appearance count condition may be added as needed, and need not be added if unnecessary.

(Other embodiments)
Although not described in the above embodiment, when sending a completion report mail to the client terminal 10 after payment processing (S304), a questionnaire can be included as necessary.

In the above embodiment, the package is generated every 10 minutes as an example, but the package can also be generated in a shorter or longer span than 10 minutes.

In the above-described embodiment, the case where each process in the matching server 30 is realized by a program stored in the matching server 30 is taken as an example, but this program can also be recorded in a computer-readable storage medium. can. In this case, each of the above processes is performed by causing the computer to execute the program recorded in the storage medium.

In the above-described embodiment, the case where the present invention is applied to a system that matches a moving client and a moving company is taken as an example. It can be applied to the matching system of

The above embodiment is an example, and the present invention is not limited to the configuration of the above embodiment. In the present invention, additions, changes, omissions, etc. of the configuration can be added within the scope of achieving the intended purpose.

The transportation matter package generation method, transportation matter package generation system, matching method, matching system, program, and storage medium of the present invention can be suitably used for matching short-distance moving of a single person.

10 client terminal 11 control unit 12 memory 13 storage unit 14 communication unit 15 input unit 16 output unit 17 bus 14a reception unit 14b transmission unit 20 business operator terminal 30 matching server 31 control unit 311 request reception unit 312 individual quotation determination unit 313 package Generation unit 314 Consignment application reception unit 315 Completion report reception unit 316 Settlement processing unit 317 ID/PW issuing unit 318 Information acquisition unit 331 Provisional application item storage unit 332 Waiting item storage unit 333 Packaging item storage unit 334 Consignment application item storage unit 335 Confirmed case storage unit 336 Completed case storage unit 337 Business operator information storage unit 32 Memory 33 Storage unit 33a Case database 33b Business operator database 34 Communication unit 34a Reception unit 34b Transmission unit 35 Bus G Arrival point N Communication network S Departure point

Claims (12)

A method for generating a package by selecting two or more transportation cases, comprising:
generating a package by selecting two or more transportation projects from a plurality of transportation projects stored in a storage unit so as not to exceed a preset upper limit operating time;
A transport case package generation method characterized by: In the transportation matter package generation method according to claim 1,
A preset upper limit for the sum of the intra-project travel time for each of two or more transportation projects, the inter-project transit time required for transportation between the two or more transportation projects, and the loading and unloading time for each of the two or more transportation projects Create a package by selecting two or more transportation cases so as not to exceed the operating time;
A transport case package generation method characterized by: In the transportation matter package generation method according to claim 1 or claim 2,
Exclude from the n+1th case candidates the total time of the travel time between the nth case and the n+1th case and the travel time within the n+1th case that exceeds a preset exclusion reference time.
A transport case package generation method characterized by: In the transportation matter package generation method according to any one of claims 1 to 3,
Cases with a low number of appearances are given priority as candidates for the n+1th case,
A transport case package generation method characterized by: A system for generating a package by selecting two or more transportation items,
a request reception unit that receives a request for a transportation item from a requester terminal used by a transportation requester;
a storage unit that stores the transportation items received by the request receiving unit;
a package generation unit that selects two or more transportation projects from among the plurality of transportation projects stored in the storage unit so as not to exceed a preset upper limit operating time and generates a package;
A transport case package generation system characterized by: In the transportation matter package generation system according to claim 5,
The package generation unit determines that the total of the intra-project travel time of each of the two or more transportation projects, the inter-project transit time required for transportation between the two or more transportation projects, and the unloading time of each of the two or more transportation projects Select two or more transportation cases to generate a package so as not to exceed the preset upper limit operating time,
A transport case package generation system characterized by: In the transportation matter package generation system according to claim 5 or claim 6,
The package generation unit excludes, from the n+1-th case candidates, a case in which the total time of the moving time between the n-th case and the (n+1)-th case and the moving time within the n+1-th case exceeds a preset exclusion reference time. ,
A transport case package generation system characterized by: In the transportation matter package generation system according to any one of claims 5 to 7,
The package generation unit preferentially selects an item with a low number of occurrences as a candidate for the (n+1)th item.
A transport case package generation system characterized by: A matching method for matching a transportation requester and a transportation company,
A requester terminal used by the transportation requester, a business operator terminal used by the transportation business operator, and a matching server are connected via a communication network,
a step of generating a package by a freight case package generation method according to any one of claims 1 to 4;
receiving a consignment application from the business terminal for the package generated in the step;
A matching method characterized by: In the matching system that matches transportation requesters and transportation companies,
A requester terminal used by the transportation requester, a business operator terminal used by the transportation business operator, and a matching server are connected via a communication network,
A transportation matter package generation system according to any one of claims 5 to 8;
a consignment application reception unit that receives a consignment application from a business operator terminal for the package generated by the transportation package generation system,
A matching system characterized by: A program for causing a computer to function as the transportation item package generation system according to claim 5 or claim 8 or the matching system according to claim 10. A computer-readable storage medium in which the program according to claim 11 is recorded.

Images