Logistics route fusion method and device, electronic equipment and storage medium

Abstract

The application provides a logistics route fusion method and device, electronic equipment and storage medium. The logistics route fusion method comprises the following steps: acquiring at least one first to-be-fused line corresponding to a target original line in a first logistics network and at least one second to-be-fused line in a second logistics network; pairing and fusing the at least one first to-be-fused line and the at least one second to-be-fused line by using a random search algorithm to obtain at least one fused line, wherein the fused line is a cost-time optimal to-be-fused line in a plurality of to-be-fused lines corresponding to each second to-be-fused line; determining the at least one fused line as a first fused line combination of the target original line; calculating the first fused line combination by taking each original line in the first logistics network as the target original line to obtain a plurality of first fused line combinations corresponding to the plurality of original lines; and outputting logistics line fusion information based on the plurality of first fused line combinations.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of logistics, in particular to a logistics route fusion method and device, electronic equipment and storage medium. BACKGROUND

[0002] At present, the main method for identifying the fusion route between different logistics networks is that the planning personnel of both parties make subjective inference and simple calculation through historical cargo volume data, map information, etc., or the site personnel make temporary fusion according to historical fusion route and on-site cargo volume, which is incomplete and lagging, and the identification is time-consuming and difficult to find all fusion routes, and cannot quickly identify the mutual influence between different fusion routes.

[0003] That is, the route fusion efficiency between different logistics networks in the prior art is not high. SUMMARY

[0004] The present application aims to provide a logistics route fusion method and device, electronic equipment and storage medium, and aims to solve the problem of low route fusion efficiency between different logistics networks in the prior art.

[0005] In one aspect, the present application provides a logistics route fusion method, which is used for fusing the route of a first logistics network and the route of a second logistics network, and the fusion method comprises:

[0006] Obtaining at least one first to-be-fused line corresponding to a target original line in a first logistics network and at least one second to-be-fused line in a second logistics network;

[0007] Pairing and fusing the at least one first to-be-fused line and the at least one second to-be-fused line by using a random search algorithm to obtain at least one fusion route, wherein each fusion route is formed by fusing one first to-be-fused line and one second to-be-fused line, and the fusion route is the cost-time optimal to-be-fused line in the multiple to-be-fused lines corresponding to each second to-be-fused line;

[0008] Determining the at least one fusion route as a first fusion line combination of the target original line;

[0009] Calculating the first fusion line combination respectively with each original line in the first logistics network as the target original line to obtain multiple first fusion line combinations corresponding to multiple original lines;

[0010] Outputting logistics route fusion information based on the multiple first fusion line combinations.

[0011] The outputting logistics route fusion information based on the multiple first fusion line combinations comprises:

[0012] determining whether there are at least two second combination of fusion lines in the plurality of first combination of fusion lines, wherein the at least two second combination of fusion lines comprises at least one same fusion line;

[0013] if there are at least two second combination of fusion lines in the plurality of first combination of fusion lines, obtaining a third combination of fusion lines with minimum cost time from the at least two second combination of fusion lines;

[0014] outputting the logistics line fusion information based on the third combination of fusion lines and the plurality of first combination of fusion lines after removing the second combination of fusion lines.

[0015] wherein the at least one first to-be-fusion line and the at least one second to-be-fusion line are paired and fused by using a random search algorithm to obtain at least one fusion line, comprising:

[0016] obtaining the priority of the at least one first to-be-fusion line;

[0017] pairing and fusing the at least one first to-be-fusion line with the at least one second to-be-fusion line in turn based on the priority of the at least one first to-be-fusion line by using a random search algorithm;

[0018] removing the cargo volume of the paired and fused first to-be-fusion line from the cargo volume on the original line, and removing the paired and fused second to-be-fusion line from the at least one second to-be-fusion line;

[0019] ending the pairing and fusing when the cargo volume on the original line is zero or the at least one second to-be-fusion line is fully paired, to obtain the at least one fusion line.

[0020] wherein the pairing and fusing the at least one first to-be-fusion line with the at least one second to-be-fusion line in turn based on the priority of the at least one first to-be-fusion line by using a random search algorithm, comprising:

[0021] determining the first to-be-fusion line with the highest priority in the at least one first to-be-fusion line as a target first to-be-fusion line;

[0022] randomly searching the at least one second to-be-fusion line within the fusion distance range of the target first to-be-fusion line to obtain an optimal paired second to-be-fusion line of the target first to-be-fusion line;

[0023] randomly searching within the fusion distance range of the optimal paired second to-be-fusion line to obtain an optimal paired first to-be-fusion line of the optimal paired second to-be-fusion line;

[0024] If the optimal pairing first to-be-fusion line of the optimal pairing second to-be-fusion line is the target first to-be-fusion line, the target first to-be-fusion line and the optimal pairing second to-be-fusion line are paired and fused to obtain the fusion line.

[0025] The random search of the at least one second to-be-fusion line in the fusion distance range of the target first to-be-fusion line to obtain the optimal pairing second to-be-fusion line of the target first to-be-fusion line comprises:

[0026] The at least one second to-be-fusion line in the fusion distance range of the target first to-be-fusion line is randomly searched to obtain a plurality of third to-be-fusion lines.

[0027] A plurality of cost efficiencies of fusion of the target first to-be-fusion line and the plurality of third to-be-fusion lines are calculated based on cost efficiency calculation parameters of the target first to-be-fusion line and the plurality of third to-be-fusion lines.

[0028] The third to-be-fusion line corresponding to the minimum cost efficiency in the plurality of cost efficiencies is determined as the optimal pairing second to-be-fusion line of the target first to-be-fusion line.

[0029] The priority of the at least one first to-be-fusion line comprises:

[0030] The starting site level and the terminal site level of the first to-be-fusion line are obtained.

[0031] The priority of the first to-be-fusion line is determined based on the starting site level and the terminal site level of the first to-be-fusion line.

[0032] The at least one first to-be-fusion line corresponding to the target original line in the first logistics network and the at least one second to-be-fusion line in the second logistics network comprises, before:

[0033] The cargo volume of each original line in the first logistics network is obtained.

[0034] The sorting of each original line in the first logistics network is determined based on the cargo volume of each original line in the first logistics network.

[0035] The original line with the highest sorting is determined as the target original line.

[0036] In one aspect, the application provides a logistics line fusion device, which comprises:

[0037] An obtaining unit is configured to obtain at least one first to-be-fusion line corresponding to a target original line in a first logistics network and at least one second to-be-fusion line in a second logistics network.

[0038] The pairing fusion unit is configured to pair and fuse the at least one first to-be-fused line and the at least one second to-be-fused line by using a random search algorithm to obtain at least one fused line, wherein each fused line is formed by fusing one first to-be-fused line and one second to-be-fused line, and the fused line is a cost-time optimal to-be-fused line among a plurality of to-be-fused lines corresponding to each second to-be-fused line;

[0039] The determining unit is configured to determine the at least one fused line as a first fused line combination of the target original line.

[0040] The calculating unit is configured to calculate the first fused line combination respectively by taking each original line in the first logistics network as the target original line to obtain a plurality of first fused line combinations corresponding to the plurality of original lines.

[0041] The output unit is configured to output logistics line fusion information based on the plurality of first fused line combinations.

[0042] The output unit is further configured to determine whether at least two second fused line combinations exist in the plurality of first fused line combinations, wherein the at least two second fused line combinations include at least one same fused line.

[0043] If the at least two second fused line combinations exist in the plurality of first fused line combinations, a third fused line combination with minimum cost and time is obtained from the at least two second fused line combinations.

[0044] The output unit is further configured to output the logistics line fusion information based on the third fused line combination and the plurality of first fused line combinations after removing the second fused line combinations.

[0045] The pairing fusion unit is further configured to obtain a priority of the at least one first to-be-fused line.

[0046] The pairing fusion unit is further configured to pair and fuse the at least one first to-be-fused line and the at least one second to-be-fused line in sequence based on the priority of the at least one first to-be-fused line by using the random search algorithm.

[0047] The pairing fusion unit is further configured to remove the cargo volume of the paired and fused first to-be-fused line from the cargo volume of the original line, and remove the paired and fused second to-be-fused line from the at least one second to-be-fused line.

[0048] The pairing fusion unit is further configured to end the pairing and fusion when the cargo volume of the original line is zero or all the second to-be-fused lines are paired to obtain the at least one fused line.

[0049] The pairing and fusing unit is further configured to determine the first to-be-fused line with the highest priority as a target first to-be-fused line.

[0050] The pairing and fusing unit is further configured to perform random search on the at least one second to-be-fused line within a fusable distance range of the target first to-be-fused line, and obtain an optimal pairing second to-be-fused line of the target first to-be-fused line.

[0051] The pairing and fusing unit is further configured to perform random search within a fusable distance range of the optimal pairing second to-be-fused line, and obtain an optimal pairing first to-be-fused line of the optimal pairing second to-be-fused line.

[0052] If the optimal pairing first to-be-fused line of the optimal pairing second to-be-fused line is the target first to-be-fused line, the pairing and fusing unit is further configured to pair and fuse the target first to-be-fused line and the optimal pairing second to-be-fused line, and obtain the fused line.

[0053] The pairing and fusing unit is further configured to perform random search on the at least one second to-be-fused line within a fusable distance range of the target first to-be-fused line, and obtain a plurality of third to-be-fused lines.

[0054] The pairing and fusing unit is further configured to calculate a plurality of cost efficiencies of fusion of the target first to-be-fused line and the plurality of third to-be-fused lines based on cost efficiency calculation parameters of the target first to-be-fused line and the plurality of third to-be-fused lines.

[0055] The pairing and fusing unit is further configured to determine a third to-be-fused line corresponding to a minimum cost efficiency in the plurality of cost efficiencies as the optimal pairing second to-be-fused line of the target first to-be-fused line.

[0056] The pairing and fusing unit is further configured to obtain a starting site level and a terminal site level of the first to-be-fused line.

[0057] The pairing and fusing unit is further configured to determine a priority of the first to-be-fused line based on the starting site level and the terminal site level of the first to-be-fused line.

[0058] The obtaining unit is further configured to obtain a cargo volume of each original line in the first logistics network.

[0059] The obtaining unit is further configured to determine an order of each original line in the first logistics network based on the cargo volume of each original line in the first logistics network.

[0060] The pairing and fusing unit is further configured to determine the original line with the highest order as the target original line.

[0061] In one aspect, the present application also provides an electronic device, which comprises:

[0062] One or more processors;

[0063] a memory; and

[0064] one or more application programs, wherein the one or more application programs are stored in the memory and configured to be executed by the processor to implement the method for fusing logistics lines of any one of the first aspect.

[0065] In one aspect, the present application also provides a computer readable storage medium having stored thereon a computer program, the computer program being loaded by a processor to execute the steps in the method for fusing logistics lines of any one of the first aspect.

[0066] The present application provides a method for fusing logistics lines, which splits the original lines in a first logistics network to obtain a plurality of first to-be-fused lines, and uses a random search algorithm to respectively pair and fuse a plurality of second to-be-fused lines of a second logistics network to obtain a to-be-fused line with optimal cost and time efficiency, and then outputs the to-be-fused line with optimal cost and time efficiency of each original line in the first logistics network as the fused lines of the plurality of original lines. The method is suitable for fusing double-network trunk lines with their own stations and line bases, and can provide real-time logistics line fusion information. The method avoids information transmission lag and conflicts between fused lines caused by manual identification, and improves the efficiency of line fusion. BRIEF DESCRIPTION OF DRAWINGS

[0067] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed in the embodiment description will be briefly introduced. Obviously, the drawings in the following description are only some embodiments of the present application, and other drawings can be obtained by those skilled in the art without creative labor.

[0068] Figure 1 A scene schematic diagram of the logistics line fusion system provided by the embodiments of the present application;

[0069] Figure 2 An embodiment flowchart of the logistics line fusion method provided by the embodiments of the present application;

[0070] Figure 3 An embodiment flowchart of a specific embodiment S202 of the logistics line fusion method provided by the embodiments of the present application;

[0071] Figure 4 An embodiment structure schematic diagram of the logistics line fusion device provided by the embodiments of the present application;

[0072] Figure 5 An embodiment structure schematic diagram of the electronic device provided by the embodiments of the present application. DETAILED DESCRIPTION

[0073] With reference to the accompanying drawings, the technical solutions in the embodiments of the present application will be clearly and completely described below. Obviously, the described embodiments are only a part of the embodiments of the present application, rather than all the embodiments of the present application. Based on the embodiments in the present application, any person skilled in the art can obtain all other embodiments without creative work, which shall fall within the scope of protection of the present application.

[0074] In the description of the present application, it should be understood that the orientation or positional relationship indicated by the terms "center", "longitudinal", "lateral", "length", "width", "thickness", "upper", "lower", "front", "rear", "left", "right", "vertical", "horizontal", "top", "bottom", "inner", "outer" and the like is based on the orientation or positional relationship shown in the drawings, and is only for the convenience of describing the present application and simplifying the description, and does not indicate or imply that the device or element referred to must have a particular orientation, be constructed and operated in a particular orientation, and therefore cannot be understood as a limitation on the present application. In addition, the terms "first", "second" are only for descriptive purposes, and cannot be understood as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Therefore, the features defined as "first", "second" can explicitly or implicitly include one or more of the features. In the description of the present application, the meaning of "multiple" is two or more, unless otherwise explicitly and specifically limited.

[0075] In the present application, the word "exemplary" is used to mean "serving as an example, instance, or illustration". Any implementation described as "exemplary" in the present application is not necessarily to be construed as preferred or advantageous over other implementations. The following description is presented to enable any person skilled in the art to make and use the present application. In the following description, for the purpose of explanation, details are set forth. It is apparent to those skilled in the art that the present application can be practiced without using these specific details. In other instances, well-known structures and processes are not described in detail in order to avoid obscuring the description of the present application. Therefore, the present application is not intended to be limited to the embodiments shown, but is to be accorded the widest scope consistent with the principles and features disclosed herein.

[0076] It should be noted that the method of the present application is executed in an electronic device, and the processing object of each electronic device exists in the form of data or information, such as time, which is essentially time information. It can be understood that in subsequent embodiments, if the size, quantity, position, etc. are mentioned, they all exist in the corresponding data for processing by the electronic device, and specific details are not described here.

[0077] The present application provides a logistics route fusion method and device, electronic equipment and storage medium, which are described in detail below.

[0078] See also Figure 1 , Figure 1 This is a schematic diagram of a scenario of a logistics line fusion system provided in an embodiment of the present application. The logistics line fusion system may include an electronic device 100, in which a logistics line fusion device is integrated, such as Figure 1 electronic devices in the.

[0079] In the embodiments of the present application, the electronic device 100 may be an independent server, or a server network or server cluster composed of servers. For example, the electronic device 100 described in the embodiments of the present application includes but is not limited to a computer, a network host, a single network server, a set of multiple network servers, or a cloud server composed of multiple servers. The cloud server is composed of a large number of computers or network servers based on cloud computing.

[0080] Those skilled in the art will understand that Figure 1 The application environment shown in the figure is only one application scenario of the present application solution and does not constitute a limitation on the application scenario of the present application solution. Other application environments may also include Figure 1 More or fewer electronic devices as shown in, e.g. Figure 1 Only one electronic device is shown. It can be understood that the fusion system of the logistics line can also include one or more other servers, which are not limited here.

[0081] In addition, if Figure 1 As shown, the logistics line fusion system may further include a memory 200 for storing data.

[0082] It should be noted that Figure 1 The scenario diagram of the fusion system of logistics routes shown is only an example. The fusion system of logistics routes and the scenario described in the embodiment of the present application are intended to more clearly illustrate the technical solution of the embodiment of the present application, and do not constitute a limitation on the technical solution provided by the embodiment of the present application. Ordinary technicians in this field can know that with the evolution of the fusion system of logistics routes and the emergence of new business scenarios, the technical solution provided by the embodiment of the present application is also applicable to similar technical problems.

[0083] First, an embodiment of the present application provides a method for integrating logistics routes. The execution subject of the method is a logistics route integration device. The logistics route integration device is applied to an electronic device. The method includes:

[0084] Obtaining at least one first route to be financed corresponding to the target original route in the first logistics network and at least one second route to be financed in the second logistics network;

[0085] pairing and fusing the at least one first to-be-fused line and the at least one second to-be-fused line by using a random search algorithm to obtain at least one fused line, wherein each fused line is formed by fusing one first to-be-fused line and one second to-be-fused line, and the fused line is a cost-time optimal fusable line among a plurality of fusable lines corresponding to each second to-be-fused line;

[0086] determining the at least one fused line as a first fused line combination of the target original line;

[0087] respectively taking each original line in the first logistics network as a target original line to perform first fused line combination calculation, to obtain a plurality of first fused line combinations corresponding to the plurality of original lines;

[0088] outputting logistics line fusion information based on the plurality of first fused line combinations.

[0089] Referring to Figure 2 , Figure 2 is an embodiment flowchart of a logistics line fusion method provided by the present application. As shown in Figure 2 , the logistics line fusion method comprises:

[0090] S201, obtaining at least one first to-be-fused line corresponding to a target original line in a first logistics network and at least one second to-be-fused line in a second logistics network.

[0091] In the present application, the first logistics network can be a franchise mode logistics network, and the second logistics network can be a direct operation mode logistics network; the first logistics network can be a direct operation mode logistics network, and the second logistics network can be a franchise mode logistics network.

[0092] In the present application, before obtaining at least one first to-be-fused line corresponding to a target original line in a first logistics network and at least one second to-be-fused line in a second logistics network, it comprises: unifying the cargo volume measurement units of the first logistics network and the second logistics network to a pre-designed cargo volume measurement unit. For example, the cargo volume measurement unit in the first logistics network is weight, and the cargo volume measurement unit in the second logistics network is volume, then the cargo volume measurement units of the first logistics network and the second logistics network are unified to volume measurement units, which is convenient for subsequent line fusion.

[0093] In the present application, before obtaining at least one first to-be-fused line corresponding to a target original line in a first logistics network and at least one second to-be-fused line in a second logistics network, it comprises:

[0094] (1) obtaining the cargo volume of each original line in the first logistics network.

[0095] Specifically, for example, the first logistics network is network A, and the first logistics network includes two original routes A0-A5 and A10-A50, with a cargo volume of 30 cubic meters and 20 cubic meters, respectively.

[0096] (2) Determine the order of each original route in the first logistics network based on the cargo volume of each original route in the first logistics network.

[0097] Specifically, the larger the cargo volume of each original route, the higher the order of the original route. Of course, in other embodiments, the relationship between the cargo volume and the priority can be determined according to specific circumstances, which is not limited in the present application.

[0098] (3) Determine the original route with the highest order as the target original route.

[0099] Specifically, according to the principle that the cargo volume is proportional to the priority, the original route A0-A5 has the highest priority, and the original route A0-A5 is calculated as the target original route. The higher the priority of the original route, the more cargo volume it has, and the more likely it is to occur, such as warehouse explosion. Prioritizing the original route with the highest order to split into multiple first to-be-fusion lines and second logistics networks for fusion can improve the fusion effect of the logistics network.

[0100] In the embodiments of the present application, at least one fourth to-be-fusion line passing through the target original route in the first logistics network is obtained, and the target original route in the at least one fourth to-be-fusion line is removed to obtain at least one first to-be-fusion line. That is, the fourth to-be-fusion line is straightened at the target original route to form a first to-be-fusion line that does not pass through the target original route. For example, the target original route is A0-A5, with a cargo volume of 30 cubic meters, and A0 and A5 represent sites such as Wuhan and Shenzhen. At least one fourth to-be-fusion line passing through the target original route is A1-A0-A5-A2, with a cargo volume of 20 cubic meters; A3-A0-A5-A4, with a cargo volume of 10 cubic meters; and A7-A1-A0-A5-A2-A9, with a cargo volume of 20 cubic meters. The target original route in the at least one fourth to-be-fusion line is removed to obtain at least one first to-be-fusion line, which is A1-A2, A3-A4, and A7-A1-A2-A9, respectively.

[0101] S202, using a random search algorithm to pair and fuse the at least one first to-be-fusion line and the at least one second to-be-fusion line to obtain at least one fusion line, wherein each fusion line is formed by fusing one first to-be-fusion line and one second to-be-fusion line, and the fusion line is the cost-time optimal fusion line in the plurality of fusion lines corresponding to each second to-be-fusion line.

[0102] Referring to Figure 3 , Figure 3is a specific embodiment flowchart of S202 in the logistics line fusion method provided by the embodiment of the present application.

[0103] In the embodiment of the present application, at least one first to-be-fused line and at least one second to-be-fused line are paired and fused to obtain at least one fused line, comprising:

[0104] S301: Obtain the priority of at least one first to-be-fused line.

[0105] Specifically, the starting site level and the terminal site level of the first to-be-fused line are obtained; and the priority of the first to-be-fused line is determined based on the starting site level and the terminal site level of the first to-be-fused line. For example, the site type can be divided into three types, which are non-original line terminal site, transfer site, non-original line terminal site, original line starting site and original line terminal site; therefore, the priority of the first to-be-fused line can be determined according to the sum of the starting site level and the terminal site level of the first to-be-fused line. Specifically, the five first to-be-fused lines are: non-original line starting site-non-original line terminal site, non-original line starting site-transfer site, transfer site-transfer site, transfer site-non-original line terminal site, and original line starting site-original line terminal site. For example, A0-A5 can be divided into: A7-A1-A2-A9, A1-A2, A7 and A9 are starting and terminal end sites respectively, A1 and A2 are transfer sites respectively, and the priority of A7-A1-A2-A9 is higher than that of A1-A2.

[0106] S302: Using a random search algorithm, at least one first to-be-fused line is sequentially paired and fused with at least one second to-be-fused line based on the priority of the at least one first to-be-fused line.

[0107] Random search refers to a search method in which the search trajectory is randomly and uniformly scattered in the target distribution area under the condition that the target position basically obeys uniform distribution. Common random search algorithms mainly include simulated annealing algorithm, genetic algorithm, evolutionary strategy, etc.

[0108] Specifically, using a random search algorithm, at least one first to-be-fused line is sequentially paired and fused with at least one second to-be-fused line based on the priority of the at least one first to-be-fused line, comprising:

[0109] (1) Determine the first to-be-fused line with the highest priority as the target first to-be-fused line.

[0110] For example, the priority of A7-A1-A2-A9 is higher than that of A1-A2, and A7-A1-A2-A9 is determined as the target first to-be-fused line.

[0111] (2) In the range of the first target line, at least one second line is randomly searched to obtain the optimal second line of the first target line.

[0112] Specifically, the range of the first target line is divided into different ranges according to the different functions of the site, for example, the range of the first target line is 3km, 4km, etc.

[0113] In the range of the first target line, at least one second line is randomly searched to obtain the optimal second line of the first target line.

[0114] Based on the cost and time calculation parameters of the first target line and the third line, the cost and time of the fusion of the first target line and the third line are calculated. The cost and time calculation parameters can include the price of the vehicle, the cost of the line, and the time of the line delivery, etc. The relationship between the cost and time and the cost and time calculation parameters can be set according to the specific situation, and the cost and time can be calculated according to the cost and time calculation parameters, and the cost and time can be weighted to obtain the cost and time. For example, the cost and time of the fusion of the first target line A1-A2 and the third line B1-B2 is 100; the cost and time of the fusion of the first target line A1-A2 and the third line B3-B4 is 90.

[0115] The third line corresponding to the minimum cost and time in the multiple cost and times is determined as the optimal second line. For example, the third line B3-B4 is determined as the optimal second line of the first target line A1-A2.

[0116] (3) In the range of the optimal second line, the optimal first line of the optimal second line is obtained by randomly searching.

[0117] Based on the above method of obtaining the optimal second line of the first target line, the optimal first line of the optimal second line can be determined. For example, the optimal first line of the optimal second line B3-B4 is the first line A3-A4.

[0118] (4) If the optimal fusion line is the first target line, the first target line and the optimal second line are paired and fused to obtain the fusion line.

[0119] If the optimal pairing first to-be-fusion line of the optimal pairing second to-be-fusion line is the target first to-be-fusion line, it indicates that the target first to-be-fusion line and the optimal pairing second to-be-fusion line are the optimal pairing of each other, and thus the target first to-be-fusion line and the optimal pairing second to-be-fusion line are paired and fused to obtain a fusion line, which can ensure that the fusion line is the target original line of the first logistics network and the optimal pairing line of the second logistics network, improve the effect of line fusion, and reduce the cost and time. For example, the optimal pairing second to-be-fusion line of the target first to-be-fusion line A1-A2 is B3-B4, the optimal pairing line of the optimal pairing second to-be-fusion line B3-B4 is the target first to-be-fusion line A1-A2, and thus the optimal pairing second to-be-fusion line B3-B4 and the target first to-be-fusion line A1-A2 are fused.

[0120] Specifically, the target first to-be-fusion line and the optimal pairing second to-be-fusion line can be fused according to the loading and unloading information of each site. For example, the fusion line obtained by fusing the target first to-be-fusion line A1-A2 and the optimal pairing second to-be-fusion line B3-B4 is A1-B3-B4-A2.

[0121] If the optimal pairing first to-be-fusion line of the optimal pairing second to-be-fusion line is not the target first to-be-fusion line, the target first to-be-fusion line is not fused with the second logistics network.

[0122] S303: The cargo volume of the paired and fused first to-be-fusion line is removed from the cargo volume on the original line, and the paired and fused second to-be-fusion line is removed from at least one second to-be-fusion line.

[0123] In a specific embodiment, a to-be-reduced cargo volume unpaired and fused first to-be-fusion line is found from the unpaired and fused first to-be-fusion line, wherein the to-be-reduced cargo volume unpaired and fused first to-be-fusion line is a line of the paired and fused first to-be-fusion line. The cargo volume of the line of the paired and fused first to-be-fusion line is removed from the to-be-reduced cargo volume unpaired and fused first to-be-fusion line. In this way, when the to-be-reduced cargo volume unpaired and fused first to-be-fusion line is paired and fused, the cargo volume can be directly removed from the original line. The paired and fused first to-be-fusion line refers to the first to-be-fusion line that has completed pairing and fusion, the paired and fused first to-be-fusion line refers to the first to-be-fusion line that has completed pairing and fusion before, and the unpaired and fused first to-be-fusion line refers to the first to-be-fusion line that has not completed pairing and fusion.

[0124] In another specific embodiment, for each of the paired first to-be-fused lines, compare the paired first to-be-fused line with the first to-be-fused line after pairing fusion to obtain a to-be-reduced quantity paired first to-be-fused line, wherein any to-be-reduced quantity paired first to-be-fused line passes through the first to-be-fused line after pairing fusion. The quantity of the to-be-reduced quantity paired first to-be-fused line is subtracted from the first to-be-fused line after pairing fusion, and the quantity of the first to-be-fused line after pairing fusion after the reduction is removed from the quantity on the original line. For example, the original line is B-C, the first to-be-fused line after pairing fusion is A-C, the paired first to-be-fused line is A-D, and A-D passes through A-C. Then determine the to-be-reduced quantity paired first to-be-fused line as A-D, subtract the quantity of the to-be-reduced quantity paired first to-be-fused line A-D from the first to-be-fused line after pairing fusion A-C, and then remove the quantity of the first to-be-fused line A-C after pairing fusion after the reduction from the quantity on the original line.

[0125] S304: When the quantity on the target original line is zero or all the second to-be-fused lines are paired, end the pairing fusion to obtain at least one fused line.

[0126] When the quantity on the target original line is zero, it indicates that the quantity of the target original line has been completely split, and the target original line in the first logistics network has completed the line fusion task, and the fusion pairing can be ended. When all the second to-be-fused lines are paired, it indicates that the first logistics network and the second logistics network have completed the line fusion, and the fusion pairing can be ended.

[0127] S203, determine at least one fused line as a first fusion line combination of the target original line.

[0128] For example, the target original line A0-A5 in the first logistics network is split into two first to-be-fused lines, A1-A2 and A3-A4; the second logistics network has two second to-be-fused lines, B1-B2 and B3-B4. The two fused lines are A1-B3-B4-A2 and A3-B3-B4-A4. The two fused lines A1-B3-B4-A2 and A3-B3-B4-A4 are determined as the first fusion line combination of the target original line A0-A5.

[0129] S204, respectively, take each original line in the first logistics network as a target original line to perform first fusion line combination calculation to obtain a plurality of first fusion line combinations corresponding to a plurality of original lines.

[0130] Specifically, the cycles S201-S203 can be used to perform first fusion line combination calculation on each original line in the first logistics network, so as to obtain a plurality of first fusion line combinations corresponding to each original line. Since the target original line is the highest ranked original line, the first fusion line combination calculation is performed on the highest ranked original line among the remaining original lines each time, so that the highest ranked original line can be split and fused each time, and the effect of logistics fusion can be improved.

[0131] S205, outputting logistics line fusion information based on the plurality of first fusion line combinations.

[0132] In one specific embodiment, the logistics line fusion information is outputted based on the plurality of first fusion line combinations, including:

[0133] (1) determining whether there are at least two second fusion line combinations in the plurality of first fusion line combinations, wherein the at least two second fusion line combinations include at least one same fusion line.

[0134] Since different original routes can split the same first fusion line, there can be second fusion line combinations with repeated fusion lines. Therefore, it is necessary to determine whether there are second fusion line combinations with repeated fusion lines in the plurality of first fusion line combinations. For example, there are three original routes, A0-A5, A10-A15, and A20-A25. A0-A5 and A10-A15 both have two fusion lines A1-B3-B4-A2, so the first fusion line combinations corresponding to A0-A5 and A10-A15 are both second fusion line combinations.

[0135] (2) if there are at least two second fusion line combinations in the plurality of first fusion line combinations, obtaining a third fusion line combination with the minimum cost and time efficiency from the at least two second fusion line combinations.

[0136] Specifically, a plurality of cost and time efficiencies of each second fusion line combination are calculated according to the cost and time efficiency calculation parameters of each second fusion line combination. The cost and time efficiency calculation parameters can include vehicle price, line cost, and line delivery time efficiency, etc. The relationship between the cost and time efficiency and the cost and time efficiency calculation parameters can be set according to specific conditions. The cost and time efficiency can be obtained by weighting the cost and time efficiency calculated according to the cost and time efficiency calculation parameters. For example, the cost and time efficiency of the second fusion line combination corresponding to A0-A5 is 1000, and the cost and time efficiency of the second fusion line combination corresponding to A10-A15 is 900. Then, the second fusion line combination corresponding to A10-A15 is determined as the third fusion line combination.

[0137] (3) outputting the logistics line fusion information based on the third fusion line combination and the first fusion line combination after removing the second fusion line combination.

[0138] Specifically, the third fusion line combination and the first fusion line combination after removing the second fusion line combination are determined as the optimal fusion line combination, and the second fusion line combination after removing the third fusion line combination is determined as the abandoned fusion line combination. The fusion line in the abandoned fusion line combination is split into the to-be-fused line and put back into the first logistics network and the second logistics network. The output logistics line fusion information includes all fusion lines of the optimal fusion line combination, the cost time limit, the vehicle type, and the cargo volume of the original line, etc.

[0139] In another specific embodiment, when a new first fusion line combination is generated, a plurality of second fusion line combinations with repeated fusion lines of the new first fusion line combination are obtained from a plurality of recorded first fusion line combinations. The plurality of second fusion line combinations have repeated fusion lines with the new first fusion line combination, for example, one of the second fusion line combinations has a first repeated fusion line with the new first fusion line combination; another of the second fusion line combinations has a second repeated fusion line with the new first fusion line combination. For the first repeated fusion line, it is judged whether the combination cost time limit of the new first fusion line combination is smaller than that of the second fusion line combination with the first repeated fusion line. If the combination cost time limit of the new first fusion line combination is not smaller than that of the second fusion line combination with the first repeated fusion line, the first repeated fusion line is removed from the new first fusion line combination. It is judged whether the cost time limit of the new first fusion line combination after removing the line meets the preset combination cost time limit condition. If the cost time limit of the new first fusion line combination after removing the line does not meet the preset combination cost time limit condition, the new first fusion line combination is split into the to-be-fused line and put back into the first logistics network and the second logistics network, and the judgment of the next new first fusion line combination is performed. If the cost time limit of the new first fusion line combination after removing the line meets the preset combination cost time limit condition, for the second repeated fusion line, it is judged whether the cost time limit of the new first fusion line combination after removing the line is smaller than that of the second fusion line combination with the second repeated fusion line.

[0140] After the new first fusion line combination is compared with the plurality of second fusion line combinations for each repeated fusion line, if the new first fusion line combination is still not split, the new first fusion line combination is added to the plurality of recorded first fusion line combinations, and the repeated fusion line in the second fusion line combination with a larger cost time limit than the new first fusion line is removed. If the second fusion line combination after removing the line does not meet the preset combination cost time limit condition, the second fusion line combination after removing the line is split.

[0141] In order to better implement the fusion method of the logistics line in the embodiments of the present application, on the basis of the fusion method of the logistics line, the embodiments of the present application further provide a logistics line fusion device, as shown in Figure 4 Figure 4 which is a structural schematic diagram of an embodiment of the logistics line fusion device provided in the embodiments of the present application. The logistics line fusion device comprises:

[0142] An acquisition unit 401 is configured to acquire at least one first to-be-fused line corresponding to a target original line in a first logistics network and at least one second to-be-fused line in a second logistics network.

[0143] A pairing and fusion unit 402 is configured to perform pairing and fusion on the at least one first to-be-fused line and the at least one second to-be-fused line by using a random search algorithm to obtain at least one fused line, wherein each fused line is formed by fusing one first to-be-fused line and one second to-be-fused line, and the fused line is a cost-time optimal to-be-fused line in a plurality of to-be-fused lines corresponding to each second to-be-fused line.

[0144] A determination unit 403 is configured to determine the at least one fused line as a first fusion line combination of the target original line.

[0145] A calculation unit 404 is configured to perform first fusion line combination calculation by taking each original line in the first logistics network as the target original line to obtain a plurality of first fusion line combinations corresponding to the plurality of original lines.

[0146] An output unit 405 is configured to output logistics line fusion information based on the plurality of first fusion line combinations.

[0147] The output unit 405 is further configured to determine whether there are at least two second fusion line combinations in the plurality of first fusion line combinations, wherein the at least two second fusion line combinations include at least one same fused line.

[0148] If there are at least two second fusion line combinations in the plurality of first fusion line combinations, a third fusion line combination with the minimum cost and time is obtained from the at least two second fusion line combinations.

[0149] Based on the third fusion line combination and the plurality of first fusion line combinations after removing the second fusion line combinations, the output unit 405 outputs logistics line fusion information.

[0150] The pairing and fusion unit 402 is further configured to acquire a priority of the at least one first to-be-fused line.

[0151] The pairing and fusion unit 402 is further configured to perform pairing and fusion on the at least one first to-be-fused line and the at least one second to-be-fused line based on the priority of the at least one first to-be-fused line by using the random search algorithm.​

[0152] remove the cargo volume of the first to-be-fused line after pairing fusion from the cargo volume on the original line, and remove the second to-be-fused line after pairing fusion from the at least one second to-be-fused line;

[0153] end the pairing fusion when the cargo volume on the original line is zero or the at least one second to-be-fused line is completely paired, to obtain at least one fused line.

[0154] The pairing fusion unit 402 is further configured to determine a first to-be-fused line with the highest priority among the at least one first to-be-fused line as a target first to-be-fused line.

[0155] The pairing fusion unit 402 is further configured to perform random search on the at least one second to-be-fused line within a fusible distance range of the target first to-be-fused line, to obtain an optimal pairing second to-be-fused line of the target first to-be-fused line.

[0156] The pairing fusion unit 402 is further configured to perform random search within a fusible distance range of the optimal pairing second to-be-fused line, to obtain an optimal pairing first to-be-fused line of the optimal pairing second to-be-fused line.

[0157] If the optimal pairing first to-be-fused line of the optimal pairing second to-be-fused line is the target first to-be-fused line, the pairing fusion unit 402 is further configured to pair and fuse the target first to-be-fused line and the optimal pairing second to-be-fused line, to obtain a fused line.

[0158] The pairing fusion unit 402 is further configured to perform random search on the at least one second to-be-fused line within a fusible distance range of the target first to-be-fused line, to obtain a plurality of third to-be-fused lines.

[0159] The pairing fusion unit 402 is further configured to calculate a plurality of cost efficiencies of fusion of the target first to-be-fused line and the plurality of third to-be-fused lines based on cost efficiency calculation parameters of the target first to-be-fused line and the plurality of third to-be-fused lines.

[0160] The pairing fusion unit 402 is further configured to determine a third to-be-fused line corresponding to a minimum cost efficiency in the plurality of cost efficiencies as the optimal pairing second to-be-fused line.

[0161] The pairing fusion unit 402 is further configured to obtain a starting site level and a terminal site level of the first to-be-fused line.

[0162] The pairing fusion unit 402 is further configured to determine a priority of the first to-be-fused line based on the starting site level and the terminal site level of the first to-be-fused line.

[0163] The obtaining unit 401 is further configured to obtain cargo volumes of each original line in the first logistics network.

[0164] The obtaining unit 401 is further configured to determine an order of each original line in the first logistics network based on the cargo volumes of each original line in the first logistics network.

[0165] The original line with the highest ranking is determined as the target original line.

[0166] The embodiment of the present application further provides an electronic device integrating the fusion device of any one of the logistics lines provided by the embodiment of the present application. Figure 5 As shown in the figure, the structure schematic diagram of the electronic device related to the embodiment of the present application is shown, in particular:

[0167] The electronic device can include a processor 601 with one or more processing cores, a memory 602 with one or more computer readable storage media, a power supply 603, an input unit 604, and the like. Those skilled in the art can understand that the structure of the electronic device shown in the figure does not constitute a limitation on the electronic device, and can include more or fewer components than the figure, or combine certain components, or different component arrangements. Among them:

[0168] The processor 601 is the control center of the electronic device, which connects all parts of the electronic device through various interfaces and lines, executes the software programs and / or modules stored in the memory 602, and calls the data stored in the memory 602, executes various functions and processes data of the electronic device, and thus monitors the whole electronic device. Optionally, the processor 601 can include one or more processing cores; preferably, the processor 601 can integrate an application processor and a modem processor, wherein the application processor mainly processes the operating system, user interface and application program, etc., and the modem processor mainly processes wireless communication. It can be understood that the above-mentioned modem processor can also not be integrated into the processor 601.

[0169] The memory 602 can be used to store software programs and modules, and the processor 601 executes various functions and data processing by running the software programs and modules stored in the memory 602. The memory 602 can mainly include a program storage area and a data storage area, wherein the program storage area can store the operating system, at least one application program required by the function (such as sound playing function, image playing function, etc.), etc.; the data storage area can store the data created according to the use of the electronic device, etc. In addition, the memory 602 can include a high-speed random access memory, and can also include a non-volatile memory, such as at least one magnetic disk storage device, a flash memory device, or other volatile solid-state memory device. Accordingly, the memory 602 can also include a memory controller to provide access for the processor 601 to the memory 602.

[0170] The electronic device can further include a power supply 603 for supplying power to the various components. Preferably, the power supply 603 can be logically connected to the processor 601 through a power management system, so that the power management system can manage charging, discharging, and power consumption management, etc. The power supply 603 can also include one or more DC or AC power sources, a recharging system, a power failure detection circuit, a power converter or inverter, a power status indicator, etc.

[0171] The electronic device can further include an input unit 604 for receiving input digital or character information, and generating keyboard, mouse, joystick, optical or trackball signal inputs related to user settings and function controls.

[0172] Although not shown, the electronic device can further include a display unit, etc., which will not be described here. In particular, in the present embodiment, the processor 601 in the electronic device will load the executable file corresponding to the process of one or more application programs into the memory 602 according to the following instructions, and run the application program stored in the memory 602 by the processor 601, so as to realize various functions, such as:

[0173] Obtaining at least one first to-be-financed line corresponding to the target original line in the first logistics network and at least one second to-be-financed line in the second logistics network;

[0174] Pairing and fusing the at least one first to-be-financed line and the at least one second to-be-financed line by using a random search algorithm to obtain at least one financed line, wherein each financed line is formed by fusing one first to-be-financed line and one second to-be-financed line, and the financed line is the cost-time optimal to-be-financed line among a plurality of to-be-financed lines corresponding to each second to-be-financed line;

[0175] Determining the at least one financed line as a first fusion line combination of the target original line;

[0176] Respectively taking each original line in the first logistics network as a target original line to perform first fusion line combination calculation, to obtain a plurality of first fusion line combinations corresponding to a plurality of original lines;

[0177] Outputting logistics line fusion information based on the plurality of first fusion line combinations.

[0178] Those of ordinary skill in the art can understand that all or part of the steps in the various methods of the above embodiments can be completed by instructions, or by controlling related hardware by instructions, which can be stored in a computer readable storage medium and loaded and executed by a processor.

[0179] To this end, the embodiment of the present application provides a computer readable storage medium, which can include a read only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, etc. A computer program is stored on the storage medium, and the computer program is loaded by a processor to execute steps in any of the logistics route fusion methods provided by the embodiment of the present application. For example, the computer program loaded by the processor can execute the following steps:

[0180] obtaining at least one first to-be-fused line corresponding to the target original line in the first logistics network and at least one second to-be-fused line in the second logistics network;

[0181] performing pairing fusion on the at least one first to-be-fused line and the at least one second to-be-fused line by using a random search algorithm to obtain at least one fused line, wherein each fused line is formed by fusing one first to-be-fused line and one second to-be-fused line, and the fused line is a cost-time optimal fusable line in a plurality of fusable lines corresponding to each second to-be-fused line;

[0182] determining the at least one fused line as a first fused line combination of the target original line;

[0183] performing first fused line combination calculation by taking each original line in the first logistics network as the target original line to obtain a plurality of first fused line combinations corresponding to the plurality of original lines;

[0184] outputting logistics line fusion information based on the plurality of first fused line combinations.

[0185] In the above embodiments, the description of each embodiment has its own focus, and the parts not described in detail in a certain embodiment can be referred to the detailed description of other embodiments above, which will not be repeated here.

[0186] In a specific implementation, each of the above units or structures can be implemented as an independent entity, or can be combined as the same or several entities, and the specific implementation of each unit or structure can be referred to the method embodiments above, which will not be repeated here.

[0187] The specific implementation of each operation can be referred to the above embodiments, which will not be repeated here.

[0188] The fusion method and device of the logistics line provided by the embodiment of the application, the electronic device, and the storage medium are described in detail above. The principles and implementation manners of the application are described by applying specific examples in this paper. The above embodiment description is only used to help understand the method of the application and its core idea. At the same time, for those skilled in the art, according to the idea of the application, the specific implementation manners and application ranges will be changed. In conclusion, the content of the specification should not be understood as a limitation of the application.

Claims

1. A method for integrating logistics routes, characterized in that: The fusion method is used to fuse the routes of the first logistics network and the routes of the second logistics network, and the fusion method includes: Obtaining at least one first route to be financed corresponding to the target original route in the first logistics network and at least one second route to be financed in the second logistics network; Obtaining the priority of the at least one first line to be funded; determining the first line to be funded with the highest priority among the at least one first line to be funded as a target first line to be funded; Randomly searching the at least one second line to be fused within the fusion distance range of the target first line to be fused to obtain the optimal matching second line to be fused of the target first line to be fused; Performing a random search within the range of the translatable distance of the optimal paired second line to be translatable to obtain the optimal paired first line to be translatable of the optimal paired second line to be translatable; If the optimal paired first line to be fused of the optimal paired second line to be fused is the target first line to be fused, pairing and fusing the target first line to be fused with the optimal paired second line to be fused; The cargo volume of the first line to be financed after the paired fusion is removed from the cargo volume on the original line, and the second line to be financed after the paired fusion is removed from the at least one second line to be financed; When the cargo volume on the target original route is zero or all of the at least one second line to be financed are paired, the pairing and fusion are terminated to obtain at least one funded route; wherein each funded route is formed by the fusion of one of the first line to be financed and one of the second line to be financed, and the funded route is the funded route with the best cost and time efficiency among the multiple funded routes corresponding to each second line to be financed; Determining the at least one fused route as a first fused route combination of the target original routes; performing the first fused route combination calculation using each original route in the first logistics network as the target original route, to obtain a plurality of first fused route combinations corresponding to the plurality of original routes; Logistics route fusion information is output based on the multiple first fusion route combinations.

2. The method for integrating logistics routes according to claim 1, characterized in that: The outputting logistics route fusion information based on the plurality of first fusion route combinations includes: Determining whether there are at least two second fused line combinations among the plurality of first fused line combinations, wherein the at least two second fused line combinations include at least one identical fused line; If there are at least two second fused line combinations among the plurality of first fused line combinations, obtaining a third fused line combination with the minimum cost and time efficiency from the at least two second fused line combinations; The logistics route fusion information is output based on the third fusion route combination and the plurality of first fusion route combinations after removing the second fusion route combination.

3. The method for integrating logistics routes according to claim 1, wherein: The randomly searching the at least one second line to be fused within the fusionable distance range of the target first line to be fused to obtain the optimal paired second line to be fused of the target first line to be fused, comprising: Randomly searching the at least one second line to be funded within the flexibly flexibly distance range of the target first line to be funded to obtain a plurality of third lines to be funded; Calculating multiple cost efficiencies of integrating the target first line to be funded and the multiple third lines to be funded based on cost efficiencies calculation parameters of the target first line to be funded and the multiple third lines to be funded; The third line to be funded corresponding to the minimum cost efficiency among the multiple cost efficiency rates is determined as the optimal matching second line to be funded of the target first line to be funded.

4. The method for integrating logistics routes according to claim 1, wherein: The obtaining the priority of the at least one first line to be funded includes: Obtain the starting site grade and the ending site grade of the first line to be integrated; The priority of the first line to be accommodated is determined based on the starting site level and the ending site level of the first line to be accommodated.

5. The method for integrating logistics routes according to claim 1, wherein: Before obtaining at least one first route to be financed corresponding to the target original route in the first logistics network and at least one second route to be financed in the second logistics network, the method includes: Obtaining the cargo volume of each original route in the first logistics network; Determining the order of the original routes in the first logistics network based on the cargo volume of the original routes in the first logistics network; The original route with the highest ranking is determined as the target original route.

6. A fusion device for logistics lines, characterized in that: The fusion device of the logistics line includes: an acquiring unit, configured to acquire at least one first route to be financed corresponding to a target original route in the first logistics network and at least one second route to be financed in the second logistics network; The pairing and fusion unit is configured to obtain the priority of the at least one first line to be fused; determine the first line to be fused with the highest priority among the at least one first line to be fused as the target first line to be fused; perform a random search on the at least one second line to be fused within the fusion distance range of the target first line to be fused to obtain the optimal pairing second line to be fused of the target first line to be fused; perform a random search within the fusion distance range of the optimal pairing second line to be fused to obtain the optimal pairing first line to be fused of the optimal pairing second line to be fused; if the optimal pairing first line to be fused of the optimal pairing second line to be fused is the target first line to be fused If the target first line to be funded is a funded line, the target first line to be funded and the optimal paired second line to be funded are paired and merged; the cargo volume of the paired and merged first line to be funded is removed from the cargo volume on the original line, and the paired and merged second line to be funded is removed from the at least one second line to be funded; when the cargo volume on the target original line is zero or all of the at least one second line to be funded are paired, the pairing and fusion is terminated to obtain at least one funded line, wherein each funded line is formed by the fusion of one first line to be funded and one second line to be funded, and the funded line is the funded line with the best cost and time efficiency among the multiple funded lines corresponding to each second line to be funded; a determining unit, configured to determine the at least one fused route as a first fused route combination of the target original routes; a calculation unit, configured to perform first fused route combination calculation using each original route in the first logistics network as the target original route, to obtain a plurality of first fused route combinations corresponding to the plurality of original routes; An output unit is used to output logistics route fusion information based on the multiple first fusion route combinations.

7. An electronic device, characterized in that: The electronic device comprises: one or more processors; Memory; and One or more applications, wherein the one or more applications are stored in the memory and configured to be executed by the processor to implement the logistics route fusion method according to any one of claims 1 to 5.

8. A computer-readable storage medium, characterized in that A computer program is stored thereon, and the computer program is loaded by a processor to execute the steps in the logistics route fusion method according to any one of claims 1 to 5.

Images