An information push method suitable for cross-border trade

Abstract

The present invention relates to the technical field of information push, and discloses an information push method suitable for cross-border trade, including: collecting historical cross-border trade routes by obtaining the user's starting place, destination, trade time period and scheduled route information, and when the number of collected data does not meet the subsequent screening requirements, expanding the trade time period until the screening requirements are met; obtaining user-related data, executing screening strategies, including route screening, time comparison and node judgment, etc., to ensure that the most suitable trade route can be screened out. If the current screening strategy fails to find a suitable route, the remaining screening strategies are executed until the optimal recommended route is found; the method can recommend the optimal cross-border trade route to the user based on the data analysis results, so as to improve data analysis efficiency and reduce retrieval costs.

Description

Technical Field

[0001] The present invention relates to the technical field of information push, and in particular to an information push method suitable for cross-border trade. Background Art

[0002] In the context of the rapid development of the global economy, cross-border trade has increasingly become an important means for companies from all countries to expand their markets. With the increasing complexity and diversity of the international market, companies face many challenges when conducting cross-border trade. Therefore, how to efficiently obtain relevant information and make reasonable route planning has become the key to the success of a company.

[0003] Traditional ways of obtaining cross-border trade information often rely on manual search and information collection, which is inefficient and prone to missing important information. With the development of information technology, especially the application of big data and artificial intelligence, companies have begun to explore more intelligent information push methods to achieve rapid information acquisition and accurate matching.

[0004] In the prior art, although there are some information push systems based on user needs, most of them still have the following deficiencies, such as: insufficient information matching. Many existing systems fail to fully consider the specific needs of users, such as trade time periods, scheduled routes, etc., resulting in the information pushed being often not accurate enough and unable to meet the actual needs of users; data collection limitations: in the data collection process, there is often a lack of effective use of historical data, and failure to dynamically adjust time periods or screening strategies to obtain more relevant historical trade routes; single recommendation algorithms. Existing recommendation systems mostly use simple content-based or collaborative filtering algorithms, lacking in-depth analysis of users and historical data, resulting in insufficient diversity and accuracy of recommendation results.

[0005] Therefore, there is an urgent need for a new method for pushing cross-border trade information that can comprehensively consider multi-dimensional information such as the user's region, time period, and scheduled route, and achieve accurate information push through intelligent data collection and screening strategies. Summary of the invention

[0006] The present invention provides an information push method applicable to cross-border trade, which is used to promote the solution of the problems mentioned in the above background technology.

[0007] The present invention provides the following technical solution: an information push method applicable to cross-border trade, comprising:

[0008] Obtain the user's location, and record the user's location as the target region;

[0009] Obtain the estimated time period for the user to conduct cross-border trade, recorded as the trade time period;

[0010] The start time of the trading period is recorded as the start time, and the end time of the trading period is recorded as the end time;

[0011] Get the destination region where the user conducts cross-border trade, which is recorded as the end region;

[0012] Get the user's scheduled route;

[0013] The predetermined route includes a plurality of nodes, each node is a region, the starting point of the predetermined route is the target region, and the end point is the termination region;

[0014] Enter the nodes between the target area and the end area in the predetermined route into a node set;

[0015] Number the elements in the node set from 1 to n in the order in which they pass through the node set, where n is the number of elements in the node set.

[0016] The passing order refers to the actual traveling order of the nodes in the predetermined route;

[0017] Data collection is performed based on the user’s trading time period;

[0018] According to the user's predetermined route, a first screening strategy is executed on the data collection results;

[0019] Determine whether to execute the second screening strategy based on the result of the first screening strategy;

[0020] If the second screening strategy is executed, the data collection results are screened again, and it is determined whether to recommend to the user based on the screening results;

[0021] If no recommendation is made to the user, the third screening strategy is executed;

[0022] Determine whether to recommend to the user based on the number of results of the third screening strategy;

[0023] If the number of results of the third screening strategy is equal to zero, the fourth screening strategy is executed;

[0024] Perform data analysis on the results of the fourth screening strategy, and make recommendations to users based on the analysis results.

[0025] Optionally, the data collection according to the user's trading time period includes:

[0026] Setting a time adjustment threshold for expanding the range of the trade time period, denoted as time threshold;

[0027] Obtain all cross-border trade routes in the historical trade period and enter the historical route collection;

[0028] Set a route quantity threshold b for determining whether the number of cross-border trade routes meets the screening requirements;

[0029] If the number of elements in the historical route set is less than or equal to b, the time adjustment strategy is executed as follows:

[0030] Record the moment before the start time and separated from the start time by the time threshold as the first time;

[0031] Recording a moment after the termination time and separated from the termination time by a time threshold as a second time;

[0032] The time period formed between the first time and the second time is taken as a new trade time period, and all cross-border trade routes within the trade time period are re-obtained and recorded in a historical route set;

[0033] If the number of elements in the historical route set is less than or equal to b, the time adjustment strategy is executed until the number of elements in the historical route set is greater than b.

[0034] Optionally, executing a first screening strategy on the data collection results according to the user's predetermined route includes:

[0035] Obtain all routes in the historical route set whose starting point and end point are the same as the target area and the end area respectively, and enter them into the first set;

[0036] Randomly select any element in the first set as a transfer element, and enter all nodes between the starting point and the end point in the transfer element into the transfer set;

[0037] Each element in the first set corresponds to a transfer set;

[0038] For each transfer collection;

[0039] Get the intersection of the transit set and the node set;

[0040] If the number of elements in the intersection is equal to the number of elements in the node set, the nodes in the transit elements are numbered from 1 to f in the order of the transit element's travel direction, where f is the number of elements in the transit set;

[0041] Determine in turn whether the corresponding elements in the transit set and the node set under each number are the same;

[0042] If the corresponding elements in the transit set and the node set under each number are the same, the transit element will be recommended to the user;

[0043] If there is a number where the corresponding elements in the transit set and the node set are different, then reselect the elements in the first set as new transit elements and execute the first screening strategy;

[0044] If the number of elements in the intersection is not equal to the number of elements in the node set, reselect any element in the first set and execute the first screening strategy;

[0045] If all elements in the first set are traversed and no recommendation is made to the user, the second screening strategy is executed.

[0046] Optionally, judging whether to make a recommendation according to the number of results of the second screening strategy includes:

[0047] Obtain all elements in the historical route set that contain the scheduled route, and enter them into the second set;

[0048] If the number of elements in the second set is zero, the third strategy is executed;

[0049] If the number of elements in the second set is not zero, the actual travel time taken for each element in the second set from the node corresponding to the smallest number to the node corresponding to the largest number is calculated respectively, and the route with the shortest actual travel time is selected and recommended to the user.

[0050] Optionally, if the third screening strategy is executed, the data collection results are screened again, and it is determined whether to recommend to the user according to the screening results, including:

[0051] Obtain elements in the historical route set whose starting point and ending point are respectively the same as the target area and the end area, and which contain all the nodes in the node set, and enter them into the third set;

[0052] Randomly select any element in the third set as the target route;

[0053] The nodes in the target route that are identical to the nodes in the scheduled route are numbered from 1 to g according to their travel direction in the target route, and are entered into a similar set, where g is the number of nodes in the target route that are identical to the nodes in the scheduled route;

[0054] Determine in turn whether the corresponding elements in the similarity set and the node set under each number are the same;

[0055] If the corresponding elements in the similarity set and the node set under each number are the same, then the elements in the third set are reselected as the new target route, and numbered and judged;

[0056] If there is a number where the corresponding elements in the similar set and the node set are different, the current target route in the third set is removed and the third set is updated;

[0057] When all elements in the third set are traversed, the actual travel time of each element in the third set is obtained, and the route corresponding to the element with the smallest actual travel time is selected and recommended to the user;

[0058] If no recommendation is made to the user, the fourth screening strategy is executed.

[0059] Optionally, if the number of results of the third screening strategy is equal to zero, executing the fourth screening strategy includes:

[0060] Obtain all elements containing the target area and the end area in the historical route set, and enter them into the fourth set;

[0061] Select the elements in the fourth set in sequence, and number all nodes in the element from 1 to e according to the order of the element's travel direction, where e is the number of nodes in the element;

[0062] If the number corresponding to the target region in the current element is less than the number corresponding to the end region, the element is entered into the No. 1 set;

[0063] If the number corresponding to the target area in the current element is greater than the number corresponding to the end area, then reselect the element in the third set and perform number determination;

[0064] When all elements in the fourth set are traversed, stop selecting;

[0065] Randomly select any element in the first set as the first element, and obtain all nodes between the target area and the end area in the first element;

[0066] If the above nodes are all elements in the node set, they are numbered according to the corresponding numbers of the above nodes in the node set;

[0067] If the node numbers between the target area and the end area in the first element increase in sequence, the first element is entered into the second set, and the elements in the first set are reselected as the new target routes, and the numbers and number growth trends are determined;

[0068] Otherwise, reselect the elements in set No. 1 as the new target route, and number them and determine the number growth trend;

[0069] When all elements in set 1 are traversed, the selection stops;

[0070] Enter the element with the largest number of nodes between the target region and the end region in the second set into the comparison set;

[0071] If the number of elements in the comparison set is 1, then the elements in the comparison set are entered into the fifth set;

[0072] If the number of elements in the comparison set is greater than 1, any element in the comparison set is randomly selected as the processing element, and the route simulation strategy is executed.

[0073] Optionally, if the number of elements in the comparison set is greater than 1, any element in the comparison set is randomly selected as a processing element, and a route simulation strategy is executed, including:

[0074] Mark the nodes in the planned route that do not appear in the processing element and enter them into the missing set;

[0075] Each element in the missing set is selected as a simulation node in order from small to large according to the corresponding number in the node set;

[0076] Obtain the travel time of the processing element in actual transportation, which is recorded as the first travel time;

[0077] The number corresponding to the simulation node in the node set is recorded as the simulation number;

[0078] Obtain the previous adjacent node of the simulation node in the predetermined route, recorded as the adjacent simulation node;

[0079] Enter the adjacent simulation nodes and simulation nodes into the simulation route set, reselect the elements in the missing set as new simulation nodes, and execute the route simulation strategy;

[0080] If all elements in the missing set are traversed, determine whether there are duplicate elements in the simulated route set;

[0081] If there are duplicate elements, keep one of each duplicate element in the simulation route set;

[0082] Sort the elements in the simulated route set from 1 to h according to the travel order of the nodes in the predetermined route, where h is the number of elements in the simulated route set;

[0083] The elements in the missing set are used as insertion elements;

[0084] Elements in the simulated route collection that are different from the inserted elements are treated as non-inserted elements;

[0085] If the number of non-insertion elements in the simulation route set is 1, the simulation route set is used as a sub-simulation route set;

[0086] If the number of non-insertion elements in the simulation route set is greater than 1, all elements in the simulation route set are divided into multiple sub-simulation route sets according to the positions of the non-insertion elements, and the nodes with the smallest element number in each sub-simulation route set are all non-insertion elements;

[0087] Executes the calculation simulation time strategy.

[0088] Optionally, the execution of the calculation simulation time strategy includes:

[0089] Randomly select a sub-simulation route set, and use all elements in the sub-simulation route set as the passed route segments, obtain all elements in the historical route set that contain the passed route segments, and enter them into the passed set;

[0090] Calculate the actual travel time for each element in the passing set from the node corresponding to the smallest number in the route segment to the node corresponding to the largest number, and enter it into the actual time set;

[0091] Calculate the ratio of the sum of all elements in the actual time set to the number of elements in the actual time set, record it as the average actual time, and enter it into the average actual set;

[0092] Reselect all elements in a sub-simulation route set as the passed route segments, and calculate the corresponding average actual time;

[0093] When all sub-simulation route sets are traversed, the selection is stopped, and the sum of all elements in the average actual set is calculated and recorded as the second travel time;

[0094] The sum of the first driving time and the second driving time is recorded as the estimated driving time, and is entered into the final route simulation set;

[0095] Reselect elements in the comparison set as new processing elements and execute the route simulation strategy;

[0096] If all elements in the comparison set are traversed, the route corresponding to the smallest element in the final set is entered into the fifth set.

[0097] Optionally, performing data analysis on the fourth screening strategy result and making recommendations to the user based on the analysis result includes:

[0098] Record all nodes in the predetermined route as target nodes;

[0099] Get all elements in the historical route collection that contain nodes in the scheduled route and enter them into the termination collection;

[0100] Mark all target nodes in each element of the termination set, and number the marked target nodes from 1 to d according to the order of nodes in the predetermined route, where d is the number of all target nodes in each element of the termination set;

[0101] Enter the elements in the termination set whose numbers are greater than 1 and whose numbers increase in a sequential manner into the inclusion set;

[0102] Mark the elements in the included set that contain the largest number of target nodes, delete all other unmarked elements in the included set, and update the included set;

[0103] Randomly select any element in the set as a similar route;

[0104] Mark the target nodes corresponding to the smallest number and the largest number in the similar routes, and obtain the time taken by the similar routes from the target node corresponding to the smallest number to the target node corresponding to the largest number, record the time as the third travel time, and enter it into the similar time set;

[0105] Reselect any element in the included set as a new similar route, and obtain the third travel time of the similar route;

[0106] When all elements in the set are traversed, the selection stops;

[0107] Enter the route corresponding to the minimum value in the similar time set into the fifth set;

[0108] Get the number of target nodes contained in each element of the fifth set;

[0109] Recommend the elements in the fifth set that contain the largest number of target nodes to the user;

[0110] If the number of target nodes contained in each element in the fifth set is the same, the route corresponding to the smallest element in the similarity set is selected and recommended to the user.

[0111] The present invention has the following beneficial effects:

[0112] 1. This information push method is suitable for cross-border trade. By setting multiple screening strategies, from the first screening strategy to the fourth screening strategy, each screening step corresponds to different screening criteria, and the historical data is filtered layer by layer according to different screening criteria to ensure that the information finally pushed to the user is highly matched with the route, time period, node, etc. of its cross-border trade, so as to ensure the high accuracy of the push route.

[0113] 2. This information push method is suitable for cross-border trade. It obtains the user's trade time period and collects historical data based on the historical trade time period. The historical data collected in this way is closer to the user's actual transportation situation. When the number of collected historical data does not meet the subsequent screening requirements, it is re-collected by expanding the user's trade time period until the screening requirements are met. This flexible time expansion strategy can ensure that enough relevant data is collected.

[0114] 3. This information push method is suitable for cross-border trade. The nodes in the user's scheduled route are numbered in order of passing, and the first screening strategy is executed on the historical data according to the numbering. By executing the first screening strategy, the route consistent with the user's scheduled route is preferentially screened out. This screening method can preferentially screen out the route that best meets the user's needs.

[0115] 4. This information push method is suitable for cross-border trade. It obtains historical data including the starting point and end point of a scheduled route, and numbers the nodes in each historical data that are the same as the nodes in the scheduled route. The historical data is further screened by judging the growth trend of the numbering. The actual transportation time of each filtered route is obtained, and the route with the shortest transportation time is selected as the recommended route. In this way, routes that can pass through all nodes in the scheduled route and pass in a consistent order can be screened out, thereby increasing the user's selectivity and the rationality of the route.

[0116] 5. This is an information push method suitable for cross-border trade. It obtains historical data that is consistent with the starting point and end point in the scheduled route, and numbers the nodes in the historical data that are the same as the nodes in the scheduled route. It marks the nodes in the scheduled route that do not appear in the historical data, and obtains a simulated route set based on the adjacent nodes of the marked nodes in the scheduled route. The elements in the simulated route set are sorted according to the order of passing the scheduled route, and the average time taken for all passing through it is calculated according to the sorting result. By calculating the sum of the average time and the actual transportation time of the historical data, the route corresponding to the minimum value is selected and entered into the fifth set. By calculating the time of the nodes that have not been passed, the time taken by the user to reach the nodes that have not been passed through through multiple transportations can be simulated, so that the recommendation results can better meet the needs of users; choosing summation as a way to organize data can reduce the data impact caused by actual transportation conditions, make the data comparable and improve the accuracy of recommendations.

[0117] 6. This is an information push method suitable for cross-border trade. The method enters the acquired historical data containing nodes in the scheduled route into a fifth set, and first preliminarily screens the elements in the fifth set according to the number of nodes in the scheduled route. If the number of screening results is greater than 1, the time of the elements in each screening result is compared, and the route with the shortest time is selected as the recommended route for user reference; by analyzing and processing the historical data containing nodes in the scheduled route, it can be ensured that the route that best meets the user's needs is screened out, and the screened route is recommended to the user as a reference, which increases the possibility and comparability of user selection and improves screening efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0118] Figure 1 It is a schematic diagram of the process of the present invention. DETAILED DESCRIPTION

[0119] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0120] Example 1, see Figure 1 , an information push method suitable for cross-border trade, comprising:

[0121] Obtain the user's location, and record the user's location as the target region;

[0122] Obtain the estimated time period for the user to conduct cross-border trade, recorded as the trade time period;

[0123] The start time of the trading period is recorded as the start time, and the end time of the trading period is recorded as the end time;

[0124] Get the destination region where the user conducts cross-border trade, which is recorded as the end region;

[0125] Get the user's scheduled route;

[0126] The predetermined route includes a plurality of nodes, each node is a region, the starting point of the predetermined route is the target region, and the end point is the termination region;

[0127] Enter the nodes between the target area and the end area in the predetermined route into a node set;

[0128] Number the elements in the node set from 1 to n in the order in which they pass through the node set, where n is the number of elements in the node set.

[0129] The passing order refers to the actual traveling order of the nodes in the predetermined route;

[0130] Data collection is performed based on the user’s trading time period;

[0131] According to the user's predetermined route, a first screening strategy is executed on the data collection results;

[0132] Determine whether to execute the second screening strategy based on the result of the first screening strategy;

[0133] If the second screening strategy is executed, the data collection results are screened again, and it is determined whether to recommend to the user based on the screening results;

[0134] If no recommendation is made to the user, the third screening strategy is executed;

[0135] Determine whether to recommend to the user based on the number of results of the third screening strategy;

[0136] If the number of results of the third screening strategy is equal to zero, the fourth screening strategy is executed;

[0137] Performing data analysis on the results of the fourth screening strategy and making recommendations to users based on the analysis results;

[0138] By setting multiple filtering strategies, from the first filtering strategy to the fourth filtering strategy, each filtering step corresponds to different filtering criteria, and historical data is filtered layer by layer according to different filtering criteria to ensure that the information finally pushed to the user is highly matched with their cross-border trade routes, time periods, nodes, etc., to ensure the high accuracy of the pushed information.

[0139] The data collection according to the user's trading time period includes:

[0140] Setting a time adjustment threshold for expanding the range of the trade time period, denoted as time threshold;

[0141] Obtain all cross-border trade routes in the historical trade period and enter the historical route collection;

[0142] Set a route quantity threshold b for determining whether the number of cross-border trade routes meets the screening requirements;

[0143] If the number of elements in the historical route set is less than or equal to b, the time adjustment strategy is executed as follows:

[0144] Record the moment before the start time and separated from the start time by the time threshold as the first time;

[0145] Recording a moment after the termination time and separated from the termination time by a time threshold as a second time;

[0146] The time period formed between the first time and the second time is taken as a new trade time period, and all cross-border trade routes within the trade time period are re-obtained and recorded in a historical route set;

[0147] If the number of elements in the historical route set is less than or equal to b, the time adjustment strategy is executed until the number of elements in the historical route set is greater than b;

[0148] By obtaining the user's trading time period and collecting historical data based on the historical trading time period, the collected historical data is closer to the user's actual transportation situation; when the number of collected historical data does not meet the subsequent screening needs, the user's trading time period is expanded and re-collected until the screening needs are met. This flexible time expansion strategy can ensure that enough relevant data is collected.

[0149] The step of executing a first screening strategy on the data collection results according to the user's predetermined route includes:

[0150] Obtain all routes in the historical route set whose starting point and end point are the same as the target area and the end area respectively, and enter them into the first set;

[0151] Randomly select any element in the first set as a transfer element, and enter all nodes between the starting point and the end point in the transfer element into the transfer set;

[0152] Each element in the first set corresponds to a transfer set;

[0153] For each transfer collection;

[0154] Get the intersection of the transit set and the node set;

[0155] If the number of elements in the intersection is equal to the number of elements in the node set, the nodes in the transit elements are numbered from 1 to f in the order of the transit element's travel direction, where f is the number of elements in the transit set;

[0156] Determine in turn whether the corresponding elements in the transit set and the node set under each number are the same;

[0157] If the corresponding elements in the transit set and the node set under each number are the same, the transit element will be recommended to the user;

[0158] If there is a number where the corresponding elements in the transit set and the node set are different, then reselect the elements in the first set as new transit elements and execute the first screening strategy;

[0159] If the number of elements in the intersection is not equal to the number of elements in the node set, reselect any element in the first set and execute the first screening strategy;

[0160] If all elements in the first set are traversed and no recommendation is made to the user, the second screening strategy is executed;

[0161] By numbering the nodes in the user's scheduled route in order, executing the first screening strategy on the historical data according to the numbering, and preferentially screening out the route consistent with the user's scheduled route by executing the first screening strategy, this screening method can preferentially screen out the route that best meets the user's needs.

[0162] The determining whether to make a recommendation according to the number of results of the second screening strategy includes:

[0163] Obtain all elements in the historical route set that contain the scheduled route, and enter them into the second set;

[0164] If the number of elements in the second set is zero, the third strategy is executed;

[0165] If the number of elements in the second set is not zero, the actual travel time taken for each element in the second set from the node corresponding to the smallest number to the node corresponding to the largest number is calculated respectively, and the route with the shortest actual travel time is selected and recommended to the user.

[0166] If the third screening strategy is executed, the data collection results are screened again, and it is determined whether to recommend to the user according to the screening results, including:

[0167] Obtain elements in the historical route set whose starting point and ending point are respectively the same as the target area and the end area, and which contain all the nodes in the node set, and enter them into the third set;

[0168] Randomly select any element in the third set as the target route;

[0169] The nodes in the target route that are identical to the nodes in the scheduled route are numbered from 1 to g according to their travel direction in the target route, and are entered into a similar set, where g is the number of nodes in the target route that are identical to the nodes in the scheduled route;

[0170] Determine in turn whether the corresponding elements in the similarity set and the node set under each number are the same;

[0171] If the corresponding elements in the similarity set and the node set under each number are the same, then the elements in the third set are reselected as the new target route, and numbered and judged;

[0172] If there is a number where the corresponding elements in the similar set and the node set are different, the current target route in the third set is removed and the third set is updated;

[0173] When all elements in the third set are traversed, the actual travel time of each element in the third set is obtained, and the route corresponding to the element with the smallest actual travel time is selected and recommended to the user;

[0174] If no recommendation is made to the user, the fourth screening strategy is executed.

[0175] If the number of results of the third screening strategy is equal to zero, the fourth screening strategy is executed, including:

[0176] Obtain all elements containing the target area and the end area in the historical route set, and enter them into the fourth set;

[0177] Select the elements in the fourth set in sequence, and number all nodes in the element from 1 to e according to the order of the element's travel direction, where e is the number of nodes in the element;

[0178] If the number corresponding to the target region in the current element is less than the number corresponding to the end region, the element is entered into the No. 1 set;

[0179] If the number corresponding to the target area in the current element is greater than the number corresponding to the end area, then reselect the element in the third set and perform number determination;

[0180] When all elements in the fourth set are traversed, stop selecting;

[0181] Randomly select any element in the first set as the first element, and obtain all nodes between the target area and the end area in the first element;

[0182] If the above nodes are all elements in the node set, they are numbered according to the corresponding numbers of the above nodes in the node set;

[0183] If the node numbers between the target area and the end area in the first element increase in sequence, the first element is entered into the second set, and the elements in the first set are reselected as the new target routes, and the numbers and number growth trends are determined;

[0184] Otherwise, reselect the elements in set No. 1 as the new target route, and number them and determine the number growth trend;

[0185] By obtaining historical data containing the starting point and the end point of the scheduled route, and numbering the nodes in each historical data that are the same as the nodes in the scheduled route, the historical data is further screened by judging the growth trend of the number, and the actual transportation time of each filtered route is obtained, and the route with the shortest time is selected as the recommended route. In this way, the route that can pass through all the nodes in the scheduled route and pass through the same order can be screened, which increases the user's selectivity and the rationality of the route;

[0186] When all elements in set 1 are traversed, the selection stops;

[0187] Enter the element with the largest number of nodes between the target region and the end region in the second set into the comparison set;

[0188] If the number of elements in the comparison set is 1, then the elements in the comparison set are entered into the fifth set;

[0189] If the number of elements in the comparison set is greater than 1, any element in the comparison set is randomly selected as the processing element, and the route simulation strategy is executed.

[0190] If the number of elements in the comparison set is greater than 1, any element in the comparison set is randomly selected as a processing element, and a route simulation strategy is executed, including:

[0191] Mark the nodes in the planned route that do not appear in the processing element and enter them into the missing set;

[0192] Each element in the missing set is selected as a simulation node in order from small to large according to the corresponding number in the node set;

[0193] Obtain the travel time of the processing element in actual transportation, which is recorded as the first travel time;

[0194] The number corresponding to the simulation node in the node set is recorded as the simulation number;

[0195] Obtain the previous adjacent node of the simulation node in the predetermined route, recorded as the adjacent simulation node;

[0196] Enter the adjacent simulation nodes and simulation nodes into the simulation route set, reselect the elements in the missing set as new simulation nodes, and execute the route simulation strategy;

[0197] If all elements in the missing set are traversed, determine whether there are duplicate elements in the simulated route set;

[0198] If there are duplicate elements, keep one of each duplicate element in the simulation route set;

[0199] Sort the elements in the simulated route set from 1 to h according to the travel order of the nodes in the predetermined route, where h is the number of elements in the simulated route set;

[0200] The elements in the missing set are used as insertion elements;

[0201] Elements in the simulated route collection that are different from the inserted elements are treated as non-inserted elements;

[0202] If the number of non-insertion elements in the simulation route set is 1, the simulation route set is used as a sub-simulation route set;

[0203] If the number of non-insertion elements in the simulation route set is greater than 1, all elements in the simulation route set are divided into multiple sub-simulation route sets according to the positions of the non-insertion elements, and the nodes with the smallest element number in each sub-simulation route set are all non-insertion elements;

[0204] Executes the calculation simulation time strategy.

[0205] The execution calculation simulation time strategy includes:

[0206] Randomly select a sub-simulation route set, and use all elements in the sub-simulation route set as the passed route segments, obtain all elements in the historical route set that contain the passed route segments, and enter them into the passed set;

[0207] Calculate the actual travel time for each element in the passing set from the node corresponding to the smallest number in the route segment to the node corresponding to the largest number, and enter it into the actual time set;

[0208] Calculate the ratio of the sum of all elements in the actual time set to the number of elements in the actual time set, record it as the average actual time, and enter it into the average actual set;

[0209] Reselect all elements in a sub-simulation route set as the passed route segments, and calculate the corresponding average actual time;

[0210] When all sub-simulation route sets are traversed, the selection is stopped, and the sum of all elements in the average actual set is calculated and recorded as the second travel time;

[0211] The sum of the first driving time and the second driving time is recorded as the estimated driving time, and is entered into the final route simulation set;

[0212] Reselect elements in the comparison set as new processing elements and execute the route simulation strategy;

[0213] If all elements in the comparison set are traversed, the route corresponding to the smallest element in the final set is entered into the fifth set;

[0214] By obtaining historical data that is consistent with the starting point and end point of the scheduled route, and numbering the nodes in the historical data that are the same as the nodes in the scheduled route, by marking the nodes in the scheduled route that do not appear in the historical data, and obtaining a set of simulated routes based on the adjacent nodes of the marked nodes in the scheduled route, the elements in the simulated route set are sorted according to the order of the scheduled route, and the average time taken for all the routes to pass through them is calculated based on the sorting result. By calculating the sum of the average time and the actual transportation time of the historical data, the route corresponding to the minimum value is selected and entered into the fifth set. By calculating the time for the nodes that have not been passed, the time taken by the user to reach the nodes that have not been passed through through multiple transportations can be simulated, so that the recommendation results can better meet the needs of users. Selecting summation as a way to organize data can reduce the data impact caused by actual transportation conditions, make the data comparable and improve the accuracy of recommendations.

[0215] The data analysis of the fourth screening strategy results and recommendation to the user based on the analysis results include:

[0216] Record all nodes in the predetermined route as target nodes;

[0217] Get all elements in the historical route collection that contain nodes in the scheduled route and enter them into the termination collection;

[0218] Mark all target nodes in each element of the termination set, and number the marked target nodes from 1 to d according to the order of nodes in the predetermined route, where d is the number of all target nodes in each element of the termination set;

[0219] Enter the elements in the termination set whose numbers are greater than 1 and whose numbers increase in a sequential manner into the inclusion set;

[0220] Mark the elements in the included set that contain the largest number of target nodes, delete all other unmarked elements in the included set, and update the included set;

[0221] Randomly select any element in the set as a similar route;

[0222] Mark the target nodes corresponding to the smallest number and the largest number in the similar routes, and obtain the time taken by the similar routes from the target node corresponding to the smallest number to the target node corresponding to the largest number, record the time as the third travel time, and enter it into the similar time set;

[0223] Reselect any element in the included set as a new similar route, and obtain the third travel time of the similar route;

[0224] When all elements in the set are traversed, the selection stops;

[0225] Enter the route corresponding to the minimum value in the similar time set into the fifth set;

[0226] Get the number of target nodes contained in each element of the fifth set;

[0227] Recommend the elements in the fifth set that contain the largest number of target nodes to the user;

[0228] If the number of target nodes contained in each element in the fifth set is the same, then the route corresponding to the smallest element in the similarity set is selected and recommended to the user;

[0229] By entering the acquired historical data including the nodes in the scheduled route into the fifth set, and firstly screening the elements in the fifth set according to the number of nodes in the scheduled route, if the number of screening results is greater than 1, the time of the elements in each screening result is compared, and the route with the shortest time is selected as the recommended route for the user's reference; by analyzing and processing the historical data including the nodes in the scheduled route, it can be ensured that the route that best meets the user's needs is screened out, and the screened route is recommended to the user as a reference, which increases the possibility and comparability of user selection and improves screening efficiency.

[0230] It should be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device.

[0231] The above is only a preferred embodiment of the present invention. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the technical principles of the present invention. These improvements and modifications should also be regarded as the scope of protection of the present invention.

Claims

1. A method for pushing information suitable for cross-border trade, characterized by: include, Obtain the user's location, and record the user's location as the target region; Obtain the estimated time period for the user to conduct cross-border trade, recorded as the trade time period; The start time of the trading period is recorded as the start time, and the end time of the trading period is recorded as the end time; Get the destination region where the user conducts cross-border trade, which is recorded as the end region; Get the user's scheduled route; The predetermined route includes a plurality of nodes, each node is a region, the starting point of the predetermined route is the target region, and the end point is the termination region; Enter the nodes between the target area and the end area in the predetermined route into a node set; Number the elements in the node set from 1 to n in the order in which they pass through the node set, where n is the number of elements in the node set. The passing order refers to the actual traveling order of the nodes in the predetermined route; Data collection is performed based on the user’s trading time period; According to the user's predetermined route, a first screening strategy is executed on the data collection results; Determine whether to execute the second screening strategy based on the result of the first screening strategy; If the second screening strategy is executed, the data collection results are screened again, and it is determined whether to recommend to the user based on the screening results; If no recommendation is made to the user, the third screening strategy is executed; Determine whether to recommend to the user based on the number of results of the third screening strategy; If the number of results of the third screening strategy is equal to zero, the fourth screening strategy is executed; Perform data analysis on the results of the fourth screening strategy, and make recommendations to users based on the analysis results.

2. The information push method applicable to cross-border trade according to claim 1, characterized in that: The data collection according to the user's trading time period includes: Setting a time adjustment threshold for expanding the range of the trade time period, denoted as time threshold; Obtain all cross-border trade routes in the historical trade period and enter the historical route collection; Set a route quantity threshold b for determining whether the number of cross-border trade routes meets the screening requirements; If the number of elements in the historical route set is less than or equal to b, the time adjustment strategy is executed as follows: Record the moment before the start time and separated from the start time by the time threshold as the first time; Recording a moment after the termination time and separated from the termination time by a time threshold as a second time; The time period formed between the first time and the second time is taken as a new trade time period, and all cross-border trade routes within the trade time period are re-obtained and recorded in a historical route set; If the number of elements in the historical route set is less than or equal to b, the time adjustment strategy is executed until the number of elements in the historical route set is greater than b.

3. The information push method applicable to cross-border trade according to claim 1, characterized in that: The step of executing a first screening strategy on the data collection results according to the user's predetermined route includes: Obtain all routes in the historical route set whose starting point and end point are the same as the target area and the end area respectively, and enter them into the first set; Randomly select any element in the first set as a transfer element, and enter all nodes between the starting point and the end point in the transfer element into the transfer set; Each element in the first set corresponds to a transfer set; For each transfer collection; Get the intersection of the transit set and the node set; If the number of elements in the intersection is equal to the number of elements in the node set, the nodes in the transit elements are numbered from 1 to f in the order of the transit element's travel direction, where f is the number of elements in the transit set; Determine in turn whether the corresponding elements in the transit set and the node set under each number are the same; If the corresponding elements in the transit set and the node set under each number are the same, the transit element will be recommended to the user; If there is a number where the corresponding elements in the transit set and the node set are different, then reselect the elements in the first set as new transit elements and execute the first screening strategy; If the number of elements in the intersection is not equal to the number of elements in the node set, reselect any element in the first set and execute the first screening strategy; If all elements in the first set are traversed and no recommendation is made to the user, the second screening strategy is executed.

4. The information push method applicable to cross-border trade according to claim 1, characterized in that: The determining whether to make a recommendation according to the number of results of the second screening strategy includes: Obtain all elements in the historical route set that contain the scheduled route, and enter them into the second set; If the number of elements in the second set is zero, the third strategy is executed; If the number of elements in the second set is not zero, the actual travel time taken for each element in the second set from the node corresponding to the smallest number to the node corresponding to the largest number is calculated respectively, and the route with the shortest actual travel time is selected and recommended to the user.

5. The information push method applicable to cross-border trade according to claim 1, characterized in that: If the third screening strategy is executed, the data collection results are screened again, and it is determined whether to recommend to the user according to the screening results, including: Obtain elements in the historical route set whose starting point and ending point are respectively the same as the target area and the end area, and which contain all the nodes in the node set, and enter them into the third set; Randomly select any element in the third set as the target route; The nodes in the target route that are identical to the nodes in the scheduled route are numbered from 1 to g according to their travel direction in the target route, and are entered into a similar set, where g is the number of nodes in the target route that are identical to the nodes in the scheduled route; Determine in turn whether the corresponding elements in the similarity set and the node set under each number are the same; If the corresponding elements in the similarity set and the node set under each number are the same, then the elements in the third set are reselected as the new target route, and numbered and judged; If there is a number where the corresponding elements in the similar set and the node set are different, the current target route in the third set is removed and the third set is updated; When all elements in the third set are traversed, the actual travel time of each element in the third set is obtained, and the route corresponding to the element with the smallest actual travel time is selected and recommended to the user; If no recommendation is made to the user, the fourth screening strategy is executed.

6. The information push method applicable to cross-border trade according to claim 1, characterized in that: If the number of results of the third screening strategy is equal to zero, the fourth screening strategy is executed, including: Obtain all elements containing the target area and the end area in the historical route set, and enter them into the fourth set; Select the elements in the fourth set in sequence, and number all nodes in the element from 1 to e according to the order of the element's travel direction, where e is the number of nodes in the element; If the number corresponding to the target region in the current element is less than the number corresponding to the end region, the element is entered into the No. 1 set; If the number corresponding to the target area in the current element is greater than the number corresponding to the end area, then reselect the element in the third set and perform number determination; When all elements in the fourth set are traversed, stop selecting; Randomly select any element in the first set as the first element, and obtain all nodes between the target area and the end area in the first element; If the above nodes are all elements in the node set, they are numbered according to the corresponding numbers of the above nodes in the node set; If the node numbers between the target area and the end area in the first element increase in sequence, the first element is entered into the second set, and the elements in the first set are reselected as the new target routes, and the numbers and number growth trends are determined; Otherwise, reselect the elements in set No. 1 as the new target route, and number them and determine the number growth trend; When all elements in set 1 are traversed, the selection stops; Enter the element with the largest number of nodes between the target region and the end region in the second set into the comparison set; If the number of elements in the comparison set is 1, then the elements in the comparison set are entered into the fifth set; If the number of elements in the comparison set is greater than 1, any element in the comparison set is randomly selected as the processing element, and the route simulation strategy is executed.

7. The information push method applicable to cross-border trade according to claim 6, characterized in that: If the number of elements in the comparison set is greater than 1, any element in the comparison set is randomly selected as a processing element, and a route simulation strategy is executed, including: Mark the nodes in the planned route that do not appear in the processing element and enter them into the missing set; Each element in the missing set is selected as a simulation node in order from small to large according to the corresponding number in the node set; Obtain the travel time of the processing element in actual transportation, which is recorded as the first travel time; The number corresponding to the simulation node in the node set is recorded as the simulation number; Obtain the previous adjacent node of the simulation node in the predetermined route, recorded as the adjacent simulation node; Enter the adjacent simulation nodes and simulation nodes into the simulation route set, reselect the elements in the missing set as new simulation nodes, and execute the route simulation strategy; If all elements in the missing set are traversed, determine whether there are duplicate elements in the simulated route set; If there are duplicate elements, keep one of each duplicate element in the simulation route set; Sort the elements in the simulated route set from 1 to h according to the travel order of the nodes in the predetermined route, where h is the number of elements in the simulated route set; The elements in the missing set are used as insertion elements; Elements in the simulated route collection that are different from the inserted elements are treated as non-inserted elements; If the number of non-insertion elements in the simulation route set is 1, the simulation route set is used as a sub-simulation route set; If the number of non-insertion elements in the simulation route set is greater than 1, all elements in the simulation route set are divided into multiple sub-simulation route sets according to the positions of the non-insertion elements, and the nodes with the smallest element number in each sub-simulation route set are all non-insertion elements; Executes the calculation simulation time strategy.

8. The information push method applicable to cross-border trade according to claim 7, characterized in that: The execution calculation simulation time strategy includes: Randomly select a sub-simulation route set, and use all elements in the sub-simulation route set as the passed route segments, obtain all elements in the historical route set that contain the passed route segments, and enter them into the passed set; Calculate the actual travel time for each element in the passing set from the node corresponding to the smallest number in the route segment to the node corresponding to the largest number, and enter it into the actual time set; Calculate the ratio of the sum of all elements in the actual time set to the number of elements in the actual time set, record it as the average actual time, and enter it into the average actual set; Reselect all elements in a sub-simulation route set as the passed route segments, and calculate the corresponding average actual time; When all sub-simulation route sets are traversed, the selection is stopped, and the sum of all elements in the average actual set is calculated and recorded as the second travel time; The sum of the first driving time and the second driving time is recorded as the estimated driving time, and is entered into the final route simulation set; Reselect elements in the comparison set as new processing elements and execute the route simulation strategy; If all elements in the comparison set are traversed, the route corresponding to the smallest element in the final set is entered into the fifth set.

9. The information push method applicable to cross-border trade according to claim 1, characterized in that: The data analysis of the fourth screening strategy results and recommendation to the user based on the analysis results include: Record all nodes in the predetermined route as target nodes; Get all elements in the historical route collection that contain nodes in the scheduled route and enter them into the termination collection; Mark all target nodes in each element of the termination set, and number the marked target nodes from 1 to d according to the order of nodes in the predetermined route, where d is the number of all target nodes in each element of the termination set; Enter the elements in the termination set whose numbers are greater than 1 and whose numbers increase in a sequential manner into the inclusion set; Mark the elements in the included set that contain the largest number of target nodes, delete all other unmarked elements in the included set, and update the included set; Randomly select any element in the set as a similar route; Mark the target nodes corresponding to the smallest number and the largest number in the similar routes, and obtain the time taken by the similar routes from the target node corresponding to the smallest number to the target node corresponding to the largest number, record the time as the third travel time, and enter it into the similar time set; Reselect any element in the included set as a new similar route, and obtain the third travel time of the similar route; When all elements in the set are traversed, the selection stops; Enter the route corresponding to the minimum value in the similar time set into the fifth set; Get the number of target nodes contained in each element of the fifth set; Recommend the elements in the fifth set that contain the largest number of target nodes to the user; If the number of target nodes contained in each element in the fifth set is the same, the route corresponding to the smallest element in the similarity set is selected and recommended to the user.

Images