Transportation case package generation method, transportation case package generation system, matching method, matching system, program, and storage medium

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

[Technical field]

[0001] The present invention relates to matching a transportation requester with a transportation company. [Background technology]

[0002] Conventionally, a system that matches transportation requesters with transportation companies is known in which a person wishing to move (transport requester) can obtain quotations from multiple moving companies (transport companies) all at once (Patent Document 1). [Prior art documents] [Patent documents]

[0003] [Patent Document 1] JP 2015-210568 A Summary of the Invention [Problem to be solved by the invention]

[0004] In the case of the system of Patent Document 1, the transport requester receives telephone calls and emails requesting quotes from nearly 10 transport companies, which has the disadvantage of placing a heavy burden on the transport requester in answering the telephone calls.

[0005] In addition, from the viewpoint of the transport company, since they have to take on (accept) projects among multiple competitors, they are forced to lower their prices, and even if they are able to accept the project, they have the disadvantage of being difficult to make a profit. In addition, since they have to accept projects according to the wishes of the operation client, the reality is that the transport route becomes inefficient.

[0006] The present invention has been made in consideration of the above circumstances, and the problem to be solved is to provide a transportation case package generation method, transportation case package generation system, matching method, matching system, program, and storage medium that reduce the burden on the transportation requester and enable transportation companies to accept cases that are efficient and profitable. [Means for solving the problem]

[0007] [How to generate a transportation package] The transportation case package generation method of the present invention is a method for generating a package by selecting two or more transportation cases, and generates a package by selecting two or more transportation cases from a plurality of transportation cases stored in a memory unit so as not to exceed a preset upper limit operating time.

[0008] [Transportation case package generation system] The transportation case package generation system of the present invention is a system for selecting two or more transportation cases and generating a package, and is equipped with a request receiving unit that receives requests for transportation cases from a client terminal used by a transportation requester, a memory unit that stores the transportation cases received by the request receiving unit, and a package generation unit that selects two or more transportation cases from the multiple transportation cases stored in the memory unit so as not to exceed a predetermined upper limit operating time and generates a package.

[0009] [Rendering Intent] The matching method of the present invention is a method for matching a transportation requester with a transportation company, and includes a client terminal used by the transportation requester, a company terminal used by the transportation company, and a matching server connected via a communication network, and includes a step of selecting two or more transportation cases using the transportation case package generation method to generate a package, and a step of accepting an acceptance application from the company terminal for the package generated in the step.

[0010] [Matching System] The matching system of the present invention is a system that matches transportation requesters with transportation companies, and is equipped with a client terminal used by the transportation requester, a business terminal used by the transportation company, and a matching server connected via a communication network, and is equipped with the transportation case package generation system and a contract application reception unit that accepts contract applications from the business company terminal for packages generated by the transportation case package generation system.

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

[0012] [Storage medium] The storage medium of the present invention is a computer-readable storage medium having the program of the present invention recorded thereon. Effect of the Invention

[0013] Since the present invention is not a system that requests quotations from multiple transport companies all at once, the burden on the transport requester is light, and transport companies can accept projects efficiently and profitably. [Brief description of the drawings]

[0014] [Figure 1] FIG. 1 is a schematic diagram showing an example of a matching system of the present invention. [Diagram 2] FIG. 2 is a block diagram showing an example of a requester terminal and a business operator terminal. [Diagram 3] FIG. 4A is a functional block diagram showing an example of a matching server, FIG. 4B is a functional block diagram showing an example of a case database, and FIG. 4C is a functional block diagram showing an example of a business operator database. [Figure 4] FIG. 11 is a sequence diagram showing an example of a processing flow when making a provisional application. [Diagram 5] FIG. 11 is a sequence diagram showing an example of a processing flow from package generation to completion of matching. [Figure 6] FIG. 11 is a sequence diagram showing an example of a process flow after a moving operation is completed. [Figure 7] FIG. 2 is an explanatory diagram of the concept of time in the present application. [Figure 8] 1A and 1B are diagrams illustrating an example of a package generation procedure. [Figure 9] 1A and 1B are diagrams illustrating an example of a package generation procedure. [Figure 10]1A and 1B are diagrams illustrating an example of a package generation procedure. [Figure 11] 13A to 13D are diagrams illustrating an example of a package generation procedure when an exclusion criterion time condition and an occurrence count condition are included. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0015] (Embodiment) An example of an embodiment of the present invention will be described with reference to the drawings. The present invention can be applied to a matching system between a transport requester (hereinafter simply referred to as a "requester") who requests the transport of various items and a transport business operator (hereinafter simply referred to as a "business operator") who accepts the request, but here, an example will be described in which the transport case is a move and the system matches a requester who requests the move with a business operator who accepts the move.

[0016] [Overall configuration] The overall configuration of the matching system of this embodiment is shown in Fig. 1. 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 communicatively connected via a communication network N.

[0017] [Requester's device] The client terminal 10 is a terminal used by a client who requests a move, and is configured, for example, as a PC, a smartphone, a tablet, etc. 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, and each component is electrically connected via a bus 17.

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

[0019] The memory 12 is a main storage device that stores data and instructions, and is configured, for example, by a ROM (Read Only Memory) or a RAM (Random Access Memory).

[0020] The storage unit 13 is an auxiliary storage device that stores programs and data, and is configured, for example, by a hard disk drive (HDD), a solid state drive (SSD), or a flash memory.

[0021] The communication unit 14 is a communication interface for wireless communication (data communication) with the carrier 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 performs communication 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).

[0022] The input unit 15 is a device for inputting information, and is composed of, for example, a keyboard, a touch screen, a mouse, a voice input device, etc. The output unit 16 is a device for outputting information, and is composed of, for example, a display, a printer, etc.

[0023] Each requester can use the matching system from the browser of his / her own requester terminal 10. The matching system may be used by installing a dedicated application in the requester terminal 10 and using the application.

[0024] The configuration of the client terminal 10 described here is merely an example, and other configurations are also possible as long as the desired purpose can be achieved.

[0025] [Business operator terminal] The business operator terminal 20 is a terminal used by a business operator who accepts moving, and is configured, for example, as a PC, a smartphone, a tablet, etc. The configuration of the business operator terminal 20 is the same as that of the client terminal 10, so a description thereof will be omitted here. The business operator terminal 20 may have a different configuration from that of the client terminal 10 as long as the intended purpose can be achieved.

[0026] [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 mainly comprises a control unit 31, a memory 32, a storage unit 33, and a communication unit 34. These elements are electrically connected via a bus 35.

[0027] Although not shown in the figure, it is preferable that the matching server 30 is configured to include an uninterruptible power supply, a backup device, etc., so that the matching server 30 can provide stable services to a plurality of client terminals 10 and business terminals 20.

[0028] The control unit 31 comprehensively controls each component connected via a bus 35, and is composed of, for example, a CPU, an MPU, etc. The control unit 31 loads application programs required for executing processes from the storage unit 33 to the memory 32, and executes each process.

[0029] The control unit 31 in this embodiment has as its main components a request receiving unit 311, an individual estimate determination unit 312, a package generation unit 313, a contract application receiving unit 314, a completion report receiving unit 315, a payment processing unit 316, an ID / PW issuing unit 317, and an information acquisition unit 318.

[0030] The request receiving unit 311 is a functional unit that receives a moving application (request) from the client terminal 10, and the individual estimate determination unit 312 is a functional unit that determines whether or not the case applied for from the client terminal 10 satisfies preset acceptance criteria. The individual estimate determination unit 312 will be described in detail later.

[0031] The package generation unit 313 is a functional unit that selects two or more cases from among the cases stored in the memory unit 33 (more specifically, the waiting case storage unit 332) so as not to exceed a preset upper limit operation time, and generates a package. The package generation procedure in the package generation unit 313 will be described later. Note that a package in this application means a group of cases that includes two or more transportation cases, and businesses basically apply for and take on cases on a package-by-package basis.

[0032] The contract application receiving unit 314 is a functional unit that receives contract applications for packages from the business operator terminal 20, the completion report receiving unit 315 is a functional unit that receives work completion reports from the business operator terminal 20, and the payment processing unit 316 is a functional unit that executes payment processing based on payment information input from the client terminal 10.

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

[0034] The information acquisition unit 318 is a functional unit that uses an API (Application Programming Interface) provided by an external server to acquire information such as location information (e.g., latitude and longitude) of the residence before and after the move, distance information between the residences before and after the move, and highway toll information if a highway is included in the travel route.

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

[0036] As shown in FIG. 3(a), the storage unit 33 of this embodiment mainly comprises a case database 33a in which information related to cases is stored, and a business database 33b in which information related to businesses is stored.

[0037] As shown in Figures 3(b) and (c), the case database 33a includes a provisional application case storage section 331, a waiting case storage section 332, a packaged case storage section 333, an accepted application case storage section 334, a confirmed case storage section 335, a completed case storage section 336, etc., and the business operator database 33b includes a business operator information storage section 337.

[0038] The provisional application case storage unit 331 is an area for storing cases for which provisional applications have been made from the requester terminal 10, the waiting case storage unit 332 is an area for storing information regarding cases for which full applications have been made but not yet packaged (hereinafter referred to as "waiting cases"), the packaged case storage unit 333 is an area for storing packaged cases, and the request for acceptance case storage unit 334 is an area for storing packaged cases for which acceptance applications have been made by businesses.

[0039] In addition, the confirmed case storage unit 335 is an area for storing package cases for which a business operator has applied for the contract and the client has made a final application and the matching has been confirmed, the completed case storage unit 336 is an area for storing cases for which the moving work has been completed, and the business operator information storage unit 337 is an area for storing data related to registered businesses.

[0040] The communication unit 34 is a communication interface for performing wireless communication (data communication) with the client terminal 10, the business operator terminal 20, etc. via the communication network N, and communication is performed according to various communication standards such as TCP / IP, Bluetooth Low Energy (registered trademark), Bluetooth (registered trademark), 3G, 4G, LTE, etc.

[0041] The communication unit 34 includes a receiving unit 34a and a transmitting unit 34b. The receiving unit 34a receives signals from the requester terminal 10, the business operator terminal 20, etc., decodes the received signals, and transmits them to the control unit 31. The transmitting unit 34b transmits information transmitted from the control unit 31 to each of the requester terminals 10.

[0042] The matching server 30 may be configured as a group of two or more servers, such as a web server, an application server, and a database server, all of which are communicably connected to one another via a LAN.

[0043] [Processing on the matching server] Next, a process flow in the matching system of this embodiment will be described with reference to Fig. 4 to Fig. 6. Each process below is realized by a program stored in the matching server 30.

[0044] First, with reference to FIG. 4, a process flow when a client applies for matching for a moving job will be described. (1) A client uses his / her client terminal 10 to access a website provided by matching server 30 (S001). (2) The matching server 30 returns a provisional application screen to the client terminal 10 (S002). The provisional application screen includes information about the current residence and information about the residence to which the client is moving, such as the postal code, address, building type, number of floors the residence is on, whether there is an elevator, and items related to vehicular traffic in front of the building. (3) The requester inputs moving information using his / her requester terminal 10 and transmits it to the matching server 30 (S003). (4) The matching server 30, which has received the moving information from the requester terminal 10, returns a luggage information input screen to the requester terminal 10 (S004). The luggage information input screen includes items related to the number of furniture items, such as sofas, tables, chairs, and TV stands. Each furniture item has a volume set according to its size. (5) The requester inputs package information using his / her requester terminal 10 and transmits it to the matching server 30 (S005). (6) The matching server 30, which has received the package information from the requester terminal 10, compares the moving information and package information sent from the requester terminal 10 with the pre-set acceptance criteria to determine whether the job satisfies the acceptance criteria (S006). The acceptance criteria will be described later. (7) If it is determined in step (6) that the acceptance criteria are met, a screen for inputting desired dates, etc. is returned to the requester terminal 10 (S007). The screen for inputting desired dates, etc. includes an input field for the date of desired matching (the date of desired moving) and the requester's email address, etc. (8) If it is determined in step (6) above that the acceptance criteria are not met, details of the individual estimated amount are transmitted to the requester terminal 10 (S008). (9) The client inputs the desired schedule and email address using his / her client terminal 10, and transmits them to the matching server 30 (S009). (10) The matching server 30, which has received information such as the desired schedule from the requester terminal 10, returns a provisional application confirmation screen to the requester terminal 10 (S010). (11) Using his / her own client terminal 10, the requester clicks "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 transmits a provisional application confirmation email to the client terminal 10 (S013). (13) Upon receiving the provisional application confirmation email, the requester clicks on the URL displayed in the provisional application confirmation email using his / her requester terminal 10 (S014). (14) When the URL displayed in the provisional application confirmation email is clicked on the requester terminal 10, the matching server 30 returns a name and telephone number input screen to the requester terminal 10 (S015). (15) The client inputs his / her name and telephone number using his / her client terminal 10, and transmits them to the matching server 30 (S016). (16) The matching server 30, which has received the information regarding the name and telephone number from the requester terminal 10, returns a confirmation screen for the application to the requester terminal 10 (S017). The confirmation screen for the application displays the desired dates and the fees for each desired date. The settings for the displayed fees will be described later. (17) Using his / her own client terminal 10, the requester clicks "Confirm" on the application confirmation screen displayed on the client terminal 10 (S018). (18) When "Confirm" is clicked on the requester terminal 10, the matching server 30 transmits a formal application completion email to the requester terminal 10 (S019). (19) When the application completion email is sent to the requester terminal 10, the case is stored in the waiting case storage unit 332 (S020), and the case transitions to a matching waiting state.

[0045] The acceptance criteria in (6) above can be, for example, the area before and after the move, the distance from the departure point S to the arrival point G of each case (hereinafter referred to as the "travel distance within the case"), the total volume of the luggage in the case, the type of luggage in the case, the number of floors of the building before and after the move, the surrounding area conditions before and after the move, etc. Two or more of these criteria can also be combined.

[0046] When using the areas before and after the move as the underwriting criteria, for example, it is possible to determine whether the current residence or the new residence entered at the time of provisional application is included in a pre-set target area (hereinafter referred to as the "underwriting target area"). If it is determined that both are within the underwriting target area, the case will be considered to be a packaged case, and if it is determined that both or either one of the areas is outside the target area, the case will be considered to be an individual estimate.

[0047] When using the distance traveled within a case as an underwriting criterion, for example, it is possible to determine whether the distance traveled within a case calculated from information about the current residence or the new residence entered at the time of provisional application is within a preset distance (hereinafter referred to as the "case maximum distance").If it is determined that the distance traveled within a case is within the case maximum distance, the case will be treated as a case to be packaged, and if it is determined that it exceeds the case maximum distance, the case will be treated as a case to be individually estimated.

[0048] When the total volume of the cargo is used as the acceptance criterion, for example, it is possible to determine whether the total volume calculated from the cargo information entered at the time of provisional application is within a preset volume (hereinafter referred to as the "case upper limit volume"), and if it is determined that the total volume is within the case upper limit volume, the case will be treated as a case to be packaged, and if it is determined that the total volume exceeds the case upper limit volume, the case will be treated as a case to be individually quoted.

[0049] When the type of cargo is used as an acceptance criterion, for example, it can be determined whether the cargo entered at the time of provisional application includes cargo that is not eligible for transportation (hereinafter referred to as "cargo not eligible for transportation") that has been preset, and if it is determined that the cargo desired to be transported does not include cargo that is not eligible for transportation, the case can be treated as one for which packaging is required, and if it is determined that the cargo includes cargo that is not eligible for transportation, the case can be treated as one for which an individual estimate is required.

[0050] When using the number of floors of the building before and after the move as an underwriting criterion, for example, it can be determined whether the number of floors of the current residence or the new residence entered at the time of provisional application is less than a preset number of floors (hereinafter referred to as the "maximum number of floors"). If it is determined that the number of floors of both residences is less than the maximum number of floors, the case can be treated as a packaged case, and if it is determined that the number of floors of both or either of the residences exceeds the maximum number of floors, the case can be treated as a case for individual estimates.

[0051] When using the surrounding conditions before and after the move as an underwriting criterion, for example, information regarding vehicular traffic in front of the property entered at the time of provisional application can be used to determine whether or not there is a road wide enough for vehicles to pass in front of the current residence and the new residence. If it is determined that there is a road wide enough for vehicular traffic in front of both residences, the case can be packaged, and if it is determined that there is not a road wide enough for vehicular traffic in front of both or either of the residences, the case can be subject to an individual estimate.

[0052] When the case is processed as a case for which an individual estimate is required based on each of the above-mentioned underwriting standards, details of the individual estimate amount are sent to the requester terminal 10 (see FIG. 4). Cases that have been processed as cases for which an individual estimate is required can be displayed on a website as individual cases, and businesses can accept them as individual cases. Cases for which an individual estimate is required can also be processed outside the matching system. For example, a person in charge on the administrator side who manages the matching system (e.g., customer support) can contact the requester and the business by phone or email to match the case.

[0053] The above-mentioned underwriting criteria are merely examples, and other underwriting criteria may be used. Moreover, underwriting criteria may be set as necessary, and may be omitted if unnecessary.

[0054] The application confirmation screen (16) above will display the desired dates and the fees for those dates. If there are two or more desired dates, the fees will be displayed for each date. If a highway is used, the fees including the highway toll will be displayed. The highway toll can be obtained using an external map API, etc.

[0055] The fees displayed on this application confirmation screen are the amounts set in the price list uploaded by the administrator of matching server 30. The administrator of matching server 30 can set prices according to circumstances, such as weekdays, weekends, holidays, busy periods, slow periods, etc., and can update the fees at any time by uploading a price list with the set prices. At this time, along with the price list, the administrator can also set the date (start date of application) when the fees listed in the price list will apply.

[0056] The process flow for applying for matching described here is just an example, and other flows are also possible. For example, it is possible to omit unnecessary steps from the steps shown in Figure 4, or to change the order of the steps.

[0057] Next, the flow of processing from the generation of a package to the completion of a permanent application will be described with reference to FIG. (1) The matching server 30 selects two or more cases from 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, the next one is 13:10, etc.). The package generation interval shown here is an example, and the package generation interval can be set or changed as desired. The specific procedure for generating a package will be described later. (2) The matching server 30 stores the generated package in the packaging request storage unit 333 (S102). (3) The business uses its business terminal 20 to access the website provided by the matching server 30 (S201). The business performs user registration on the website in advance and obtains a login ID and login password. (4) The matching server 30 returns a login screen to the business terminal 20 (S202). (5) The business operator logs into the website using his / her business operator terminal 20 (S203), and then searches for new cases (S204). (6) The matching server 30 that has received the search conditions from the business operator terminal 20 returns a search result screen to the business operator terminal 20 (S205). (7) The business operator selects the package he / she wishes to accept from the list of packages displayed on the search result screen and submits an application for acceptance (S206). (8) When an application for acceptance is accepted from the business operator terminal 20, the application is stored in the application application case storage unit 334 (S207), and the application transitions to a matching completion state. (9) The matching server 30 transmits a matching completion email to the requester (requester terminal 10) of the case included in the package for which the request for acceptance has been made (S208). (10) Upon receiving the matching completion email, the requester clicks on the URL displayed in the matching completion email using his / her requester terminal 10 (S209). (11) When the URL displayed in the matching completion email is clicked on the requester terminal 10, the matching server 30 returns a My Page to the requester terminal 10 (S210). (12) The requester fills in the necessary information on his / her requester terminal 10 and carries out the application procedure (S211). (13) When the application procedure is performed from the requester terminal 10, the matching server 30 returns a screen for inputting personal information, etc. to the requester terminal 10 (S212). (14) The requester inputs the necessary information on the personal information input screen displayed on the requester terminal 10 and transmits it to the matching server 30 (S213). The personal information input here includes the requester's name, telephone number, credit card information, etc. (15) Based on the personal information and payment information sent from the client terminal 10, credit is provided to the payment agent (S214). (16) Once credit is confirmed, the case is stored in the confirmed case storage unit 335 (S215), and the case transitions to a contract confirmed state. (17) The matching server 30 sends an application completion email to the requester (requester terminal 10) who has completed the application procedure (S216), and provides detailed information about the package to the business operator (business operator terminal 20) who has applied to accept the case (S217).

[0058] The process flow from the generation of the package to the completion of the application described here is just an example, and other processes are also possible. For example, unnecessary steps can be omitted from the steps shown in Figure 5, or the order of the steps can be changed.

[0059] Finally, with reference to FIG. 6, the flow of processing after the completion of the moving operation will be described. (1) The business operator uses his / her business operator terminal 20 to report to the matching server 30 that the work for the contracted job 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 case storage unit 336 (S302), and the package transitions to a work completed state. (3) The matching server 30 performs a payment process (S303). (4) After the settlement process, the matching server 30 transmits a completion report email to the requester (requester terminal 10) of the case included in the package (S304).

[0060] The process flow after the migration is completed as described here is just an example, and other processes can be used. For example, it is possible to omit unnecessary steps from the steps shown in Figure 6, or to change the order of the steps.

[0061] [Package generation procedure] Next, a description will be given of a procedure for generating a package of cases executed by the matching server 30. In this embodiment, a package is generated by selecting two or more cases from among a plurality of cases stored in the waiting case storage unit 332 so that a preset upper limit operation time is not exceeded.

[0062] Specifically, as shown in Figure 7, a package is generated by selecting two or more transport cases so that the total of the intra-case travel time for each of the two or more transport cases, the inter-case travel time required for travel between the two or more transport cases, and the loading and unloading time for each of the two or more transport cases does not exceed a preset upper limit operating time.

[0063] Here, "travel time within a case" refers to the time required to travel from the departure point S to the arrival point G of each case, "travel time between cases" refers to the time required to travel from the arrival point G of one case to the departure point S of the next case, "loading and unloading time" refers to the time required for loading and unloading each case, and "maximum operating time" refers to the maximum operating time in one day.

[0064] In addition, the "point of departure S" and "point of arrival G" in this application do not necessarily need to be specified by the addresses before and after the move, but can also be specified by the location (latitude and longitude, address, postal code, etc.) of the residence before and after the move, the nearest train station, the nearest post office, the nearest school, the nearest store, etc.

[0065] The travel time within a case and the travel time between cases can be obtained in various ways, for example, by using a publicly available map API, etc. The travel time within a case and the travel time between cases can also be obtained in other ways.

[0066] When using a map API or the like, location information (e.g., latitude and longitude) before and after the move is acquired, and the acquired information is used to calculate the travel time within a case or the travel time between cases on the matching server 30 side, and the map API or the like can also be used to acquire information on the time required to travel within a case or between cases. In the latter case, it is not necessary for the matching server 30 side to calculate the travel time within a case or the travel time between cases.

[0067] The unloading time and the upper limit operation time can be preset to any time. For example, the unloading time can be set to 30 minutes, 60 minutes, 90 minutes, 120 minutes, etc., and the upper limit operation time can be set to 360 minutes, 420 minutes, 480 minutes, etc. The unloading time and the upper limit operation time may be other than these.

[0068] As shown in FIGS. 8(a) and 8(b) to 10(a) and 10(b), when five cases are stored in the waiting case storage unit 332, a package is generated in the following procedure. (1) Calculate or obtain the in-case travel time for each of the five cases (Figure 8(a)). (2) Based on the in-case travel time calculated or acquired in (1) above, select one case as the first case (Figure 8(b)). In this example, of the five cases, the one with the longest in-case travel time is selected as the first case. (3) Next, the inter-case travel distance from the arrival point G of the first case to the departure point S of another case other than the first case is calculated (Figure 9(a)). (4) Based on the travel distance between the cases calculated or obtained in (3) above, a case different from the first case is selected as the second case (Figure 9(b)). In this example, of the four cases excluding the first case, the one with the shortest travel time from the destination G of the first case to each destination G of the second case candidates is selected as the second case. (5) Calculate the inter-case travel distance, which is the travel distance from the arrival point G of the second case to the departure point S of another case other than the first case and the second case (FIG. 10(a)). (6) Based on the travel 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 (Figure 10(b)). In this example, among the three cases excluding the first and second cases, the one with the shortest travel time from the destination G of the second case to each destination G of the third case candidate is selected as the third case.

[0069] Here, we have explained an example of packaging three cases together, but the number of cases can be more or less than three. If there are fewer than three cases, follow the steps (1) to (4) above. If there are more than three cases, repeat the same steps as (5) and (6) above as many times as necessary for the fourth case onwards.

[0070] For ease of explanation, the above example shows a case where five cases are stored in the waiting case storage unit 332, but the number of moving cases actually registered is greater than this, and the above-mentioned processes (1) to (6) are performed on all cases stored in the waiting case storage unit 332. In reality, two or more packages are generated, and some cases may be incorporated in duplicate into two or more packages.

[0071] Basically, a package can be generated by going through the steps (1) to (6) above, but when steps (1) to (6) are used, many cases with short internal movement times tend to be included in the package, and cases with long internal movement times tend to be difficult to include in the package. In this case, by adding another condition, it is possible to make it easier for cases with long internal movement times to be included in the package, thereby averaging out all cases.

[0072] Possible conditions to be added include, for example, an exclusion criteria time condition, an occurrence count condition, etc. The "exclusion criteria time condition" here is a condition that the total time of the inter-case movement time between the immediately preceding case (nth case) and the next case candidate (n+1th case candidate) and the intra-case movement time of the next case candidate (n+1th case candidate) must be within a preset exclusion criteria time.

[0073] The "occurrence condition" is a condition that the number of times (occurrence count) a project is included in two or more generated packages must be the smallest. For example, if there are three packages, Package A, Package B, and Package C, the number of occurrences of projects included in all the packages will be counted as three, and the number of occurrences of projects included in Package A and Package C will be counted as two.

[0074] When the exclusion criteria time condition is added, if the total time of the inter-case movement time between the immediately preceding case and the next case candidate is shorter than the exclusion criteria time, the next case candidate is selected as the next case candidate, and if the total time is longer than the exclusion criteria time, the candidate is excluded from the next case candidates.

[0075] Note that the "nth case" here refers to the case immediately preceding it, such as the first case against the second case, or the second case against the third case, while the "n+1th case" is a relative concept referring to the case immediately following, such as the second case against the first case, or the third case against the second case.

[0076] In addition, when the condition of the number of occurrences is added, during the generation of the package, the number of times each case appears in one or more generated packages is counted, and the case with the smallest number is selected as the next case.

[0077] For example, in the case where there are four second case candidates following the first case as shown in Fig. 11(a), the fourth candidate is excluded from the second case candidates because the total time of the inter-case movement time between the immediately preceding case and the next case candidate and the intra-case movement time of the next case candidate is longer than the exclusion criteria time according to the exclusion criteria time condition as shown in Fig. 11(b).

[0078] Next, as shown in Figure 11(c), the number of occurrences of each of the remaining three second candidates is compared, and all but the one with the smallest number of occurrences (the second candidate) are excluded from the second case candidates. After that, as shown in Figure 11(d), of the two remaining second candidates, the third candidate with the longest travel time from the arrival point G of the first case to the arrival point G of the second candidate (the sum of the inter-case travel time between the first case and the second case candidate and the intra-case travel time of the second case candidate) is excluded from the second case candidate, and finally the remaining first candidate is adopted as the second case. Although not shown in the figure, the third case can also be selected in a similar manner.

[0079] In this way, by adding the exclusion criteria time condition and the occurrence count condition to the upper limit operating time as conditions, cases with long movement times within a case can be easily incorporated into a package, and all cases can be leveled out.

[0080] In addition, it is possible to add both the exclusion criteria time condition and the occurrence count condition, or to add only one of them. The exclusion criteria time condition and the occurrence count condition can be added as necessary, and there is no need to add them if they are not required.

[0081] (Other embodiments) Although not described in the above embodiment, when a completion report email is sent to the client terminal 10 after the payment process (S304), a questionnaire can be included as necessary.

[0082] In the above embodiment, a case where a package is generated every 10 minutes is taken as an example, but the package can also be generated at intervals shorter or longer than 10 minutes.

[0083] In the above embodiment, the processes in the matching server 30 are realized by a program stored in the matching server 30, but the program may be recorded in a computer-readable storage medium. In this case, the processes are performed by causing a computer to execute the program recorded in the storage medium.

[0084] In the above embodiment, an example is given of the application of the present invention to a system that matches moving clients with moving companies, but the present invention can be applied to a matching system for moving cases, as well as a matching system for furniture transportation clients with transportation companies.

[0085] The above-described embodiment is merely an example, and the present invention is not limited to the configuration of the above-described embodiment. The present invention can be modified, changed, or omitted in the configuration within the scope of achieving the intended object. [Industrial Applicability]

[0086] The transportation case package creation method, transportation case package creation system, matching method, matching system, program, and storage medium of the present invention can be suitably used for matching short-distance moves for single people. [Explanation of symbols]

[0087] 10. Client terminal 11 Control section 12. Memory 13 Storage section 14 Communications Department 15 Input section 16 Output section 17 Bus 14a Receiving section 14b Transmitter 20 Operator terminal 30 Matching Server 31 Control Unit 311 Request Reception Department 312 Individual Estimate Judgment Department 313 Package Generation Unit 314 Contract Application Reception Department 315 Completion report reception department 316 Payment Processing Unit 317 ID / PW Issuing Department 318 Information Acquisition Department 331 Provisional Application Case Storage Unit 332 Waiting Case Storage Unit 333 Packaged Case Storage Unit 334 Contract application case storage section 335 Confirmed Case Storage Unit 336 Completed Case Storage Section 337 Business Information Storage Unit 32 Memory 33 Storage section 33a Case Database 33b Business Database 34 Communications Department 34a Receiving section 34b Transmitter 35 Bus G. Destination N Communication Network S Departure point

Claims

1. 1. A method for selecting two or more transportation cases and generating a package, comprising: the control unit selects two or more transportation cases from among the multiple transportation cases stored in the storage unit, and generates a package such that the total of the intra-case travel time of each of the two or more transportation cases, the inter-case travel time required for travel between the two or more transportation cases, and the loading / unloading time of each of the two or more transportation cases does not exceed a preset upper limit operating time; A method for generating a transportation package.

2. 2. The method for creating a transportation package according to claim 1, The control unit excludes from the n+1th candidate case those cases in which the total time of the inter-case movement time between the nth case and the n+1th case and the intra-case movement time of the n+1th case exceeds a preset exclusion reference time. A method for generating a transportation package.

3. The method for generating a transportation case package according to claim 1 or 2, The control unit prioritizes cases with a smaller number of occurrences as candidates for the n+1th case. A method for generating a transportation package.

4. 1. A system for selecting two or more transportation cases and generating a package, comprising: A request receiving unit that receives a request for a transportation item from a client terminal used by a transportation client; A storage unit for storing transportation requests received by the request receiving unit; a package generation unit that selects two or more transportation cases from among the plurality of transportation cases stored in the storage unit and generates a package such that the total of the in-case travel time of each of the two or more transportation cases, the inter-case travel time required for travel between the two or more transportation cases, and the loading and unloading time of each of the two or more transportation cases does not exceed a preset upper limit operating time; A transportation package generation system.

5. 5. The transportation package creation system according to claim 4, The package generation unit excludes from the n+1th candidate case those cases in which the total time of the inter-case movement time between the nth case and the n+1th case and the intra-case movement time of the n+1th case exceeds a preset exclusion reference time. A transportation package generation system.

6. In the transportation package generation system according to claim 4 or 5, The package generation unit prioritizes cases that occur less frequently as candidates for the n+1th case. A transportation package generation system.

7. A matching method for matching a transportation requester with a transportation business operator, comprising: A client terminal used by the transport client, a carrier terminal used by the transport carrier, and a matching server are connected via a communication network; A step of generating a package by a transportation package generation method according to any one of claims 1 to 3; The control unit includes a step of accepting an order for the package generated in the step from the carrier terminal. A matching method comprising:

8. In a matching system that matches transportation clients with transportation companies, A client terminal used by the transport client, a carrier terminal used by the transport carrier, and a matching server are connected via a communication network; A transportation package creation system according to any one of claims 4 to 6, A delivery application receiving unit is provided for receiving delivery applications from a business operator terminal for the package generated by the delivery package generation system. A matching system characterized by:

9. A program for causing a computer to function as the transportation case package generation system according to any one of claims 4 to 6.

10. A computer comprising: A step of generating a package by a transportation package generation method according to any one of claims 1 to 3; A step of accepting an order for the package generated in the step from a carrier terminal; A program for executing the above.

11. A computer-readable storage medium having the program according to claim 9 or 10 recorded thereon.

Images