Optimization method and system for logistics transportation scheme of replacing single-sided loop with double-sided loop

By constructing and solving the problem of logistics transportation solution optimization, and using column generation algorithm to optimize the bilateral loop replacement unilateral lines, the problem of incomplete single-sided line replacement in the logistics network is solved, and the maximum transportation cost savings and the improvement of computing efficiency is achieved.

CN114330970BActive Publication Date: 2024-11-12ZHEJIANG BAISHI TECH
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202111274916.2
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2021-10-29
Publication Date
2024-11-12
Estimated Expiration
2041-10-29

AI Technical Summary

Technical Problem

The prior art is difficult to efficiently identify and optimize whether the single-sided lines in the logistics network can be replaced with bilateral rings, especially when there are too many single-sided lines or more than 3 nodes are needed to connect, resulting in insufficient solutions for the bilateral rings to replace the single-sided lines. Comprehensive and transportation cost savings are not maximized.

Method used

By constructing the optimization problem of logistics and transportation schemes, using column generation algorithms and solvers, setting constraints based on the basic data of single-sided lines and bilateral loops to optimize the replacement of single-sided lines, ensuring capacity balance and cost minimization, and adopting the preferred solution Filter one-sided lines and generate bilateral loops, and iteratively solve them to achieve the optimal solution.

Benefits of technology

It has achieved the maximization of bilateral loop share in the logistics network, reduced transportation costs, and improved the calculation speed and optimality of transportation scheme optimization.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114330970B_ABST
    Figure CN114330970B_ABST
Patent Text Reader

Abstract

The present invention discloses a logistics transportation scheme optimization method and optimization system for replacing a single side with a double-sided loop line. The optimization method first extracts and screens a set of single-sided lines that meet the screening conditions from a transportation task management system according to a given single-sided line screening condition, and then solves the constructed logistics transportation scheme optimization problem through a column generation algorithm based on the basic data of each single-sided line and the double-sided loop line to be replaced with the single-sided line, and takes the guaranteed transportation capacity after optimization and the number of double-sided loop lines and single-sided lines that are not replaced as non-negative integers as constraints, and obtains a logistics transportation scheme with the minimum overall transportation cost of the logistics network. The present invention constructs a logistics transportation scheme optimization problem and uses a column generation algorithm to solve the logistics transportation scheme with the minimum overall transportation cost of the logistics network, thereby ensuring the efficiency of the scheme solution and the comprehensiveness of the solution result.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the technical field of logistics transportation route optimization, and in particular to a logistics transportation scheme optimization method and optimization system for replacing a single-sided loop line with a double-sided loop line. Background Art

[0002] The transportation resources in the logistics network are usually divided into two categories: bilateral and unilateral. Bilateral refers to routes with transportation demand in both the forward and reverse directions. For example, A (such as Beijing)-B (such as Hangzhou) and BA both have transportation demand. At this time, you can request two vehicles from the carrier to execute the AB and BA routes respectively, or request one vehicle to execute the ABA route. That is, the bilateral must ensure that the number of transportation vehicles in the originating distribution and the destination distribution remains unchanged before and after the transportation task is executed. Unilateral means that there is transportation demand in only one direction. For example, for route AB, you only need to request one vehicle from the carrier to execute the AB route, and the carrier is responsible for balancing the number of vehicles in the originating distribution and the destination distribution. Generally speaking, the per-kilometer cost of unilateral vehicles is much higher than that of bilateral vehicles (usually about 1.5 times) due to empty driving on the return trip. Therefore, by limiting empty driving and maximizing the proportion of bilateral transportation capacity, the transportation cost can be greatly reduced.

[0003] like Figure 1 As shown in the figure, it is assumed that the logistics network has two unilateral routes AB and CA, the distance between AB and CA is 1000 kilometers, and the distance between BC is 200 kilometers. Both AB and CA have logistics transportation needs, while BC has no transportation demand. It is assumed that two unilateral vehicles X and Y perform the transportation tasks of the two routes AB and CA respectively. If the transportation costs of the unilateral routes AB and CA are both 8 yuan / km, then the daily cost of the two vehicles X and Y to perform the AB and CA routes is (1000+1000)×8=16000 yuan. Assuming that the transportation cost of the bilateral route is 6 yuan / km, if the two unilateral routes AB and CA are converted into the bilateral loop ABCA, a bilateral vehicle Z can be requested to perform the loop transportation task. Although the Z vehicle is empty in the BC section, the transportation cost of the Z vehicle to perform a trip on the ABCA loop is reduced to (1000+1000+200)×6=13200 yuan. Therefore, it can be seen that the transportation cost of logistics companies can be greatly reduced by maximizing the proportion of bilateral transportation capacity.

[0004] However, at present, the identification of whether a single-sided route can be replaced by a double-sided loop mainly relies on simple data analysis or manual enumeration. For example, for each logistics distribution point, the single-sided routes of its departure and arrival are manually counted. If the end point of a single-sided route of departure is close to the starting point of a single-sided route of arrival or there is a single-sided task between the two points, the potential cost savings can be further calculated. If the savings are large, the three points are connected to form a double-sided loop. Figure 1 Take the three points A, B, and C shown as an example. The one-way route starting from A is AB (the end point of AB is B), and the one-way route to A is CA (the starting point of CA is C). If simple data analysis or manual identification finds that the distance between the end point B and the starting point C is relatively close or there is a one-way transportation task between B and C, then a loop ABCA is formed between the three points A, B, and C, and the cost of executing the loop ABCA is calculated compared to the total cost of executing the one-way routes AB, BC, and CA separately. If the savings are large, the three one-way routes AB, BC, and CA are constructed into an ABCA loop. However, this simple data analysis or manual enumeration method has the following two problems:

[0005] 1. If there are many unilateral routes in the logistics network, such as nearly a thousand or more, or if more than three nodes need to be connected to build a bilateral loop, the amount of calculation required by manual enumeration or existing simple data analysis methods is staggering, and it is impossible to efficiently provide the optimization results of the logistics transportation plan for replacing unilateral routes with bilateral loops;

[0006] 2. Even if all feasible bilateral loops that are to replace the unilateral routes are obtained through brute force enumeration, since the same unilateral route may appear in different bilateral loops, the existing simple data analysis method cannot select the most suitable bilateral loop from the bilateral loop set to replace the corresponding unilateral route, so as to save the most overall logistics and transportation costs. Summary of the invention

[0007] The present invention aims to increase the proportion of bilateral loops in the logistics network, maximize the savings in logistics transportation costs and at the same time ensure the calculation speed of logistics transportation plan optimization. It provides a logistics transportation plan optimization method and optimization system in which bilateral loops replace single-sided loops.

[0008] To achieve this object, the present invention adopts the following technical solutions:

[0009] A method for optimizing a logistics transportation solution by replacing a single-sided loop with a double-sided loop is provided, comprising the following steps:

[0010] S1, according to the given unilateral route screening condition, extract and screen the unilateral route set that meets the screening condition from the transportation task management system;

[0011] S2, construct the logistics transportation plan optimization problem;

[0012] S3, according to the basic data of each unilateral line and the bilateral loop line that is to replace the unilateral line, and with the constraints that the optimized transport capacity is guaranteed and the number of runs of the bilateral loop line and the unilateral line that is not replaced is a non-negative integer, the logistics transportation plan optimization problem is solved by a column generation algorithm to obtain a logistics transportation plan with the lowest overall transportation cost of the logistics network.

[0013] As a preferred solution of the present invention, in step S1, the unilateral route screening condition includes a specified date range for unilateral route screening and a threshold value of the number of operating days of each unilateral route within the specified date range.

[0014] As a preferred embodiment of the present invention, the method for screening the unilateral line comprises the steps of:

[0015] S11, calculating the number of operating days of each of the unilateral routes within a specified date range;

[0016] S12, judging whether the number of days each of the unilateral lines is in operation is greater than a given threshold of days in operation,

[0017] If yes, the unilateral line is selected and added to the unilateral line set;

[0018] If not, the unilateral line is not added to the unilateral line set.

[0019] As a preferred solution of the present invention, the maximum number of distribution nodes in the bilateral loop given in step S3=3.

[0020] As a preferred solution of the present invention, the logistics transportation solution optimization problem in step S3 is expressed by the following formula (1):

[0021]

[0022] In formula (1), C represents the set of bilateral loops c whose number of nodes does not exceed the given number of nodes;

[0023] R represents the set of all unilateral lines r;

[0024] f c represents the transportation cost of the bilateral loop line c;

[0025] x c is a decision variable, indicating the number of the bilateral loop lines c opened;

[0026] p r represents the transportation cost of the unilateral route r;

[0027] y r is a decision variable, representing the number of the single-side routes r opened;

[0028] a cr Indicates whether the bilateral loop c contains the unilateral line r, a cr =1 indicates that the bilateral loop c contains the unilateral line r; a cr =0 means that the bilateral loop c does not contain the unilateral line r;

[0029] n r It represents the average daily operation times of the single-side line r.

[0030] As a preferred solution of the present invention, the method for solving the logistics transportation solution optimization problem comprises the steps of:

[0031] S31, constructing the logistics transportation plan optimization problem as a restricted master problem;

[0032] S32, solving the restricted main problem using a solver;

[0033] S33, construct and solve a sub-problem, and determine whether the optimal solution to the sub-problem is greater than or equal to 0,

[0034] If yes, the optimal solution of the restricted main problem obtained in step S32 is used as the optimal solution for solving the logistics transportation plan optimization problem;

[0035] If not, the newly generated columns in solving the sub-problem are added to the restricted main problem, and the process returns to step S32 to continue solving the problem until the optimal solution of the sub-problem is greater than or equal to 0.

[0036] As a preferred solution of the present invention, the restricted main problem constructed in step S31 is expressed by the following formula (2):

[0037]

[0038] In formula (2),

[0039] As a preferred solution of the present invention, the sub-problem constructed in step S33 is expressed by the following formula (3):

[0040]

[0041] In formula (3), i,j represent allocation i and allocation j;

[0042] H represents the distribution set of all the single-side lines screened out;

[0043] x ijIndicates whether the line segment ij connecting the distribution i and the distribution j appears in the double-sided loop, x ij =1 indicates that the line segment ij appears in the bilateral loop, x ij =0 means that the line segment ij does not appear in the bilateral loop;

[0044] f ij represents the transportation price of the line segment ij according to bilateral billing;

[0045] λ r Representation Constraints The dual variable of

[0046] x o(r),d(r) Indicates whether the line segment o(r)-d(r) connecting the originating distribution o(r) and the destination distribution d(r) appears in the double-sided loop, x o(r),d(r) = 0 means that the line segment o(r)-d(r) does not appear in the double-sided loop; x o(r),d(r) =1 means that the line segment o(r)-d(r) appears in the double-sided loop;

[0047] L represents the maximum number of nodes allowed by the bilateral loop;

[0048] The constraint ∑ in formula (3) j∈H x ij ≤1 Used to ensure that each of the line segments ij only appears in one of the bilateral loops;

[0049] Constraint∑ j∈H x ij =∑ j∈H x ji Used to ensure that the line segment ij selected last can form a bilateral loop;

[0050] Constraint∑ j∈H x ij ≤L is used to ensure that the number of nodes in each of the bilateral loops does not exceed a given number of nodes L.

[0051] As a preferred solution of the present invention, a solver is used to solve the restricted main problem expressed by formula (2) and the sub-problem expressed by formula (3).

[0052] The present invention also provides a logistics transportation scheme optimization system for replacing a single side with a double-sided loop line, which can implement the logistics transportation scheme optimization method. The logistics transportation scheme optimization system includes:

[0053] Parameter input module, used to provide users with parameters required to input optimized logistics transportation solutions;

[0054] A unilateral route extraction and screening module, connected to the parameter input module, is used to automatically extract and screen out a set of unilateral routes that meet the conditions from the transportation task management system according to the screening conditions input by the user;

[0055] A bilateral loop generation module, connected to the parameter input module and the unilateral line extraction and screening module, respectively, for generating a bilateral loop to replace the unilateral line after screening out the unilateral line set, based on the maximum number of nodes of the bilateral loop input by the user as a constraint;

[0056] A transportation cost calculation module, connected to the bilateral loop generation module and the unilateral route extraction and screening module, respectively, for calculating the transportation cost of each bilateral loop generated and the transportation cost of the unilateral route that has not been replaced;

[0057] An optimization problem construction module, used to provide the user with a method for constructing a logistics transportation solution optimization problem;

[0058] A solution constraint setting module, used to provide the user with the constraint conditions for solving the logistics transportation plan optimization problem;

[0059] The optimization problem solving module is respectively connected to the unilateral route extraction and screening module, the bilateral loop generation module, the transportation cost calculation module, the optimization problem construction module and the solution constraint setting module, and is used to solve the constructed logistics transportation plan optimization problem based on the basic data corresponding to the generated bilateral loop and the unilateral route that has not been replaced, and with the constraints that the optimized transportation capacity is guaranteed and the number of the bilateral loop and the unilateral route that has not been replaced is a non-negative integer, to obtain the logistics transportation plan with the minimum overall transportation cost of the logistics network. The present invention has the following beneficial effects:

[0060] 1. By constructing and solving the logistics transportation plan optimization problem, the optimal solution for replacing the unilateral route with the generated bilateral loop line is obtained to save the most logistics transportation costs. This solves the technical problems faced by simple data analysis and manual exhaustive replacement of unilateral routes in the past, such as the bilateral loop lines to be replaced with unilateral routes are not comprehensive enough, the replacement plan is not optimal, and the cost savings are not the highest due to the large number of logistics network distributions;

[0061] 2. The logistics and transportation plan optimization problem as the main problem is constructed as a restricted main problem through the column generation algorithm, and the optimality conditions for solving the main problem are judged by constructing and solving sub-problems. If it is satisfied, the solution of the restricted main problem is used as the solution of the logistics and transportation plan optimization problem. If it is not satisfied, the sub-problems are iteratively calculated, and the columns generated by the sub-problem solution are used as the variables for solving the restricted main problem to solve the restricted main problem again until the optimality conditions for solving the main problem are met. The column generation algorithm solves the technical problems of difficulty in directly solving the logistics and transportation plan optimization problem due to many dependent variables and slow direct solution speed. BRIEF DESCRIPTION OF THE DRAWINGS

[0062] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the following briefly introduces the drawings required for use in the embodiments of the present invention. Obviously, the drawings described below are only some embodiments of the present invention, and for ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0063] Figure 1 It is a schematic diagram of a double-sided loop line replacing a single-sided line;

[0064] Figure 2 This is a diagram of implementation steps of a method for optimizing a logistics transportation solution of replacing a single-sided loop line with a double-sided loop line provided in one embodiment of the present invention;

[0065] Figure 3 It is a flowchart for solving the restricted main problem;

[0066] Figure 4 It is a structural schematic diagram of a logistics transportation solution optimization system for replacing a single-sided loop line with a double-sided loop line provided by an embodiment of the present invention;

[0067] Figure 5 It is a schematic diagram of the parameter input interface provided by the logistics and transportation plan optimization system. DETAILED DESCRIPTION

[0068] The technical solution of the present invention is further described below with reference to the accompanying drawings and through specific implementation methods.

[0069] Among them, the drawings are only used for illustrative explanations, and they only represent schematic diagrams rather than actual pictures, and should not be understood as limitations on this patent; in order to better illustrate the embodiments of the present invention, some parts of the drawings may be omitted, enlarged or reduced, and do not represent the size of the actual product; for those skilled in the art, it is understandable that some well-known structures and their descriptions in the drawings may be omitted.

[0070] The same or similar numbers in the drawings of the embodiments of the present invention correspond to the same or similar parts; in the description of the present invention, it should be understood that if the terms "upper", "lower", "left", "right", "inner", "outer", etc. appear, the orientation or position relationship indicated is based on the orientation or position relationship shown in the drawings, which is only for the convenience of describing the present invention and simplifying the description, rather than indicating or implying that the device or element referred to must have a specific orientation, be constructed and operated in a specific orientation. Therefore, the terms describing the position relationship in the drawings are only used for illustrative purposes and cannot be understood as a limitation on this patent. For ordinary technicians in this field, the specific meanings of the above terms can be understood according to specific circumstances.

[0071] In the description of the present invention, unless otherwise clearly specified and limited, if the term "connection" or the like appears to indicate the connection relationship between components, the term should be understood in a broad sense, for example, it can be a fixed connection, a detachable connection, or an integral connection; it can be a mechanical connection or an electrical connection; it can be a direct connection or an indirect connection through an intermediate medium, it can be the internal connection of two components or the interaction relationship between two components. For ordinary technicians in this field, the specific meanings of the above terms in the present invention can be understood according to specific circumstances.

[0072] The embodiment of the present invention provides a method for optimizing a logistics transportation solution by replacing a single-sided loop line with a double-sided loop line. Figure 2 As shown, it includes the following 3 steps:

[0073] Step S1, according to the unilateral route screening conditions given by the user, extract and screen out a set of unilateral routes that meet the screening conditions from the transportation task management system; in this embodiment, the unilateral route screening conditions include the specified date range for unilateral route screening (for example, the specified date range for screening is from January 1 to January 7, 2021) and the threshold of the number of days each unilateral route is running within the specified date range. Since bilateral loop lines usually have vehicles running every day, and many unilateral routes are not running every day, replacing unilateral routes with low running frequencies (for example, only one day a week) with bilateral loop lines is not of great value in saving overall logistics and transportation costs. Therefore, when screening unilateral routes, the present invention sets a threshold for the number of days of operation of the unilateral routes, filters out unilateral routes with less running days than the threshold for the number of days of operation within the specified date range, and retains unilateral routes with more running days than the threshold for the number of days of operation, which is beneficial to improving the value of unilateral route replacement. At the same time, since the number of unilateral routes to be replaced after filtering is reduced, it is beneficial to improve the calculation speed of logistics and transportation plan optimization.

[0074] Specifically, the basic data of the single-side line extracted first is shown in Table 1 below:

[0075]

[0076] Table 1

[0077] As can be seen from Table 1 above, the basic data of a unilateral route includes but is not limited to the departure date, bus number, origin distribution, destination distribution and transportation cost of the logistics transport vehicle executing the unilateral route.

[0078] Then, based on the number of days that the shuttle buses of each extracted unilateral route run within the specified date range, the unilateral routes with the number of days running greater than the threshold of the number of days running are screened out. For example, the specified date range for the screening of unilateral routes is from January 1 to January 7, 2021. According to the scheduling plan, during these 7 days, there are shuttle buses that perform the transportation task of the unilateral route Beijing (origin distribution) - Hangzhou (destination distribution) from January 1 to 4, and there are no shuttle buses that perform the transportation task of the unilateral route from January 5 to 7. In this case, during the 7 days from January 1 to 7, the number of days that the Beijing-Hangzhou unilateral route runs is 4. If the preset threshold of the number of days running is 3, the number of days that the unilateral route runs within the specified date range of January 1 to 7 is greater than the preset threshold of the number of days running, so it is considered that the unilateral route has the value of being replaced by the bilateral loop line, and the unilateral route Beijing-Hangzhou is screened out.

[0079] When screening unilateral routes, it is necessary to calculate the average daily number of runs of each unilateral route within the specified date range and the average cost of performing the transportation task of the unilateral route. The average daily number of runs of each unilateral route within the specified date range is used as one of the constraints for the subsequent optimization of the logistics and transportation plan to ensure the capacity balance of the optimized logistics network. The average daily number of runs of a unilateral route is calculated as follows: assuming that within the specified date range of January 1-7, 2021, the unilateral route runs twice a day from January 1 to 3, runs once on January 4, and does not run from January 5 to 7. The average daily number of runs of the unilateral route is If the cost of each single-side route is 10,000 yuan, then the average transportation cost of each single-side route for 7 transportation tasks from January 1 to 7 is Yuan.

[0080] The average transportation cost of each unilateral route within the specified date range is one of the constants for solving the logistics transportation plan optimization problem and needs to be calculated in advance.

[0081] The data details of each single-side line screened out are shown in Table 2 below:

[0082]

[0083] Table 2

[0084] Step S2, constructing a logistics transportation plan optimization problem;

[0085] The logistics transportation plan optimization problem constructed in the embodiment of the present invention is expressed by the following formula (1):

[0086]

[0087] The meanings of the symbols in formula (1) are shown in Table 3 below:

[0088]

[0089] Table 3

[0090] Specifically, C represents the set of bilateral loops c generated in step S2 whose number of nodes does not exceed the given number of nodes;

[0091] R represents the set of all unilateral lines r;

[0092] f c represents the transportation cost of the bilateral loop c;

[0093] x c is a decision variable, indicating the number of bilateral loop lines c opened;

[0094] p r represents the transportation cost of a single route r;

[0095] y r is a decision variable, indicating the number of single-side routes r opened;

[0096] a cr Indicates whether the bilateral loop c contains the unilateral line r, a cr =1 indicates that the bilateral loop c contains the unilateral line r; a cr =0 means that the bilateral loop c does not contain the unilateral line r;

[0097] n r It represents the average daily number of runs on single-side line r.

[0098] In formula (1), the objective function min∑ c∈C f c x c +∑ r∈R p r y r The meaning of is to minimize the sum of the costs of the bilateral loop and the unilateral line;

[0099] The first constraint condition ∑ c∈C a cr x c +y r ≥n r The meaning of is to ensure that the total capacity of the double-sided loop line of the replaced single-sided line and the single-sided line that has not been replaced meets the original total capacity requirements of the single-sided line before the line replacement; for example, for the single-sided line AB(1), its n r =1, there are now three bilateral loops: ABCA(1), ACDA(2), CABC(3), of which loops (1) and (3) contain the single-side line (1), so a 11 =1,a 21 =0,a 31 =1, the formula is x1+x3+y r ≥1, meaning that at least one of the loop line (1), loop line (3) and single-side line (1) must be in operation.

[0100] The second constraint x in formula (1) c ≥0,y r ≥0 and the third constraint x c ,y r The reason for the decision variable x to be an integer is to ensure that c ,y r A non-negative integer.

[0101] Step S3, according to the basic data of each unilateral line and the bilateral loop line that is to replace the unilateral line, and with the constraints that the optimized transport capacity is guaranteed and the number of bilateral loop lines and unilateral lines that are not replaced is a non-negative integer, the logistics transportation plan optimization problem is solved by a column generation algorithm to obtain a logistics transportation plan with the lowest overall transportation cost of the logistics network.

[0102] A logistics network may contain hundreds of distribution points. If the number of nodes in the bilateral loop that is to replace the single-sided line is set to more than 3, the process of solving the optimization problem will become complicated and it is difficult to solve the optimization problem quickly and comprehensively. In order to solve this problem, the present invention adopts a heuristic method based on column generation. The basic idea is to first ignore the integer constraints in formula (1), solve the optimization problem as a linear programming problem using a column generation algorithm, and then use all generated columns as a set C of bilateral loops. Finally, use this set C to solve the optimization problem.

[0103] Column generation is a method for solving linear programming problems with a large number of variables. For minimization problems, the basic calculation process is as follows: Figure 3As shown. In this embodiment, we call the linear programming problem to be solved (logistics and transportation scheme optimization problem) the master problem (Master Problem, MP). The basic process is to first add only a small number of variables (also called "columns") to construct a restricted master problem (Restricted Master Problem, RMP). After solving the RMP, it is necessary to determine whether the optimality condition for solving the original problem (logistics and transportation scheme optimization problem) (in this embodiment, the optimality condition is that the reducedcost (test number) of all columns is greater than or equal to 0) is met. In this embodiment, a sub-problem is constructed to determine whether the optimality condition is met, that is, to solve in is the reduced cost of column j. If the optimal solution of the subproblem is greater than or equal to 0, the optimal solution of RMP is the optimal solution of MP. Otherwise, the newly generated columns in the subproblem are added to RMP to continue solving until the optimality condition is met.

[0104] The following is a detailed description of the process of solving the logistics transportation plan optimization problem using the column generation algorithm:

[0105] First, the logistics transportation plan optimization problem (MP) is constructed as a restricted master problem (RMP), which is expressed by the following formula (2):

[0106]

[0107] In formula (2), Initially, let After using the solver to solve the restricted main problem expressed by formula (2) and obtaining the bilateral loop to replace the single-sided line, we need to determine whether there are other bilateral loops that meet the requirements and can further reduce the function value of the optimization problem. We solve this problem by constructing the sub-problem expressed by the following formula (3):

[0108]

[0109] The meanings of the symbols in formula (3) are shown in Table 4 below:

[0110]

[0111] Table 4

[0112] Specifically, i,j represents allocation i and allocation j;

[0113] H represents the distribution set of all the single-side lines screened out;

[0114] z ij Indicates whether the line segment ij connecting distribution i and distribution j appears in the double-sided loop, xij = 1 means that the line segment ij appears in the double-sided loop, x ij =0 means that the line segment ij does not appear in the double-sided loop;

[0115] f ij represents the transportation price of segment ij according to bilateral charging;

[0116] λ r Representation Constraints The dual variable of

[0117] x o(r),d(r) Indicates whether the line segment o(r)-d(r) connecting the originating distribution o(r) and the destination distribution d(r) appears in the double-sided loop, x o(r),d(r) = 0 means that the line segment o(r)-d(r) does not appear in the double-sided loop; x o(r),d(r) =1 means that the line segment o(r)-d(r) appears in the double-sided loop;

[0118] L represents the maximum number of nodes allowed in a bilateral loop;

[0119] The constraint ∑ in formula (3) j∈H x ij ≤1 Used to ensure that each line segment ij only appears in one bilateral loop;

[0120] Constraint∑ j∈H x ij =∑ j∈H x ji Used to ensure that the last selected line segment ij can form a bilateral loop;

[0121] Constraint∑ j∈H x ij ≤L is used to ensure that the number of nodes in each bilateral loop does not exceed the given number of nodes L.

[0122] The following is an example of the constraints that the three constraints in formula (3) can play:

[0123] For example, there are 4 allocations 1, 2, 3, and 4, and there is a variable x between each of these 4 allocations. ij , that is, x 12 、x 13 、x 14 、x 21 、x 23 、x 24 、x 31 、x 32 、x 34 、x 41 、x 42 、x 43The first constraint ∑ j∈H x ij ≤1 For allocation 1, it is x 12 +x 13 +x 14 ≤1, indicating that allocation 1 is connected to at most one remaining allocation (2, 3, 4);

[0124] The second constraint ∑ j∈H x ij =∑ j∈H x ji For allocation 1, it is x 12 +x 13 +x 14 =x 21 +x 32 +x 41 , which means that the number of distribution 1 connected to other distributions is equal to the number of other distributions connected to distribution 1, which ensures that the result is a ring;

[0125] The last constraint ∑ j∈H x ij ≤L adds up all the x, indicating that all connections cannot exceed L.

[0126] Then, the solver is used to solve the subproblem expressed in formula (3). If the optimal solution of the subproblem is greater than or equal to 0, the subproblem solving process is terminated and the optimal solution of RMP is used as the optimal solution of MP. Otherwise, the newly generated columns in solving the subproblem are added to the restricted main problem, and the restricted main problem is continued to be solved until the optimal solution of the subproblem is greater than or equal to 0, and the subproblem solving process is terminated.

[0127] After solving, a line replacement plan with cost saving potential is generated, such as shown in Table 5 below:

[0128]

[0129] Table 5

[0130] It should be noted that in the process of solving the logistics transportation plan optimization problem, there are many specific methods to generate a bilateral loop to replace a unilateral route. For example, the bilateral loop to replace the unilateral route can be generated by calculating the distance between the origin distribution point of one unilateral route and the destination distribution point of another unilateral route. Figure 1 , Figure 1For example, the distance between the destination branch point "B" of the unilateral line AB and the starting branch point "A" of the unilateral line CA is 200 kilometers. We set the generation condition of the bilateral loop line as "the starting branch of unilateral line 1 is the same as the destination branch of unilateral line 1, and the distance between the destination branch of unilateral line 1 and the starting branch of unilateral line 2 is less than or equal to 200 kilometers". Then AB as unilateral line 1 and CA as unilateral line 2 just meet the above bilateral loop line generation conditions, so a bilateral loop line ABCA can be generated between the three points of branch A, B, and C. Then, the bilateral loop line is used as a variable to solve the optimization problem to verify whether the solution of the optimization problem satisfies the optimal solution. If so, the bilateral loop line ABCA is used as a loop line to replace the unilateral lines AB and CA, and a line replacement scheme as shown in Table 5 above is formed.

[0131] In order to facilitate users to obtain a logistics transportation optimization plan in a visual manner by applying the logistics transportation plan optimization method provided in this embodiment, the present invention also provides a logistics transportation plan optimization system for replacing a single-sided loop with a double-sided loop, such as Figure 4 As shown, the system includes:

[0132] The parameter input module is used to provide users with the parameters required to input the optimized logistics transportation plan. For the parameter input interface, please refer to Figure 5 , the input parameters include the specified date range, the number of days to be counted back, the threshold of normal single-side line (i.e., the threshold of the number of days that a single-side line is in operation within the specified date range), the maximum number of nodes of the regular loop line (the maximum number of nodes allowed in the bilateral loop line that is to replace the single-side line), the domain (the type of filter object for the single-side line, for example, the domain is "express delivery" which means that the filter object for the single-side line is an express delivery line), the regular price per kilometer (the price per kilometer of the bilateral loop line), in Figure 5 Enter the calculation deadline in the "Calculation Deadline" column in the interface, and enter the number of days to calculate backwards. This will determine that the specified date range for logistics and transportation plan optimization is the date range from the calculation deadline to the number of days to calculate backwards.

[0133] The unilateral route extraction and screening module is connected to the parameter input module and is used to automatically extract and screen out the unilateral route set that meets the conditions from the transportation task management system according to the screening conditions input by the user;

[0134] The bilateral loop generation module is connected to the parameter input module and the unilateral line extraction and screening module respectively, and is used to generate a bilateral loop to replace the unilateral line according to the maximum number of nodes of the bilateral loop input by the user after screening out the unilateral line set;

[0135] The transportation cost calculation module is connected to the bilateral loop generation module and the unilateral route extraction and screening module respectively, and is used to calculate the transportation cost of each bilateral loop generated and the transportation cost of the unilateral route that has not been replaced;

[0136] The optimization problem building module is used to provide users with the ability to build logistics and transportation solution optimization problems;

[0137] The solution constraint setting module is used to provide users with the constraint conditions for solving the logistics transportation plan optimization problem;

[0138] The optimization problem solving module is respectively connected to the unilateral route extraction and screening module, the bilateral loop line generation module, the transportation cost calculation module, the optimization problem construction module and the solution constraint setting module. It is used to solve the constructed logistics transportation plan optimization problem according to the basic data corresponding to the generated bilateral loop lines and the non-replaced unilateral routes, and with the constraints that the optimized transportation capacity is guaranteed and the number of bilateral loop lines and non-replaced unilateral routes opened is a non-negative integer, to obtain the logistics transportation plan with the minimum overall transportation cost of the logistics network.

[0139] The following is a further description of the process by which the system optimizes and outputs the logistics transportation plan after the user inputs the parameters:

[0140] For example, the system selects the sample unilateral line information according to the filter conditions entered by the user as shown in Table 6 below:

[0141]

[0142] The distances between each distribution room in Table 6 (in kilometers) are shown in Table 7 below:

[0143]

[0144] In Table 7, the maximum number of nodes of the bilateral loop line given by the user is "3", and the per-kilometer transportation price of the bilateral loop line is 6 yuan.

[0145] The system constructs the logistics transportation plan optimization problem as a restricted master problem and then starts the first iterative calculation. First, let Then, the solver is used to solve the restricted master problem expressed in formula (2), and the dual variables (λ in formula (3)) corresponding to the single-side routes Hangzhou-Beijing, Beijing-Jinhua, Yiwu-Beijing, and Beijing-Wuhan are obtained. r ) are 10000, 12000, 11500, and 9000 respectively. Then, the obtained dual variables are used to construct and solve the subproblem expressed in formula (3) to obtain the optimal solution x ij (i is Yiwu, j is Beijing) = 1 (indicates that the unilateral route from Yiwu to Beijing appears in the generated bilateral loop), x ij(i is Beijing, j is Jinhua) = 1, x ij (i is Jinhua, j is Yiwu) = 1. At this time, the optimal value obtained by solving formula (3), that is, the reduced cost, is -6562. The negative reduced cost indicates that the optimality condition for solving the main problem has not been met, so further iterative calculations are required for the sub-problem. The bilateral loop generated by the first iteration is Yiwu-Beijing-Jinhua-Yiwu; in the second iteration, Solving the restricted main problem expressed in formula (2) yields the dual variables corresponding to the single-side routes Hangzhou-Beijing, Beijing-Jinhua, Yiwu-Beijing, and Beijing-Wuhan as 10,000, 12,000, 4,938, and 9,000, respectively. Using the obtained dual variables, we solve the subproblems and obtain the optimal solution x ij (i is Hangzhou, j is Beijing) = 1, x ij (i is Beijing, j is Jinhua) = 1, x ij (i is Jinhua, j is Hangzhou) = 1. At this time, the optimal value obtained by solving the subproblem, that is, the reduced cost, is -5014. It is necessary to continue iterating. After the second iteration, the generated bilateral loop is Hangzhou-Beijing-Jinhua-Hangzhou. In the third iteration, The subproblem is constructed by using the dual variables obtained by solving the restricted main problem expressed by formula (2). Its optimal value is 0, and no new bilateral loops can be generated. The optimality condition for solving the main problem is met, and the column generation process ends. The optimal solution x of the main problem expressed by formula (1) is obtained by using the two generated bilateral loops (Yiwu-Beijing-Jinhua-Yiwu, Hangzhou-Beijing-Jinhua-Hangzhou). c (c is a bilateral loop: Yiwu-Beijing-Jinhua-Yiwu) = 1, y r1 (r1 is a single-side route: Beijing-Wuhan) = 1, y r2 (r2 is the unilateral route: Hangzhou-Beijing) = 1, that is, the original unilateral routes Yiwu-Beijing and Beijing-Jinhua are replaced by the bilateral loop Yiwu-Beijing-Jinhua-Yiwu, and the original unilateral routes Hangzhou-Beijing and Beijing-Wuhan are not replaced. The cost saved by this replacement plan is 11,500 (Yiwu-Beijing unilateral route transportation cost) + 12,000 (Beijing-Jinhua unilateral route transportation cost) - 6 (bilateral loop line per kilometer transportation cost) * (1396 (Yiwu-Beijing kilometers) + 1409 (Jinhua-Beijing kilometers) + 18 (Yiwu-Jinhua kilometers)) = 6,562 yuan. The final optimized output logistics transportation plan is shown in Table 8 below:

[0146]

[0147] Table 8

[0148] After outputting the logistics and transportation optimization plan, users need to evaluate the optimization plan and, based on the bidding situation of vehicle resources, decide which bilateral loop lines can be put online and which unilateral lines will be replaced. After the bilateral loop lines are online, users need to monitor their operation and calculate the actual cost savings achieved.

[0149] In summary, the present invention constructs and solves the logistics and transportation plan optimization problem, replaces multiple single-sided routes with high logistics and transportation costs and replacement value with a low-cost bilateral loop line, which greatly saves logistics and transportation costs, and solves the optimization problem through a column generation algorithm, which simplifies the complexity of solving the optimization problem with many dependent variables and improves the efficiency of solving the optimization problem. In addition, the constructed logistics and transportation plan optimization system provides users with the parameters required for input plan optimization in a visual manner, and can quickly solve and output logistics and transportation plans with single-sided line replacement value according to different plan optimization requirements of users.

[0150] It should be noted that the above specific implementations are only preferred embodiments of the present invention and the technical principles used. Those skilled in the art should understand that various modifications, equivalent substitutions, changes, etc. can be made to the present invention. However, as long as these changes do not deviate from the spirit of the present invention, they should be within the scope of protection of the present invention. In addition, some terms used in the specification and claims of this application are not restrictive, but are only for the convenience of description.

Claims

1. A method for optimizing logistics transportation schemes by replacing a single-sided loop with a double-sided loop, characterized in that: Includes steps: S1, according to the given unilateral route screening condition, extract and screen the unilateral route set that meets the screening condition from the transportation task management system; S2, construct the logistics transportation plan optimization problem; S3, according to the basic data of each unilateral route and the bilateral loop line to be replaced by the unilateral route, and with the guaranteed transport capacity after optimization and the number of runs of the bilateral loop line and the unilateral route not replaced being a non-negative integer as constraints, solve the logistics transportation plan optimization problem by means of a column generation algorithm, and obtain a logistics transportation plan with the minimum overall transportation cost of the logistics network; In step S1, the unilateral route screening condition includes a specified date range for unilateral route screening and a threshold of the number of operating days of each unilateral route within the specified date range; The method for screening the unilateral line comprises the steps of: S11, calculating the number of operating days of each of the unilateral routes within a specified date range; S12, judging whether the number of days each of the unilateral lines is in operation is greater than a given threshold of days in operation, If yes, the unilateral line is selected and added to the unilateral line set; If not, the unilateral line is not added to the unilateral line set; The maximum number of distribution nodes in the bilateral loop given in step S3 = 3; The logistics transportation plan optimization problem in step S3 is expressed by the following formula (1): In formula (1), C represents the set of bilateral loops c whose number of nodes does not exceed the given number of nodes; R represents the set of all unilateral lines r; f c represents the transportation cost of the bilateral loop line c; x c is a decision variable, indicating the number of the bilateral loop lines c opened; p r represents the transportation cost of the unilateral route r; y r is a decision variable, representing the number of the single-side routes r opened; a cr Indicates whether the bilateral loop c contains the unilateral line r, a cr =1 indicates that the bilateral loop c contains the unilateral line r; a cr =0 means that the bilateral loop c does not include the unilateral line r; n r represents the average daily number of operations of the single-side line r; The method for solving the logistics transportation plan optimization problem includes the following steps: S31, constructing the logistics transportation plan optimization problem as a restricted master problem; S32, solving the restricted main problem using a solver; S33, construct and solve a sub-problem, and determine whether the optimal solution to the sub-problem is greater than or equal to 0, If yes, the optimal solution of the restricted main problem obtained in step S32 is used as the optimal solution for solving the logistics transportation plan optimization problem; If not, the newly generated columns in solving the sub-problem are added to the restricted main problem, and the process returns to step S32 to continue solving the problem until the optimal solution of the sub-problem is greater than or equal to 0; The restricted master problem constructed in step S31 is expressed by the following formula (2): In formula (2), The sub-problem constructed in step S33 is expressed by the following formula (3): In formula (3), i and j represent allocation i and allocation j; H represents the distribution set of all the single-side lines screened out; x ij Indicates whether the line segment i-j connecting the distribution i and the distribution j appears in the bilateral loop, x ij =1 indicates that the line segment ij appears in the bilateral loop, x ij =0 means that the line segment ij does not appear in the bilateral loop; f ij represents the transportation price of the line segment ij according to bilateral billing; λ r Representation Constraints The dual variable of x o(r),d(r) Indicates whether the line segment o(r)-d(r) connecting the originating distribution o(r) and the destination distribution d(r) appears in the double-sided loop, x o(r),d(r) = 0 means that the line segment o(r)-d(r) does not appear in the double-sided loop; x o(r),d(r) =1 means that the line segment o(r)-d(r) appears in the double-sided loop; L represents the maximum number of nodes allowed by the bilateral loop; The constraints in formula (3) Used to ensure that each of the line segments i-j only appears in one of the bilateral loops; constraint Used to ensure that the line segment i-j selected last can form a bilateral loop; Constraint∑ j∈H x ij ≤L is used to ensure that the number of nodes in each of the bilateral loops does not exceed a given number of nodes L; The solver is used to solve the restricted main problem expressed by formula (2) and the sub-problem expressed by formula (3).

2. A logistics transportation plan optimization system for replacing a single-sided loop with a double-sided loop, which can implement the logistics transportation plan optimization method as claimed in claim 1, characterized in that: The logistics transportation scheme optimization system includes: Parameter input module, used to provide users with parameters required to input optimized logistics transportation solutions; A unilateral route extraction and screening module, connected to the parameter input module, is used to automatically extract and screen out a set of unilateral routes that meet the conditions from the transportation task management system according to the screening conditions input by the user; A bilateral loop generation module, connected to the parameter input module and the unilateral line extraction and screening module, respectively, for generating a bilateral loop to replace the unilateral line after screening out the unilateral line set, based on the maximum number of nodes of the bilateral loop input by the user as a constraint; A transportation cost calculation module, connected to the bilateral loop generation module and the unilateral route extraction and screening module, respectively, for calculating the transportation cost of each bilateral loop generated and the transportation cost of the unilateral route that has not been replaced; An optimization problem construction module, used to provide the user with a method for constructing a logistics transportation solution optimization problem; A solution constraint setting module, used to provide the user with the constraint conditions for solving the logistics transportation plan optimization problem; The optimization problem solving module is respectively connected to the unilateral route extraction and screening module, the bilateral loop line generation module, the transportation cost calculation module, the optimization problem construction module and the solution constraint setting module, and is used to solve the constructed logistics transportation plan optimization problem according to the basic data corresponding to the generated bilateral loop lines and the unilateral routes that have not been replaced, and with the constraints that the optimized transportation capacity is guaranteed and the number of the bilateral loop lines and the unilateral routes that have not been replaced is a non-negative integer, so as to obtain the logistics transportation plan with the minimum overall transportation cost of the logistics network.