Freight screening result display method and computer readable storage medium

Abstract

The invention provides a freight screening result display method and a computer readable storage medium, and terminal equipment receives freight search information input by a user on a freight search interface, and sends a freight search request carrying the freight search information to a server after receiving a search operation on the freight search interface. The server responds to the freight search request and performs recall operation on all the current transportation demand lists according to the freight search information and information of a first user corresponding to the terminal equipment to obtain recalled transportation demand lists; and sorting the recalled transportation demand orders based on the degree information that each recalled transportation demand order accords with the expectation of the first user and the generalization degree information of each recalled transportation demand order to obtain a screening result. And the server sends the screening result to the terminal equipment, and the terminal equipment displays the screening result. Therefore, the order receiving efficiency of the driver is improved, the order reaching efficiency of the cargo owner and the driver is improved, and the user experience is improved.

Description

Technical Field

[0001] The present disclosure relates to the field of intelligent transportation technology, and in particular to a method for displaying freight screening results and a computer-readable storage medium. Background Art

[0002] In the scenario of intelligent transportation, users can search and obtain the transportation requirements submitted by the current shipper through terminal devices. Users can accept orders in the transportation requirements, and the shipper and user can reach an order and carry out subsequent transportation.

[0003] However, currently, after the transportation requirements submitted by the shippers are shown to users, the efficiency of drivers accepting orders is not high. Summary of the invention

[0004] The present disclosure provides a method for displaying freight screening results and a computer-readable storage medium to solve the problem of low efficiency in accepting orders by drivers.

[0005] In a first aspect, the present disclosure provides a method for displaying freight screening results, the method comprising:

[0006] receiving a freight search request sent by a terminal device, wherein the freight search request includes freight search information;

[0007] In response to the freight search request, based on the freight search information and the information of the first user corresponding to the terminal device, a recall operation is performed on all current transport demand orders to obtain recalled transport demand orders;

[0008] Based on the information about the degree to which each recalled transport demand form meets the expectations of the first user and the information about the degree of generalization of each recalled transport demand form, the recalled transport demand forms are sorted to obtain a screening result;

[0009] The screening result is sent to the terminal device so that the terminal device displays the screening result.

[0010] In some embodiments, the types of the recalled transport demand orders include: precise recall type and generalized recall type;

[0011] The recalled transport demand orders are sorted based on the information on the degree to which each recalled transport demand order meets the expectations of the first user and the information on the degree of generalization of each recalled transport demand order to obtain screening results, including:

[0012] Obtain the first score of each recalled transport demand order;

[0013] Using the first score of the recalled transport demand order as information on the degree to which the recalled transport demand order meets the expectations of the first user;

[0014] Sorting the recalled transport demand orders of the precise recall type in descending order of the first scores to obtain a precise sequence; the recalled transport demand order in the precise sequence is the first element;

[0015] Sorting the recalled transport demand orders of the generalized recall type in descending order of the first scores to obtain a generalized sequence; the recalled transport demand order in the generalized sequence is the second element;

[0016] If the number of recalled transport demand orders of the precise recall type is greater than or equal to a first threshold, based on the first scores of each first element and each second element, and the generalization degree information of each second element, the second element in the generalized sequence is inserted into the precise sequence to obtain a screening result.

[0017] In some embodiments, based on the first scores of each first element and each second element, and the generalization degree information of each second element, inserting the second element in the generalized sequence into the precise sequence to obtain the screening result includes:

[0018] The following insertion processing is performed on the first R first elements in the precise sequence: according to the window function, N first elements are obtained; a second element that is not currently inserted into the precise sequence and has the highest first score is obtained as the first element to be inserted; if the generalization degree information of the first element to be inserted meets the generalization degree control condition, and the first score of the first element to be inserted is greater than the minimum value of the first scores of the N first elements, the first element to be inserted is inserted into the N first elements; according to the window function, the next N first elements in the precise sequence are obtained, and the execution is returned to obtain a second element that is not currently inserted into the precise sequence and has the highest first score as the first element to be inserted, until the processing of the first R first elements in the precise sequence is completed to obtain a first shuffled sequence; N is an integer greater than 1, and R is an integer greater than N;

[0019] The following insertion processing is performed on the first element after the Rth one in the precise sequence: according to the preset interval division method, the first element of the first preset interval in the preset interval division method is obtained; the second element that is not currently inserted into the precise sequence and ranks in the front K is obtained as the second element to be inserted; if the generalization degree information of the second element to be inserted meets the generalization degree control condition, and the first score of the second element to be inserted is greater than the minimum value of the first score of the first element of the first preset interval, the second element to be inserted is inserted into the first element of the first preset interval; according to the preset interval division method, the first element of the next preset interval is obtained, and the execution is returned to obtain the second element that is not currently inserted into the precise sequence and ranks in the front K with the first score as the second element to be inserted, until the processing of the first element after the Rth one in the precise sequence is completed, and the second shuffled sequence is obtained; K is an integer greater than 0;

[0020] The first shuffled sequence, the second shuffled sequence, and the generalized sequence except for the precise sequence inserted are arranged in sequence to obtain a screening result.

[0021] In some embodiments, the method further comprises:

[0022] Obtaining the total generalization score and / or the departure place generalization score of the second element in the generalization sequence; the total generalization score of the second element in the generalization sequence is used to indicate the comprehensive generalization degree of the second element in the generalization sequence; the departure place generalization score of the second element in the generalization sequence is used to indicate the generalization degree of the departure place of the second element in the generalization sequence;

[0023] The total generalization score and / or the starting generalization score of the second element in the generalization sequence is used as the generalization degree information of the second element in the generalization sequence.

[0024] In some embodiments, the freight search information includes departure place information and destination information; the transport demand list includes loading place information, unloading place information, cargo weight, cargo volume, required vehicle model and required vehicle length; and obtaining the generalization total score and / or the departure place generalization score of the second element in the generalization sequence includes:

[0025] Determine the generalized score of the departure place of the second element according to the departure place information in the freight search information and the loading place information in the second element;

[0026] Obtaining generalized scores corresponding to each piece of information other than the loading place information in the second element;

[0027] A total generalization score of the second element is obtained according to the generalization scores respectively corresponding to all the information in the second element.

[0028] In some embodiments, it is determined that the generalization degree information of the second element in the generalization sequence meets the generalization degree control condition in the following manner:

[0029] When performing the insertion process, for the first Z1 first elements in the precise sequence, if the total generalization score of the second element in the generalized sequence is less than or equal to the first total score threshold, and the departure place generalization score of the second element in the generalized sequence is less than or equal to the first departure place threshold, it is determined that the generalization degree information of the second element in the generalized sequence meets the generalization degree control condition; Z1 is an integer greater than 0 and less than R;

[0030] When performing the insertion process, for the Z1+1th to Z2th first elements in the precise sequence, if there is a second element in the generalized sequence whose total generalization score is less than or equal to the second total score threshold, and whose departure place generalization score is less than or equal to the second departure place threshold, it is determined that the generalization degree information of the second element meets the generalization degree control condition; the second total score threshold is greater than the first total score threshold; the second departure place threshold is greater than the first departure place threshold; Z2 is an integer greater than Z1 and less than R;

[0031] When performing the insertion process, for the first element after the Z2th in the precise sequence, if there is a second element in the generalized sequence whose total generalization score is less than or equal to the third total score threshold, and the generalization score of the departure place of the second element is less than or equal to the third departure place threshold, it is determined that the generalization degree information of the second element meets the generalization degree control condition; the third total score threshold is greater than the second total score threshold; and the third departure place threshold is greater than the second departure place threshold.

[0032] In some embodiments, in response to the freight search request, based on the freight search information and the information of the first user corresponding to the terminal device, performing a recall operation on all current transport demand orders to obtain the recalled transport demand orders includes:

[0033] In response to the freight search request, determining a plurality of recall methods and recall quantities respectively corresponding to the plurality of recall methods according to the freight search information and information of a first user corresponding to the terminal device;

[0034] According to the quantity of the transport demand orders corresponding to the multiple recall methods, the cut-off quantity and the generalization degree information of the transport demand orders corresponding to the multiple recall methods, part or all of the transport demand orders corresponding to the multiple recall methods are determined as recalled transport demand orders.

[0035] In some embodiments, in response to the freight search request, determining multiple recall methods and recall quantities corresponding to the multiple recall methods according to the freight search information and information of the first user corresponding to the terminal device includes:

[0036] In response to the freight search request, determining a plurality of recall methods according to the freight search information and information of a first user corresponding to the terminal device;

[0037] The recall quantities corresponding to the multiple recall methods are determined according to the first user's preference information for recall accuracy and / or the first user's preference information for historical search results obtained by the multiple recall methods.

[0038] In a second aspect, the present disclosure provides a method for displaying freight screening results, the method comprising:

[0039] Receive freight search information in the freight search interface;

[0040] After receiving the search operation on the freight search interface, sending a freight search request to a server, wherein the freight search request includes the freight search information;

[0041] receiving a screening result sent by the server, wherein the screening result is obtained by the server performing a recall operation on all current transport demand orders according to the freight search information and the information of the first user corresponding to the terminal device, to obtain recalled transport demand orders; and sorting the recalled transport demand orders based on information on the degree to which each recalled transport demand order meets the expectations of the first user and information on the degree of generalization of each recalled transport demand order;

[0042] The filtering results are displayed.

[0043] In a third aspect, the present disclosure provides a server, comprising a memory and a processor, wherein the memory stores a computer program executable on the processor, and when the processor executes the program, the method described in the first aspect is implemented.

[0044] In a fourth aspect, the present disclosure provides a terminal device, including a memory and a processor, wherein the memory stores a computer program executable on the processor, and when the processor executes the program, the method described in the second aspect is implemented.

[0045] In a fifth aspect, the present disclosure provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the method described in the first aspect above.

[0046] In a sixth aspect, the present disclosure provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the method described in the second aspect above.

[0047] The method for displaying freight screening results and the computer-readable storage medium provided by the embodiments of the present disclosure are as follows: the terminal device receives freight search information input by the user in the freight search interface, and after receiving the search operation in the freight search interface, sends a freight search request carrying the freight search information to the server. In response to the freight search request, the server performs a recall operation on all current transport demand orders according to the freight search information and the information of the first user corresponding to the terminal device, and obtains the recalled transport demand orders; based on the information of the degree to which each recalled transport demand order meets the expectations of the first user, and the generalization degree information of each recalled transport demand order, the recalled transport demand orders are sorted to obtain the screening results. The server sends the screening results to the terminal device, and the terminal device displays the screening results. If the recalled transport demand orders are more in line with the driver's expectations, the driver will be more inclined to click on and complete the order. The different degrees of generalization of the recalled transport demand orders will also affect the driver's click and completion of the order. Therefore, according to the degree to which different recalled transport demand orders meet the driver's expectations and the generalization degree information of each recalled transport demand order, the freight screening results displayed to the driver are personalized. The driver can quickly find satisfactory transportation needs, which improves the driver's order acceptance efficiency, thereby improving the efficiency of shippers and drivers in completing orders and improving the user experience. BRIEF DESCRIPTION OF THE DRAWINGS

[0048] Figure 1 An architectural diagram of a freight screening result display system provided in an embodiment of the present disclosure;

[0049] Figure 2 An interactive schematic diagram of a method for displaying freight screening results provided by an embodiment of the present disclosure;

[0050] Figure 3 It is a flowchart of a method for displaying freight screening results provided in an embodiment of the present disclosure. DETAILED DESCRIPTION

[0051] Exemplary embodiments will be described in detail herein, examples of which are shown in the accompanying drawings. When the following description refers to the drawings, the same numbers in different drawings represent the same or similar elements unless otherwise indicated. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present disclosure. Instead, they are merely examples of devices and methods consistent with some aspects of the present disclosure as detailed in the appended claims.

[0052] In the present disclosure, "at least one" refers to one or more, and "plurality" refers to two or more. "And / or" describes the association relationship of associated objects, indicating that three relationships may exist. For example, A and / or B can represent: A exists alone, A and B exist at the same time, and B exists alone, where A and B can be singular or plural. The character " / " generally indicates that the objects associated before and after are in an "or" relationship. "At least one of the following" or similar expressions refers to any combination of these items, including any combination of single items or plural items. For example, at least one of a alone, b alone, or c alone can represent: a alone, b alone, c alone, a and b in combination, a and c in combination, b and c in combination, or a, b, and c in combination, where a, b, and c can be single or multiple. In addition, the terms "first" and "second" are used for descriptive purposes only and cannot be understood as indicating or implying relative importance.

[0053] The method for displaying freight screening results provided in this application can be applied to a freight screening result display system. Figure 1 , Figure 1 The architecture diagram of a freight screening result display system provided in an embodiment of the present disclosure includes a server 102 and a terminal device 101. The server 102 and the terminal device 101 are connected via a network. Among them, the server 102 can be a server 102, or a server cluster composed of two or more servers. The terminal device 101 can include but is not limited to a terminal device, a terminal, a user equipment (UE), a mobile station, a mobile terminal, etc. The terminal device 101 can specifically be a mobile phone, a tablet computer, a computer with wireless transceiver function, a wearable device, a robot, a smart home device, etc.

[0054] Usually, the terminal device 101 can receive the freight search information input by the user in the freight search interface. After receiving the user's click operation at the search control, the terminal device 101 sends the freight search request carrying the freight search information to the server 102. The server 102 searches the current transportation demand list according to the freight search information, obtains the screening results, and sends the screening results to the terminal device 101. The terminal device 101 displays the screening results. After seeing the screening results, the user can click on any transportation demand list in the screening results on the freight search interface to accept the order. The cargo owner and the driver can then sign the order and carry out subsequent transportation. Among them, the transportation demand list can also be called the source of goods. The transportation demand list usually contains the transportation demand information filled in by the cargo owner. For example, the transportation demand information may include loading place information, unloading place information, cargo weight, cargo volume, required vehicle model, required vehicle length, etc.

[0055] The present disclosure provides a method for displaying freight screening results. The terminal device receives freight search information input by a user in a freight search interface. After receiving a search operation in the freight search interface, the terminal device sends a freight search request carrying the freight search information to a server. In response to the freight search request, the server performs a recall operation on all current transport demand orders according to the freight search information and information of a first user corresponding to the terminal device to obtain recalled transport demand orders; based on information on the degree to which each recalled transport demand order meets the expectations of the first user and information on the degree of generalization of each recalled transport demand order, the recalled transport demand orders are sorted to obtain screening results. The server sends the screening results to the terminal device, and the terminal device displays the screening results. If the recalled transport demand orders are more in line with the driver's expectations, the driver will be more inclined to click and complete the order. In addition, the different degrees of generalization of the recalled transport demand orders will also affect the driver's click and completion of the order. Therefore, according to the degree to which different recalled transport demand orders meet the driver's expectations and the generalization degree information of each recalled transport demand order, the freight screening results displayed to the driver are personalized. The driver can quickly find satisfactory transportation needs, which improves the driver's order acceptance efficiency, thereby improving the efficiency of shippers and drivers in completing orders and improving the user experience.

[0056] See also Figure 2 , Figure 2 The method provided in this embodiment can be applied to a display system for freight screening results, and the display system for freight screening results can be the above-mentioned Figure 1 The freight estimation system in the embodiment shown. Figure 2 As shown, the method provided in this embodiment may include the following steps 201 to 206.

[0057] Step 201: The terminal device receives freight search information on the freight search interface.

[0058] The freight search interface refers to an interface for searching for a transport demand form. The freight search interface can receive freight search information, which refers to condition information for searching for a transport demand form input by a user, so that the transport demand form is searched and displayed according to the user input. The freight search interface can be an interface in an application installed on a terminal device, or an interface displayed on the World Wide Web (web), and the present disclosure does not limit this.

[0059] Furthermore, the freight search information may include departure information and destination information.

[0060] The departure place information refers to the address information of the vehicle loading indicated by the user. The departure place information can be one or more, that is, the driver can fill in one or more departure places. The departure place information can also be a province, city, or district.

[0061] The destination information refers to the address information of the vehicle unloading indicated by the user. The destination information can be one or more, that is, the user can fill in one or more destinations. The destination information can also be a province, city, or district.

[0062] Furthermore, the freight search information may also include at least one of the following: vehicle information, search load-bearing range, cargo category information, and vehicle type, etc.

[0063] The vehicle information refers to relevant information of the vehicle to be used to transport the goods indicated by the transportation demand. The vehicle information may include the search vehicle length and / or the search vehicle model. The search vehicle model may be vehicle type information, for example, the search vehicle model may be the model of the vehicle. Since there may be multiple vehicle lengths for the same model of vehicle, the vehicle information also includes the search vehicle length, so as to distinguish different vehicle types.

[0064] The search load-bearing range refers to the range of load that the current first user's vehicle can carry.

[0065] The cargo category information refers to the type of cargo to be transported. The packaging method refers to the packaging method of the cargo to be transported during transportation. For example, the packaging method may be bulk, carton packaging, foam box packaging, or basket packaging.

[0066] The vehicle type can be a full truckload or less-than-load. A full truckload means that the entire vehicle is required for transportation. Less-than-load means that part of the vehicle can be used for transportation, for example, you can share a vehicle with other people for transportation.

[0067] Step 202: After receiving the search operation on the freight search interface, the terminal device sends a freight search request to the server.

[0068] The freight search request includes freight search information.

[0069] Usually, the freight request interface also has a search control, that is, after the user enters the freight search information, he can click the search control to confirm the search, and the terminal device sends the freight search request to the server. After the server completes the search, it sends the search results to the terminal device, and the corresponding search results can be displayed on the freight search interface of the terminal device. The user can select the transportation demand form in the screening results to complete the transportation order.

[0070] Step 203: In response to the freight search request, the server performs a recall operation on all current transport demand orders based on the freight search information and the information of the first user corresponding to the terminal device to obtain the recalled transport demand orders.

[0071] The information of the first user may refer to a user name and a password.

[0072] Before the terminal device operates the freight search interface, it is usually necessary to log in, wherein the terminal device logs in as the first user. After receiving the search operation, the terminal device can carry the first user's information in the freight search request and send it to the server; the terminal device can also send the received first user's information to the server before the user operates the freight search interface, and the server will match the terminal device with the first user's information. After that, when the server receives the freight search request sent by the terminal device, it will automatically associate the freight search request with the first user's information.

[0073] Among them, all current transportation demand orders refer to the transportation demands proposed by the current cargo owner and have not been accepted by any user.

[0074] The recall operation refers to the operation of filtering all current transport demand orders according to different search conditions to obtain the filtering results.

[0075] Since the freight search information for each user or each time the user searches may be different, the server may perform a recall operation on all current transport demand orders according to the freight search information and the information of the first user to obtain the recalled transport demand orders.

[0076] Step 204: The server sorts the recalled transport demand orders based on the degree to which each recalled transport demand order meets the expectations of the first user and the generalization degree information of each recalled transport demand order to obtain a screening result.

[0077] The information on the degree to which the recalled transport demand form meets the expectations of the first user refers to the degree to which the first user is expected to be willing to click on and place an order when the recalled transport demand form is displayed to the first user for viewing.

[0078] The generalization degree information of the recalled transport demand form is used to indicate the degree to which the recalled transport demand form does not meet the search condition input by the first user.

[0079] Furthermore, the types of transport demand orders can be divided into precise recall types and generalized recall types. The precise recall type refers to a transport demand order whose search conditions meet the freight search information input by the user. The generalized recall type refers to a transport demand order whose search conditions partially meet the freight search information input by the user. It should be noted that for a precise recall type of transport demand order, its generalization degree information may be completely consistent with the search conditions input by the first user, that is, its generalization degree is zero.

[0080] Among them, all current transportation demand orders refer to the transportation demands proposed by the current cargo owner and have not been accepted by any user.

[0081] Since each time a user searches, the user may only browse a portion of the previously displayed transport demand orders from the front to the back for the screening results displayed on the terminal device, it is necessary to sort the recalled transport demand orders and put the transport demand orders that better meet the user's expectations at the front. The server sorts the recalled transport demand orders based on the degree information of each recalled transport demand order meeting the first user's expectations and the generalization degree information of each recalled transport demand order, so as to obtain a screening result that better meets the user's expectations.

[0082] Step 205: The server sends the screening result to the terminal device.

[0083] Step 206: The terminal device displays the screening results.

[0084] The terminal device can display the filter results in the freight search interface according to the server sorting; it can also jump from the freight search interface to the filter result display interface to display the filter results in the server sorting.

[0085] In this embodiment, the terminal device receives freight search information input by the user in the freight search interface, and after receiving the search operation in the freight search interface, sends a freight search request carrying the freight search information to the server. In response to the freight search request, the server performs a recall operation on all current transport demand orders according to the freight search information and the information of the first user corresponding to the terminal device, and obtains the recalled transport demand orders; based on the degree information of each recalled transport demand order meeting the expectations of the first user, and the generalization degree information of each recalled transport demand order, the recalled transport demand orders are sorted to obtain the screening results. The server sends the screening results to the terminal device, and the terminal device displays the screening results. If the recalled transport demand orders are more in line with the driver's expectations, the driver will be more inclined to click on and complete the order. The different degrees of generalization of the recalled transport demand orders will also affect the driver's click and completion of the order. Therefore, according to the degree to which different recalled transport demand orders meet the driver's expectations and the generalization degree information of each recalled transport demand order, the freight screening results displayed to the driver are personalized. The driver can quickly find satisfactory transportation needs, which improves the driver's order acceptance efficiency, thereby improving the efficiency of shippers and drivers in completing orders and improving the user experience.

[0086] In some embodiments, the types of recalled transport demand orders include: precise recall type and generalized recall type. Step 204 may include the following steps 2041 to 2047.

[0087] Step 2041: The server obtains the first score of each recalled transportation demand order.

[0088] Step 2042: The server uses the first score of the recalled transportation demand order as information on the degree to which the recalled transportation demand order meets the expectations of the first user.

[0089] The first score of the recalled transport demand order is used to indicate the degree to which the recalled transport demand order meets the expectations of the first user. The higher the first score, the higher the degree to which the recalled transport demand order meets the expectations of the first user. On the contrary, the lower the first score, the lower the degree to which the recalled transport demand order meets the expectations of the first user.

[0090] Exemplarily, the server can score each recalled transport demand order through a scoring model, where the scoring model is used to score the transport demand order according to the degree to which it meets the user's expectations. All the transport demand orders obtained above can be input into the scoring model to obtain the first score of the recalled transport demand order.

[0091] Step 2043: The server sorts the recalled transport demand orders of the precise recall type in descending order of the first scores to obtain a precise sequence.

[0092] Among them, the recalled transportation demand order in the precise sequence is the first element.

[0093] Step 2044: The server sorts the recalled transport demand orders of the generalized recall type in descending order of the first scores to obtain a generalized sequence.

[0094] Among them, the recalled transportation demand order in the generalized sequence is the second element.

[0095] It should be noted that there is no order in which step 2043 and step 2044 are executed. For example, step 2043 may be executed first, and then step 2044; step 2044 may be executed first, and then step 2043; and step 2043 and step 2044 may be executed simultaneously. The present disclosure does not limit the order in which step 2043 and step 2044 are executed.

[0096] Step 2045: The server determines whether the number of recalled transport demand orders of the precise recall type is greater than or equal to a first threshold.

[0097] The first threshold is a preset integer greater than 1.

[0098] If so, continue to step 2046; if not, continue to step 2047.

[0099] Step 2046: Based on the first scores of each first element and each second element and the generalization degree information of each second element, the server inserts the second elements in the generalized sequence into the precise sequence to obtain a screening result.

[0100] In this embodiment, the server determines whether the number of recalled transport demand orders of precise recall type is greater than or equal to the first threshold value. If the number of recalled transport demand orders of precise recall type is greater than or equal to the first threshold value, it means that the number of recalled transport demand orders of precise recall type is large, and the recalled transport demand orders of generalized recall type can be inserted into the precise sequence. If the recalled transport demand order is more in line with the driver's expectations, the driver is more inclined to click and complete the order. The different generalization levels of the recalled transport demand orders will also affect the driver's click and completion of the order. Therefore, according to the degree to which different recalled transport demand orders meet the driver's expectations and the generalization level information of each recalled transport demand order, the freight screening results displayed to the driver are personalized, and the driver can quickly find satisfactory transportation needs, which improves the driver's efficiency in accepting orders, thereby improving the efficiency of the shipper and the driver in reaching an order, and improving the user experience.

[0101] Step 2047: The server arranges the generalized sequence after the precise sequence to obtain the screening result.

[0102] In this embodiment, if the number of recalled transport demand orders of precise recall type is less than the first threshold, it means that the number of recalled transport demand orders of precise recall type is small, and the server may not insert the recalled transport demand orders of generalized recall type into the precise sequence, but put the precise sequence at the front to display it to the user. The driver can quickly find satisfactory transportation needs, which improves the efficiency of the driver's order acceptance, thereby improving the efficiency of the shipper and the driver in reaching an order and improving the user experience.

[0103] In some embodiments, step 2046 can be implemented by the following steps 20461-20469, steps 2046a-2046i and step 204610.

[0104] Among them, the server performs the following insertion processing of steps 20461 to 20469 on the first R first elements in the precise sequence.

[0105] Step 20461: The server obtains N first elements according to the window function.

[0106] The parameter of the window function is N, which is an integer greater than 1. For example, N can be 5 or 7, etc., which is not limited in the present disclosure. Assuming that N is 5, according to the window function, 5 consecutive first elements are obtained each time from the beginning of the precise sequence, the first time the 1st to 5th first elements are obtained, the second time the 6th to 10th first elements are obtained, and so on.

[0107] Step 20462: The server obtains a second element that has not been inserted into the precise sequence and has the highest first score as the first element to be inserted.

[0108] Step 20463: The server determines whether the generalization degree information of the first element to be inserted meets the generalization degree control condition, and whether the first score of the first element to be inserted is greater than the minimum value of the first scores of the N first elements.

[0109] If so, continue to step 20464; if not, continue to step 20465.

[0110] The generalization degree control condition is a condition for inserting the second element into the precise sequence, which is set based on the position where the second element will be inserted into the precise sequence and the generalization degree information of the second element. In this embodiment, the generalization degree control condition refers to a condition for inserting the first element to be inserted into the precise sequence, which is set based on the position where the first element to be inserted into the precise sequence and the generalization degree information of the first element to be inserted.

[0111] Step 20464: The server inserts the first element to be inserted into the N first elements. The process continues with step 20467.

[0112] Step 20465: The server determines whether there is a second element in the generalization sequence that meets the following first condition: the generalization degree information meets the generalization degree control condition, and the first score is greater than the minimum value of the first scores of the N first elements.

[0113] If so, continue to step 20466; if not, continue to step 20467.

[0114] Step 20466: The server obtains the second element with the largest first score that meets the first condition, and inserts it into the precise sequence. Then, step 20467 is executed.

[0115] Wherein, R is an integer greater than N. Usually, R is set to be an integer greater than N. If R is less than N, the following steps 2046a to 2046g can be used for processing.

[0116] Step 20467: The server determines whether the processing of the first R first elements in the precise sequence is completed.

[0117] If so, continue to execute step 20468; if not, return to execute step 20469.

[0118] Step 20468: The server obtains the first shuffle sequence.

[0119] Step 20469: The server obtains the next N first elements in the precise sequence according to the window function, and returns to execute step 20462.

[0120] In this embodiment, the server processes the first R first elements in the precise sequence: the server obtains N first elements according to the window function. From the generalized sequence, a second element that is not currently inserted into the precise sequence and has the highest first score is obtained as the first element to be inserted. It is determined whether the generalization degree information of the first element to be inserted meets the generalization degree control condition, and the first score of the first element to be inserted is greater than the minimum value among the first scores of the N first elements. If the generalization degree information of the first element to be inserted meets the generalization degree control condition, and the first score of the first element to be inserted is greater than the minimum value among the first scores of the N first elements, the first element to be inserted is inserted before the first element to be inserted in the N first elements whose first score is less than the first element to be inserted. If the generalization degree information of the first element to be inserted does not meet the generalization degree control condition, or the first score of the first element to be inserted is less than or equal to the minimum value among the first scores of the N first elements, the first element to be inserted is not inserted into the N first elements. It is possible to continue to obtain whether there is a second element in the generalization sequence that meets the following first condition: the generalization degree information meets the generalization degree control condition, and the first score is greater than the minimum value of the first scores of the N first elements. If there is, then obtain the second element with the largest first score from the second elements that meet the first condition, and insert it into the N first elements. Continue to perform the insertion process on the next window.

[0121] Exemplarily, assuming that R is 100 and the parameter N of the window function is 5, first obtain the first 5 first elements in the precise sequence for insertion processing: obtain the first second element in the generalized sequence that is not inserted into the precise sequence, and determine whether the generalization degree information of the second element meets the generalization degree control conditions respectively.

[0122] If the generalization degree information of the second element does not meet the generalization degree control condition, the second element is not inserted into the first five first elements.

[0123] Furthermore, it is possible to continue to obtain whether there is a second element in the generalization sequence that meets the following first condition: the generalization degree information meets the generalization degree control condition, and the first score is greater than the minimum value of the first scores of the N first elements. If there is, then the second element with the largest first score is obtained from the second elements that meet the first condition, and inserted into the first 5 first elements.

[0124] If the generalization degree information of the second element meets the generalization degree control condition, it is determined whether the first score of the second element is greater than the minimum value of the first scores of the first five first elements, and the second element can be inserted into the first five first elements according to the first scores of the second element and the first five first elements. During the insertion process, the second element is inserted before the first element of the first five first elements whose first score is less than the second element, and after the first element of the first five first elements whose first score is greater than the second element, so that the arrangement order of the first five first elements and the second element after insertion is arranged from high to low according to the scores.

[0125] The server performs the following insertion processing of steps 2046a to 2046i on the first element after the Rth element in the precise sequence.

[0126] Step 2046a: The server obtains the first element of the first preset interval in the preset interval division method according to the preset interval division method.

[0127] The preset interval division method refers to: dividing the first element after the Rth first element in the precise sequence according to the preset interval, and obtaining the second elements of a preset interval each time.

[0128] Exemplarily, the preset interval division method can be set as: the (R+1)th to Ath first elements are the first preset interval, where A is an integer greater than (R+1); the (A+1)th to Bth first elements are the second preset interval, and so on. The corresponding intervals can be preset, where B is an integer.

[0129] Step 2046b: The server obtains the second element that is not currently inserted into the precise sequence and is ranked in the first K as the second element to be inserted.

[0130] Wherein, K is an integer greater than 0.

[0131] From the generalized sequence, obtain the second elements that are not currently inserted into the precise sequence and are ranked in the first K as the second elements to be inserted, that is, in the generalized sequence that is not currently inserted into the precise sequence, obtain the K second elements with the highest first scores.

[0132] Step 2046c: The server determines whether the generalization degree information of the second element to be inserted meets the generalization degree control condition, and whether the first score of the second element to be inserted is greater than the minimum value of the first scores of the first elements in the first preset interval.

[0133] If so, proceed to step 2046d; if not, proceed to step 2046e.

[0134] In this embodiment, the generalization degree control condition refers to a condition for inserting the second element to be inserted into the precise sequence, which is set according to the position where the second element to be inserted will be inserted into the precise sequence and the generalization degree information of the second element to be inserted.

[0135] Step 2046d: The server inserts the second element to be inserted into the first element of the first preset interval. Then, step 2046g is executed.

[0136] Step 2046e: The server determines whether there is a second element in the generalization sequence that meets the following second condition: the generalization degree information meets the generalization degree control condition, and the first score is greater than the minimum value of the first scores of the N first elements.

[0137] If so, proceed to step 2046f; if not, proceed to step 2046g.

[0138] Step 2046f: The server obtains no more than K second elements with the largest first scores among the second elements that meet the second condition, and inserts them into the precise sequence. Then, proceed to step 2046g.

[0139] Step 2046g: The server determines whether the processing of the first element after the Rth one in the precise sequence is completed.

[0140] If yes, continue to execute step 2046h; if no, return to execute step 2046i.

[0141] Step 2046h: The server obtains a second shuffled sequence.

[0142] Step 2046i: The server obtains the first element of the next preset interval according to the preset interval division method. Then proceed to step 2046b.

[0143] In this embodiment, the server has already inserted the first R first elements in the precise sequence, and the server then inserts the first element after the Rth in the precise sequence: the server obtains the first element of the first preset interval in the preset interval division method according to the preset interval division method. From the generalized sequence, obtain the second element that is not currently inserted into the precise sequence and ranks in the first K as the second element to be inserted. Determine whether the generalization degree information of the second element to be inserted meets the generalization degree control condition, and whether the first score of the second element to be inserted is greater than the minimum value of the first score of the first element of the first preset interval.

[0144] If the generalization degree information of the second element to be inserted meets the generalization degree control condition, and the first score of the second element to be inserted is greater than the minimum value of the first score of the first element in the first preset interval, it means that the generalization degree of the current second element to be inserted meets the requirements, and the first score of the current second element to be inserted is higher, then the second element to be inserted is inserted into the first element of the first preset interval.

[0145] If the generalization degree information of the second element to be inserted does not meet the generalization degree control condition, or the first score of the second element to be inserted is less than or equal to the minimum value of the first score of the first element in the first preset interval, it means that the generalization degree of the current second element to be inserted may be too high and does not meet the requirements, or the first score of the current second element to be inserted is low, which is lower than the first score of all the first elements in the first preset interval. For the user, the expectation of the second element to be inserted is not high, and the second element to be inserted is not inserted into the first element in the first preset interval. It can continue to determine whether there is a second element that meets the following second condition in the generalization sequence: the generalization degree information meets the generalization degree control condition, and the first score is greater than the minimum value of the first scores of N first elements. If there is, from the second elements that meet the second condition, obtain the K second elements with the largest first scores and insert them into the precise sequence, wherein, if the second elements that meet the second condition are less than K, obtain all the second elements that meet the second condition and insert them into the precise sequence. Continue to insert the first element of the next preset interval.

[0146] Exemplarily, assuming that R is 100, the first preset interval is the 20 first elements after R, and K is 2. First, the 101st to 121st first elements in the precise sequence are inserted: the first two second elements in the generalized sequence that are not inserted into the precise sequence are obtained, and it is determined whether the generalization degree information of the two second elements meets the generalization degree control conditions respectively.

[0147] If the generalization degree information of the second element among the two second elements does not meet the generalization degree control condition, the second element that does not meet the generalization degree control condition will not be inserted into the 101-121st first elements. It can continue to be judged whether there is a second element in the generalization sequence that meets the generalization degree information and meets the generalization degree control condition, and the first score is greater than the minimum value of the first scores of the N first elements. If there are two or more second elements that meet the second condition, obtain the two second elements with the largest first scores that meet the second condition and insert them into the 101-121st first elements. If there is one second element that meets the second condition, obtain the second element that meets the second condition and insert it into the 101-121st first elements.

[0148] If the generalization degree information exists in the two second elements and meets the generalization degree control condition, then it is determined whether the first score of the second element that meets the generalization degree control condition is greater than the minimum value of the first scores of the 101-121st first elements. Then, the second element can be inserted into the 101-121st first elements according to the first scores of the second element and the 101-121st first elements.

[0149] It should be noted that usually, after the execution of steps 20461 to 20469 is completed, steps 2046a to 2046i are executed. After the execution of step 2046i is completed, step 204610 is executed.

[0150] Step 204610: The server sequentially arranges the first shuffled sequence, the second shuffled sequence, and the generalized sequence except the inserted precise sequence to obtain a screening result.

[0151] In this embodiment, the first shuffled sequence with the highest first score is arranged at the front, followed by the second shuffled sequence, and then the second elements except the elements in the first shuffled sequence and the second shuffled sequence are arranged from high to low according to the first score.

[0152] This embodiment provides a specific process in which the server inserts the second element in the generalized sequence into the precise sequence based on the first score of each first element and each second element, and the generalization degree information of each second element, to obtain the screening result, and comprehensively considers the situation of inserting the second element and the first element in the precise sequence, so that the obtained screening result is more in line with the user's expectations. Drivers are more inclined to click and complete the order. The different generalization degrees of the recalled transport demand orders will also affect the driver's click and complete the order. Therefore, according to the degree to which different recalled transport demand orders meet the driver's expectations and the generalization degree information of each recalled transport demand order, the freight screening results displayed to the driver are personalized, and the driver can quickly find satisfactory transportation needs, which improves the driver's efficiency in accepting orders, thereby improving the efficiency of the shipper and the driver in completing the order, and improving the user experience.

[0153] In some embodiments, the generalization degree information of the second element in the generalization sequence may be obtained through the total generalization score and / or the starting generalization score of the second element in the generalization sequence, which is described in detail below with specific embodiments.

[0154] On the basis of any of the above embodiments, further, the method provided in this embodiment also includes the following steps 207 and 208.

[0155] Step 207: The server obtains the total generalization score and / or the generalization score of the departure place of the second element in the generalization sequence.

[0156] The total generalization score of the second element in the generalization sequence is used to indicate the comprehensive generalization degree of the second element in the generalization sequence.

[0157] The generalization score of the departure place of the second element in the generalization sequence is used to indicate the generalization degree of the departure place of the second element in the generalization sequence.

[0158] Step 208: The server uses the total generalization score and / or the departure place generalization score of the second element in the generalization sequence as generalization degree information of the second element in the generalization sequence.

[0159] In this embodiment, since the departure place information is something that the user must fill in during the search process, and the loading location information in the transport demand form has a greater impact on the user's selection of the transport demand form, for each second element, the corresponding departure place generalization score and generalization total score are obtained as the generalization degree information of the second element.

[0160] In some embodiments, the freight search information generally includes departure information and destination information. The transport demand list generally includes loading location information, unloading location information, cargo weight, cargo volume, required vehicle model and required vehicle length. Step 207 can be implemented through the following steps 2071-2073.

[0161] Step 2071: The server determines the generalized score of the departure place of the second element according to the departure place information in the freight search information and the loading place information in the second element.

[0162] For the departure place information in the freight search information, in a possible implementation, the departure place information in the freight search information may be a departure location, and the user may fill in one or more departure locations, for example, the user may fill in up to 3 departure locations. The departure location is usually in the province / city / district dimension, and step 2071 may be implemented by the following steps 20711-20716.

[0163] Step 20711: The server determines the coordinate location of the departure point based on the departure point information.

[0164] The coordinate position of the departure place can be expressed by the longitude and latitude of the departure place. The following description will be made using the coordinate position of the departure place as the longitude and latitude of the departure place.

[0165] If the departure location in the freight search information is in the province dimension, the longitude and latitude of the provincial administrative center can be taken as the longitude and latitude of the departure location; if the departure location in the freight search information is in the city / district dimension, the longitude and latitude of the city / district administrative center can be taken as the longitude and latitude of the departure location.

[0166] Step 20712: The server obtains the first empty driving distance between the coordinate position of the departure place and the coordinate position of the loading place in the transportation demand list.

[0167] Exemplarily, the unit of the first idle driving distance may be km.

[0168] It should be noted that if there are multiple departure locations in the freight search information, the distance between the coordinate position of each departure location and the coordinate position of the loading location in the transportation demand list is calculated, and the smallest distance is taken as the first empty driving distance. If the coordinate position is expressed in longitude and latitude, the distance between the longitude and latitude of each departure location and the longitude and latitude of the loading location in the transportation demand list is calculated, and the smallest distance is taken as the first empty driving distance.

[0169] Step 20713: The server obtains the transportation distance between the loading point and the unloading point in the transportation demand sheet.

[0170] For example, the unit of the transport distance may be km.

[0171] Step 20714: The server obtains the upper limit of the generalized distance of the departure point.

[0172] Furthermore, the upper limit of the generalized distance of the departure point can be obtained by the following formula (1).

[0173] Upper limit of generalized distance of departure place = min{transportation distance*10%+10km,200km} Formula (1)

[0174] Step 20715: The server determines the generalized score of the departure point according to the first empty driving distance and the upper limit of the generalized distance of the departure point.

[0175] Furthermore, the generalized score of the departure place can be obtained by the following formula (2).

[0176] x1= D / Generalized distance upper limit formula of departure place (2)

[0177] Among them, x1 is the generalized score of the departure point, and D is the first empty driving distance.

[0178] In another possible implementation, the departure place information in the freight search information may be a departure search vicinity range. The departure search vicinity range refers to a range within a certain range around the departure place as the departure place. For example, the departure search vicinity range may be 20km, 50km, 100km or 200km around the departure place. Then step 2071 may be implemented as follows:

[0179] The server may determine a generalization level of the departure place search in the transport demand sheet according to the departure place search range in the freight search information and the loading place information in the transport demand sheet.

[0180] Further, step 2071 can be implemented through the following steps 2071a-2071b.

[0181] Step 2071a: The server obtains a second empty driving distance between the coordinate position of the departure place and the coordinate position of the loading place in the transportation demand list.

[0182] If the coordinate position is longitude and latitude, the second empty driving distance between the longitude and latitude of the departure place and the longitude and latitude of the loading place in the transportation demand list is obtained.

[0183] Step 2071a is similar to the above step 20712. The latitude and longitude of the departure place refers to the latitude and longitude of the departure place location input by the user.

[0184] Step 2071b: The server determines a generalization degree value of the search near the departure place according to the second empty driving distance and the search near the departure place.

[0185] Furthermore, the generalization score of the search near the initial departure point can be obtained by the following formula (3).

[0186] x3=D / driver search generalization distance numerical formula (3)

[0187] Among them, x3 is the generalization score of the search near the initial departure point, and D is the second empty driving distance.

[0188] If the search range near the departure point is 20km, and the second empty driving distance D <= 50km, the search range near the departure point is generalized as min{2.0, x3};

[0189] If the search range near the departure point is 200km, and the second empty driving distance D>250km, the generalization score of the search near the departure point is 3.0;

[0190] In all cases other than the above, the search near the departure place is generalized to x3.

[0191] Step 2072: The server obtains the generalized scores corresponding to each piece of information in the second element except the loading location information.

[0192] For the destination information included in the freight search information, the destination generalization score of the transport demand sheet may be determined according to the destination information in the freight search information and the unloading place information in the transport demand sheet.

[0193] For the destination information in the freight search information, in a possible implementation, the destination information in the freight search information includes a destination point, and the user can fill in one or more destination points. For example, the user can fill in up to 5 destination points. The destination point is usually a province / city / district dimension, wherein if the dimension of the destination point is nationwide, the destination generalization degree value may not be calculated. The server may determine the destination generalization score of the transport demand order through the following steps 11 to 15.

[0194] Step 11: The server determines the destination coordinates based on the destination point.

[0195] The destination coordinate position may be represented by the destination longitude and latitude, and the following description will be made using the destination coordinate position as the destination longitude and latitude.

[0196] If the dimension of the destination point in the freight search information is province, the longitude and latitude of the provincial administrative center can be taken as the longitude and latitude of the departure point; if the dimension of the destination point in the freight search information is city / district, the longitude and latitude of the city / district administrative center can be taken as the longitude and latitude of the departure point.

[0197] Step 12: The server determines a third empty driving distance between the coordinate position of the destination and the coordinate position of the unloading place in the transportation demand list.

[0198] If the coordinate position is expressed in longitude and latitude, determine the third empty driving distance between the longitude and latitude of the destination and the longitude and latitude of the unloading place in the transportation demand sheet.

[0199] Exemplarily, the unit of the third idle driving distance may be km.

[0200] It should be noted that if there are multiple destination points in the freight search information, the distances between the longitude and latitude of each destination and the longitude and latitude of the unloading place in the transportation demand list are traversed and calculated, and the shortest distance is taken as the third empty driving distance.

[0201] Step 13: The server obtains the transportation distance between the loading point and the unloading point in the transportation demand list.

[0202] For example, the unit of the transport distance may be km.

[0203] Step 14: The server obtains the upper limit of the generalization distance of the destination.

[0204] Furthermore, the upper limit of the destination generalization distance can be obtained by the following formula (4).

[0205] Destination generalization distance upper limit = transportation distance * 20% + 20km Formula (4)

[0206] Step 15: The server determines a destination generalization degree value according to the third empty driving distance and the upper limit of the destination generalization distance.

[0207] Furthermore, if the dimension of the destination point in the freight search information is a province, and the unloading place in the transport demand sheet belongs to the province, then the generalization degree x2 = 1.0. In other cases, the destination generalization degree value can be obtained by the following formula (5).

[0208] x2 = D / destination generalization distance upper limit formula (5)

[0209] Among them, x2 is the destination generalization degree value, and D is the third empty driving distance.

[0210] In another possible implementation, the destination information includes a destination search range. The destination search range refers to a range within a certain range around the destination as the destination. For example, the destination search range may be within 20 km, 50 km, 100 km, or 200 km of the destination. The server may determine the destination generalization score of the transport demand sheet through the following steps 1a-1b.

[0211] Step 1a: The server obtains a fourth empty driving distance between the coordinate position of the destination and the coordinate position of the unloading place in the transportation demand list.

[0212] If the coordinate position is expressed in longitude and latitude, the fourth empty driving distance between the longitude and latitude of the destination and the longitude and latitude of the unloading place in the transportation demand sheet is obtained.

[0213] Step 1a is similar to the above step 2071a. The longitude and latitude of the destination refers to the longitude and latitude of the destination location input by the user.

[0214] Step 1b: The server determines a generalization degree value of the destination search neighborhood according to the fourth empty driving distance and the destination search neighborhood range.

[0215] Furthermore, the generalization degree value of the initial destination search nearby can be obtained by the following formula (6).

[0216] x4=D / driver search generalization distance numerical formula (6)

[0217] Among them, x4 is the generalization degree value of the initial destination search vicinity, and D is the fourth empty driving distance.

[0218] If the destination search vicinity range is 20 km, and the fourth empty driving distance D<=50 km, then the destination search vicinity generalization degree value is min{2.0, x4}.

[0219] If the destination search vicinity range is 200km, and the fourth empty driving distance D>250km, the destination search vicinity generalization degree value is 3.0.

[0220] In all cases other than the above, the generalization value of the destination search nearby is x4.

[0221] If the freight search information includes vehicle information.

[0222] In some embodiments, the vehicle information may include one or more searched vehicle lengths, and the vehicle length generalization score may be determined based on the searched vehicle lengths. In addition, the transport demand sheet may also include one or more required vehicle lengths. The vehicle length generalization score may be determined based on the searched vehicle lengths and the required vehicle lengths in the transport demand sheet.

[0223] In a possible implementation, the vehicle length generalization score can be obtained through the following steps 21 to 24.

[0224] Step 21, the server determines the maximum value of the searched vehicle lengths in the freight search information as the maximum searched vehicle length; and determines the minimum value of the searched vehicle lengths in the freight search information as the minimum searched vehicle length.

[0225] Step 22: The server determines the maximum value of the required vehicle lengths in the transport demand list as the maximum required vehicle length, and determines the minimum value of the required vehicle lengths in the transport demand list as the minimum required vehicle length.

[0226] Step 23: The server determines the generalization score of the initial vehicle length according to the maximum search vehicle length, the minimum search vehicle length, the maximum required vehicle length and the minimum required vehicle length.

[0227] Furthermore, the initial vehicle length generalization score can be obtained by the following formula (7).

[0228] z = max{z1,z2} Formula (7)

[0229] z1 = minimum vehicle length required / maximum vehicle length searched;

[0230] z2 = search minimum vehicle length / required maximum vehicle length;

[0231] Among them, z is the generalization score of the initial vehicle length.

[0232] Step 24: The server obtains a generalized score of the vehicle length according to the first user's historical freight search request, the historically viewed transportation demand orders, the historically completed transportation demand orders, and the initial vehicle length generalized score.

[0233] The largest number of N vehicle lengths among the vehicle lengths in the first user's historical freight search requests, the vehicle lengths in the historically viewed transport demand orders, and the vehicle lengths in the historically completed transport demand orders are obtained. N is an integer greater than 0, for example, N may be 3.

[0234] Furthermore, the initial vehicle length generalization score can be adjusted in the following way to obtain the vehicle length generalization score:

[0235] If the freight search information searched by the first user includes the search for vehicle length, the initial vehicle length generalization score z>1.0, and the required vehicle length in the transportation demand order does not belong to the above N types of vehicle lengths, then the vehicle length generalization score is max{2.5, z}.

[0236] If the freight search information searched by the first user includes the search for vehicle length, and the initial vehicle length generalization score z>1.0, and the required vehicle length in the transport demand form belongs to the above N types of vehicle lengths, then the vehicle length generalization score is z.

[0237] If the freight search information searched by the first user includes searching for vehicle length, and the initial vehicle length generalization score z<=1.0, then the vehicle length generalization score is z.

[0238] If the freight search information searched by the first user does not include the search vehicle length, and the required vehicle length in the transport demand form belongs to the above N types of vehicle lengths, the generalization score of the vehicle length is 0.0.

[0239] The freight search information searched by the first user does not include the search vehicle length, and the required vehicle length in the transport demand form belongs to the above N types of vehicle lengths, then the generalization score of the vehicle length is 2.5.

[0240] In another possible implementation, the vehicle length generalization score can be obtained through the following steps 2a to 2f.

[0241] Step 2a, the server obtains the M types of vehicle lengths with the largest number from among the vehicle lengths in the first user's historical freight search requests, the vehicle lengths in the historically viewed transportation demand orders, and the vehicle lengths in the transportation demand orders of historically completed orders.

[0242] Here, M is an integer greater than 0, for example, M may be 5.

[0243] Step 2b: determine whether the required vehicle length in the transport demand sheet meets the searched vehicle length in the freight search information, or whether the required vehicle length in the transport demand sheet meets one of the M types of vehicle lengths.

[0244] If yes, proceed to step 2c; if no, proceed to step 2d.

[0245] Step 2c: Determine that the generalization score of the vehicle length is 0.

[0246] Step 2d: determine whether the required vehicle length in the transport demand sheet does not match the searched vehicle length in the freight search information, and whether the required vehicle length in the transport demand sheet does not match any of the M types of vehicle lengths.

[0247] If yes, proceed to step 2e; if no, proceed to step 2f.

[0248] Step 2e: Determine the generalization of vehicle length into 2.

[0249] It should be noted that if the first user does not search for the vehicle length, that is, the vehicle length is not searched in the freight search information, it is determined whether the required vehicle length in the transport demand sheet meets any of the M types of vehicle lengths.

[0250] Step 2f: Determine that the generalization score of the vehicle length is 0.

[0251] Furthermore, the vehicle information may include one or more searched vehicle models, and the vehicle model generalization score may be determined based on the searched vehicle models. In addition, the transport demand sheet may also include one or more required vehicle models. The vehicle model generalization score is determined based on the searched vehicle models and the required vehicle models in the transport demand sheet.

[0252] In a possible implementation, the server may determine the vehicle type generalization score through the following steps 31 to 38.

[0253] Step 31: The server obtains the M largest number of vehicle models from among the vehicle models in the first user's historical freight search request, the vehicle models in the historically viewed transportation demand orders, and the vehicle models in the transportation demand orders of historically completed orders.

[0254] Wherein, M is an integer greater than 0.

[0255] Step 32: The server determines whether the searched vehicle model is the same as the required vehicle model in the transportation demand form.

[0256] If yes, continue to step 33; if no, continue to step 36.

[0257] Step 33: The server determines whether the required vehicle type in the transportation demand form belongs to the above-mentioned M types of vehicle types.

[0258] If yes, proceed to step 34; if no, proceed to step 35.

[0259] Step 34: The server determines that the vehicle type generalization score is a first value.

[0260] Exemplarily, the first value may be 0.

[0261] Step 35: The server determines that the vehicle type generalization score is a second value.

[0262] The second value is greater than the first value.

[0263] Exemplarily, the second value may be 0.1.

[0264] Step 36: The server determines whether the required vehicle type in the transportation demand form belongs to the above-mentioned M types of vehicle types.

[0265] If yes, proceed to step 37; if no, proceed to step 38.

[0266] Step 37: The server determines that the vehicle type generalization score is a third value.

[0267] The third value is greater than the second value.

[0268] Exemplarily, the third value may be 0.5.

[0269] Step 38: The server determines that the vehicle type generalization score is a fourth value. Then, step 39 is executed.

[0270] The fourth value is greater than the third value.

[0271] Exemplarily, the fourth value may be 2.

[0272] In another possible implementation, the server may determine the vehicle model generalization score through the following steps 3a to 3f.

[0273] Step 3a: The server obtains the M largest number of vehicle models from among the vehicle models in the first user's historical freight search request, the vehicle models in the historically viewed transportation demand orders, and the vehicle models in the historically completed orders.

[0274] Here, M is an integer greater than 0, for example, M may be 5.

[0275] Step 3b: determine whether the required vehicle model in the transport demand sheet matches the search vehicle model in the freight search information, or whether the required vehicle model in the transport demand sheet matches one of the M vehicle models.

[0276] If yes, proceed to step 3c; if no, proceed to step 3d.

[0277] Step 3c: Determine that the vehicle type generalization score is 0.

[0278] Step 3d: determine whether the required vehicle model in the transport demand sheet does not match the search vehicle model in the freight search information, and whether the required vehicle model in the transport demand sheet does not match one of the M vehicle models.

[0279] If yes, proceed to step 3e; if no, proceed to step 3f.

[0280] Step 3e: Determine the generalization of vehicle models into 2.

[0281] It should be noted that if the first user does not search for a vehicle model, that is, there is no search vehicle model in the freight search information, then it is determined whether the required vehicle model in the transportation demand form meets any one of the M vehicle models.

[0282] Step 3f: Determine that the vehicle type generalization score is 0.

[0283] In some embodiments, if the freight search information includes a search for a load-bearing range, the server may determine a load-bearing generalization score based on the search for the load-bearing range. The server may determine the load-bearing generalization score based on the search for the load-bearing range and the required load-bearing range in the transport demand sheet.

[0284] Further, the server may determine the load-bearing generalization score through the following steps 41 to 43.

[0285] Step 41: The server obtains the maximum value in the search load-bearing range as the search maximum load-bearing value.

[0286] Step 42: The server obtains the minimum value in the required load-bearing range in the transport demand form as the required minimum load-bearing.

[0287] Step 43: The server obtains the ratio of the required minimum load-bearing capacity to the searched maximum load-bearing capacity as the load-bearing generalization score.

[0288] Step 2073: The server obtains the total generalization score of the second element according to the generalization scores corresponding to all the information in the second element.

[0289] In this embodiment, there are many specific ways to obtain the generalization total score, which is not limited in this disclosure. For example, the generalization scores corresponding to all the information in the second element can be summed to obtain the generalization total score of the second element. The generalization scores corresponding to all the information in the second element can also be weighted summed to obtain the generalization total score of the second element.

[0290] In this embodiment, the generalization degree information of the transport demand form is obtained according to the generalization between the freight search information and the freight demand information in the transport demand form.

[0291] In some embodiments, after determining the generalized total score and / or the generalized score of the departure place of the second element, the server can determine whether the second element meets the generalized degree control condition according to whether the generalized total score and / or the generalized score of the departure place of the second element meets the generalized degree control condition. This is described in detail below with specific embodiments.

[0292] Furthermore, the determination in step 20463 of whether the generalization degree information of the first element to be inserted meets the generalization degree control condition, and the determination in step 2046c of whether the generalization degree information of the second element to be inserted meets the generalization degree control condition can both be determined in the following manner.

[0293] For the second element in the generalization sequence, the server determines that the generalization degree information of the second element in the generalization sequence meets the generalization degree control condition in the following manner:

[0294] When performing the insertion process, for the first Z1 first elements in the precise sequence, if the total generalization score of the second element in the generalized sequence is less than or equal to the first total score threshold, and the generalization score of the departure place of the second element in the generalized sequence is less than or equal to the first departure place threshold, it is determined that the generalization degree information of the second element in the generalized sequence meets the generalization degree control condition.

[0295] Wherein, Z1 is an integer greater than 0 and less than R. Z1 is less than R.

[0296] When performing the insertion process, for the (Z1+1)th to Z2th first elements in the precise sequence, if there is a second element in the generalized sequence whose total generalization score is less than or equal to the second total score threshold, and the second element's place of departure generalization score is less than or equal to the second place of departure threshold, then it is determined that the generalization degree information of the second element meets the generalization degree control condition; the second total score threshold is greater than the first total score threshold; and the second place of departure threshold is greater than the first place of departure threshold.

[0297] Wherein, Z2 is an integer greater than Z1 and less than R.

[0298] When performing the insertion process, for the first element after the Z2th in the precise sequence, if there is a second element in the generalized sequence whose total generalization score is less than or equal to the third total score threshold, and the second element's place of departure generalization score is less than or equal to the third place of departure threshold, then it is determined that the generalization degree information of the second element meets the generalization degree control condition.

[0299] The third total score threshold is greater than the second total score threshold. The third departure place threshold is greater than the second departure place threshold.

[0300] In this embodiment, each second element to be inserted into the precise sequence is processed according to the following three situations.

[0301] In the first case, if the second element is to be inserted into the first Z1 first elements of the precise sequence, the following judgment is made to determine whether the generalization degree information of the second element meets the generalization degree control condition:

[0302] If the total generalization score of the second element in the generalization sequence is less than or equal to the first total score threshold, and the departure place generalization score of the second element in the generalization sequence is less than or equal to the first departure place threshold, it is determined that the generalization degree information of the second element meets the generalization degree control condition.

[0303] If the total generalization score of the second element in the generalization sequence is greater than the first total score threshold, or the departure point generalization score of the second element in the generalization sequence is greater than the first departure point threshold, it is determined that the generalization degree information of the second element does not meet the generalization degree control condition. Generally, for the second element whose generalization degree information does not meet the generalization degree control condition, the precise sequence is not inserted this time.

[0304] In the second case, if the second element is to be inserted into the Z1+1th to Z2th first elements of the precise sequence, the following judgment is made to determine whether the generalization degree information of the second element meets the generalization degree control condition:

[0305] If the second element in the generalization sequence has a total generalization score less than or equal to the third total score threshold, and the second element's departure place generalization score less than or equal to the third departure place threshold, it is determined that the generalization degree information of the second element meets the generalization degree control condition.

[0306] If the second element in the generalization sequence has a total generalization score greater than the third total score threshold, or the second element's departure place generalization score greater than the third departure place threshold, it is determined that the generalization degree information of the second element does not meet the generalization degree control condition. Usually, for the second element whose generalization degree information does not meet the generalization degree control condition, the precise sequence is not inserted this time.

[0307] In the third case, if the second element is to be inserted into the first element after the Z2th element of the precise sequence, the following judgment is made to determine whether the generalization degree information of the second element meets the generalization degree control condition:

[0308] If the second element in the generalization sequence has a total generalization score less than or equal to the third total score threshold, and the second element's departure place generalization score less than or equal to the third departure place threshold, it is determined that the generalization degree information of the second element meets the generalization degree control condition.

[0309] If the second element in the generalization sequence has a total generalization score greater than the third total score threshold, or the second element's departure place generalization score greater than the third departure place threshold, it is determined that the generalization degree information of the second element does not meet the generalization degree control condition. Usually, for the second element whose generalization degree information does not meet the generalization degree control condition, the precise sequence is not inserted this time.

[0310] In this embodiment, the server sets three thresholds corresponding to the generalization total score of the second element, namely, the first total score threshold, the second total score threshold and the third total score threshold. It can be understood that the higher the generalization total score of the second element, the greater the overall generalization degree of the second element. If the second element is about to be inserted into the precise sequence, the closer it is to the front, the lower the generalization total score of the second element. Therefore, the first total score threshold is less than the second total score threshold, and the second total score threshold is less than the third total score threshold. For the second element that is about to be inserted into the first Z1 first elements of the precise sequence, the generalization total score of the second element is controlled by the first total score threshold. For the second element that is about to be inserted into the Z1+1th to Z2th first elements of the precise sequence, the generalization total score of the second element is controlled by the second total score threshold. For the second element that is about to be inserted into the first element after the Z2th in the precise sequence, the generalization total score of the second element is controlled by the third total score threshold.

[0311] The server sets three thresholds for the generalization score of the departure place of the second element, namely, the first departure place threshold, the second departure place threshold and the third departure place threshold. It can be understood that the higher the generalization score of the departure place of the second element, the greater the generalization degree of the departure place of the second element. If the second element is inserted into the precise sequence closer to the front, the generalization score of the departure place of the second element is lower. Therefore, the first departure place threshold is less than the second departure place threshold, and the second departure place threshold is less than the third departure place threshold. For the second element that is about to be inserted into the first Z1 first elements of the precise sequence, the generalization score of the departure place of the second element is controlled by the first departure place threshold. For the second element that is about to be inserted into the first elements from Z1+1 to Z2 of the precise sequence, the generalization score of the departure place of the second element is controlled by the second departure place threshold. For the second element that is about to be inserted into the first elements after Z2 of the precise sequence, the generalization score of the departure place of the second element is controlled by the third departure place threshold.

[0312] Therefore, the server controls the generalization degree information of the second element to be inserted into the precise sequence through the generalization degree control condition. The insertion process is more in line with the driver's expectations, and the freight screening results displayed to the driver are personalized. The driver can quickly find satisfactory transportation needs, which improves the driver's order acceptance efficiency, thereby improving the efficiency of shippers and drivers in reaching orders and improving the user experience.

[0313] In some embodiments, step 203 may be implemented through the following steps 2031 - 2032 .

[0314] Step 2031: The server responds to the freight search request and determines a plurality of recall methods and the recall quantities corresponding to the plurality of recall methods according to the freight search information and the information of the first user corresponding to the terminal device.

[0315] Among them, the recall method refers to searching all current transportation demand orders according to different search conditions to obtain screening results.

[0316] Since the freight search information for each user or each time the user searches may be different, multiple recall methods for searching may be determined based on the freight search information and the information of the first user. For example, one or more recall methods are determined based on the departure information and the destination information; or one or more recall methods are determined based on the departure information, the destination information, and the vehicle information, etc. The present disclosure does not limit the determined recall methods.

[0317] Furthermore, step 2031 can be implemented through the following steps 20311 and 20312.

[0318] Step 20311: The server responds to the freight search request and determines multiple recall methods according to the freight search information and the information of the first user corresponding to the terminal device.

[0319] Step 20312: The server determines the recall quantities corresponding to the multiple recall methods according to the first user's preference information for recall accuracy and / or the first user's preference information for historical search results obtained by the multiple recall methods.

[0320] The recall accuracy refers to the degree to which the recall method meets the original search condition. The preference information of the first user for the recall accuracy refers to the recall accuracy of the recall method preferred by the first user.

[0321] Furthermore, the recall accuracy may include precise recall and generalized recall. Precise recall refers to a recall method in which the search condition meets the freight search information input by the user. Generalized recall refers to a recall method in which the search condition partially meets the freight search information input by the user.

[0322] Furthermore, the first user's preference information for recall accuracy may include the first user's preference score for accurate transportation demand orders. The server may determine the first user's preference score for accurate transportation demand orders based on the historical number of accurate transportation demand orders viewed by the first user and the historical number of accurate transportation demand orders for which the first user has placed orders.

[0323] The above-mentioned precise transportation demand order refers to a transportation demand order with a precise recall accuracy.

[0324] The historical number of precise transportation demand orders viewed by the first user refers to the number of precise transportation demand orders viewed by the first user in previous search processes. Usually, viewing of a transportation demand order is determined by the user clicking on the corresponding transportation demand order.

[0325] The historical number of accurate transportation demand orders for which the first user has completed an order refers to the number of accurate transportation demand orders that the first user has viewed and accepted during previous searches. Usually, accepting an order means that the user confirms to accept the transportation demand order, thereby completing an order.

[0326] The information about the first user's preference for historical search results obtained by multiple recall methods is used to indicate: for each of the multiple recall methods, the first user's preference for the screening results obtained when searching in the past. For example, based on the viewing and transaction status of the screening results obtained by a recall method when searching in the past by the first user, the first user's preference for the historical search results obtained by the recall method can be determined.

[0327] In this embodiment, the server can determine the first user's preference score for precise transportation demand orders by viewing the historical number of precise transportation demand orders viewed by the first user and the historical number of precise transportation demand orders for which the first user has completed orders. The first user's preference score for precise transportation demand orders is used as the first user's preference information for recall accuracy. Subsequently, the recall quantities corresponding to the multiple recall methods are determined based on the first user's preference information for recall accuracy and / or the first user's preference information for historical search results obtained for multiple recall methods. Based on the recall quantities corresponding to the multiple recall methods, the transportation demand orders that meet the conditions of the multiple recall methods are determined from all current transportation demand orders to obtain screening results, thereby personalizing the freight screening results displayed to the driver based on the preferences of different drivers for the recalled transportation demand orders. The driver can quickly find satisfactory transportation needs, which improves the driver's efficiency in accepting orders, thereby improving the efficiency of the shipper and the driver in reaching an order, and improving the user experience.

[0328] Among them, the recall quantity refers to the number of transportation demand orders obtained through the recall method.

[0329] In a possible implementation, the server may determine the recall quantities corresponding to the multiple recall methods according to the first user's preference information for recall accuracy.

[0330] In another possible implementation, the server may also determine the recall quantities corresponding to the multiple recall methods according to the first user's preference information for the historical search results obtained by the multiple recall methods.

[0331] In another possible implementation, the server may determine the recall quantities corresponding to the multiple recall methods according to the first user's preference information for recall accuracy and the first user's preference information for historical search results obtained by the multiple recall methods.

[0332] Step 2032: The server determines part or all of the transportation demand orders corresponding to the multiple recall methods as recalled transportation demand orders based on the number of transportation demand orders corresponding to the multiple recall methods, the cut-off number, and the generalization degree information of the transportation demand orders corresponding to the multiple recall methods.

[0333] Furthermore, step 2032 can be implemented through the following steps 20321 to 20324.

[0334] Step 20321: The server determines a transport demand order that meets the conditions of multiple recall methods from all current transport demand orders based on the recall quantities corresponding to the multiple recall methods.

[0335] Step 20322: determine whether the number of transportation demand orders corresponding to multiple recall methods reaches a cutoff condition, the first user's preference score for accurate transportation demand orders is greater than a second threshold, the number of all current transportation demand orders is greater than or equal to the first number, and there is a transportation demand order with a first generalization level among the transportation demand orders corresponding to multiple recall methods.

[0336] If yes, continue to execute step 20323; if no, continue to execute step 20324.

[0337] The second threshold is a preset value, for example, the second threshold may be 0.8.

[0338] The first number is a preset value.

[0339] Among them, the generalized transportation demand order can determine the generalization level according to the generalization degree. The larger the generalization level, the lower the generalization degree. For example, the first level, the second level and the third level can be set, among which the first level has the largest generalization degree.

[0340] Furthermore, the generalization level corresponding to each category of information of the transport demand form obtained in the above embodiment can be determined by the generalization score corresponding to each category of information of the transport demand form. For example, the generalization score of the category information of the transport demand form can be set to be less than or equal to 1, and the generalization level of the category information of the second element is the third level; the generalization score of the category information of the transport demand form can be set to be greater than 1 and less than or equal to 2, and the generalization level of the category information of the transport demand form is the second level; the generalization score of the category information of the transport demand form can be set to be greater than or equal to 2, and the generalization level of the category information of the transport demand form is the first level. When the generalization level of 3 or more category information is the first level, it means that the generalization degree of the transport demand form is relatively high, and it is considered that the generalization level of the transport demand form is the first level.

[0341] Step 20323, delete some or all of the transportation demand orders of the first generalization level to obtain the screening results.

[0342] Step 20324: Determine the transport demand orders corresponding to the multiple recall methods as the screening results.

[0343] Furthermore, after step 20321, the transport demand orders corresponding to the multiple recall methods may be deduplicated to obtain a deduplicated transport demand order. The transport demand orders corresponding to the multiple recall methods in step 20322 are deduplicated transport demand orders.

[0344] In this embodiment, the terminal device receives the freight search information input by the user in the freight search interface, and after receiving the search operation in the freight search interface, sends a freight search request carrying the freight search information to the server. In response to the freight search request, the server determines multiple recall methods according to the freight search information and the information of the first user corresponding to the terminal device, and determines the recall quantity corresponding to the multiple recall methods according to the first user's preference information for recall accuracy and / or the first user's preference information for the historical search results obtained by the multiple recall methods; based on the recall quantity corresponding to the multiple recall methods, the transport demand orders that meet the conditions of the multiple recall methods are determined from all current transport demand orders to obtain the screening results, and the server sends the screening results to the terminal device, and the terminal device displays the screening results, and the user can view the screening results. Therefore, according to the preferences of different drivers for the recalled transport demand orders, the freight screening results displayed to the driver are determined in a personalized manner, and the driver can quickly find a satisfactory transport demand, which improves the efficiency of the driver's order acceptance, thereby improving the efficiency of the shipper and the driver in reaching an order, and improving the user experience.

[0345] The method provided by the present disclosure is described below with specific examples.

[0346] See also Figure 3 , Figure 3 FIG. 1 is a flow chart of a method for displaying freight screening results provided by an embodiment of the present disclosure. Figure 3 As shown, the method of this embodiment includes the following steps:

[0347] Step a: The server sorts the sources of goods according to the scoring results of the refined ranking model.

[0348] The source of goods corresponds to the transportation demand list in the above embodiment.

[0349] The refined ranking model corresponds to the scoring model in the above embodiment, and is used to score the transport demand form according to the degree to which it meets the user's expectations, so as to obtain the first score of the recalled transport demand form.

[0350] Step b: Determine whether the precise quantity is greater than or equal to M.

[0351] Among them, the precise cargo quantity corresponds to the quantity of the precise recall type transportation demand order in the above embodiment.

[0352] Here, M corresponds to the first threshold in the above embodiment.

[0353] If yes, proceed to step c; if no, proceed to step j.

[0354] Step c: Determine whether the accurate supply ranking is less than or equal to R.

[0355] If yes, proceed to step d; if no, proceed to step f.

[0356] Step d: determine whether the generalized supply source complies with the restriction rules and complies with the generalization degree range control.

[0357] Among them, the restriction rule means that the inserted source of goods must score higher than the precise source of goods in the same location.

[0358] The generalization degree interval control corresponds to the generalization degree control condition in the above embodiment.

[0359] 1. The first Z1 shipment in the precise sequence: the comprehensive score of the generalization degree of the transport demand order > X1 value, or the generalization degree of the departure place > x1, no interleaving;

[0360] 2. For Z1-Z2 tickets in the precise sequence: if the comprehensive score of generalization degree is greater than X2 value, or the generalization degree of the departure place is greater than x2, no interleaving is allowed;

[0361] 3. For shipments above Z2 in the precise sequence: if the generalization comprehensive score is greater than X3 value, or the generalization degree of the departure place is greater than x3, no interleaving is allowed;

[0362] The sources that do not meet the above comprehensive scoring conditions will be placed on the recommended generalized floor, where the above parameters can be configured by interval.

[0363] If yes, continue to step e; if no, do not perform the insertion operation.

[0364] Step e: Based on the N-insert-one logic, insert one generalized shipment according to the window parameter N.

[0365] The generalized cargo corresponds to the transportation demand sheet of the generalized recall type in the above embodiment.

[0366] Step f: determine whether the generalized supply source complies with the restriction rules and complies with the generalization degree range control.

[0367] If yes, continue to step g; if no, do not perform the insertion operation.

[0368] Step g: After the generalized goods quantity control processing: at most X tickets of generalized goods are inserted into the precise floor.

[0369] Among them, the precise floor refers to the display area that ranks in the front position in the screening results, and correspondingly, the generalized floor refers to the display area that ranks behind the precise floor in the screening results.

[0370] Step h: Continuous generalization and dispersal processing: No two generalized goods shall appear consecutively.

[0371] In the process of inserting the generalized goods, two consecutive generalized goods cannot appear. If two consecutive generalized goods appear, the second one of the two consecutive generalized goods may not be inserted, or the second one of the two consecutive generalized goods may be moved back one position.

[0372] Step i: Place the remaining generalized items on the recommended generalized floor in the order of their ranking.

[0373] Step j: Place precise goods on precise floors, and generalized goods on recommended generalized floors.

[0374] Based on the method for displaying freight screening results described in any of the above embodiments, the embodiment of the present disclosure further provides a computer-readable storage medium, for example, the non-temporary computer-readable storage medium may be a read-only memory (ROM), a random access memory (RAM), a CD-ROM, a magnetic tape, a floppy disk, and an optical data storage device, etc. The storage medium stores computer instructions for executing the method for displaying freight screening results described in any of the above embodiments, which will not be described in detail herein.

[0375] A person skilled in the art will understand that all or part of the steps to implement the above embodiments may be accomplished by hardware, or by a program to instruct the relevant hardware, and the program may be stored in a computer-readable storage medium, and the above-mentioned storage medium may be a read-only memory, a disk or an optical disk, etc.

[0376] Those skilled in the art will readily appreciate other embodiments of the present disclosure after considering the specification and practicing the disclosure disclosed herein. This application is intended to cover any variations, uses, or adaptations of the present disclosure that follow the general principles of the present disclosure and include common knowledge or customary techniques in the art that are not disclosed in the present disclosure. The description and examples are intended to be exemplary only, and the true scope and spirit of the present disclosure are indicated by the following claims.

Claims

1. A method for displaying freight screening results, characterized in that: The method comprises: receiving a freight search request sent by a terminal device, wherein the freight search request includes freight search information; In response to the freight search request, based on the freight search information and the information of the first user corresponding to the terminal device, a recall operation is performed on all current transport demand orders to obtain recalled transport demand orders; Based on the information about the degree to which each recalled transport demand form meets the expectations of the first user and the information about the degree of generalization of each recalled transport demand form, the recalled transport demand forms are sorted to obtain a screening result; The screening result is sent to the terminal device so that the terminal device displays the screening result.

2. The method according to claim 1, characterized in that The types of the recalled transport demand orders include: precise recall type and generalized recall type; The recalled transport demand orders are sorted based on the information on the degree to which each recalled transport demand order meets the expectations of the first user and the information on the degree of generalization of each recalled transport demand order to obtain screening results, including: Obtain the first score of each recalled transport demand order; Using the first score of the recalled transport demand order as information on the degree to which the recalled transport demand order meets the expectations of the first user; Sorting the recalled transport demand orders of the precise recall type in descending order of the first scores to obtain a precise sequence; the recalled transport demand order in the precise sequence is the first element; Sorting the recalled transport demand orders of the generalized recall type in descending order of the first scores to obtain a generalized sequence; the recalled transport demand order in the generalized sequence is the second element; If the number of recalled transport demand orders of the precise recall type is greater than or equal to a first threshold, based on the first scores of each first element and each second element, and the generalization degree information of each second element, the second element in the generalized sequence is inserted into the precise sequence to obtain a screening result.

3. The method according to claim 2, characterized in that The method of inserting the second element in the generalized sequence into the precise sequence based on the first score of each first element and each second element and the generalization degree information of each second element to obtain the screening result includes: The following insertion processing is performed on the first R first elements in the precise sequence: according to the window function, N first elements are obtained; a second element that is not currently inserted into the precise sequence and has the highest first score is obtained as the first element to be inserted; if the generalization degree information of the first element to be inserted meets the generalization degree control condition, and the first score of the first element to be inserted is greater than the minimum value of the first scores of the N first elements, the first element to be inserted is inserted into the N first elements; according to the window function, the next N first elements in the precise sequence are obtained, and the execution is returned to obtain a second element that is not currently inserted into the precise sequence and has the highest first score as the first element to be inserted, until the processing of the first R first elements in the precise sequence is completed to obtain a first shuffled sequence; N is an integer greater than 1, and R is an integer greater than N; The following insertion processing is performed on the first element after the Rth one in the precise sequence: according to the preset interval division method, the first element of the first preset interval in the preset interval division method is obtained; the second element that is not currently inserted into the precise sequence and ranks in the front K is obtained as the second element to be inserted; if the generalization degree information of the second element to be inserted meets the generalization degree control condition, and the first score of the second element to be inserted is greater than the minimum value of the first score of the first element of the first preset interval, the second element to be inserted is inserted into the first element of the first preset interval; according to the preset interval division method, the first element of the next preset interval is obtained, and the execution is returned to obtain the second element that is not currently inserted into the precise sequence and ranks in the front K with the first score as the second element to be inserted, until the processing of the first element after the Rth one in the precise sequence is completed, and the second shuffled sequence is obtained; K is an integer greater than 0; The first shuffled sequence, the second shuffled sequence, and the generalized sequence except for the precise sequence inserted are arranged in sequence to obtain a screening result.

4. The method according to claim 3, characterized in that The method further comprises: Obtaining the total generalization score and / or the departure place generalization score of the second element in the generalization sequence; the total generalization score of the second element in the generalization sequence is used to indicate the comprehensive generalization degree of the second element in the generalization sequence; the departure place generalization score of the second element in the generalization sequence is used to indicate the generalization degree of the departure place of the second element in the generalization sequence; The total generalization score and / or the starting generalization score of the second element in the generalization sequence is used as the generalization degree information of the second element in the generalization sequence.

5. The method according to claim 4, characterized in that The freight search information includes departure place information and destination information; the transport demand list includes loading place information, unloading place information, cargo weight, cargo volume, required vehicle type and required vehicle length; the obtaining of the generalized total score and / or the departure place generalized score of the second element in the generalized sequence includes: Determine the generalized score of the departure place of the second element according to the departure place information in the freight search information and the loading place information in the second element; Obtaining generalized scores corresponding to each piece of information other than the loading place information in the second element; A total generalization score of the second element is obtained according to the generalization scores respectively corresponding to all the information in the second element.

6. The method according to claim 4 or 5, characterized in that: Determining whether the generalization degree information of the second element in the generalization sequence meets the generalization degree control condition is performed in the following manner: When performing the insertion process, for the first Z1 first elements in the precise sequence, if the total generalization score of the second element in the generalized sequence is less than or equal to the first total score threshold, and the departure place generalization score of the second element in the generalized sequence is less than or equal to the first departure place threshold, it is determined that the generalization degree information of the second element in the generalized sequence meets the generalization degree control condition; Z1 is an integer greater than 0 and less than R; When performing the insertion process, for the Z1+1th to Z2th first elements in the precise sequence, if there is a second element in the generalized sequence whose total generalization score is less than or equal to the second total score threshold, and whose departure place generalization score is less than or equal to the second departure place threshold, it is determined that the generalization degree information of the second element meets the generalization degree control condition; The second total score threshold is greater than the first total score threshold; the second departure place threshold is greater than the first departure place threshold; Z2 is an integer greater than Z1 and less than R; When performing the insertion process, for the first element after the Z2th in the precise sequence, if there is a second element in the generalized sequence whose total generalization score is less than or equal to the third total score threshold, and whose departure place generalization score is less than or equal to the third departure place threshold, it is determined that the generalization degree information of the second element meets the generalization degree control condition; The third total score threshold is greater than the second total score threshold; the third departure place threshold is greater than the second departure place threshold.

7. The method according to claim 1, characterized in that The step of performing a recall operation on all current transport demand orders based on the freight search information and the information of the first user corresponding to the terminal device in response to the freight search request to obtain the recalled transport demand orders includes: In response to the freight search request, determining a plurality of recall methods and recall quantities respectively corresponding to the plurality of recall methods according to the freight search information and information of a first user corresponding to the terminal device; According to the quantity of the transport demand orders corresponding to the multiple recall methods, the cut-off quantity and the generalization degree information of the transport demand orders corresponding to the multiple recall methods, part or all of the transport demand orders corresponding to the multiple recall methods are determined as recalled transport demand orders.

8. The method according to claim 7, characterized in that The step of responding to the freight search request and determining, according to the freight search information and information of the first user corresponding to the terminal device, a plurality of recall methods and recall quantities respectively corresponding to the plurality of recall methods includes: In response to the freight search request, determining a plurality of recall methods according to the freight search information and information of a first user corresponding to the terminal device; The recall quantities corresponding to the multiple recall methods are determined according to the first user's preference information for recall accuracy and / or the first user's preference information for historical search results obtained by the multiple recall methods.

9. A method for displaying freight screening results, characterized in that: The method comprises: Receive freight search information in the freight search interface; After receiving the search operation on the freight search interface, sending a freight search request to a server, wherein the freight search request includes the freight search information; receiving a screening result sent by the server, wherein the screening result is obtained by the server performing a recall operation on all current transport demand orders according to the freight search information and the information of the first user corresponding to the terminal device, to obtain recalled transport demand orders; and sorting the recalled transport demand orders based on information on the degree to which each recalled transport demand order meets the expectations of the first user and information on the degree of generalization of each recalled transport demand order; The filtering results are displayed.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the method according to any one of claims 1 to 9 is implemented.

Images