CN114118887A

CN114118887A - Logistics routing updating method and device

Info

Publication number: CN114118887A
Application number: CN202110013036.3A
Authority: CN
Inventors: 陈夏
Original assignee: Beijing Jingdong Zhenshi Information Technology Co Ltd
Current assignee: Beijing Jingdong Zhenshi Information Technology Co Ltd
Priority date: 2021-01-06
Filing date: 2021-01-06
Publication date: 2022-03-01

Abstract

The invention discloses a method and a device for updating a logistics route, and relates to the technical field of logistics. One embodiment of the method comprises: acquiring logistics historical data in a set area range; processing the logistics historical data, wherein the processed result comprises all logistics routes and a large amount of logistics routes in a set area range; acquiring parameters related to logistics route updating; generating an objective function and a constraint condition of the objective function by using parameters related to logistics route updating and pre-constructed decision variables related to logistics route updating, and introducing a large amount of logistics routes into the constraint condition of the objective function; calculating the minimum value of the objective function based on the constraint condition of the objective function to obtain a decision result corresponding to the decision variable; and updating the logistics route in the area range according to the decision result. The implementation method can effectively solve the large-scale logistics routing planning problem.

Description

Logistics routing updating method and device

Technical Field

The present invention relates to the field of logistics technologies, and in particular, to a method and an apparatus for updating a logistics route.

Background

Logistics transportation is generally supported by logistics routes including sorting, for example, logistics route from location a to location B is a to sorting center 1, sorting center 1 to sorting center 2, sorting center 2 to location B, and logistics package is generally transported to location B via the logistics route. Due to adjustment of logistics services or change of layout of sorting centers in an area, etc., logistics routes are often required to be adjusted or updated accordingly. Currently, the adjustment or update of the logistics route mainly adopts an integer programming mode.

In the process of implementing the invention, the inventor finds that at least the following problems exist in the prior art:

due to the complex business constraint, when the updating scale is large, the integer programming mode needs to consume large computing resources, and the effective solution can not be carried out frequently.

Disclosure of Invention

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

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

acquiring logistics historical data in a set area range;

processing the logistics history data, wherein the processed result comprises all logistics routes and a large amount of logistics routes in the set area range;

acquiring parameters related to logistics route updating;

generating an objective function and a constraint condition of the objective function by using the parameters related to the logistics route updating and pre-constructed decision variables related to the logistics route updating, and introducing the large amount of logistics routes into the constraint condition of the objective function;

calculating the minimum value of the objective function based on the constraint condition of the objective function to obtain a decision result corresponding to the decision variable;

and updating the logistics route in the area range according to the decision result.

Preferably, the method for updating the logistics route further comprises: acquiring historical waybill data;

the method for acquiring the logistics history data in the set area range comprises the following steps:

and screening out historical waybill data belonging to the set region range from the historical waybill data.

Preferably, the processing the logistics history data comprises:

according to historical waybill data belonging to the set area range, counting the single quantity of each logistics route in the set area range;

and screening a large single amount of logistics routes from the logistics routes in the set area range according to the historical single amount of each logistics route and a preset large single amount screening strategy.

Preferably, the step of screening out historical waybill data belonging to the set region range from the historical waybill data includes:

determining a sorting center included by the logistics route in the set area range;

and screening historical waybill data passing through the sorting center.

Preferably, the preset large single-quantity screening strategy comprises the following steps:

screening logistics routes with single quantity not lower than a preset single quantity threshold value, and taking the screened logistics routes as large-single-quantity logistics routes;

or,

according to the single amount of the logistics routes, all the logistics routes in a set area range are arranged in a descending order;

and screening a large amount of logistics routes according to the descending order result and a preset ordering range.

Preferably, the processing the logistics history data comprises:

marking the functions of a sorting center included in the logistics route according to the types of the upstream inflow network points and the downstream outflow network points in the logistics route and the transportation types of the logistics route for inflow single quantity and outflow single quantity;

updating the logistics route in the area range comprises the following steps: relocating the functionality of a sorting center included in the logistics route.

Preferably, the parameters related to the logistics routing update comprise a routing parameter and a cost parameter;

generating an objective function and a constraint condition of the objective function, comprising:

introducing a part of the routing parameters and the cost parameters into a preset model function to obtain the target function;

and introducing the other part of the routing parameters into a preset model constraint condition to obtain a part of constraint conditions of the objective function.

Preferably, calculating the minimum value of the objective function comprises: and calculating the minimum total cost in the set area range.

Preferably, the routing parameters include: the distance between two points in each logistics route in the set area range and the threshold value of the number of sorting centers of each function; each logistics route comprises any one or more of a capacity threshold value of the sorting center, a vehicle capacity limit value of a transport vehicle, a single transport quantity of each logistics route, a single large quantity of logistics routes and auxiliary variables.

Preferably, the cost parameters include: any one or more of a fixed cost of the transport, a varying cost of the transport, an operating cost of the sorting center included with each of the logistics routes, and a rent cost of the sorting center included with each of the logistics routes.

Preferably, updating the logistics route in the area range comprises:

judging whether a plurality of logistics routes with the same upstream inflow network point and downstream outflow network point exist or not;

if the single quantity of logistics routes exists, aiming at a plurality of logistics routes with the same upstream inflow network point and downstream outflow network point, keeping the logistics route with the maximum single quantity, deleting other logistics routes, and adding the single quantity in the other logistics routes to the logistics route with the maximum single quantity.

Preferably, the decision variables related to logistics routing update include: the logistics route comprises any one or more of variable sets of whether a sorting center is enabled or not, single variable sets of sorting centers of the logistics route, function variable sets of sorting centers of the logistics route, flow variable sets of the logistics route, decision variable sets of large single logistics route, and line use transport variable sets of the logistics route.

In a second aspect, an embodiment of the present invention provides an update apparatus for a logistics route, including: a logistics data processing unit, a parameter acquisition unit, a route decision unit and a route updating unit, wherein,

the logistics data processing unit is used for acquiring logistics historical data in a set area range; processing the logistics history data, wherein the processed result comprises all logistics routes and a large amount of logistics routes in the set area range;

the parameter acquiring unit is used for acquiring parameters related to logistics route updating;

the route decision unit is configured to generate an objective function and a constraint condition of the objective function by using the parameter related to the update of the logistics route, a pre-established decision variable related to the update of the logistics route, and the large single amount of logistics routes; calculating the minimum value of the objective function based on the constraint condition of the objective function to obtain a decision result corresponding to the decision variable;

and the route updating unit is used for updating the logistics route in the area range according to the decision result.

One embodiment of the above invention has the following advantages or benefits: all logistics routes and large single amount of logistics routes in the set area range are obtained by processing logistics historical data in the set area range, then an objective function and constraint conditions of the objective function are generated based on parameters related to logistics route updating and pre-constructed decision variables related to logistics route updating, and the large single amount of logistics routes are introduced into the constraint conditions of the objective function. As a large amount of single-quantity logistics routes are introduced into the constraint conditions, namely the large amount of single-quantity logistics routes are mainly constrained without constraining all the logistics routes, the calculation and the constraint conditions of the objective function are simplified, the large-scale logistics route planning problem is effectively solved, and the consumption of calculation resources can be reduced.

Further effects of the above-mentioned non-conventional alternatives will be described below in connection with the embodiments.

Drawings

The drawings are included to provide a better understanding of the invention and are not to be construed as unduly limiting the invention. Wherein:

FIG. 1 is a schematic diagram of a structure for routing of partial streams within a zone according to an embodiment of the invention;

fig. 2 is a schematic diagram of a main flow of an update method of a logistics route according to an embodiment of the present invention;

fig. 3 is a schematic diagram of a main flow of processing logistics history data according to an embodiment of the invention;

FIG. 4 is a schematic diagram of a main flow of generating an objective function and constraints of the objective function according to an embodiment of the invention;

FIG. 5 is a schematic diagram of the main flow of updating the logistics routing within a set range according to an embodiment of the present invention;

fig. 6 is a schematic diagram of a main flow of an update method of a logistics route according to another embodiment of the present invention;

fig. 7 is a schematic diagram of the main units of an update apparatus of a logistics route according to an embodiment of the present invention;

FIG. 8 is an exemplary system architecture diagram in which embodiments of the present invention may be employed;

fig. 9 is a schematic structural diagram of a computer system suitable for implementing a terminal device or a server according to an embodiment of the present invention.

Detailed Description

Exemplary embodiments of the present invention are described below with reference to the accompanying drawings, in which various details of embodiments of the invention are included to assist understanding, and which are to be considered as merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.

As shown in fig. 1, a logistics route according to an embodiment of the present invention may include an upstream ingress node, a central sorting center within a defined area, and a downstream egress node. Wherein, the upstream inflow network point can be a cross-regional sorting center, a sorting center in a region, a station, a warehouse, etc.; the downstream outgoing network points can be sorting centers in the region, sorting centers outside the region, stations and the like. It is worth to be noted that the upstream ingress network point and the downstream egress network point are definitions of one physical distribution route, and the upstream ingress network point of one physical distribution route may be a downstream egress network point of another physical distribution route; a downstream egress point of one logistics route may be an upstream ingress point of another logistics route.

The logistics routing update of the embodiment of the invention mainly relates to the replanning of the passing sorting centers from the upstream inflow network points to the downstream outflow network points and the repositioning of the functions of the passing sorting centers.

Generally, a complete logistics route from an origin to a destination may include a plurality of sorting centers, and the solution provided by the embodiment of the present invention is mainly to update the logistics route in segments, for example, for a complete logistics route across multiple zones, the solution provided by the embodiment of the present invention may update a segment of logistics route in each zone separately or simultaneously to complete the update of the complete logistics route across multiple zones.

The logistics route aimed by the scheme provided by the embodiment of the invention is mainly a section of logistics route in a set area range, wherein a sorting center exists between an upstream inflow network node and a downstream outflow network node.

Generally, an upstream ingress network point and a downstream egress network point belong to only one stream route, and the sorting centers between the upstream ingress network point and the downstream egress network point can be used by different upstream ingress network points and downstream egress network points, so that a stream route can be uniquely represented by using the upstream ingress network point and the downstream egress network point, and only the sorting centers in the stream route need to be rearranged or distributed, and the like.

It should be noted that fig. 1 only shows a part of the logistics routes in one area by way of example, and the logistics routes provided by the embodiment of the present invention are not limited to two sorting centers, but may be one or more sorting centers, which exist between the upstream incoming branch point and the downstream outgoing branch point. However, in general, in most of the distribution routes in a region, there are two sorting centers between the upstream and downstream distribution points.

Fig. 2 is a method for updating a logistics route according to an embodiment of the present invention, and as shown in fig. 1, the method for updating a logistics route may include the following steps:

step S201: acquiring logistics historical data in a set area range;

step S202: processing the logistics historical data, wherein the processed result comprises all logistics routes and a large amount of logistics routes in a set area range;

step S203: acquiring parameters related to logistics route updating;

step S204: generating an objective function and a constraint condition of the objective function by using parameters related to logistics route updating and pre-constructed decision variables related to logistics route updating, and introducing a large amount of logistics routes into the constraint condition of the objective function;

step S205: calculating the minimum value of the objective function based on the constraint condition of the objective function to obtain a decision result corresponding to the decision variable;

step S206: and updating the logistics route in the area range according to the decision result.

The set area range may be a range arbitrarily divided, for example, a north China area, a south China area, or the like, and the area range may be within a province or a city.

The specific implementation of step S101 may be that historical waybill data is acquired, and all waybill data passing through a set area range, such as a city list, is screened out according to the area range; sorting all the screened waybill data passing through the area range, wherein the sorted data is called as OD data, the OD data is single-quantity data entering a downstream outflow network point (labeled as Destination) from an upstream inflow network point (labeled as a starting point Origin) through one or more sorting centers in a set area range, and the single-quantity data can include a single quantity from the upstream inflow network point (i.e., a starting network point in table 1) to the downstream outflow network point (i.e., a target network point in table 1), a single-quantity percentage from the upstream inflow network point (i.e., a starting network point in table 1) to the downstream outflow network point (i.e., a target network point in table 1), a starting city corresponding to the upstream inflow network point (i.e., a starting network point in table 1), and a target city corresponding to the downstream outflow network point (i.e., a target network point in table 1). As shown in table 1 below, the partial OD data of the area range was set.

TABLE 1 partial OD data for set zone range

Starting net point	Starting city	Destination net point	Destination city	Single quantity (thousands pieces)	Percent by weight
						a receiving storehouse	A city	b1 sorting center	A city	8146	17％
c sorting center	B city	d sorting center	B city	7289	15％
						E-shaped cargo receiving bin	A city	f1 sorting center	C city	6418	13％
g sorting center	D city	b sorting center	A city	4866	10％
						h-shaped cargo receiving bin	A city	r sorting center	E city	4501	9％
w sorting center	City F	b sorting center	A city	3949	8％
						s-shaped goods receiving bin	A city	z sorting center	City of G	1498	3％
n sorting center	A city	m sorting center	E city	1496	3％
						c sorting center	B city	p2 sorting yard	H city	1292	3％
f2 sorting center	C city	q sorting center	P city	692	1％
						b2 goods receiving bin	Guangzhou A city	p1 sorting center	Q city	684	1％
t sorting center	Guangzhou A city	b sorting center	B city	587	1％
						…	…	…	…	…	…

The percentage of the single volume transported by one physical distribution route to the downstream point (i.e., the destination point in table 1) from the upstream point (i.e., the point in table 1) is the percentage of the total single volume transported by all the physical distribution routes in the area of the predetermined area.

The large single-volume logistics route generally refers to a logistics route with a large single-volume transportation ratio, and can be screened from all the above table 1 through setting conditions. The setting condition can be set correspondingly according to actual requirements. Because the layout or planning of a large single amount of logistics routes can obviously influence the logistics network layout or logistics cost and the like in the whole set area range, the embodiment of the invention focuses on the large single amount of logistics routes, reduces the constraints of other logistics routes except the large single amount of logistics routes, reduces the consumption of computing resources and can ensure the accuracy of logistics route planning.

The implementation manner of step S203 may be that, when performing logistics route update, the parameter related to the logistics route update may be directly obtained from a storage area of a computing device or a storage device, where the parameter related to the logistics route update may be stored in advance according to an actual requirement; the logistics routing update related parameters input by the user through the terminal equipment can also be received.

In the embodiment shown in fig. 2, all the logistics routes and a large amount of logistics routes within the set area range are obtained by processing the logistics history data within the set area range, then an objective function and a constraint condition of the objective function are generated based on parameters related to logistics route update and pre-constructed decision variables related to logistics route update, and the large amount of logistics routes are introduced into the constraint condition of the objective function. As a large amount of single-quantity logistics routes are introduced into the constraint conditions, namely the large amount of single-quantity logistics routes are mainly constrained without constraining all the logistics routes, the calculation and the constraint conditions of the objective function are simplified, the large-scale logistics route planning problem is effectively solved, and the consumption of calculation resources can be reduced.

In an embodiment of the present invention, the method for updating a logistics route may further include: acquiring historical waybill data; screening out historical waybill data belonging to a set area range from the historical waybill data; accordingly, as shown in fig. 3, the processing of the logistics history data may include the steps of:

step S301: according to historical waybill data belonging to a set area range, counting the single quantity of each logistics route in the set area range;

step S302: and screening a large single amount of logistics routes from the logistics routes in the set area range according to the historical single amount of each logistics route and a preset large single amount screening strategy.

The preset large single-quantity screening strategy can be used for screening the logistics routes with single quantity not lower than a preset single-quantity threshold value, and the screened logistics routes are used as the large single-quantity logistics routes; the preset single amount threshold value can be modified or set correspondingly according to actual requirements. For example, if the preset single threshold is not less than 1000 pieces, a large single amount of logistics routes are screened for part of the logistics routes given in table 1, and the screened large single amount of logistics routes are: 9 large-volume logistics routes are formed by a goods receiving bin-b 1 sorting center, a c sorting center-d sorting center, an e goods receiving bin-f 1 sorting center, a g sorting center-b sorting center, an h goods receiving bin-r sorting center, a w sorting center-b sorting center, an s goods receiving bin-z sorting center, an n sorting center-m sorting center and a c sorting center-p 2 sorting field. For another example, if the preset single quantity threshold is that the single quantity percentage is not lower than 10%, a large single quantity of logistics routes are screened for part of the logistics routes given in table 1, and the screened large single quantity of logistics routes are: the a receiving warehouse-b 1 sorting center, the c sorting center-d sorting center, the e receiving warehouse-f 1 sorting center and the g sorting center-b sorting center are 4 large single-volume logistics routes.

In addition, the preset large-single-quantity screening strategy can also be that all the logistics routes in the set area range are arranged in a descending order according to the single quantity of the logistics routes; and screening a large amount of logistics routes according to the descending order result and a preset ordering range. For example, all the logistics routes in a region are arranged in the order from high to low of a single quantity, and the logistics route arranged in the top 20% (the preset sequencing range) is selected as the logistics route with the large single quantity. For example, the total number of the logistics routes arranged from high to low in a single amount in one area is 40, the first 20% is selected, and the first 8 logistics routes arranged in a descending order are selected as the logistics routes with large single amount.

It is worth noting that the individual amount of routing of a stream is determined by the upstream ingress point (start point) and the downstream egress point (end point). Therefore, a large single-quantity logistics route can be determined through the upstream inflow network point (starting point) and the downstream outflow network point (end point), the acquisition mode of the large single-quantity logistics route is simplified, and the consumption of computing resources is effectively reduced.

In addition, the large single-volume logistics route is determined by combining the single volumes of all logistics routes in one area, so that the large single-volume logistics route has flexibility in obtaining, can meet the requirements of different areas, and better meets the actual requirements.

In an embodiment of the present invention, in order to ensure accuracy of single quantity statistics in a set area range, that is, to count all single quantities passing through any sorting center in the set area range, a specific implementation manner of screening out historical waybill data belonging to the set area range from the historical waybill data may include: determining a sorting center included by the logistics route in the set area range; and screening historical waybill data passing through the sorting center. The logistics route of the sorting center between the upstream inflow network point and the downstream outflow network point in the set area range is also included into the statistical range. The upstream inflow stations and the downstream outflow stations can be reversely deduced through the sorting center, so that the upstream inflow stations outside the set area range and the downstream outflow stations outside the set area range are also taken into consideration, the logistics routing in the set area range is more complete, the logistics routing is updated based on the more complete logistics routing in the set area range, and the accuracy of the logistics routing updating can be improved.

In the embodiment of the present invention, processing the logistics history data may include: marking the functions of a sorting center included in the logistics route according to the network point types of an upstream inflow network point and a downstream outflow network point in the logistics route and the transportation types of the logistics route for inflow single quantity and outflow single quantity; accordingly, updating the region-wide logistics routing can include: relocating the functionality of the sorting center included in the logistics routing.

For example, as shown in fig. 1, if the type of upstream inflow network point (Origins) is a sorting center outside the zone, the sorting center to which the upstream inflow network point is connected functions as a trunk inbound; if the type of the network point of the upstream inflow network point is a sorting center in the area, the sorting center connected with the upstream inflow network point has the function of branch line harboring; if the network point type of the upstream inflow network point is the network point, the sorting center connected with the upstream inflow network point has the function of collecting and entering ports; if the type of the upstream inflow network point is a warehouse, the sorting center connected with the upstream inflow network point has the function of ferrying and entering port; correspondingly, if the type of the downstream outgoing network point (destination) is an outside-area sorting center, the sorting center connected with the downstream outgoing network point has the function of trunk line departure; if the type of the network point of the downstream outgoing network point is a sorting center in the region, the sorting center connected with the downstream outgoing network point has the function of branch line departure; if the type of the downstream outgoing network point is the station point, the sorting center connected with the downstream outgoing network point has the function of entering the port by branch lines; if the type of the downstream outflow network point is warehouse, the sorting center connected with the downstream outflow network point has the functions of transferring station and leaving port, etc.

It is worth mentioning that the upstream and downstream egress nodes can be connected to the same sorting center, which has both the inbound and outbound functions.

By positioning or updating and positioning the functions of the sorting centers between the upstream inflow network points and the downstream outflow network points in the logistics route, the sorting centers in each area can be better managed, the address positions of the sorting centers can be conveniently and subsequently re-planned for the sorting centers, and the like.

In the embodiment of the present invention, the parameters related to the logistics routing update may include a routing parameter and a cost parameter; as shown in fig. 4, generating the objective function and the constraint of the objective function may include the following steps:

step S401: introducing a part of the routing parameters and the cost parameters into a preset model function to obtain a target function;

step S402: and introducing the other part of the routing parameters into a preset model constraint condition to obtain a part of constraint conditions of the objective function.

The routing parameters may include: setting the distance between two points in each logistics route in the area range and the threshold value of the number of sorting centers of each function; each logistics route comprises any one or more of a capacity threshold of the sorting center, a vehicle capacity limit of the transport vehicle, a single transport quantity of each logistics route, a single large quantity of logistics routes and auxiliary variables. In a preferred embodiment, the routing parameters include the distance between two points in each logistics route in a set area range and the threshold value of the number of sorting centers of each function; each logistics route comprises a capacity threshold value of the sorting center, a vehicle capacity limit value of a transport vehicle, a single transport quantity of each logistics route, a single large quantity of logistics routes and auxiliary variables.

The distance between two points in the logistics route refers to the distance between an upstream inflow network point and a connected sorting center, the distance between two connected sorting centers located between the upstream inflow network point and a downstream outflow network point, and the distance between the downstream outflow network point and the connected sorting center in the logistics route.

Wherein the cost parameters may include: any one or more of a fixed cost of the transport, a varying cost of the transport, an operating cost of the sorting center included with each logistics route, and a rent cost of the sorting center included with each logistics route. In a preferred embodiment, the cost parameters include a fixed cost of the transport, a varying cost of the transport, an operating cost of the sorting center included in each logistics route, and a rent cost of the sorting center included in each logistics route.

In an embodiment of the present invention, the specific implementation of calculating the minimum value of the objective function may include: the total cost within the set area is calculated to be the minimum.

The minimum total cost within the calculation-set area can be achieved by the following calculation formula (1).

Wherein, minimize [ alpha ], [ beta ] -a]Characterizing and calculating a minimum value;

characterizing a fixed cost for a vehicle of type p; dis (disease)_i,jRepresenting the distance from a point i to a point j in the logistics route;

a cost variation (dollar/kilometer) characterizing a vehicle of type p; veh_i,j,pRepresenting the number of vehicles of a section of route from a midpoint i to a point j of the logistics route, wherein the number of the vehicles is the number of the vehicles of the vehicle type p; veh represents that a logistics routing needs a vehicle variable set, and elements are integer variables; opener_gCharacterizing the operation cost of a sorting center g in the logistics route; amt_gCharacterizing the total single quantity flowing through the sorting center g; tent_gRepresenting the rent cost of the sorting center g; open (open)_gCharacterizing the operating cost (dollar/unit) of the sorting center g; d characterizes the set of sorting centers within the set area.

It should be noted that, the set of sorting centers in the set area in the above calculation formula (1) may be a set of sorting centers that are upstream inflow nodes, sorting centers that are downstream outflow nodes, and all sorting centers located between the upstream inflow nodes and the downstream outflow nodes; or a collection of all sort centers between an upstream in-flow point and a downstream out-flow point.

With respect to the above-mentioned calculation formula (1),

the vehicle use cost of each route is represented, and includes a vehicle fixed cost and a variation cost related to the route distance. Sigma_j∈Doper_j*amt_jRepresenting the order operation cost for all sorts. Sigma_j∈Drent_j*open_jRepresenting the rental costs of all sorting centers.

In an embodiment of the present invention, as shown in fig. 5, the above-mentioned logistics routing in the update area range may include the following steps:

step S501: judging whether a plurality of logistics routes with the same upstream inflow network point and downstream outflow network point exist, if so, executing a step S502; if not, ending the current flow;

step S502: and aiming at a plurality of logistics routes with the same upstream inflow network point and downstream outflow network point, reserving the logistics route with the largest single quantity, deleting other logistics routes, and adding the single quantity in the other logistics routes to the logistics route with the largest single quantity.

Because the constraint condition of the objective function of the decision-making result is introduced into a large single amount of logistics routes, and no constraint is performed on other logistics routes except the large single amount of logistics routes, and accordingly, other logistics routes except the large single amount of logistics routes may have an upstream inflow network node and a downstream outflow network node of a plurality of logistics routes, so that other logistics routes except the large single amount of logistics routes can be further processed through the steps S501 and S502 to ensure that the upstream inflow network node and the downstream outflow network node (i.e., an O-D pair) only correspond to one logistics route.

In the embodiment of the present invention, the decision variables related to the logistics routing update may include: the logistics routing comprises any one or more of variable sets of whether a sorting center is enabled or not, single variable sets of sorting centers of the logistics routing, function variable sets of sorting centers of the logistics routing, flow variable sets of logistics routing, decision variable sets of large single logistics routing and line use transport means variable sets of the logistics routing.

In a preferred embodiment, the decision variables related to the logistics routing update include: the logistics routing comprises variable sets of whether the sorting centers are enabled or not, single variable sets of the sorting centers, functional variable sets of the sorting centers, decision variable sets of the logistics routing, decision variable sets of the large single logistics routing and line use transport variable sets.

In order to clearly illustrate the update method of the logistics route, the following description will be made of the logistics route including an upstream inflow node i, two intermediate sorting centers j and k, and a downstream outflow node j as an example shown in fig. 1. As shown in fig. 6, the method for updating the logistics route may include the following steps:

step S601: acquiring historical waybill data;

the step can be directly obtained from the waybill management system, or historical waybill data input by a user through the terminal equipment is received.

Step S602: determining a sorting center included by the logistics route in the set area range;

in the structure shown in fig. 1, in addition to the upstream inflow points (Origins) and the downstream outflow points (destinations), the sorting centers in the set area range include four sorting centers,

step S603: screening historical waybill data passing through a sorting center to obtain logistics historical data in a set area range;

for example, the historical waybill data passing through the four sorting centers shown in fig. 1 is screened, an upstream inflow branch point (Origins) or a downstream outflow branch point (Destination) of the historical waybill data passing through the sorting centers may be a station, a warehouse, a sorting center or the like outside a set area, and the historical waybill data within the set area is screened based on the sorting centers within the set area, so that the historical waybill data within the set area is statistically perfect, and the accuracy of updating the subsequent logistics routes is ensured.

Step S604: according to historical waybill data belonging to a set area range, counting the single quantity of each logistics route in the set area range;

the statistical results can be as shown in table 1 above.

Step S605: screening a large single amount of logistics routes from the logistics routes in a set area range according to the historical single amount of each logistics route and a preset large single amount screening strategy;

the preset large-unit screening strategy in this step may include: screening logistics routes with single quantity not lower than a preset single quantity threshold value, and taking the screened logistics routes as large-single-quantity logistics routes; or, according to the single amount of the logistics routes, all the logistics routes in the set area range are arranged in a descending order; and screening a large amount of logistics routes according to the descending order result and a preset ordering range. The specific implementation manner of this step has been specifically described in the foregoing embodiments, and is not described herein again. The large single-volume logistics route counts the OD pairs from the upstream inflow network point O to the downstream outflow network point D, and does not concern the intermediate sorting center through which the upstream inflow network point O passes to the downstream outflow network point D.

Step S606: marking the functions of a sorting center included in the logistics route according to the network point types of an upstream inflow network point and a downstream outflow network point in the logistics route and the transportation types of the logistics route for inflow single quantity and outflow single quantity;

the labeling result of this step can be shown in fig. 1, and the functions of the four sorting centers are: one sorting center in the sorting 1 functions as a branch entry and a collection entry, the other sorting center in the sorting 1 functions as a trunk entry and a ferry entry, one sorting center in the sorting 2 functions as a branch exit, and the other sorting center corresponding to the sorting 2 functions as a trunk exit and a transfer exit. Since one sorting center can belong to a plurality of logistics routes simultaneously, the functions of the sorting center in each logistics route are different, so that the functions of the sorting center between an upstream inflow network point and a downstream outflow network point in the logistics routes can be multiple.

Step S607: acquiring parameters related to logistics route updating;

the parameters related to the logistics route update acquired in this step may include a routing parameter and a cost parameter, wherein,

the routing parameters include:

dis characterizes the distance matrix, kilometer. Dis (disease)_m,nAnd characterizing the distance between two adjacent points (m-n) in the physical distribution route. In the physical distribution structure shown in fig. 1, two adjacent points in the physical distribution route may be i-j, j-k, and k-l.

And L represents the limitation of each functional number of the sorting center between the upstream inflow network point and the downstream outflow network point in the logistics route in the set area. Wherein L is_uAnd representing the limitation of the number of the sorting centers with the u function in the set area range. The embodiment of the invention has 7 kinds of functional categories, namely trunk line entry, branch line entry, trunk line departure, branch line departure, collection entry, ferry entry and transfer exit.

Cap characterizes the sorting center capacity limit between the upstream inflow network point and the downstream outflow network point in the logistics route in the set area. Cap_gCharacterizing the capacity limit of the sorting center g for processing single quantities.

Vol characterizes the capacity limit of the vehicle. Vol_pThe capacity limit of the vehicle type p is characterized.

OD characterizes the single quantity of upstream inflow point O to downstream outflow point D of the stream route. OD_i,lThe single quantities from i to l are characterized and obtained from step S604 above.

bigdo characterizes the set of upstream inflow points O to downstream outflow points D of a large single volume of the stream route. The i-l encoded set of a large number of OD pairs collected in step S605, bigdo { (i)₁,l₁),(i₂,l₂),…}。

bigM characterizes the auxiliary variable. The auxiliary variable is a large value. This auxiliary variable is an auxiliary value to implement modeling skills. A larger value may be determined, or values in a service scenario may be used, such as: the total units in the area are set.

The cost parameters include:

representing the vehicle fixed cost and the vehicle fixed cost of the vehicle type p;

representing the vehicle variation cost of the vehicle type p, yuan/kilometer;

oper characterizes the cost of the sorting operation, dollars/orders, of the sorting centers located upstream of the ingress network points to the downstream egress nodes. opener_gCharacterizing the operating costs of the sorting center g.

Step S608: generating an objective function and a constraint condition of the objective function by using parameters related to logistics route updating and decision variables related to logistics route updating;

wherein, the decision variables related to the logistics route update are preset and stored in the storage area, and the decision variables related to the logistics route update may include:

open characterizes a set of variables, the elements of which are variables 0-1, whether the sorting center between an upstream in-flow node and a downstream out-flow node is enabled. open (open)_gCharacterizing whether sorting center j is enabled. I.e. sorting centre g starts open_g1, sorting center g is not open_g＝0；

amt characterizes a set of variables of the processing unit of the sorting center located between an upstream in-flow node and a downstream out-flow node, the elements of which are a continuous variable. amt_gThe total individual quantity of flow through the sorting centre g is characterized.

func characterizes a set of functional variables of the sorting center located between upstream and downstream egress nodes, with elements of 0-1 variables. func_g,uIt is characterized whether the u function of the sorting center g is switched on or not. U function opening func like sorting center g_g,u1, u function of sorting center g is not turned on func_g,u＝0。

The flow represents a flow variable set of the logistics routing, and elements in the flow variable set are continuous variables. flow (W)_i,j,k,lRepresenting the individual amount routed through the logistics route i-j-k-l. From the above steps, the individual quantities i to l of the OD individual quantities have been obtained, and it is necessary to create a decision variable representing the individual quantity of the i flow combined through j-k to l.

r represents a variable set of routing decisions, and elements in the variable set are variables from 0 to 1. r is_i,j,k,lRepresenting the decision variables of the route i-j-k-l. This variable only creates the corresponding routing variable for a single large amount of OD, i.e., pairs of OD (i, l) ∈ bigOD with r.

veh represents that the line of the logistics route uses a variable set of the number of vehicles, and elements in the variable set are integer variables. veh_i,j,pThe number of vehicles of p vehicle types is needed for characterizing one section of line i-j in the logistics routing. The vehicle models are 4.2 meters, 7.6 meters, 17.6 meters and the like. It should be noted that, here, lines or edges between two adjacent layers are shown, and there are three lines in the structure shown in fig. 1, for example, three lines i-j, j-k, k-l are respectively the number of p vehicle types.

Step S609: calculating the minimum cost of the objective function based on the constraint condition of the objective function to obtain a decision result corresponding to the decision variable;

the minimum cost of calculating the objective function can be realized based on the above calculation formula (1), and will not be described herein.

The constraints of the objective function include:

wherein i, j, k, l represents a logistics route; (i, l) characterizing an od pair consisting of an upstream inflow site and a downstream outflow site of the logistics route; m represents a port entry function set; i, representing trunk line and branch line port access sets; representing a set of downstream flow-out network points corresponding to trunk line departure and branch line departure; f, representing a functional category set of the sorting center; s, representing a site set; w represents warehouse sets corresponding to upstream inflow network points and downstream outflow network points; v represents a vehicle model set; and N represents a port departure function set.

Where constraint 1 characterizes the OD flow balance. I.e. for each pair of logistics routed ods, the associated flow streams are summed by a single amount equal to the demand of the od pair.

And the constraint condition 2 represents that the bigOD related integer logistics routing variable r is bound with the flow variable. If flow is needed_i,j,k,lSingle amount of>0, then r_i,j,k,l1. The constraint condition 2 is mainly used for realizing the linkage of an r variable and a flow variable. I.e. if there is a flow route r at the flow (i.e. flow)>0) Then r must be 1. The constraint 2 cooperates with the constraint 3 to achieve a constraint route unique for a large single amount of ODs.

Constraint 3 characterizes that there is one and only one flow route for od, o to d in the bigOD set.

Constraint 4 characterizes the single quantity <, which is the upper limit of capacity of the sorting centers, flowing through each sorting center. D characterizes the set of sorting centers in constraints 4 to 12; g characterize the elements in the set of sorting centers.

Constraint 5 characterizes the total number of single flows through the sorting center equal to the sum of all the single flows through it.

The constraint 6 characterizes whether the binding sorting center is open or not and the flow variable of the sorting center. This constraint 6 allows the linked sorting of whether or not to be enabled with the flow rate, since open participates in the objective function calculation, i.e. if it is enabled, a lease is required.

Constraints 7 and 8 characterize the variables of the trunk-branch entry/exit variables and the routing flow of the binding sorting. The constraint 7 and the constraint 8 function as linkage variables. Which may be user configurable and which needs to be constrained.

The constraint condition 9 represents that the number of sorting centers with a certain function is not more than the number with the function. F characterizes the functional set of the sorting center.

Constraint 10, constraint 11 and constraint 12 characterize that the total single quantity of flow through the constraint three hierarchy lines (i-j, j-k, k-l) is not greater than the total volume of the vehicle (number of vehicles x volume of the vehicle).

The calculation process of this step can utilize a commercial solver (e.g., scip, cplex, etc.) to solve the objective function. Flow of analytic decision variables_i,j,k,lThe logistics route i-j-k-l with the single amount larger than 0 and the corresponding single amount information are reserved, for example, the analyzed result is represented by route which can be used_i,j,k,lRepresenting the individual quantities of the stream routes i-j-k-l. At this point, objective function solution and main decision variable analysis are completed. However, the objective function does not have a unique constraint on routing of all ODs, and subsequent post-processing of the results of the decision variables is required.

Step S610: judging whether a plurality of logistics routes with the same upstream inflow network point and downstream outflow network point exist in the decision result, if so, executing step S611; if not, go to step S612;

collecting all routing information analyzed in the step S609; wherein, the judging process specifically comprises the following steps: for an o-d pair, whether there are multiple corresponding decision results route whose subscripts include i and l, and collecting these multiple routes od and corresponding multiple routes_i,j,k,l。

Step S611: for a plurality of logistics routes having the same upstream ingress network point and downstream egress network point, retaining the logistics route with the largest single quantity, deleting other logistics routes, adding the single quantity in the other logistics routes to the logistics route with the largest single quantity, and executing step S613;

and deleting the route with less single quantity compared with the single quantity of the plurality of routes corresponding to the od, and increasing the corresponding single quantity to the route with the maximum single quantity. Until all od has one and only one route to perform, and the service requirement is met.

Step S612: directly adjusting the logistics route according to the decision result;

step S613: and according to the decision result or the adjusted logistics route, repositioning the functions of the sorting center included in the logistics route.

The scheme provided by the embodiment of the invention can abstract the sorting network of the region into a 4-layer routing network, and the routing network optimizes and outputs the functions of each sorting center. Namely, the routing network is replanned with optimal cost, and the types of inflow lines and outflow lines of the routes in the routing network are analyzed to carry out address selection and positioning on the sorting function.

Screening out a large amount of single-amount ODs, adding unique route constraints to the single-amount ODs, wherein the number of the single-amount ODs is small, and the single-amount occupation ratio is high; and relaxing the decision variables corresponding to other routes into the flow of the route, and replacing the unique constraint of the route with the flow balance constraint. Because most decision variables are relaxed into continuous variables, the solver can obtain feasible solutions of the relaxation models more easily, and the solving speed is high.

When the capacity constraint parameters of the sorting center are configured, the parameters are always a fixed numerical value, but in actual service operation, the upper limit of the capacity of the sorting center has elasticity. However, the general mathematical programming model cannot utilize the elasticity, and a more cost-optimal solution is explored. The embodiment of the invention provides a method for properly utilizing service elasticity, namely resolving an OD with a plurality of routes in an optimal solution, and merging redundant routes by utilizing rules to ensure that each OD has one route to meet service rules. The merged individual sorting centers slightly exceed the upper limit of the production capacity, and the model relaxation method can effectively control the range, namely, the method accords with the business elasticity.

The scheme provided by the embodiment of the invention can solve the problem of medium and large scale of 50-150 ten thousand routing variables and perform function planning on the sorting center of the city group in the attention range.

As shown in fig. 7, an embodiment of the present invention provides a logistics route updating apparatus 700, where the logistics route updating apparatus 700 may include: a logistics data processing unit 701, a parameter obtaining unit 702, a route decision unit 703 and a route updating unit 704, wherein,

a logistics data processing unit 701, configured to obtain logistics history data within a set area range; processing the logistics historical data, wherein the processed result comprises all logistics routes and a large amount of logistics routes in a set area range;

a parameter obtaining unit 702, configured to obtain a parameter related to logistics route update;

a route decision unit 703, configured to generate an objective function and a constraint condition of the objective function by using parameters related to logistics route update, a pre-constructed decision variable related to logistics route update, and a large amount of logistics routes; calculating the minimum value of the objective function based on the constraint condition of the objective function to obtain a decision result corresponding to the decision variable;

and a route updating unit 704, configured to update the logistics routes in the area range according to the decision result.

In the embodiment of the present invention, the logistics data processing unit 701 is configured to obtain historical waybill data; and screening out historical waybill data belonging to a set area range from the historical waybill data.

In this embodiment of the present invention, the logistics data processing unit 701 is configured to count a single quantity of each logistics route in a set area range according to historical waybill data belonging to the set area range; and screening a large single amount of logistics routes from the logistics routes in the set area range according to the historical single amount of each logistics route and a preset large single amount screening strategy.

In this embodiment of the present invention, the logistics data processing unit 701 is configured to determine a sorting center included in a logistics route within a set area range; and screening historical waybill data passing through the sorting center.

In an embodiment of the present invention, the preset large-unit screening policy may include: and screening the logistics routes with the single amount not lower than a preset single amount threshold value, and taking the screened logistics routes as large single amount logistics routes.

In the embodiment of the invention, all the logistics routes in the set area range are arranged in a descending order according to the single quantity of the logistics routes; and screening a large amount of logistics routes according to the descending order result and a preset ordering range.

In this embodiment of the present invention, the logistics data processing unit 701 is configured to label a function of a sorting center included in the logistics route according to the types of the upstream inflow network node and the downstream outflow network node in the logistics route and the transportation types of the logistics route for the inflow single quantity and the outflow single quantity;

in an embodiment of the present invention, the route updating unit 704 is configured to relocate the function of the sorting center included in the logistics route.

In the embodiment of the invention, the parameters related to the logistics routing update comprise routing parameters and cost parameters; accordingly, the number of the first and second electrodes,

a route decision unit 703, configured to introduce a part of the route parameters and the cost parameters into a preset model function to obtain a target function; and introducing the other part of the routing parameters into a preset model constraint condition to obtain a part of constraint conditions of the objective function.

In this embodiment of the present invention, the route decision unit 703 is configured to calculate that the total cost in the set area range is the minimum.

In the embodiment of the present invention, the routing parameters may include: setting the distance between two points in each logistics route in the area range and the threshold value of the number of sorting centers of each function; each logistics route comprises any one or more of a capacity threshold of the sorting center, a vehicle capacity limit of the transport vehicle, a single transport quantity of each logistics route, a single large quantity of logistics routes and auxiliary variables.

In an embodiment of the present invention, the cost parameter may include: any one or more of a fixed cost of the transport, a varying cost of the transport, an operating cost of the sorting center included with each logistics route, and a rent cost of the sorting center included with each logistics route.

In this embodiment of the present invention, the route updating unit 704 is configured to determine whether there are multiple logistics routes having the same upstream ingress network point and downstream egress network point; if the single-quantity logistics route exists, aiming at a plurality of logistics routes with the same upstream inflow network point and downstream outflow network point, the single-quantity logistics route is reserved, other logistics routes are deleted, and the single quantity in the other logistics routes is added to the single-quantity logistics route.

It should be noted that the updating apparatus for logistics routing in the above embodiments may be installed in a terminal device or a server.

Fig. 8 shows an exemplary system architecture 800 of a logistics route updating method or a logistics route updating apparatus to which an embodiment of the present invention can be applied.

As shown in fig. 8, the system architecture 800 may include

terminal devices

801, 802, 803, a network 804, an update server 805 for logistics routing, and an waybill management server 806. The network 804 is used to provide a medium of communication links between the

terminal devices

801, 802, 803 and the update server 805 of the logistics route, and between the update server 805 of the logistics route and the waybill management server 806. Network 804 may include various types of connections, such as wire, wireless communication links, or fiber optic cables, to name a few.

The user can use the

terminal devices

801, 802, 803 to interact with the update server 805 of the logistics route through the network 804 to receive or send messages or the like. The

terminal devices

801, 802, and 803 may transmit information, area range, and the like of the existing physical distribution route to the update server 805 of the physical distribution route, and may receive the updated physical distribution route result and the like transmitted by the update server 805 of the physical distribution route.

The

terminal devices

801, 802, 803 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.

The waybill management server 806 can provide historical waybill data or the like to the update server 805 of the logistics route.

The update server 805 of the logistics route may be a server that provides various services, such as a background management server (for example only) that provides updates to the logistics route for users to send information of existing logistics routes, area ranges, etc. using the

terminal devices

801, 802, 803. The background management server may analyze and perform other processing on the received data such as the historical waybill data and the data of the logistics route, and feed back a processing result (for example, an updated logistics route — just an example) to the terminal device.

It should be noted that the update method of the logistics route provided by the embodiment of the invention is generally executed by the server 805, and accordingly, the update device of the logistics route is generally disposed in the server 805.

It should be understood that the number of terminal devices, networks, and servers in fig. 8 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.

Referring now to FIG. 9, shown is a block diagram of a computer system 900 suitable for use with a terminal device implementing an embodiment of the present invention. The terminal device or the server shown in fig. 9 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present invention.

As shown in fig. 9, the computer system 900 includes a Central Processing Unit (CPU)901 that can perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)902 or a program loaded from a storage section 908 into a Random Access Memory (RAM) 903. In the RAM 903, various programs and data necessary 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. An input/output (I/O) interface 905 is also connected to bus 904.

The following components are connected to the I/O interface 905: an input portion 906 including a keyboard, a mouse, and the like; an output section 907 including components such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 908 including a hard disk and the like; and a communication section 909 including a network interface card such as a LAN card, a modem, or the like. The communication section 909 performs communication processing via a network such as the internet. The drive 910 is also connected to the I/O interface 905 as necessary. A removable medium 911 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 910 as necessary, so that a computer program read out therefrom is mounted into the storage section 908 as necessary.

In particular, according to the embodiments of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 909, and/or installed from the removable medium 911. The above-described functions defined in the system of the present invention are executed when the computer program is executed by a Central Processing Unit (CPU) 901.

It should be noted that the computer readable medium shown in the present invention can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, 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 disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present invention, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present invention, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.

The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

The units described in the embodiments of the present invention may be implemented by software or hardware. The described units may also be provided in a processor, and may be described as: provided are a processor logistics data processing unit, a parameter acquisition unit, a route decision unit and a route updating unit. Here, the names of the units do not constitute a limitation to the unit itself in some cases, and for example, the logistics data processing unit may also be described as a "unit that processes logistics history data".

As another aspect, the present invention also provides a computer-readable medium that may be contained in the apparatus described in the above embodiments; or may be separate and not incorporated into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to comprise: acquiring logistics historical data in a set area range; processing the logistics historical data, wherein the processed result comprises all logistics routes and a large amount of logistics routes in a set area range; acquiring parameters related to logistics route updating; generating an objective function and a constraint condition of the objective function by using parameters related to logistics route updating and pre-constructed decision variables related to logistics route updating, and introducing a large amount of logistics routes into the constraint condition of the objective function; calculating the minimum value of the objective function based on the constraint condition of the objective function to obtain a decision result corresponding to the decision variable; and updating the logistics route in the area range according to the decision result.

According to the technical scheme of the embodiment of the invention, all logistics routes and a large amount of logistics routes in the set area range are obtained by processing the logistics historical data in the set area range, then the objective function and the constraint condition of the objective function are generated based on the parameters related to logistics route updating and the pre-constructed decision variables related to logistics route updating, and the large amount of logistics routes are introduced into the constraint condition of the objective function. As a large amount of single-quantity logistics routes are introduced into the constraint conditions, namely the large amount of single-quantity logistics routes are mainly constrained without constraining all the logistics routes, the calculation and the constraint conditions of the objective function are simplified, the large-scale logistics route planning problem is effectively solved, and the consumption of calculation resources can be reduced.

The above-described embodiments should not be construed as limiting the scope of the invention. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions can occur, depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims

1. A method for updating a logistics route is characterized by comprising the following steps:

acquiring logistics historical data in a set area range;

acquiring parameters related to logistics route updating;

2. The method for updating physical distribution route according to claim 1,

further comprising: acquiring historical waybill data;

3. The method for updating logistics routing of claim 2, wherein processing the logistics history data comprises:

4. The method for updating logistics routes according to claim 2, wherein the step of screening the historical waybill data belonging to the set area range from the historical waybill data comprises:

and screening historical waybill data passing through the sorting center.

5. The method for updating the logistics route according to claim 3, wherein the preset massive screening strategy comprises:

or,

6. The method for updating physical distribution route according to claim 1,

processing the logistics history data, including:

7. The method for updating the logistics route according to any one of claims 1 to 6,

the parameters related to the logistics routing update comprise routing parameters and cost parameters;

8. The method for updating physical distribution route according to claim 7,

calculating a minimum value of the objective function, comprising: and calculating the minimum total cost in the set area range.

9. The method for updating physical distribution route according to claim 7,

the routing parameters include: the distance between two points in each logistics route in the set area range and the threshold value of the number of sorting centers of each function; each logistics route comprises any one or more of a capacity threshold value of the sorting center, a vehicle capacity limit value of a transport vehicle, a single transport quantity of each logistics route, a single large quantity of logistics routes and auxiliary variables.

10. The method for updating physical distribution route according to claim 7,

the cost parameters include: any one or more of a fixed cost of the transport, a varying cost of the transport, an operating cost of the sorting center included with each of the logistics routes, and a rent cost of the sorting center included with each of the logistics routes.

11. The method for updating the logistics route according to claim 1, wherein updating the logistics route in the area comprises:

12. The method for renewing physical distribution route according to any one of claims 1 to 6 and 8 to 11,

the decision variables related to the logistics route updating comprise: the logistics route comprises any one or more of variable sets of whether a sorting center is enabled or not, single variable sets of sorting centers of the logistics route, function variable sets of sorting centers of the logistics route, flow variable sets of the logistics route, decision variable sets of large single logistics route, and line use transport variable sets of the logistics route.

13. An updating apparatus for logistics routing, comprising: a logistics data processing unit, a parameter acquisition unit, a route decision unit and a route updating unit, wherein,

14. An electronic device, comprising:

one or more processors;

a storage device for storing one or more programs,

when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-12.

15. A computer-readable medium, on which a computer program is stored, which, when being executed by a processor, carries out the method according to any one of claims 1-12.