Logistics network planning method, device and computer readable storage medium

By constructing the objective function to optimize logistics transportation resources and distribution parameters and determine the optimal distribution parameters, the problem of poor timeliness of logistics distribution routes is solved and the user experience is improved.

CN112837001BActive Publication Date: 2024-11-26SF TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN201911153661.7
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2019-11-22
Publication Date
2024-11-26
Estimated Expiration
2039-11-22

AI Technical Summary

Technical Problem

There is a problem of poor delivery route timelines in the existing logistics distribution methods, which cannot meet the needs of users, resulting in poor user experience.

Method used

By obtaining historical logistics capacity resource parameters and distribution parameters, the objective function is constructed to optimize the total distribution timeline of the distribution route and determine the optimal target distribution parameters to improve the timeliness of the distribution route.

Benefits of technology

It effectively improves the timeliness of delivery routes, improves user experience, and solves the problem of poor timeliness of delivery routes.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN112837001B_ABST
    Figure CN112837001B_ABST
Patent Text Reader

Abstract

The embodiment of the present application discloses a logistics network planning method, device and computer-readable storage medium, the logistics network planning method includes obtaining historical logistics capacity resource parameters and at least two groups of distribution parameters, the distribution parameters include the distribution plan on each distribution route in the logistics network, the distribution route is the route from the central warehouse to the service station; constructing an objective function based on the distribution parameters and the logistics capacity resource parameters, the objective function represents the total distribution timeliness; calculating at least two objective function output values ​​corresponding to at least two groups of distribution parameters based on the objective function; determining the distribution parameter corresponding to the optimal value of at least two objective function output values ​​as the target distribution parameter. The present application can effectively improve the timeliness of the distribution route and improve the user experience.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of logistics distribution, and specifically to a logistics network planning method, device and computer-readable storage medium. Background Art

[0002] In recent years, with the rapid development of the industry, competition among companies has become increasingly fierce, and commodity delivery services have attracted more and more attention from consumers. The delivery timeliness of commodities is an extremely urgent issue. There are many types of commodities, and the area of ​​service stations is limited. It is impossible to store all commodities in service stations. Enterprises will establish central spare parts warehouses in central cities of various provinces. For example, a company has more than 50 central warehouses and hundreds of service stations. When a service station has a demand for commodities, the service station will transfer goods to the central warehouse in the same province. This distribution relationship between the central warehouse in the provincial capital city and the service station has the problem of poor timeliness of some lines, which cannot meet the needs of users.

[0003] That is, the logistics distribution method in the prior art has the problem of poor delivery route timeliness and poor user experience. Summary of the invention

[0004] The embodiments of the present application provide a logistics network planning method, device and computer-readable storage medium, which can effectively improve the timeliness of delivery routes and enhance user experience.

[0005] In a first aspect, the present application provides a logistics network planning method, the logistics network planning method comprising:

[0006] Obtain historical logistics capacity resource parameters and at least two sets of distribution parameters, wherein the distribution parameters include a distribution plan on each distribution route in the logistics network, and the distribution route is a route from a central warehouse to a service station;

[0007] Constructing an objective function based on the delivery parameters and the logistics transport resource parameters, wherein the objective function represents the total delivery time efficiency;

[0008] Calculate at least two objective function output values ​​corresponding to at least two groups of delivery parameters respectively based on the objective function;

[0009] The delivery parameter corresponding to the optimal value of at least two objective function output values ​​is determined as the target delivery parameter.

[0010] The logistics transport capacity resource parameters include the target number of delivery types, and the objective function is constructed based on the delivery parameters and the logistics transport capacity resource parameters, including:

[0011] The objective function is constructed with the delivery parameters as decision variables and the number of target delivery types as the first variable.

[0012] The obtaining of historical logistics capacity resource parameters and at least two sets of delivery parameters includes:

[0013] Obtain at least two sets of delivery parameters, historical target delivery time on at least two delivery routes, and historical target delivery type quantity on at least two delivery routes;

[0014] The method of constructing an objective function by taking the delivery parameter as the decision variable and the target delivery type quantity as the first variable includes:

[0015] The objective function is constructed with the delivery parameters as decision variables, the target delivery type quantity as the first variable, and the target delivery time efficiency as the second variable.

[0016] The step of obtaining at least two sets of delivery parameters, historical target delivery time efficiency on at least two delivery routes, and historical target delivery type quantity on at least two delivery routes includes:

[0017] When there are historical delivery time efficiencies on the preset delivery route, the shortest historical delivery time efficiencies among the historical delivery time efficiencies are determined as the historical target delivery time efficiencies.

[0018] The step of obtaining at least two sets of delivery parameters, historical target delivery time efficiency on at least two delivery routes, and historical target delivery type quantity on at least two delivery routes includes:

[0019] When there is no historical delivery time limit on the preset delivery route, obtain the location information of the service station and the central warehouse on the preset delivery route;

[0020] Navigate based on the location information of the service station and the central library to obtain navigation time efficiency;

[0021] The historical delivery time efficiency is determined based on the navigation time efficiency.

[0022] The step of obtaining at least two sets of delivery parameters, historical target delivery time efficiency on at least two delivery routes, and historical target delivery type quantity on at least two delivery routes includes:

[0023] Get the historical delivery time corresponding to each delivery type on the preset delivery route;

[0024] Counting the number of preset delivery time limits in the historical delivery time limits corresponding to each delivery type on the preset delivery route, wherein the preset delivery time limit is the historical delivery time limit whose time limit value does not exceed the preset time limit value;

[0025] The number of the preset delivery time limits is determined as the number of the historical target delivery types on the preset delivery route.

[0026] The constraints of the objective function include:

[0027] There is only a delivery route between a single service station and one central warehouse.

[0028] In a second aspect, the present application provides a logistics network planning device, the logistics network planning device comprising:

[0029] An acquisition module, used to acquire historical logistics capacity resource parameters and at least two groups of distribution parameters, wherein the distribution parameters include a distribution plan on each distribution route, and the distribution route is a route from a central warehouse to a service station;

[0030] A construction module, used to construct an objective function based on the delivery parameters and the logistics transport resource parameters, wherein the objective function represents the total delivery time efficiency;

[0031] A calculation module, used for respectively calculating at least two objective function output values ​​corresponding to at least two groups of delivery parameters based on the objective function;

[0032] The determination module is used to determine the delivery parameter corresponding to the optimal value of at least two objective function output values ​​as the target delivery parameter.

[0033] Among them, the logistics capacity resource parameters include the target number of delivery types, and the construction module is also used to construct the objective function with the delivery parameters as decision variables and the target number of delivery types as the first variable.

[0034] The acquisition module is further used to acquire at least two sets of delivery parameters, historical target delivery time efficiency on at least two delivery routes, and historical target delivery type quantity on at least two delivery routes;

[0035] The construction module is also used to construct an objective function with the target delivery type quantity as the first variable and the target delivery time efficiency as the second variable.

[0036] The acquisition module is further configured to, when there are historical delivery time limits on a preset delivery route, determine the shortest historical delivery time limit among the historical delivery time limits as the historical target delivery time limit.

[0037] Wherein, the acquisition module is further used to acquire the location information of the service station and the central warehouse on the preset delivery route when there is no historical delivery time limit on the preset delivery route;

[0038] Navigate based on the location information of the service station and the central library to obtain navigation time efficiency;

[0039] The historical delivery time efficiency is determined based on the navigation time efficiency.

[0040] The acquisition module is further used to acquire the historical delivery time corresponding to each delivery type on the preset delivery route;

[0041] Counting the number of preset delivery time limits in the historical delivery time limits corresponding to each delivery type on the preset delivery route, wherein the preset delivery time limit is the historical delivery time limit whose time limit value does not exceed the preset time limit value;

[0042] The number of the preset delivery time limits is determined as the number of the historical target delivery types on the preset delivery route.

[0043] The constraints of the objective function include:

[0044] There is only a delivery route between a single service station and one central warehouse.

[0045] In a third aspect, the present application further provides a logistics network planning device, the logistics network planning device comprising:

[0046] one or more processors;

[0047] Memory; and

[0048] 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 network planning method described in any one of the first aspects.

[0049] In a fourth aspect, the present application further provides a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, wherein the computer program is suitable for loading by a processor to execute the logistics network planning method of any one of the first aspects.

[0050] The beneficial effects of the present application are as follows: the present application provides a logistics network planning method, the logistics network planning method includes: obtaining historical logistics capacity resource parameters and at least two groups of distribution parameters, the distribution parameters including the distribution plan on each distribution route in the logistics network, the distribution route being the route from the central warehouse to the service station; constructing an objective function based on the distribution parameters and the logistics capacity resource parameters, the objective function representing the total distribution time efficiency; calculating at least two objective function output values ​​corresponding to at least two groups of distribution parameters based on the objective function; determining the distribution parameter corresponding to the optimal value of at least two objective function output values ​​as the target distribution parameter. In the case where the logistics distribution method in the prior art has poor distribution route time efficiency, the present application creatively constructs an objective function with the optimal total distribution time efficiency as the goal based on the logistics capacity resource parameters and the distribution parameters, optimizes the distribution parameters, and thereby determines the optimal target distribution parameters, which can effectively improve the time efficiency of the distribution route and improve the user experience. BRIEF DESCRIPTION OF THE DRAWINGS

[0051] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings required for use in the description of the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For those skilled in the art, other drawings can be obtained based on these drawings without creative work.

[0052] Figure 1 This is a flow chart of an embodiment of a logistics network planning method provided by an embodiment of the present application;

[0053] Figure 2 It is a schematic diagram of the structure of an embodiment of a logistics network planning device provided in an embodiment of the present application;

[0054] Figure 3 It is a structural diagram of another embodiment of the logistics network planning device provided in the embodiment of the present application. DETAILED DESCRIPTION

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

[0056] In the description of the present application, it should be understood that the terms "center", "longitudinal", "lateral", "length", "width", "thickness", "up", "down", "front", "back", "left", "right", "vertical", "horizontal", "top", "bottom", "inside", "outside" and the like indicate positions or positional relationships based on the positions or positional relationships shown in the accompanying drawings, which are only for the convenience of describing the present application and simplifying the description, and do not indicate or imply that the device or element referred to must have a specific orientation, be constructed and operated in a specific orientation, and therefore cannot be understood as a limitation on the present application. In addition, the terms "first" and "second" are used 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" and "second" may explicitly or implicitly include one or more features. In the description of the present application, the meaning of "multiple" is two or more, unless otherwise clearly and specifically defined.

[0057] In this application, the word "exemplary" is used to mean "used as an example, illustration, or description." Any embodiment described in this application as "exemplary" is not necessarily to be construed as being preferred or advantageous over other embodiments. The following description is given to enable any technician in the field to implement and use the present application. In the following description, details are listed for the purpose of explanation. It should be understood that a person of ordinary skill in the art can recognize that the present application can be implemented without using these specific details. In other instances, well-known structures and processes will not be elaborated in detail to avoid obscuring the description of the present application with unnecessary details. Therefore, the present application is not intended to be limited to the embodiments shown, but is consistent with the widest scope consistent with the principles and features disclosed in the present application.

[0058] Embodiments of the present application provide a logistics network planning method, device, and computer-readable storage medium.

[0059] First, the embodiment of the present application provides a logistics network planning method, which includes: obtaining historical logistics capacity resource parameters and at least two groups of distribution parameters, the distribution parameters include the distribution plan on each distribution route in the logistics network, and the distribution route is the route from the central warehouse to the service station; constructing an objective function based on the distribution parameters and the logistics capacity resource parameters, and the objective function represents the total distribution time; calculating at least two objective function output values ​​corresponding to at least two groups of distribution parameters based on the objective function; determining the distribution parameter corresponding to the optimal value of at least two objective function output values ​​as the target distribution parameter. The following are detailed descriptions.

[0060] First reference Figure 1 , Figure 1 This is a flow chart of an embodiment of a logistics network planning method provided by an embodiment of the present application. The logistics network planning method may include:

[0061] S11: Obtain historical logistics capacity resource parameters and at least two sets of distribution parameters, where the distribution parameters include distribution plans on each distribution route, and the distribution route is a route from the central warehouse to the service station.

[0062] Central warehouses are generally located in central cities of each province, such as provincial capitals and larger cities. Central warehouses can be used to store large quantities of goods. Service stations are widely distributed, mainly located in small cities or county towns, and the amount of goods stored is smaller than that of central warehouses. When a service station has a demand for goods, the service station will transfer goods to the central warehouse. For example, in Yunnan Province, Kunming has a central warehouse, and Chuxiong, Lijiang, Yuxi and other cities have service stations; in Sichuan Province, Chengdu has a central warehouse, and Panzhihua, Leshan, Deyang and other cities have service stations. Therefore, by connecting the central warehouse and the service station in pairs, at least two delivery routes can be obtained.

[0063] Specifically, first define the distribution parameters. The distribution parameters include the distribution plan on each distribution route in the logistics network. If the distribution route is for distribution, the distribution parameter of the distribution route is defined as 1; if the distribution route is not for distribution, the distribution parameter of the distribution route is defined as 0. Therefore, after defining the distribution parameters for at least two distribution routes respectively, a set of distribution parameters can be obtained. For example. The distribution route includes two distribution routes, distribution route A is from Kunming Central Warehouse to Panzhihua Service Station, and no distribution is performed; distribution route B is from Kunming Central Warehouse to Yuxi Service Station, and distribution is performed. A set of distribution parameters [0,1] can be obtained. Therefore, when different distribution plans are adopted, at least two sets of distribution parameters can be obtained. At least two sets of distribution parameters can be listed in sequence by exhaustive enumeration. For example, when there are two distribution routes, four sets of distribution parameters can be listed, namely [0,0], [1,0], [1,1], [0,1]. Of course, at least two groups of distribution parameters can also be obtained manually through experience summary, and input into the logistics network planning device through keyboard input, voice input, etc., so as to obtain at least two groups of distribution parameters.

[0064] In some embodiments of the present application, the logistics capacity resource parameters include the number of target delivery types. Obtain at least two sets of delivery parameters, the historical target delivery time on at least two delivery routes, and the historical number of target delivery types on at least two delivery routes. The parameter of the target delivery type number reflects the land, air, and human resources provided by the logistics company in this delivery route. The larger the number of target delivery types, the more resources the logistics company has in this delivery route, and the smaller the number of target delivery types, the smaller the resources the logistics company has in this delivery route. Therefore, the target delivery type number can affect its total delivery time. In other embodiments, the logistics capacity resource parameters may also include other parameters such as the number of vehicles on the delivery route, which is not limited in the present application.

[0065] In a specific embodiment, the historical delivery time on the preset route is obtained. Among them, the historical delivery time on the preset route is the time for the goods to be transported from the central warehouse on the preset route to the service station. The historical delivery time on the preset route can be obtained through the waybill recorded in the history. The historical delivery time on the preset route can be data within the historical 60 days, the historical 90 days or other time periods, which can be selected according to the specific situation, and the present application does not limit this. Specifically, the historical waybill delivery time is obtained from the waybill recorded in the history, and the historical waybill delivery time is the actual delivery time of each previous waybill. The average value of the historical waybill delivery time is determined as the historical delivery time. Of course, the historical waybill delivery time corresponding to the preset quantile in the historical waybill delivery time can be determined as the historical delivery time. The preset quantile can be the larger quartile, the median, the 95th percentile, etc., which can be selected according to the specific situation, and the present application does not limit this.

[0066] When there is no historical delivery time efficiency on the preset delivery route, obtain the location information of the service station and the central warehouse on the preset delivery route. Specifically, the location information of the service station and the central warehouse can be obtained through a map tool, for example, the longitude and latitude information of the service station and the central warehouse can be obtained. After obtaining the location information of the service station and the central warehouse on the preset delivery route, navigation is performed based on the location information of the service station and the central warehouse to obtain the navigation time efficiency. Navigation is a research field that focuses on monitoring and controlling the process of moving a process or vehicle from one place to another. The navigation field includes four general categories: land navigation, marine navigation, aviation navigation, and space navigation. Therefore, by navigating according to the known location information of the service station and the central warehouse, the navigation time efficiency can be obtained. After obtaining the navigation time efficiency, the historical delivery time efficiency is determined based on the navigation time efficiency. Specifically, the navigation time efficiency can be directly determined as the historical delivery time efficiency, or the navigation time efficiency can be weighted and determined as the historical delivery time efficiency. The weighting coefficient can be 0.5, 0.8 or 1.1, etc., which can be set according to the specific situation, and this application does not limit this. When there is no historical delivery time efficiency on the preset delivery route, it means that there is no waybill on the preset delivery route in the historical records. Using map tools to determine the location and navigate to obtain the navigation time efficiency can avoid the problem of being unable to determine the optimal delivery plan due to defects in historical records.

[0067] When there is a historical delivery time efficiency on the preset delivery route, the shortest historical delivery time efficiency among the historical delivery time efficiency is determined as the historical target delivery time efficiency. For example, if the two historical delivery time efficiency of delivery route A are 18.7 hours and 19.4 hours respectively, the historical target delivery time efficiency of delivery route A is 18.7 hours. In other embodiments, the average value of the historical delivery time efficiency may also be determined as the historical target delivery time efficiency, which is not limited in this application.

[0068] In a specific embodiment, the historical delivery time corresponding to each delivery type on the preset delivery route is obtained. Among them, the historical delivery time corresponding to each delivery type on the preset delivery route can be obtained through the waybill of historical records. The historical delivery time corresponding to each delivery type on the preset delivery route can be data within the historical 60 days, the historical 90 days or other time periods, which can be selected according to the specific situation, and this application does not limit this. The delivery type may include at least one of heavy cargo parcels, small ticket LTL, general logistics, SF Express special and SF Express standard express. Specifically, from the waybill of historical records, the historical waybill delivery time is obtained, and the average value of the historical waybill delivery time is determined as the historical delivery time. Of course, the historical waybill delivery time corresponding to the preset quantile in the historical waybill delivery time can be determined as the historical delivery time. The preset quantile can be a larger quartile, a median, the 95th percentile, etc., which can be selected according to the specific situation, and this application does not limit this. For example, the historical delivery time for heavy cargo packages on delivery route A is 18.72 hours, the historical delivery time for small-ticket LTL is 21.11 hours, and the historical delivery time for general logistics is 21.49 hours.

[0069] After obtaining the historical delivery time efficiency corresponding to each delivery type on the preset delivery route, count the number of preset delivery time efficiency in the historical delivery time efficiency corresponding to each delivery type on the preset delivery route, where the preset delivery time efficiency is the historical delivery time efficiency whose time efficiency value does not exceed the preset time efficiency value. For example, the historical delivery time efficiency of heavy cargo parcels on delivery route A is 18.72 hours, the historical delivery time efficiency of small ticket LTL is 21.11 hours, and the historical delivery time efficiency of general logistics is 21.49 hours. The preset time efficiency value is 24 hours, that is, the preset delivery time efficiency is the time efficiency that meets 24-hour delivery. If all three historical delivery time efficiencies do not exceed 24 hours, then the three historical delivery time efficiencies are all preset delivery time efficiencies. Therefore, the number of preset delivery time efficiencies is 3.

[0070] After the number of preset delivery time limits is obtained, the number of preset delivery time limits is determined as the number of historical target delivery types on the preset delivery route. If the historical delivery time limit corresponding to the delivery type satisfies 24-hour delivery, then the delivery type is the historical target delivery number. For example, if the number of preset delivery time limits is 3, then the number of historical target delivery types is 3, and the 3 historical target delivery types are heavy cargo parcels, small ticket LTL, and general logistics transportation.

[0071] Furthermore, by calculating the number of historical target delivery types on each delivery route one by one, the number of historical target delivery types on at least two delivery routes can be obtained.

[0072] The preset time limit is set to 24 hours. When the 24-hour delivery time limit is met, multiple target delivery types on the preset route can be obtained, thereby recommending multiple logistics product options for users. In other embodiments, the preset time limit can also be set to other values ​​such as 36 hours, 48 ​​hours, etc., which is not limited in this application.

[0073] Furthermore, the central warehouses corresponding to the service stations are prioritized. Specifically, the service stations are prioritized based on the historical target delivery time between the service stations and each central warehouse. More specifically, the service stations are prioritized based on the historical target delivery time between the service stations and each central warehouse according to the delivery type classification. For example, the central warehouses corresponding to the Panzhihua Service Station are the Kunming Central Warehouse and the Chengdu Central Warehouse. Among them, the historical target delivery time for heavy cargo parcels on the delivery route from the Panzhihua Service Station to the Kunming Central Warehouse is 18.72 hours, and the historical target delivery time for heavy cargo parcels on the delivery route from the Panzhihua Service Station to the Chengdu Central Warehouse is 26.47 hours. Therefore, when the Panzhihua Service Station requires goods through heavy cargo parcels, the corresponding central warehouses have the following priorities from high to low: Kunming Central Warehouse, Chengdu Central Warehouse. When the Kunming Central Warehouse is out of stock, it can be recommended that the Chengdu Central Warehouse deliver goods to the Panzhihua Service Station to ensure that the accessories are delivered as early as possible.

[0074] S12: Construct an objective function based on the distribution parameters and logistics capacity resource parameters, where the objective function represents the total distribution time.

[0075] Optimization is the problem of finding the best solution under given conditions. The meaning of "best" can be various: minimum cost, maximum return, maximum profit, shortest distance, minimum time, minimum space, etc., that is, to find the best goal when resources are given, or to use the least resources when the goal is determined. Almost all problems in production, operation and management can be considered as optimization problems, such as product raw material combination problems, personnel arrangement problems, transportation problems, site selection problems, capital management problems, optimal pricing problems, economic order quantity problems, optimal parameter determination problems in forecasting models, etc.

[0076] The mathematical model of optimization problems generally consists of three parts: decision variables, objective functions, and constraints. Decision variables refer to the quantities to be determined in the optimization problem that are related to the constraints and objective functions. Generally speaking, they all have some restrictions (constraints) and are closely related to the objective function. In the optimization problem, the function related to the variable whose extreme value (or maximum optimal value) is to be sought is called the objective function. In the optimization problem, the restrictions that the variables must satisfy when seeking the extreme value of the objective function are called constraints. For example, many practical problems require that the variables must be non-negative, which is a restriction; when studying circuit optimization design problems, the variables must obey the basic laws of the circuit, which is also a restriction, and so on. When studying problems, we must accurately describe these restrictions using mathematical expressions.

[0077] In some embodiments of the present application, the objective function is constructed with the delivery parameters as the decision variables, the target delivery type quantity as the first variable, and the target delivery time efficiency as the second variable.

[0078] In a specific embodiment, the objective function is as shown in formula (1):

[0079]

[0080] Among them, F is the objective function, N is the set of central libraries, M is the set of service stations, T ij is the target delivery time from the central warehouse i to the service station j, P ij is the number of target delivery types for the delivery route from central warehouse i to service station j, Y ij is the distribution parameter of the distribution route from central warehouse i to service station j, and λ is the adjustment coefficient.

[0081] Among them, λ is a negative value, which can be a value from -10 to -1. The more target delivery types on the delivery route, the less time consumption on the delivery route can be. More optional target delivery types give a certain timeliness reward.

[0082] In some embodiments of the present application, constructing an objective function based on delivery parameters and logistics capacity resource parameters may include: constructing an objective function using the delivery parameters as decision variables and the target delivery type quantity as a first variable.

[0083] In a specific embodiment, the objective function is as shown in formula (2):

[0084]

[0085] Among them, F is the objective function, N is the set of central libraries, M is the set of service stations, P ij is the number of target delivery types for the delivery route from central warehouse i to service station j, Y ijis the distribution parameter of the distribution route from central warehouse i to service station j, and λ is the adjustment coefficient.

[0086] S13: Calculate at least two objective function output values ​​corresponding to at least two groups of delivery parameters based on the objective function.

[0087] In the embodiment of the present application, the objective function F is described as formula (1). When the objective function is other formulas, reference is made to the case where the objective function is formula (1).

[0088] When the objective function F is formula (1), the adjustment coefficient λ can be determined according to the value input by the user. Substitute the historical target delivery time into the target delivery time T ij , substitute the historical target delivery type quantity into the target delivery type quantity P ij Therefore, the unknown quantity in the objective function F is only the distribution parameters. By inputting at least two sets of distribution parameters into the objective function in sequence, at least two output values ​​of the objective function can be obtained.

[0089] Furthermore, the constraint condition of the objective function includes: there is only one delivery route between a single service station and a central warehouse. Specifically, the constraint condition of the objective function is shown in formula (3):

[0090]

[0091] By screening the distribution parameters through constraints, the distribution parameters that meet the conditions can be greatly reduced, thereby reducing the amount of calculation and improving the efficiency of obtaining the target distribution parameters. In addition, a single service station only has a distribution route with one central warehouse. On the one hand, it can meet the requirement that each service station can have a corresponding central warehouse to supply goods, and on the other hand, it can avoid the waste of resources caused by too many central warehouses supplying service stations. For example, when there are two distribution routes, four groups of distribution parameters can be listed by exhaustive enumeration, namely [0,0], [1,0], [1,1], [0,1]. Under the constraints, only two groups of distribution parameters meet the conditions, namely [1,0] and [0,1]. The amount of calculation is reduced by half, greatly improving the calculation efficiency.

[0092] S14: Determine the delivery parameter corresponding to the optimal value among the at least two objective function output values ​​as the target delivery parameter.

[0093] In the embodiment of the present application, after obtaining at least two objective function output values, the at least two objective function output values ​​are sorted to obtain the optimal value of the at least two objective function output values. The distribution parameter corresponding to the optimal value of the at least two objective function output values ​​is determined as the target distribution parameter. Preferably, the distribution parameter corresponding to the minimum value of the at least two objective function output values ​​is determined as the target distribution parameter.

[0094] For example, if two sets of distribution parameters [1,0] and [0,1] are input into the objective function respectively, two objective function output values ​​can be obtained, namely F1 and F2. After sorting F1 and F2 from large to small, the sorting results are F1, F2. The distribution parameter [0,1] corresponding to the minimum value is used as the target distribution parameter.

[0095] Since the objective function represents the total delivery time, the target delivery parameter corresponding to the minimum output value of the objective function is the delivery plan with the minimum total delivery time. Using the target delivery parameters for delivery can achieve the shortest total delivery time and improve the timeliness of logistics distribution.

[0096] The present application provides a logistics network planning method, which includes obtaining historical logistics capacity resource parameters and at least two groups of distribution parameters, the distribution parameters including the distribution plan on each distribution route in the logistics network, the distribution route being the route from the central warehouse to the service station; constructing an objective function based on the distribution parameters and the logistics capacity resource parameters, the objective function representing the total distribution time efficiency; calculating at least two objective function output values ​​corresponding to at least two groups of distribution parameters based on the objective function; and determining the distribution parameter corresponding to the optimal value of at least two objective function output values ​​as the target distribution parameter. In the case where the logistics distribution method in the prior art has poor distribution route time efficiency, the present application creatively constructs an objective function with the optimal total distribution time efficiency as the goal based on the logistics capacity resource parameters and the distribution parameters, optimizes the distribution parameters, and thus determines the optimal target distribution parameters, which can effectively improve the time efficiency of the distribution route and improve the user experience.

[0097] See also Figure 2 , Figure 2 It is a structural diagram of an embodiment of a logistics network planning device provided in an embodiment of the present application.

[0098] like Figure 2 As shown, the present application also provides a logistics network planning device. The logistics network planning device can be integrated in a server. The logistics network planning device includes an acquisition module 201, a construction module 202, a calculation module 203, and a determination module 204. Specifically:

[0099] The acquisition module 201 is used to acquire historical logistics capacity resource parameters and at least two groups of distribution parameters, where the distribution parameters include the distribution plan on each distribution route, and the distribution route is the route from the central warehouse to the service station;

[0100] A construction module 202 is used to construct an objective function based on the distribution parameters and the logistics transport resource parameters, where the objective function represents the total distribution time efficiency;

[0101] A calculation module 203 calculates at least two objective function output values ​​corresponding to at least two groups of delivery parameters based on the objective function;

[0102] The determination module 204 is used to determine the delivery parameter corresponding to the optimal value of at least two objective function output values ​​as the target delivery parameter.

[0103] The logistics capacity resource parameters include the target number of delivery types. The construction module 202 is also used to construct an objective function using the delivery parameters as decision variables and the target number of delivery types as the first variable.

[0104] The acquisition module 201 is further used to acquire at least two sets of delivery parameters, historical target delivery time efficiency on at least two delivery routes, and historical target delivery type quantity on at least two delivery routes;

[0105] The construction module 202 is also used to construct an objective function with the target delivery type quantity as the first variable and the target delivery time efficiency as the second variable.

[0106] The acquisition module 201 is further used to, when there are historical delivery time limits on the preset delivery route, determine the shortest historical delivery time limit among the historical delivery time limits as the historical target delivery time limit.

[0107] The acquisition module 201 is further used to acquire the location information of the service station and the central warehouse on the preset delivery route when there is no historical delivery time limit on the preset delivery route;

[0108] Navigate based on the location information of the service station and the central library to obtain navigation time efficiency;

[0109] Determine historical delivery time based on navigation time.

[0110] The acquisition module 201 is also used to obtain the historical delivery time corresponding to each delivery type on the preset delivery route;

[0111] Count the number of preset delivery time limits in the historical delivery time limits corresponding to each delivery type on the preset delivery route, where the preset delivery time limit is the historical delivery time limit whose time limit value does not exceed the preset time limit value;

[0112] The quantity of the preset delivery time is determined as the historical target delivery type quantity on the preset delivery route.

[0113] Among them, the constraints of the objective function include:

[0114] There is only a delivery route between a single service station and one central warehouse.

[0115] The present application obtains historical logistics capacity resource parameters and at least two groups of distribution parameters, the distribution parameters including the distribution plans on each distribution route in the logistics network, the distribution route being the route from the central warehouse to the service station; constructs an objective function based on the distribution parameters and the logistics capacity resource parameters, the objective function representing the total distribution time efficiency; calculates at least two objective function output values ​​corresponding to at least two groups of distribution parameters based on the objective function; and determines the distribution parameter corresponding to the optimal value of at least two objective function output values ​​as the target distribution parameter. In the case where the logistics distribution method in the prior art has poor distribution route time efficiency, the present application creatively constructs an objective function with the optimal total distribution time efficiency as the goal based on the logistics capacity resource parameters and the distribution parameters, optimizes the distribution parameters, and thereby determines the optimal target distribution parameters, which can effectively improve the time efficiency of the distribution route and improve the user experience.

[0116] See also Figure 3 , Figure 3 It is a structural diagram of another embodiment of the logistics network planning device provided in the embodiment of the present application.

[0117] like Figure 3 As shown, it shows a schematic diagram of the structure of the logistics network planning device involved in the embodiment of the present application, specifically:

[0118] The logistics network planning device may include one or more processors 301 of processing cores, one or more computer-readable storage media memories 302, a power supply 303, an input unit 304 and other components. Those skilled in the art will appreciate that Figure 3 The structure of the logistics network planning device shown in the figure does not constitute a limitation on the logistics network planning device, and may include more or fewer components than shown in the figure, or combine certain components, or arrange the components differently.

[0119] The processor 301 is the control center of the logistics network planning device. It uses various interfaces and lines to connect the various parts of the entire logistics network planning device. By running or executing the software programs and / or modules stored in the memory 302, and calling the data stored in the memory 302, it executes various functions of the logistics network planning device and processes data, thereby monitoring the logistics network planning device as a whole. Optionally, the processor 301 may include one or more processing cores; preferably, the processor 301 may integrate an application processor and a modem processor, wherein the application processor mainly processes the operating system, user interface, and application programs, and the modem processor mainly processes wireless communications. It is understandable that the above-mentioned modem processor may not be integrated into the processor 301.

[0120] The memory 302 can be used to store software programs and modules. The processor 301 executes various functional applications and data processing by running the software programs and modules stored in the memory 302. The memory 302 may mainly include a program storage area and a data storage area, wherein the program storage area may store an operating system, an application required for at least one function (such as a sound playback function, an image playback function, etc.), etc.; the data storage area may store data created according to the use of the logistics network planning device, etc. In addition, the memory 302 may include a high-speed random access memory, and may also include a non-volatile memory, such as at least one disk storage device, a flash memory device, or other volatile solid-state storage devices. Accordingly, the memory 302 may also include a memory controller to provide the processor 301 with access to the memory 302.

[0121] The logistics network planning device also includes a power supply 303 for supplying power to each component. Preferably, the power supply 303 can be logically connected to the processor 301 through a power management system, so as to realize functions such as management of charging, discharging, and power consumption management through the power management system. The power supply 303 can also include any components such as one or more DC or AC power supplies, recharging systems, power failure detection circuits, power converters or inverters, and power status indicators.

[0122] The logistics network planning device may also include an input unit 304, which can be used to receive input digital or character information, and generate keyboard, mouse, joystick, optical or trackball signal input related to user settings and function control.

[0123] Although not shown, the logistics network planning device may also include a display unit, etc., which will not be described in detail here. Specifically, in the embodiment of the present application, the processor 301 in the logistics network planning device will load the executable files corresponding to the processes of one or more application programs into the memory 302 according to the following instructions, and the processor 301 will run the application programs stored in the memory 302, thereby realizing various functions, as follows:

[0124] Obtain historical logistics capacity resource parameters and at least two groups of distribution parameters, the distribution parameters include the distribution plan on each distribution route in the logistics network, and the distribution route is the route from the central warehouse to the service station; construct an objective function based on the distribution parameters and the logistics capacity resource parameters, and the objective function represents the total distribution time efficiency; calculate at least two objective function output values ​​corresponding to at least two groups of distribution parameters based on the objective function; determine the distribution parameter corresponding to the optimal value of the at least two objective function output values ​​as the target distribution parameter.

[0125] The present application obtains historical logistics capacity resource parameters and at least two sets of distribution parameters, the distribution parameters include the distribution plan on each distribution route in the logistics network, and the distribution route is the route from the central warehouse to the service station; constructs an objective function based on the distribution parameters and the logistics capacity resource parameters, and the objective function represents the total distribution timeliness; calculates at least two objective function output values ​​corresponding to at least two sets of distribution parameters based on the objective function; and determines the distribution parameter corresponding to the optimal value of at least two objective function output values ​​as the target distribution parameter. In the case where the logistics distribution method in the prior art has poor distribution route timeliness, the present application creatively constructs an objective function with the optimal total distribution timeliness as the goal based on the logistics capacity resource parameters and the distribution parameters, optimizes the distribution parameters, and thus determines the optimal target distribution parameters, which can effectively improve the timeliness of the distribution route and improve the user experience.

[0126] To this end, an embodiment of the present application provides a computer-readable storage medium, which may include: a read-only memory (ROM), a random access memory (RAM), a disk or an optical disk, etc. The computer-readable storage medium stores multiple instructions, which can be loaded by a processor to execute the steps in any of the logistics network planning methods provided in the embodiments of the present application. For example, the instruction can execute the following steps:

[0127] Obtain historical logistics capacity resource parameters and at least two groups of distribution parameters, the distribution parameters include the distribution plan on each distribution route in the logistics network, and the distribution route is the route from the central warehouse to the service station; construct an objective function based on the distribution parameters and the logistics capacity resource parameters, and the objective function represents the total distribution time efficiency; calculate at least two objective function output values ​​corresponding to at least two groups of distribution parameters based on the objective function; determine the distribution parameter corresponding to the optimal value of the at least two objective function output values ​​as the target distribution parameter.

[0128] In the above embodiments, the description of each embodiment has its own emphasis. For parts that are not described in detail in a certain embodiment, please refer to the detailed description of other embodiments above, and will not be repeated here.

[0129] In specific implementation, the above units or structures can be implemented as independent entities, or can be arbitrarily combined to be implemented as the same or several entities. The specific implementation of the above units or structures can refer to the previous method embodiments, which will not be repeated here.

[0130] The above is a detailed introduction to a logistics network planning method, device and computer-readable storage medium provided in the embodiments of the present application. Specific examples are used in this article to illustrate the principles and implementation methods of the present application. The description of the above embodiments is only used to help understand the method of the present application and its core idea; at the same time, for technical personnel in this field, according to the ideas of the present application, there will be changes in the specific implementation methods and application scopes. In summary, the content of this specification should not be understood as a limitation on the present application.

Claims

1. A logistics network planning method, characterized in that: The logistics network planning method comprises: Obtain historical logistics capacity resource parameters and at least two sets of distribution parameters, wherein the distribution parameters include a distribution plan on each distribution route in the logistics network, and the distribution route is a route from a central warehouse to a service station; Constructing an objective function based on the delivery parameters and the logistics transport resource parameters, wherein the objective function represents the total delivery time efficiency; Calculate at least two objective function output values ​​corresponding to at least two groups of delivery parameters respectively based on the objective function; Determine the distribution parameter corresponding to the optimal value among at least two objective function output values ​​as the target distribution parameter; Among them, obtaining at least two sets of delivery parameters and the number of historical target delivery types on at least two delivery routes, the delivery parameters include a distribution plan for distribution or a distribution plan without distribution for the distribution route, and the number of historical target delivery types reflects the land transportation, aviation, and human resources provided by the logistics company in the distribution route; The objective function constructed based on the distribution parameters and logistics capacity resource parameters is: Among them, F is the objective function, N is the set of central libraries, M is the set of service stations, P ij is the number of historical target delivery types for the delivery route from central warehouse i to service station j, Y ij is the distribution parameter of the distribution route from central warehouse i to service station j, and λ is the adjustment coefficient.

2. The logistics network planning method according to claim 1, characterized in that: The logistics transport capacity resource parameters include the target number of delivery types, and the objective function is constructed based on the delivery parameters and the logistics transport capacity resource parameters, including: The objective function is constructed with the delivery parameters as decision variables and the number of target delivery types as the first variable.

3. The logistics network planning method according to claim 2, characterized in that: The obtaining of historical logistics capacity resource parameters and at least two sets of delivery parameters includes: Obtain at least two sets of delivery parameters, historical target delivery time on at least two delivery routes, and historical target delivery type quantity on at least two delivery routes; The method of constructing an objective function by taking the delivery parameter as the decision variable and the target delivery type quantity as the first variable includes: The objective function is constructed with the delivery parameters as decision variables, the target delivery type quantity as the first variable, and the target delivery time efficiency as the second variable.

4. The logistics network planning method according to claim 3, characterized in that: The obtaining of at least two sets of delivery parameters, historical target delivery time efficiency on at least two delivery routes, and historical target delivery type quantity on at least two delivery routes includes: When there are historical delivery time efficiencies on the preset delivery route, the shortest historical delivery time efficiencies among the historical delivery time efficiencies are determined as the historical target delivery time efficiencies.

5. The logistics network planning method according to claim 3, characterized in that: The obtaining of at least two sets of delivery parameters, historical target delivery time efficiency on at least two delivery routes, and historical target delivery type quantity on at least two delivery routes includes: When there is no historical delivery time limit on the preset delivery route, obtain the location information of the service station and the central warehouse on the preset delivery route; Navigate based on the location information of the service station and the central library to obtain navigation time efficiency; The historical delivery time efficiency is determined based on the navigation time efficiency.

6. The logistics network planning method according to claim 3, characterized in that: The obtaining of at least two sets of delivery parameters, historical target delivery time efficiency on at least two delivery routes, and historical target delivery type quantity on at least two delivery routes includes: Get the historical delivery time corresponding to each delivery type on the preset delivery route; Counting the number of preset delivery time limits in the historical delivery time limits corresponding to each delivery type on the preset delivery route, wherein the preset delivery time limit is the historical delivery time limit whose time limit value does not exceed the preset time limit value; The number of the preset delivery time limits is determined as the number of the historical target delivery types on the preset delivery route.

7. The logistics network planning method according to any one of claims 1 to 3, characterized in that: The constraints of the objective function include: There is only a delivery route between a single service station and one central warehouse.

8. A logistics network planning device, characterized in that: The logistics network planning device comprises: An acquisition module, used to acquire historical logistics capacity resource parameters and at least two groups of distribution parameters, wherein the distribution parameters include a distribution plan on each distribution route, and the distribution route is a route from a central warehouse to a service station; A construction module, used to construct an objective function based on the delivery parameters and the logistics transport resource parameters, wherein the objective function represents the total delivery time efficiency; A calculation module, used for respectively calculating at least two objective function output values ​​corresponding to at least two groups of delivery parameters based on the objective function; A determination module, used for determining the delivery parameter corresponding to the optimal value among the at least two objective function output values ​​as the target delivery parameter; The acquisition module is further used to acquire at least two sets of delivery parameters and the number of historical target delivery types on at least two delivery routes, wherein the delivery parameters include a distribution plan for distribution or a distribution plan for no distribution on the distribution route, and the number of historical target delivery types reflects the land transportation, aviation, and human resources provided by the logistics company in the distribution route; The construction module is also used to construct the objective function based on the distribution parameters and logistics capacity resource parameters: Among them, F is the objective function, N is the set of central libraries, M is the set of service stations, P ij is the number of historical target delivery types for the delivery route from central warehouse i to service station j, Y ij is the distribution parameter of the distribution route from central warehouse i to service station j, and λ is the adjustment coefficient.

9. A logistics network planning device, characterized in that: The logistics network planning 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 network planning method according to any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, and the computer program is suitable for being loaded by a processor to execute the logistics network planning method according to any one of claims 1 to 7.