A method and device for updating a logistics route

Abstract

The present invention discloses a method and apparatus for updating a logistics route, relating to the technical field of logistics. A specific embodiment of the method includes: obtaining logistics historical data within a set area range; processing the logistics historical data, wherein the processed result includes all logistics routes within the set area range and logistics routes with large order volumes; obtaining parameters related to logistics route update; using the parameters related to logistics route update and decision variables related to logistics route update pre-constructed to generate an objective function and constraint conditions of the objective function, and introducing the logistics routes with large order volumes into the constraint conditions of the objective function; calculating the minimum value of the objective function based on the constraint conditions of the objective function to obtain a decision result corresponding to the decision variables; and updating the logistics routes within the area range according to the decision result. This embodiment can effectively solve the large-scale logistics route planning problem.

Description

Technical Field

[0001] The present invention relates to the field of logistics technologies, and in particular, to a method and apparatus for updating a logistics route. Background Art

[0002] Logistics transportation generally relies on a logistics route including sorting. For example, the logistics route from place A to place B is from A to sorting center 1, sorting center 1 to sorting center 2, and sorting center 2 to place B. Logistics parcels are generally transported to place B via this logistics route. Due to factors such as the adjustment of logistics operations or the change of the layout of sorting centers within a region, it is often necessary to correspondingly adjust or update the logistics route. Currently, the adjustment or update of the logistics route mainly adopts the method of integer programming.

[0003] In the process of implementing the present invention, the inventor found that there are at least the following problems in the prior art:

[0004] Due to the relatively complex business constraints of this integer programming method, when the update scale is relatively large, it requires a relatively large amount of computing resources and often cannot be effectively solved. Summary of the Invention

[0005] In view of this, embodiments of the present invention provide a method and apparatus for updating a logistics route, which can effectively solve large-scale logistics route planning problems and reduce the consumption of computing resources.

[0006] To achieve the above object, according to one aspect of an embodiment of the present invention, a method for updating a logistics route is provided, including:

[0007] Obtaining logistics historical data within a set area range;

[0008] Processing the logistics historical data, where the result after processing includes all logistics routes within the set area range and logistics routes with a large order volume;

[0009] Obtaining parameters related to logistics route update;

[0010] Using the parameters related to logistics route update and decision variables pre-constructed related to logistics route update to generate an objective function and constraint conditions of the objective function, and introducing the logistics routes with a large order volume into the constraint conditions of the objective function;

[0011] Based on the constraint conditions of the objective function, calculating the minimum value of the objective function to obtain a decision result corresponding to the decision variables;

[0012] Updating the logistics routes within the area range according to the decision result.

[0013] Preferably, the method for updating the logistics route further includes: obtaining historical waybill data;

[0014] Obtaining logistics historical data within a set area, including:

[0015] Screening out historical waybill data belonging to the set area from the historical waybill data.

[0016] Preferably, processing the logistics historical data includes:

[0017] According to the historical waybill data belonging to the set area, counting the order volume of each logistics route within the set area;

[0018] According to the historical order volume of each logistics route and a preset large order volume screening strategy, screening out logistics routes with large order volumes from the logistics routes within the set area.

[0019] Preferably, screening out historical waybill data belonging to the set area from the historical waybill data includes:

[0020] Determining the sorting centers included in the logistics routes within the set area;

[0021] Screening out historical waybill data passing through the sorting centers.

[0022] Preferably, the preset large order volume screening strategy includes:

[0023] Screening out logistics routes with an order volume not lower than a preset order volume threshold, and taking the screened logistics routes as logistics routes with large order volumes;

[0024] Or,

[0025] Sorting all logistics routes within the set area in descending order according to the order volume of the logistics routes;

[0026] According to the result of the descending order and a preset sorting range, screening out logistics routes with large order volumes.

[0027] Preferably, processing the logistics historical data includes:

[0028] According to the outlet type of the upstream inflow outlets and downstream outflow outlets in the logistics route and the transportation type of the inflow order volume and outflow order volume of the logistics route, marking the functions of the sorting centers included in the logistics route;

[0029] Updating the logistics routes within the area includes: relocating the functions of the sorting centers included in the logistics routes.

[0030] Preferably, the parameters related to the logistics route update include routing parameters and cost parameters;

[0031] Generate the objective function and the constraints of the objective function, including:

[0032] Introduce a part of the routing parameters and the cost parameters into a preset model function to obtain the objective function;

[0033] Introduce another part of the routing parameters into the preset model constraints to obtain partial constraints of the objective function.

[0034] Preferably, calculating the minimum value of the objective function includes: calculating the minimum total cost within the set area.

[0035] Preferably, the routing parameters include: the distance between two points in each logistics route within the set area, the threshold number of sorting centers for each function; the production capacity threshold of the sorting centers included in each logistics route, the vehicle capacity limit of the transport vehicles, the transport order volume of each logistics route, the logistics routes with large order volumes, and any one or more of the auxiliary variables.

[0036] Preferably, the cost parameters include any one or more of: the fixed cost of the transport means, the variable cost of the transport means, the operating cost of the sorting centers included in each logistics route, and the rental cost of the sorting centers included in each logistics route.

[0037] Preferably, updating the logistics routes within the area includes:

[0038] Determine whether there are multiple logistics routes with the same upstream inflow network points and downstream outflow network points;

[0039] If so, for multiple logistics routes with the same upstream inflow network points and downstream outflow network points, retain the logistics route with the largest order volume, delete the other logistics routes, and accumulate the order volume in the other logistics routes to the logistics route with the largest order volume.

[0040] Preferably, the decision variables related to the logistics route update include any one set or more sets of: the variable set indicating whether the sorting centers included in the logistics route are enabled, the variable set of the order volume of the sorting centers included in the logistics route, the function variable set of the sorting centers included in the logistics route, the flow variable set of the logistics route, the decision variable set of the logistics routes with large order volumes, and the variable set of the number of transport means used for the routes of the logistics route.

[0041] Second aspect, an embodiment of the present invention provides an update device for logistics routing, including: a logistics data processing unit, a parameter acquisition unit, a routing decision unit, and a routing update unit, where,

[0042] The logistics data processing unit is configured to acquire logistics historical data within a set area range; process the logistics historical data, where the processed result includes all logistics routes and logistics routes with large order volumes within the set area range;

[0043] The parameter acquisition unit is configured to acquire parameters related to logistics routing update;

[0044] The routing decision unit is configured to generate an objective function and constraint conditions of the objective function by using the parameters related to logistics routing update, pre-constructed decision variables related to logistics routing update, and the logistics routes with large order volumes; calculate the minimum value of the objective function based on the constraint conditions of the objective function to obtain a decision result corresponding to the decision variables;

[0045] The routing update unit is configured to update the logistics routes within the area according to the decision result.

[0046] One embodiment of the above invention has the following advantages or beneficial effects: By processing the logistics historical data within a set area range, all logistics routes and logistics routes with large order volumes within the set area range are obtained, and then an objective function and constraint conditions of the objective function are generated based on the parameters related to logistics routing update and pre-constructed decision variables related to logistics routing update, and the logistics routes with large order volumes are introduced into the constraint conditions of the objective function. Since the logistics routes with large order volumes are introduced into the constraint conditions, that is, mainly the logistics routes with large order volumes are constrained, rather than all logistics routes being constrained, the calculation of the objective function and the constraint conditions are simplified, thereby effectively solving large-scale logistics routing planning problems and being able to reduce the consumption of computing resources.

[0047] The further effects of the above non-conventional optional methods will be described in conjunction with specific embodiments below. BRIEF DESCRIPTION OF THE DRAWINGS

[0048] The drawings are used to better understand the present invention and do not constitute an improper limitation to the present invention. Among them:

[0049] Figure 1 is a schematic diagram of the structure of some logistics routes within the area according to an embodiment of the present invention;

[0050] Figure 2 is a schematic diagram of the main process of the logistics routing update method according to an embodiment of the present invention;

[0051] Figure 3 It is a schematic diagram of the main process for processing logistics historical data according to an embodiment of the present invention;

[0052] Figure 4 It is a schematic diagram of the main process for generating an objective function and the constraint conditions of the objective function according to an embodiment of the present invention;

[0053] Figure 5 It is a schematic diagram of the main process for updating the logistics route within a set range according to an embodiment of the present invention;

[0054] Figure 6 It is a schematic diagram of the main process for the method of updating the logistics route according to another embodiment of the present invention;

[0055] Figure 7 It is a schematic diagram of the main units of the device for updating the logistics route according to an embodiment of the present invention;

[0056] Figure 8 It is an exemplary system architecture diagram to which the embodiments of the present invention can be applied;

[0057] Figure 9 It is a schematic diagram of the structure of a computer system of a terminal device or a server suitable for implementing the embodiments of the present invention. Detailed implementation manners

[0058] The following makes an explanation of the exemplary embodiments of the present invention in conjunction with the accompanying drawings, including various details of the embodiments of the present invention to facilitate understanding, which should be considered merely exemplary. Therefore, those of ordinary skill in the art should recognize that various changes and modifications can be made to the embodiments described herein without departing from the scope and spirit of the present invention. Similarly, for clarity and conciseness, the descriptions of well-known functions and structures are omitted in the following.

[0059] As Figure 1 shown, the logistics route of the embodiment of the present invention may include an upstream inflow network point, a sorting center in the middle within a set area range, and a downstream outflow network point. Among them, the upstream inflow network point can be a cross-regional sorting center, a sorting center within a region, a station, a warehouse, etc.; the downstream outflow network point can be a sorting center within a region, a sorting center outside the region, a station, etc. It should be noted that the upstream inflow network point and the downstream outflow network point are defined relative to a logistics route. The upstream inflow network point of one logistics route can be the downstream outflow network point of another logistics route; the downstream outflow network point of one logistics route can be the upstream inflow network point of other logistics routes.

[0060] The update of the logistics route in the embodiments of the present invention mainly involves re-planning the sorting centers passed through from the upstream inflow outlets to the downstream outflow outlets and re-positioning the functions of the passed sorting centers.

[0061] Generally speaking, a complete logistics route from the origin to the destination may include multiple sorting centers. The solution provided by the embodiments of the present invention mainly updates the logistics route in segments. For example, for a complete logistics route across multiple regions, the solution provided by the embodiments of the present invention can update a segment of the logistics route within each region separately or simultaneously to complete the update of the complete logistics route across multiple regions.

[0062] The logistics route targeted by the solution provided by the embodiments of the present invention is mainly a segment of the logistics route within a set area where there are sorting centers between the upstream inflow outlets and the downstream outflow outlets.

[0063] Generally speaking, one upstream inflow outlet and one downstream outflow outlet only belong to one logistics route, and the sorting centers between the upstream inflow outlet and the downstream outflow outlet can be used by different upstream inflow outlets and downstream outflow outlets. Therefore, the upstream inflow outlet and the downstream outflow outlet can be used to uniquely represent a logistics route, but only the sorting centers within this logistics route need to be re-layout or re-allocated, etc.

[0064] It should be noted that Figure 1 Only a part of the logistics route within a region is given exemplarily. In the logistics route targeted by the solution provided by the embodiments of the present invention, the number of sorting centers existing between the upstream inflow outlets and the downstream outflow outlets is not limited to two, and it can also be one or more. However, generally in most logistics routes within a region, the number of sorting centers existing between the upstream inflow outlets and the downstream outflow outlets is two.

[0065] Figure 2 is an update method of a logistics route according to the embodiments of the present invention. As Figure 1 shown, the update method of this logistics route may include the following steps:

[0066] Step S201: Obtain the logistics historical data within the set area;

[0067] Step S202: Process the logistics historical data. Among them, the processed result includes all the logistics routes within the set area and the logistics routes with large order volumes;

[0068] Step S203: Obtain the parameters related to the update of the logistics route;

[0069] Step S204: Generate the objective function and the constraint conditions of the objective function by using the parameters related to the logistics route update and the pre-constructed decision variables related to the logistics route update, and introduce the logistics routes with large order volumes into the constraint conditions of the objective function;

[0070] Step S205: Calculate the minimum value of the objective function based on the constraint conditions of the objective function to obtain the decision results corresponding to the decision variables;

[0071] Step S206: Update the logistics routes within the regional scope according to the decision results.

[0072] Among them, the set regional scope can be any arbitrarily divided scope, for example, North China, South China, etc. This regional scope can also be within a province or a city.

[0073] Among them, the specific implementation manner of Step S101 can be to obtain historical waybill data, and filter out all waybill data passing through this regional scope according to the set regional scope such as a city list, etc.; and organize all the waybill data passing through this regional scope that is filtered out. The organized data is called OD data. This OD data refers to the order volume data flowing from the upstream inflow network point (marked as the origin) through one or more sorting centers within the set regional scope and into the downstream outflow network point (marked as the destination). Among them, this order volume data can include the order volume from the upstream inflow network point (i.e., the starting network point in Table 1) to the downstream outflow network point (i.e., the target network point in Table 1), the percentage of the order volume from the upstream inflow network point (i.e., the starting network point in Table 1) to the downstream outflow network point (i.e., the target network point in Table 1), the starting city corresponding to the upstream inflow network point (i.e., the starting network point in Table 1), and the destination city corresponding to the downstream outflow network point (i.e., the target network point in Table 1). As shown in Table 1 below, partial OD data of the set regional scope.

[0074] Table 1 Partial OD data of the set regional scope

[0075] Starting network point Starting city Destination network point Destination city Volume (in 10,000 pieces) Volume percentage % Receiving warehouse a City A Sorting center b1 City A 8146 17％ Sorting center c City B Sorting center d City B 7289 15％ Receiving warehouse e City A Sorting center f1 City C 6418 13％ Sorting center g City D Sorting center b City A 4866 10％ Receiving warehouse h City A Sorting center r City E 4501 9％ Sorting center w City F Sorting center b City A 3949 8％ Receiving warehouse s City A Sorting center z City G 1498 3％ Sorting center n City A Sorting center m City E 1496 3％ Sorting center c City B Sorting yard p2 City H 1292 3％ Sorting center f2 City C Sorting center q City P 692 1％ Receiving warehouse b2 Guangzhou City A Sorting center p1 City Q 684 1％ Sorting center t Guangzhou City A Sorting center b City B 587 1％ … … … … … …

[0076] The percentage of the order volume from the upstream inflow network point (i.e., the starting network point in Table 1) to the downstream outflow network point (i.e., the target network point in Table 1) refers to the percentage of the order volume transported by a logistics route within this set regional scope to the total order volume transported by all logistics routes within this set regional scope.

[0077] Among them, the logistics route with a large order volume generally refers to the logistics route with a relatively large transportation order volume, which can be screened out from all the above Table 1 by setting conditions. The setting conditions can be set accordingly according to actual needs. Since the layout or planning of the logistics route with a large order volume can significantly affect the logistics network layout or logistics cost within the entire set area, etc., therefore, in the embodiment of the present invention, the logistics route with a large order volume, that is, focusing on the logistics route with a large order volume, reduces the constraints on other logistics routes outside the logistics route with a large order volume, and while reducing the consumption of computing resources, can ensure the accuracy of the logistics route planning.

[0078] Among them, the implementation manner of step S203 can be that when performing logistics route update, the parameters related to the logistics route update can be directly obtained from the storage area or storage device of the computing device, where the parameters related to the logistics route update can be pre-stored according to actual needs; it can also be to receive the parameters related to the logistics route update input by the user through the terminal device.

[0079] In Figure 2 In the shown embodiment, by processing the logistics historical data within the set area, all the logistics routes and the logistics routes with a large order volume within the set area are obtained, and then based on the parameters related to the logistics route update and the decision variables related to the logistics route update pre-constructed, the objective function and the constraint conditions of the objective function are generated, and the logistics route with a large order volume is introduced into the constraint conditions of the objective function. Since the logistics route with a large order volume is introduced into the constraint conditions, that is, mainly constraining the logistics route with a large order volume without having to constrain all the logistics routes, it simplifies the calculation of the objective function and the constraint conditions, thereby effectively solving the large-scale logistics route planning problem and being able to reduce the consumption of computing resources.

[0080] In the embodiment of the present invention, the above method for updating the logistics route may further include: obtaining historical waybill data; screening out the historical waybill data belonging to the set area from the historical waybill data; correspondingly, as Figure 3 shown, the processing of the logistics historical data may include the following steps:

[0081] Step S301: According to the historical waybill data belonging to the set area, count the order volume of each logistics route within the set area;

[0082] Step S302: According to the historical order volume of each logistics route and the preset large order volume screening strategy, screen out the logistics routes with a large order volume from the logistics routes within the set area.

[0083] Among them, the preset large order volume screening strategy can be to screen the logistics routes with an order volume not lower than the preset order volume threshold, and use the screened logistics routes as the logistics routes with large order volumes; the preset order volume threshold can be modified or set accordingly according to actual needs. For example, if the preset order volume threshold is not lower than 10 million pieces, then for some of the logistics routes given in Table 1, the logistics routes with large order volumes are screened, and the screened logistics routes with large order volumes are: a receiving warehouse - b1 sorting center, c sorting center - d sorting center, e receiving warehouse - f1 sorting center, g sorting center - b sorting center, h receiving warehouse - r sorting center, w sorting center - b sorting center, s receiving warehouse - z sorting center, n sorting center - m sorting center, and c sorting center - p2 sorting yard, a total of 9 logistics routes with large order volumes. Another example is that if the preset order volume threshold is a percentage of the order volume not lower than 10%, then for some of the logistics routes given in Table 1, the logistics routes with large order volumes are screened, and the screened logistics routes with large order volumes are: a receiving warehouse - b1 sorting center, c sorting center - d sorting center, e receiving warehouse - f1 sorting center, and g sorting center - b sorting center, a total of 4 logistics routes with large order volumes.

[0084] In addition, the preset large order volume screening strategy can also be to sort all the logistics routes within the set area in descending order according to the order volume of the logistics routes; according to the result of the descending order and the preset sorting range, screen the logistics routes with large order volumes. For example, sort all the logistics routes in a region in descending order of order volume, and select the logistics routes in the top 20% (preset sorting range) as the logistics routes with large order volumes. For example, there are 40 logistics routes sorted in descending order of order volume in a region, and the top 20% are selected, then the first 8 logistics routes after the descending order are selected as the logistics routes with large order volumes.

[0085] It should be noted that the order volume of the logistics route is determined by the upstream inflow network point (starting point) and the downstream outflow network point (ending point). Therefore, the logistics routes with large order volumes can be determined through the upstream inflow network point (starting point) and the downstream outflow network point (ending point), simplifying the acquisition method of the logistics routes with large order volumes, thereby effectively reducing the consumption of computing resources.

[0086] In addition, the logistics routes with large order volumes are determined by combining the order volumes of all the logistics routes in a region, making the acquisition of the logistics routes with large order volumes flexible, meeting the needs of different regions, and being more in line with actual needs.

[0087] In the embodiments of the present invention, in order to ensure the accuracy of the order volume statistics within the set area, that is, to count the order volume of all sorting centers passing through the set area, the specific implementation of screening the historical waybill data belonging to the set area from the historical waybill data may include: determining the sorting centers included in the logistics route within the set area; screening the historical waybill data passing through the sorting centers. Through this process, the logistics routes where the upstream inflow outlets and downstream outflow outlets are outside the set area and the sorting centers between the upstream inflow outlets and downstream outflow outlets are within the set area can also be included in the statistical scope. That is, the upstream inflow sites and downstream outflow sites can be deduced from the sorting centers, so that the upstream inflow sites outside the set area and the downstream outflow sites outside the set area are also taken into consideration, making the logistics routes within the set area more perfect. Based on the relatively perfect logistics routes within the set area, updating the logistics routes can improve the accuracy of the logistics route update.

[0088] In the embodiments of the present invention, processing the logistics historical data may include: labeling the functions of the sorting centers included in the logistics route according to the outlet types of the upstream inflow outlets and downstream outflow outlets in the logistics route and the transportation types of the incoming order volume and outgoing order volume of the logistics route; correspondingly, updating the logistics routes within the area may include: repositioning the functions of the sorting centers included in the logistics route.

[0089] For example, as Figure 1 shown, if the outlet type of the upstream inflow outlet (Origins) is a sorting center outside the area, the function of the sorting center connected to the upstream inflow outlet is main line inbound; if the outlet type of the upstream inflow outlet is a sorting center within the area, the function of the sorting center connected to the upstream inflow outlet is branch line inbound; if the outlet type of the upstream inflow outlet is a site, the function of the sorting center connected to the upstream inflow outlet is pick-up inbound; if the outlet type of the upstream inflow outlet is a warehouse, the function of the sorting center connected to the upstream inflow outlet is ferry inbound; correspondingly, if the outlet type of the downstream outflow outlet (Destinations) is a sorting center outside the area, the function of the sorting center connected to the downstream outflow outlet is main line outbound; if the outlet type of the downstream outflow outlet is a sorting center within the area, the function of the sorting center connected to the downstream outflow outlet is branch line outbound; if the outlet type of the downstream outflow outlet is a site, the function of the sorting center connected to the downstream outflow outlet is branch line inbound; if the outlet type of the downstream outflow outlet is a warehouse, the function of the sorting center connected to the downstream outflow outlet is transfer outbound, etc.

[0090] It should be noted that the upstream inflow outlet and the downstream outflow outlet may be connected to the same sorting center, and this sorting center has both inbound and outbound functions at the same time.

[0091] By positioning or updating the positioning of the sorting center between the upstream inflow network point and the downstream outflow network point in the logistics route, the sorting centers in each region can be better managed and it is convenient to re-plan the address location of the sorting center in the future, etc.

[0092] In the embodiments of the present invention, the parameters related to the logistics route update may include routing parameters and cost parameters; as Figure 4 shown, generating the objective function and the constraint conditions of the objective function may include the following steps:

[0093] Step S401: Introduce a part of the routing parameters and cost parameters into a preset model function to obtain the objective function;

[0094] Step S402: Introduce another part of the routing parameters into the preset model constraint conditions to obtain partial constraint conditions of the objective function.

[0095] Among them, the routing parameters may include: the distance between two points in each logistics route within the set area range, the threshold number of sorting centers of each function; the production capacity threshold of the sorting centers included in each logistics route, the vehicle capacity limit of the transport vehicle, the transport order volume of each logistics route, the logistics route with a large order volume, and any one or more of the auxiliary variables. In a preferred embodiment, the routing parameters include the distance between two points in each logistics route within the set area range, the threshold number of sorting centers of each function; the production capacity threshold of the sorting centers included in each logistics route, the vehicle capacity limit of the transport vehicle, the transport order volume of each logistics route, the logistics route with a large order volume, and the auxiliary variables.

[0096] Among them, the distance between two points in the logistics route refers to the distance between the upstream inflow network point and the sorting center it connects in the logistics route, the distance between two connected sorting centers located between the upstream inflow network point and the downstream outflow network point, and the distance between the downstream outflow network point and the sorting center it connects.

[0097] Among them, the cost parameters may include: the fixed cost of the transport tool, the variable cost of the transport tool, the operation cost of the sorting centers included in each logistics route, and the rental cost of the sorting centers included in each logistics route, any one or more of them. In a preferred embodiment, the cost parameters include the fixed cost of the transport tool, the variable cost of the transport tool, the operation cost of the sorting centers included in each logistics route, and the rental cost of the sorting centers included in each logistics route.

[0098] In the embodiments of the present invention, the specific implementation manner of calculating the minimum value of the above objective function may include: calculating the minimum total cost within the set area range.

[0099] The minimum total cost within the range of the calculation setting area can be achieved through the following calculation formula (1).

[0100]

[0101] Among them, minimize[] represents calculating the minimum value; represents the fixed cost of a vehicle of model p; Dis i,j represents the distance from point i to point j in the logistics route; represents the variable cost (yuan / km) of a vehicle of model p; veh i,j,p represents the number of vehicles of model p required for the section of the line from point i to point j in the logistics route; Veh represents the set of vehicle variables required for the logistics route, and the elements are integer variables; oper g represents the operating cost of sorting center g in the logistics route; amt g represents the total number of orders flowing through sorting center g; rent g represents the rental cost of sorting center g; open g represents the operating cost (yuan / order) of sorting center g; D represents the set of sorting centers within the setting area.

[0102] It should be noted that in the set of sorting centers within the setting area in the above calculation formula (1), it can be a set composed of all sorting centers that are upstream inflow outlets, sorting centers that are downstream outflow outlets, and sorting centers located between upstream inflow outlets and downstream outflow outlets; it can also be a set composed of all sorting centers between upstream inflow outlets and downstream outflow outlets.

[0103] For the above calculation formula (1), represents the vehicle usage cost of each line, including the vehicle fixed cost and the variable cost related to the line distance. ∑ j∈D oper j *amt j represents the order operation cost of all sorting. ∑ j∈D rent j *open j represents the rental cost of all sorting centers.

[0104] In the embodiment of the present invention, as Figure 5 shown, the logistics route within the above update area may include the following steps:

[0105] Step S501: Determine whether there are multiple logistics routes with the same upstream inflow outlet and downstream outflow outlet. If so, execute step S502; if not, end the current process;

[0106] Step S502: For multiple logistics routes with the same upstream inflow network point and downstream outflow network point, retain the logistics route with the largest order volume, delete other logistics routes, and accumulate the order volumes in other logistics routes to the logistics route with the largest order volume.

[0107] Since the constraint conditions of the objective function for calculating the decision result introduce logistics routes with large order volumes and do not constrain other logistics routes other than the logistics routes with large order volumes, correspondingly, there may be multiple logistics routes with the same upstream inflow network point and downstream outflow network point among the logistics routes other than the logistics routes with large order volumes. Therefore, through the above-mentioned Step S501 and Step S502, other logistics routes other than the logistics routes with large order volumes can be further processed to ensure that there is only one logistics route corresponding to the upstream inflow network point and downstream outflow network point (i.e., an O-D pair).

[0108] In the embodiment of the present invention, the decision variables related to the update of the logistics route may include: any one set or multiple sets of variable sets indicating whether the sorting centers included in the logistics route are enabled, variable sets of the order volumes of the sorting centers included in the logistics route, variable sets of the functions of the sorting centers included in the logistics route, variable sets of the traffic volumes of the logistics route, decision variable sets of the logistics routes with large order volumes, and variable sets of the number of transportation tools used for the routes of the logistics route.

[0109] In a preferred embodiment, the decision variables related to the update of the logistics route include: variable sets indicating whether the sorting centers included in the logistics route are enabled, variable sets of the order volumes of the sorting centers included in the logistics route, variable sets of the functions of the sorting centers included in the logistics route, variable sets of the traffic volumes of the logistics route, decision variable sets of the logistics routes with large order volumes, and variable sets of the number of transportation tools used for the routes of the logistics route.

[0110] In order to clearly illustrate the method for updating the logistics route, the following takes Figure 1 the logistics route shown, which includes the upstream inflow network point i, two intermediate sorting centers j and k, and the downstream outflow network point j, as an example to elaborate on the method for updating the logistics route. As Figure 6 shown, the method for updating the logistics route may include the following steps:

[0111] Step S601: Obtain historical waybill data;

[0112] This step can directly obtain the historical waybill data from the waybill management system or receive the historical waybill data input by the user through the terminal device.

[0113] Step S602: Determine the sorting centers included in the logistics route within the set area range;

[0114] As Figure 1In the shown structure, among all the logistics routes, except for the upstream inflow nodes (Origins) and the downstream outflow nodes (Destination), there are four sorting centers within the set area.

[0115] Step S603: Screen the historical waybill data passing through the sorting centers to obtain the logistics historical data within the set area.

[0116] For example, screen the historical waybill data passing through Figure 1 the four sorting centers shown. The upstream inflow nodes (Origins) or downstream outflow nodes (Destination) of the historical waybill data passing through the sorting centers can be stations, warehouses, sorting centers, etc. outside the set area. By screening the historical waybill data based on the sorting centers within the set area, it can ensure that the statistics of the historical waybill data within the set area are relatively complete, so as to ensure the accuracy of subsequent logistics route updates.

[0117] Step S604: According to the historical waybill data belonging to the set area, count the order volume of each logistics route within the set area.

[0118] The statistical result can be as shown in Table 1 above.

[0119] Step S605: According to the historical order volume of each logistics route and the preset large order volume screening strategy, screen the logistics routes with large order volumes from the logistics routes within the set area.

[0120] The preset large order volume screening strategy in this step can include: screening the logistics routes with an order volume not lower than the preset order volume threshold, and taking the screened logistics routes as the logistics routes with large order volumes; or, arranging all the logistics routes within the set area in descending order according to the order volume of the logistics routes; according to the descending order result and the preset sorting range, screen the logistics routes with large order volumes. The specific implementation method of this step has been specifically described in the previous embodiments and will not be elaborated here. The logistics routes with large order volumes count the OD pairs from the upstream inflow node O to the downstream outflow node D, and these logistics routes with large order volumes do not pay attention to the intermediate sorting centers passed by from the upstream inflow node O to the downstream outflow node D.

[0121] Step S606: According to the node types of the upstream inflow nodes and downstream outflow nodes in the logistics route and the transportation types of the inflow order volume and outflow order volume of the logistics route, label the functions of the sorting centers included in the logistics route.

[0122] The labeling result of this step can be as Figure 1As shown in the figure, the functions of the four sorting centers are as follows: One sorting center in Sorting 1 functions as a feeder inbound and pick-up inbound; another sorting center in Sorting 1 functions as a mainline inbound and ferry inbound; one sorting center in Sorting 2 functions as a feeder outbound; the other sorting center corresponding to Sorting 2 functions as a mainline outbound and transfer outbound. Since a sorting center can belong to multiple logistics routes simultaneously and its functions vary in each logistics route, there can be multiple functions for the sorting center located between the upstream inflow node and the downstream outflow node in the logistics route.

[0123] Step S607: Obtain parameters related to the update of the logistics route;

[0124] The parameters related to the update of the logistics route obtained in this step may include routing parameters and cost parameters, where,

[0125] The routing parameters include:

[0126] Dis represents the distance matrix, in kilometers. Dis m,n represents the distance between two adjacent points (m - n) in the logistics route. For example, Figure 1 in the logistics structure shown, two adjacent points in the logistics route can be i - j, j - k, k - l.

[0127] L represents the limit on the number of each function of the sorting centers located between the upstream inflow node and the downstream outflow node in the logistics route within the set area. Among them, L u represents the limit on the number of sorting centers with function u within the set area. In the embodiments of the present invention, there are a total of 7 types of function categories, namely mainline inbound, feeder inbound, mainline outbound, feeder outbound, pick-up inbound, ferry inbound, and transfer outbound.

[0128] Cap represents the production capacity limit of the sorting centers located between the upstream inflow node and the downstream outflow node in the logistics route within the set area. Cap g represents the production capacity limit of the processing volume of sorting center g.

[0129] Vol represents the capacity limit of the vehicle. Vol p represents the capacity limit of vehicle type p.

[0130] OD represents the order volume from the upstream inflow node O to the downstream outflow node D of the logistics route. OD i,l represents the order volume from i to l, which is obtained from the above step S604.

[0131] bigOD represents the set of upstream inflow outlets O to downstream outflow outlets D of the logistics route for a large order volume. The set of i-l codes of the OD pairs with a large order volume collected in the above step S605, BigOD = {(i1, l1), (i2, l2),...}.

[0132] bigM represents an auxiliary variable. This auxiliary variable is a large value. This auxiliary variable is an auxiliary value for implementing modeling techniques. A relatively large value can be set, or a value in the business scenario can be used, such as: the total order volume within a set area.

[0133] The cost parameters include:

[0134] Represents the vehicle fixed cost of vehicle type p, in yuan;

[0135] Represents the vehicle variable cost of vehicle type p, in yuan / km;

[0136] Oper represents the sorting operation cost of the sorting center from the upstream inflow outlet to the downstream outflow node, in yuan / order. oper g Represents the operation cost of sorting center g.

[0137] Step S608: Generate the objective function and the constraint conditions of the objective function by using the parameters related to the logistics route update and the decision variables related to the logistics route update;

[0138] Among them, the decision variables related to the logistics route update are preset and stored in the storage area. The decision variables related to the logistics route update may include:

[0139] open represents the variable set of whether the sorting center between the upstream inflow outlet and the downstream outflow outlet is enabled. The elements of this variable set are 0-1 variables. open g Represents whether sorting center j is enabled. That is, when sorting center g is started, open g = 1, when sorting center g is not enabled, open g = 0;

[0140] amt represents the variable set of the processing order volume of the sorting center between the upstream inflow outlet and the downstream outflow outlet. The elements in this variable set are continuous variables. amt g Represents the total order volume flowing through sorting center g.

[0141] func represents the variable set of the function of the sorting center between the upstream inflow outlet and the downstream outflow outlet. The elements are 0-1 variables. func g,u Represents whether the u function of sorting center g is enabled. For example, when the u function of sorting center g is enabled, func g,u= 1, the u function of sorting center g is not enabled func g,u = 0.

[0142] flow represents the set of flow variables of the logistics route, and the elements in the set of flow variables are continuous variables. flow i,j,k,l represents the order volume passing through the logistics route i-j-k-l. The order volume from i to l of the OD order volume has been obtained in the above steps, and decision variables need to be created to represent the order volume of i flowing through the j-k combination to l.

[0143] r represents the set of variables for route decision-making, and the elements in this set of variables are 0-1 variables. r i,j,k,l represents the decision variable of route i-j-k-l. This variable only creates the corresponding route variable for the OD with a large order volume, that is, the OD pair (i, l) with r ∈ bigOD.

[0144] veh represents the set of variables for the number of vehicles used on the lines of the logistics route, and the elements in this set of variables are integer variables. veh i,j,p represents the number of vehicles of type p required for a section of the line i-j in the logistics route. Vehicle types such as 4.2 meters, 7.6 meters, 17.6 meters, etc. It should be noted that here it represents the line or edge between adjacent two layers, Figure 1 There are a total of three types of lines in the structure shown, such as the number of vehicles of type p used for the three lines i-j, j-k, and k-l respectively.

[0145] Step S609: Based on the constraint conditions of the objective function, calculate the minimum cost of the objective function to obtain the decision result corresponding to the decision variable;

[0146] Calculating the minimum cost of the objective function can be achieved based on the above formula (1), which will not be elaborated here.

[0147] The constraint conditions of the objective function include:

[0148]

[0149]

[0150]

[0151]

[0152]

[0153]

[0154]

[0155]

[0156]

[0157]

[0158]

[0159]

[0160] Among them, i, j, k, and l represent the logistics route; (i, l) represents the od pair composed of the upstream inflow network point and the downstream outflow network point of the logistics route; M represents the set of inbound functions; I represents the set of trunk inbound and branch inbound; O represents the set of downstream outflow network points corresponding to trunk outbound and branch outbound; F represents the set of function types of the sorting center; S represents the set of stations; W represents the set of warehouses corresponding to the upstream inflow network point and the downstream outflow network point; V represents the set of vehicle models; N represents the set of outbound functions.

[0161] Among them, constraint condition 1 represents OD flow balance. That is, for the od pair of each logistics route, the sum of the flow-through single volumes is equal to the demand of this od pair.

[0162] Constraint condition 2 represents binding the integer logistics route variable r related to bigOD and the flow variable. That is, if the single volume of flow i,j,k,l >0, then r i,j,k,l =1. This constraint condition 2 mainly realizes the linkage between the r variable and the flow variable. That is, if there is a logistics route r with flow (i.e., flow>0), then r must be 1. This constraint condition 2 and constraint condition 3 work together to achieve the uniqueness of the constrained route for bigOD with large single volumes.

[0163] Constraint condition 3 represents that for the od in the bigOD set, there is one and only one logistics route from o to d.

[0164] Constraint condition 4 represents that the single volume flowing through each sorting center <= the production capacity upper limit of the sorting center. In constraint conditions 4 to 12, D represents the set of sorting centers; g represents the elements in the set of sorting centers.

[0165] Constraint condition 5 represents that the total single volume flowing through the sorting center is equal to the sum of the single volumes of all routes flowing through it.

[0166] Constraint condition 6 represents binding the variable of whether the sorting center is opened and the flow variable of this sorting center. This constraint condition 6 can link whether the sorting is enabled and the flow-through volume, because open participates in the calculation of the objective function, that is, if it is opened, rent needs to be paid.

[0167] Constraint 7 and Constraint 8 characterize the in-port / out-port variables of the main and branch lines for bound sorting and the variables of the routing flow. The functions of Constraint 7 and Constraint 8 are to link variables. They can be configured by users and need to be constrained.

[0168] Constraint 9 characterizes that the number of sorting centers with a certain function is not greater than the number of those with that function. F represents the function set of the sorting centers.

[0169] Constraint 10, Constraint 11, and Constraint 12 characterize that the total number of single orders flowing through the three-level lines (i-j, j-k, k-l) is not greater than the total vehicle volume (number of vehicles × vehicle capacity).

[0170] The calculation process of this step can use commercial solvers (such as scip, cplex, etc.) to solve the objective function. Analyze the decision variable flow i,j,k,l , retain the logistics routes i-j-k-l with the order volume greater than 0 and the corresponding order volume information. For example, the analyzed result is represented by route, and the order volume of the logistics route i-j-k-l can be represented by route i,j,k,l . Thus, the solution of the objective function and the analysis of the main decision variables are completed. However, the objective function does not uniquely constrain all the OD routes, and subsequent post-processing of the results of the decision variables is required.

[0171] Step S610: Determine whether there are multiple logistics routes with the same upstream inflow point and downstream outflow point in the decision result. If so, execute Step S611; if not, execute Step S612;

[0172] Collect all the route information analyzed in Step S609; specifically, the determination process is as follows: for an o-d pair, whether there are multiple corresponding decision results route whose subscripts include i and l, and collect these multiple routes od and the corresponding multiple routes i,j,k,l .

[0173] Step S611: For multiple logistics routes with the same upstream inflow point and downstream outflow point, retain the logistics route with the largest order volume, delete the other logistics routes, accumulate the order volume in the other logistics routes to the logistics route with the largest order volume, and execute Step S613;

[0174] Compare the order volumes of the multiple routes corresponding to od, delete the routes with less order volume, and add the corresponding order volume to the route with the largest order volume. Until there is exactly one route for each od to fulfill the contract, meeting the business requirements.

[0175] Step S612: Directly adjust the logistics route according to the decision result;

[0176] Step S613: According to the decision result or the adjusted logistics route, relocate the functions of the sorting centers included in the logistics route.

[0177] The solution provided by the embodiment of the present invention can abstract the sorting network of the region into a four-layer routing network, and output the functions of each sorting center while optimizing the routing network. That is, by re-planning the routing network with the optimal cost, analyze the inflow and outflow line types of the routes in the routing network to locate the sorting function.

[0178] Screen out the OD with a large order volume, add a unique routing constraint to it. The number of such OD is small but the order volume ratio is high; the decision variables corresponding to other routes are relaxed to the traffic of the route, and the unique routing constraint is replaced by a traffic balance constraint. Since most decision variables are relaxed to continuous variables, the solver is more likely to obtain a feasible solution of the relaxed model and has a fast solving speed.

[0179] When configuring the production capacity constraint parameters of the sorting center, the parameters are often a fixed and determined value. However, in actual business operations, the upper limit of the production capacity of the sorting center has elasticity. However, the general mathematical programming model cannot utilize this elasticity to explore a more optimal cost solution. The embodiment of the present invention provides a method for moderately utilizing business elasticity, that is, analyze an OD with multiple routes in the optimal solution, use rules to merge redundant routes, and ensure that each OD has and only has one route to meet the business rules. After merging, the production capacity of some individual sorting centers will slightly exceed the upper limit, and the above model relaxation method can effectively control this range, that is, it conforms to business elasticity.

[0180] The solution provided by the embodiment of the present invention can solve medium and large-scale problems with 500,000 - 1.5 million routing variables, and plan the functions of the sorting centers in the urban agglomerations within the concerned scope.

[0181] As Figure 7 shown, the embodiment of the present invention provides a logistics route update device 700, and the logistics route update device 700 may include: a logistics data processing unit 701, a parameter acquisition unit 702, a routing decision unit 703, and a routing update unit 704, where,

[0182] The logistics data processing unit 701 is used to acquire the logistics historical data within the set regional range; process the logistics historical data, and the processed result includes all the logistics routes and the logistics routes with large order volumes within the set regional range;

[0183] The parameter acquisition unit 702 is used to acquire the parameters related to the logistics route update;

[0184] A routing decision-making unit 703, configured to generate an objective function and constraint conditions of the objective function by using parameters related to logistics routing update, pre-constructed decision variables related to logistics routing update, and logistics routing with a large order volume; calculate the minimum value of the objective function based on the constraint conditions of the objective function to obtain a decision result corresponding to the decision variable;

[0185] A routing update unit 704, configured to update the logistics routing within the regional scope according to the decision result.

[0186] In an embodiment of the present invention, a logistics data processing unit 701 is configured to obtain historical waybill data; screen out historical waybill data belonging to a set regional scope from the historical waybill data.

[0187] In an embodiment of the present invention, the logistics data processing unit 701 is configured to count the order volume of each logistics routing within the set regional scope according to the historical waybill data belonging to the set regional scope; screen out the logistics routing with a large order volume from the logistics routing within the set regional scope according to the historical order volume of each logistics routing and a preset large order volume screening strategy.

[0188] In an embodiment of the present invention, the logistics data processing unit 701 is configured to determine sorting centers included in the logistics routing within the set regional scope; screen out historical waybill data passing through the sorting centers.

[0189] In an embodiment of the present invention, the preset large order volume screening strategy may include: screening out logistics routing with an order volume not lower than a preset order volume threshold, and using the screened logistics routing as the logistics routing with a large order volume.

[0190] In an embodiment of the present invention, all logistics routing within the set regional scope are sorted in descending order according to the order volume of the logistics routing; the logistics routing with a large order volume is screened out according to the result of the descending order and a preset sorting range.

[0191] In an embodiment of the present invention, the logistics data processing unit 701 is configured to label the functions of the sorting centers included in the logistics routing according to the network types of the upstream inflow network points and downstream outflow network points in the logistics routing and the transportation types of the inflow order volume and outflow order volume of the logistics routing;

[0192] In an embodiment of the present invention, the routing update unit 704 is configured to reposition the functions of the sorting centers included in the logistics routing.

[0193] In an embodiment of the present invention, the parameters related to logistics routing update include routing parameters and cost parameters; correspondingly,

[0194] A routing decision unit 703 is configured to introduce a part of routing parameters and cost parameters into a preset model function to obtain an objective function; and introduce another part of the routing parameters into a preset model constraint condition to obtain partial constraint conditions of the objective function.

[0195] In an embodiment of the present invention, the routing decision unit 703 is configured to calculate the minimum total cost within a set area range.

[0196] In an embodiment of the present invention, the routing parameters may include: the distance between two points in each logistics route within a set area range, the threshold number of sorting centers for each function; the production capacity threshold of the sorting centers included in each logistics route, the vehicle capacity limit of the transport vehicles, the transport order volume of each logistics route, the logistics routes with large order volumes, and any one or more of the auxiliary variables.

[0197] In an embodiment of the present invention, the cost parameters may include: any one or more of the fixed cost of the transport means, the variable cost of the transport means, the operation cost of the sorting centers included in each logistics route, and the rental cost of the sorting centers included in each logistics route.

[0198] In an embodiment of the present invention, a routing update unit 704 is configured to determine whether there are multiple logistics routes with the same upstream inflow node and downstream outflow node; if so, for the multiple logistics routes with the same upstream inflow node and downstream outflow node, retain the logistics route with the largest order volume, delete the other logistics routes, and accumulate the order volumes in the other logistics routes to the logistics route with the largest order volume.

[0199] In an embodiment of the present invention, the decision variables related to the update of the logistics route may include: any one set or multiple sets of variable sets indicating whether the sorting centers included in the logistics route are enabled, variable sets of the order volumes of the sorting centers included in the logistics route, variable sets of the functions of the sorting centers included in the logistics route, variable sets of the traffic flows of the logistics route, decision variable sets of the logistics routes with large order volumes, and variable sets of the number of transport means used for the routes of the logistics route.

[0200] It should be noted that the update device for the logistics route in each of the above embodiments may be installed in a terminal device or a server.

[0201] Figure 8 An exemplary system architecture 800 to which the update method or update device for the logistics route according to the embodiments of the present invention can be applied is shown.

[0202] As Figure 8As shown, the system architecture 800 may include terminal devices 801, 802, 803, network 804, an update server 805 for logistics routes, and a waybill management server 806. The network 804 is used to provide a medium for communication links between the terminal devices 801, 802, 803 and the update server 805 for logistics routes, and between the update server 805 for logistics routes and the waybill management server 806. The network 804 may include various connection types, such as wired, wireless communication links, or fiber optic cables, etc.

[0203] Users can use the terminal devices 801, 802, 803 to interact with the update server 805 for logistics routes via the network 804 to receive or send messages, etc. Information such as existing logistics routes and regional scopes can be sent from the terminal devices 801, 802, 803 to the update server 805 for logistics routes, and the updated logistics route results sent by the update server 805 for logistics routes can be received.

[0204] The terminal devices 801, 802, 803 can be various electronic devices with a display screen and supporting web browsing, including but not limited to smartphones, tablets, laptop computers, and desktop computers, etc.

[0205] The waybill management server 806 can provide historical waybill data, etc. for the update server 805 for logistics routes.

[0206] The update server 805 for logistics routes can be a server that provides various services, such as a background management server (only for example) that updates the logistics routes by using the terminal devices 801, 802, 803 to send information such as existing logistics routes and regional scopes to the logistics routes. The background management server can analyze and process data such as the received historical waybill data and logistics route data, etc., and feedback the processing results (such as the updated logistics route - only for example) to the terminal devices.

[0207] It should be noted that the logistics route update method provided by the embodiments of the present invention is generally executed by the server 805. Correspondingly, the logistics route update device is generally set in the server 805.

[0208] It should be understood that Figure 8 the numbers of terminal devices, networks, and servers in

[0209] are merely illustrative. According to the implementation requirements, there can be any number of terminal devices, networks, and servers. Figure 9 Figure 900 shows a schematic structural diagram of a computer system of a terminal device suitable for implementing the embodiments of the present invention. Figure 9The terminal device or server shown is merely an example and should not impose any limitations on the functions and scope of use of the embodiments of the present invention.

[0210] As Figure 9 shown, the computer system 900 includes a central processing unit (CPU) 901, which can perform various appropriate actions and processes according to the program stored in the read-only memory (ROM) 902 or the program loaded from the storage section 908 into the random access memory (RAM) 903. In the RAM 903, various programs and data required for the operation of the system 900 are also stored. The CPU 901, ROM 902, and RAM 903 are connected to each other via a bus 904. The input / output (I / O) interface 905 is also connected to the bus 904.

[0211] The following components are connected to the I / O interface 905: an input section 906 including a keyboard, a mouse, etc.; an output section 907 including, for example, a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker, etc.; a storage section 908 including a hard disk, etc.; and a communication section 909 including a network interface card such as a LAN card, a modem, etc. The communication section 909 performs communication processing via a network such as the Internet. A drive 910 is also connected to the I / O interface 905 as required. A removable medium 911, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is installed on the drive 910 as required so that a computer program read from it can be installed into the storage section 908 as required.

[0212] In particular, according to the embodiments disclosed in the present invention, the processes described above with reference to the flowcharts can be implemented as computer software programs. For example, the embodiments disclosed in the present invention include a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program includes program codes for performing the methods shown in the flowcharts. In such an embodiment, the computer program can be downloaded and installed from the network via the communication section 909 and / or installed from the removable medium 911. When the computer program is executed by the central processing unit (CPU) 901, the above functions defined in the system of the present invention are executed.

[0213] It should be noted that the computer-readable medium shown in the present invention can be a computer-readable signal medium, a computer-readable storage medium, or any combination of the two. A computer-readable storage medium can be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the above. More specific examples of a computer-readable storage medium can include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present invention, a computer-readable storage medium can be any tangible medium that contains or stores a program, which can be used by or in conjunction with an instruction execution system, apparatus, or device. In the present invention, a computer-readable signal medium can include a data signal propagated in a baseband or as part of a carrier wave, which carries computer-readable program code. Such a propagated data signal can take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. A computer-readable signal medium can also be any computer-readable medium other than a computer-readable storage medium, which can send, propagate, or transmit a program for use by or in conjunction with an instruction execution system, apparatus, or device. The program code contained on a computer-readable medium can be transmitted using any appropriate medium, including but not limited to: wireless, wire, optical fiber, RF, etc., or any suitable combination of the above.

[0214] The flowcharts and block diagrams in the accompanying drawings illustrate the possible architectures, functions, and operations of systems, methods, and computer program products according to various embodiments of the present invention. In this regard, each block in a flowchart or block diagram can represent a module, a program segment, or a part of code that contains one or more executable instructions for implementing a specified logical function. It should also be noted that in some alternative implementations, the functions marked in the blocks can occur in a different order than marked in the accompanying drawings. For example, two consecutive blocks shown can actually be executed substantially in parallel, and they can sometimes be executed in the reverse order, depending on the functions involved. It should also be noted that each block in a block diagram or flowchart, and combinations of blocks in a block diagram or flowchart, can be implemented by a dedicated hardware-based system that performs the specified functions or operations, or by a combination of dedicated hardware and computer instructions.

[0215] The units involved in the embodiments of the present invention can be implemented in software or in hardware. The described units can also be provided in a processor. For example, it can be described as: a processor, a logistics data processing unit, a parameter acquisition unit, a routing decision unit, and a routing update unit. Among them, the names of these units do not constitute a limitation to the unit itself in some cases. For example, the logistics data processing unit can also be described as "a unit for processing logistics historical data".

[0216] As another aspect, the present invention also provides a computer-readable medium. The computer-readable medium can be included in the device described in the above embodiments; or it can exist alone without being assembled into the device. The above computer-readable medium carries one or more programs. When the above one or more programs are executed by the device, the device includes: acquiring logistics historical data within a set area range; processing the logistics historical data, where the processed result includes all logistics routes and logistics routes with large order volumes within the set area range; acquiring parameters related to logistics route update; using the parameters related to logistics route update and the pre-constructed decision variables related to logistics route update to generate an objective function and the constraint conditions of the objective function, and introducing the logistics routes with large order volumes into the constraint conditions of the objective function; based on the constraint conditions of the objective function, calculating the minimum value of the objective function to obtain the decision result corresponding to the decision variable; and updating the logistics routes within the area range according to the decision result.

[0217] According to the technical solution of the embodiments of the present invention, by processing the logistics historical data within the set area range, all logistics routes and logistics routes with large order volumes within the set area range are obtained. Then, based on the parameters related to logistics route update and the pre-constructed decision variables related to logistics route update, an objective function and the constraint conditions of the objective function are generated, and the logistics routes with large order volumes are introduced into the constraint conditions of the objective function. Since the logistics routes with large order volumes are introduced into the constraint conditions, that is, mainly the logistics routes with large order volumes are constrained, and it is not necessary to constrain all logistics routes, which simplifies the calculation of the objective function and the constraint conditions, thereby effectively solving the large-scale logistics route planning problem and reducing the consumption of computing resources.

[0218] The above specific embodiments do not constitute a limitation to the protection scope of the present invention. Those skilled in the art should understand that various modifications, combinations, sub-combinations, and substitutions can occur depending on design requirements and other factors. Any modifications, equivalent substitutions, and improvements made within the spirit and principle of the present invention should be included within the protection scope of the present invention.

Claims

1. A method for updating a logistics route, characterized in that, Including: Obtain the logistics historical data within the set area range; Process the logistics historical data, wherein the processed result includes all the logistics routes within the set area range and the logistics routes with large order volumes; Obtain the parameters related to the update of the logistics route; wherein, the parameters related to the update of the logistics route include routing parameters and cost parameters; the routing parameters include: the distance between two points in each of the logistics routes within the set area range, the threshold number of sorting centers for each function; the production capacity threshold of the sorting centers included in each logistics route, the vehicle capacity limit of the transport vehicles, the transport order volume of each logistics route, the logistics routes with large order volumes, and any one or more of the auxiliary variables; wherein, the auxiliary variable is a constant or a value in the business scenario; Generate an objective function and the constraint conditions of the objective function by using the parameters related to the update of the logistics route and the decision variables related to the update of the logistics route pre-constructed, and introduce the logistics routes with large order volumes into the constraint conditions of the objective function; wherein, the constraint conditions include: for the logistics routes with large order volumes, the constraint is that the route is unique; Calculate the minimum value of the objective function based on the constraint conditions of the objective function to obtain the decision result corresponding to the decision variables; Update the logistics routes within the area according to the decision result.

2. The method for updating the logistics route according to claim 1, wherein: Further include: obtaining historical waybill data; Obtaining the logistics historical data within the set area range includes: Screen out the historical waybill data belonging to the set area range from the historical waybill data.

3. The method for updating a logistics route according to claim 2, wherein Processing the logistics historical data includes: According to the historical waybill data belonging to the set area range, count the order volume of each logistics route within the set area range; According to the historical order volume of each logistics route and the preset large order volume screening strategy, screen out the logistics routes with large order volumes from the logistics routes within the set area range.

4. The method for updating a logistics route according to claim 2, wherein Screening out the historical waybill data belonging to the set area range from the historical waybill data includes: Determine the sorting centers included in the logistics routes within the set area range; Screen the historical waybill data passing through the sorting centers.

5. The method for updating a logistics route according to claim 3, wherein The preset large order volume screening strategy includes: Screen the logistics routes with an order volume not lower than the preset order volume threshold, and use the screened logistics routes as the logistics routes with large order volumes; Or, Arrange all the logistics routes within the set area range in descending order according to the order volume of the logistics routes; According to the descending order result and the preset sorting range, screen out the logistics routes with large order volumes.

6. The method for updating the logistics route according to claim 1, wherein: Processing the logistics historical data includes: Mark the functions of the sorting centers included in the logistics route according to the network types of the upstream inflow outlets and downstream outflow outlets in the logistics route and the transport types of the inflow order volume and outflow order volume of the logistics route; Updating the logistics routes within the area includes: repositioning the functions of the sorting centers included in the logistics route.

7. The method for updating the logistics route according to any one of claims 1 to 6, characterized in that: Generate the objective function and the constraint conditions of the objective function, including: Introduce the distance between two points in each of the logistics routes within the set area in the route parameters and the cost parameters into a preset model function to obtain the objective function; Introduce any one or more of the threshold number of sorting centers of each function within the set area in the route parameters, the production capacity threshold of the sorting centers included in each logistics route, the vehicle capacity limit of the transport vehicles, the transport order volume of each logistics route, the logistics routes with large order volumes, and the auxiliary variables into the preset model constraint conditions to obtain partial constraint conditions of the objective function.

8. The method for updating the logistics route according to claim 7, characterized in that: Calculate the minimum value of the objective function, including: calculating the minimum total cost within the set area.

9. The method for updating the logistics route according to claim 7, characterized in that: The cost parameters include any one or more of the fixed cost of the transport means, the variable cost of the transport means, the operation cost of the sorting centers included in each logistics route, and the rental cost of the sorting centers included in each logistics route.

10. The update method of the logistics route according to claim 1, wherein Update the logistics routes within the area, including: Judge whether there are multiple logistics routes with the same upstream inflow network points and downstream outflow network points; If so, for multiple logistics routes with the same upstream inflow network points and downstream outflow network points, retain the logistics route with the largest order volume, delete the other logistics routes, and accumulate the order volume in the other logistics routes to the logistics route with the largest order volume.

11. The method for updating the logistics route according to any one of claims 1 to 6, 8 to 10, characterized in that: The decision variables related to the update of the logistics route include any one set or multiple sets of the variable set indicating whether the sorting centers included in the logistics route are enabled, the order volume variable set of the sorting centers included in the logistics route, the function variable set of the sorting centers included in the logistics route, the flow variable set of the logistics route, the decision variable set of the logistics routes with large order volumes, and the variable set of the number of transport means used in the route of the logistics route; The function variable set indicates whether the functions of the sorting centers included in the logistics route are enabled; the decision variable set indicates whether the logistics route is a logistics route with a large order volume.

12. An update device for logistics routing, characterized in that, It includes: A logistics data processing unit, a parameter acquisition unit, a routing decision unit, and a routing update unit, wherein The logistics data processing unit is used to acquire the logistics historical data within the set area; process the logistics historical data, and the processed result includes all the logistics routes and the logistics routes with large order volumes within the set area; The parameter acquisition unit is configured to acquire parameters related to logistics route update; wherein, the parameters related to logistics route update include routing parameters and cost parameters; the routing parameters include: the distance between two points in each of the logistics routes within the set area range, the threshold number of sorting centers for each function; the production capacity threshold of the sorting centers included in each logistics route, the vehicle capacity limit of the transport vehicles, the transport order volume of each logistics route, the logistics route with a large order volume, and any one or more of the auxiliary variables; wherein, the auxiliary variable is a constant or a value in the business scenario. The routing decision unit is configured to generate an objective function and the constraint conditions of the objective function by using the parameters related to logistics route update and the decision variables related to logistics route update pre-constructed; wherein, the constraint conditions include: for the logistics route with a large order volume, constraining the route to be unique; based on the constraint conditions of the objective function, calculating the minimum value of the objective function to obtain the decision result corresponding to the decision variable. The routing update unit is configured to update the logistics routes within the area range according to the decision result.

13. An electronic device, characterized in that, Comprising: One or more processors; A storage device for storing one or more programs, When the one or more programs are executed by the one or more processors, the one or more processors implement the method according to any one of claims 1-11.

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

Images