Logistics distribution method and system under warehouse and distribution integration mode

By constructing and solving the logistics distribution target model, optimizing the distribution plan for warehousing and distribution vehicles, the problem of high warehousing and distribution costs is solved, and efficient and low-cost logistics distribution is achieved.

CN114926077BActive Publication Date: 2024-11-15CHONGQING DESIGN GRP CO LTD
View PDF 4 Cites 0 Cited by

Patent Information

Application Number
CN202210628646.9
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-06-06
Publication Date
2024-11-15
Estimated Expiration
2042-06-06

AI Technical Summary

Technical Problem

The cost of warehousing and distribution remains high under the integrated warehousing and distribution model, especially the optimization scheduling of logistics and distribution is difficult to achieve, resulting in high transportation costs.

Method used

By obtaining the parameters of warehousing outlets, distribution vehicles and customer points, building an objective function and constraint condition that minimizes distribution costs, establishing a logistics distribution target model, solving the optimal solution and objective function value, and realizing an optimized distribution plan for logistics distribution.

Benefits of technology

It improves distribution efficiency, saves distribution costs, and improves the flexibility, efficiency and economicality of logistics distribution through open paths.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114926077B_ABST
    Figure CN114926077B_ABST
Patent Text Reader

Abstract

The present invention proposes a logistics distribution allocation method and system under the warehouse and distribution integration mode. The method is: obtaining all storage network parameters, distribution vehicle parameters, and customer point parameters within the radiation range of each storage network; constructing a logistics distribution objective function with the goal of minimizing distribution costs; establishing constraints; constructing a target model for logistics distribution; solving the model based on the order information to be distributed to obtain the optimal solution and the objective function value; applying the obtained optimal solution and objective function value to the logistics distribution under the warehouse and distribution integration mode to obtain a logistics distribution allocation plan. The logistics distribution allocation method under the warehouse and distribution integration mode combines the storage network parameters, the distribution vehicle parameters, the customer point parameters within the radiation range of each storage network, and the constraints to solve the logistics distribution objective function, thereby realizing the optimal scheduling of logistics distribution under the warehouse and distribution integration mode, improving the distribution efficiency, and saving the distribution cost.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of logistics, and in particular to a logistics distribution method and system under a warehouse and distribution integration mode. Background Art

[0002] Warehousing and distribution integration = warehouse + warehouse operation + distribution. The service of warehousing and distribution integration aims to provide customers with one-stop warehousing and distribution services. As the back-end service of e-commerce, warehousing and distribution mainly solve the seller's goods allocation (collection, processing, sorting, picking, distribution, packaging) and organize the delivery to customers, etc.

[0003] The general process of warehousing and distribution integration is as follows: Warehousing end: order procurement, warehousing notification, temporary storage of received goods, quality inspection and packing, warehouse transfer or shelving; Production end: production orders, inventory scheduling, picking, secondary sorting, unpacking and verification, labeling and weighing, warehouse delivery and loading; Distribution end: trunk line transportation, distribution center, secondary transportation, secondary distribution center, transportation and distribution site, and delivery receipt.

[0004] Since warehousing requires a large area and professional operations, and distribution requires comprehensive network coverage and a large number of transportation tools, the costs of warehousing and distribution remain high. Therefore, reducing warehousing and transportation costs has become a technical problem that needs to be solved urgently in the current warehousing and distribution integration, which includes how to achieve optimal scheduling of logistics distribution. Summary of the invention

[0005] In order to overcome the defects existing in the above-mentioned prior art, the purpose of the present invention is to provide a logistics distribution method and system under the warehouse and distribution integration mode.

[0006] In order to achieve the above-mentioned object of the present invention, the present invention provides a logistics distribution allocation method in a warehouse-distribution integration mode, comprising the following steps:

[0007] Obtain the parameters of all storage outlets, the parameters of the distribution vehicles owned by each storage outlet, and the parameters of customer points within the coverage area of ​​each storage outlet;

[0008] Construct a logistics distribution objective function with the goal of minimizing distribution costs;

[0009] Establish constraints;

[0010] Construct a target model for logistics distribution;

[0011] Based on the order information to be delivered, solving the model to obtain the optimal solution and the objective function value;

[0012] The obtained optimal solution and objective function value are applied to the logistics distribution under the warehouse and distribution integration mode to obtain the logistics distribution allocation plan.

[0013] The logistics distribution allocation method under the warehousing and distribution integration mode combines the warehousing network parameters, distribution vehicle parameters, customer point parameters within the radiation range of each warehousing network and constraints to solve the logistics distribution objective function, realizing the optimal scheduling of logistics distribution under the warehousing and distribution integration mode, improving the distribution efficiency and saving the distribution cost.

[0014] The preferred scheme of the logistics distribution allocation method under the warehouse and distribution integration mode: the logistics distribution objective function includes the driving cost of the distribution vehicle and the loading operation cost of the automatic loader at the storage network point.

[0015] Preferably, the logistics distribution objective function is:

[0016] Where V is the set of storage outlets and customer points, V = V D ∪V C , V D V is a collection of storage outlets. C is a set of customer points with distribution needs within the radiation range of the storage outlets, H is the set of distribution vehicles owned by the storage outlets; the storage outlets and customer points are taken as nodes, t ij is the travel time between nodes in the distribution transportation network, i,j refers to different nodes in the set V, i,j∈V, set t ij =t ji , x ijh is a 0-1 variable. It takes 1 when the delivery vehicle h∈H passes through the path (i,j)(i,j∈V) and i≠j, otherwise it takes 0. i For customer point i∈V C The quantity of goods demanded, v m is the storage network m∈V D Loading speed, wc mi is a 0-1 variable. When the storage outlet m∈V D Service customer point i∈V C It takes 1 when the value is true; otherwise, it takes 0.

[0017] In this preferred solution, the objective function aims to minimize the transportation cost, thereby reducing the transportation cost of the logistics distribution allocation solution.

[0018] The preferred solution of the logistics distribution allocation method under the warehouse and distribution integration mode: the constraints include:

[0019] The number of times the delivery vehicles enter and exit the storage outlets is the same: Refers to any h, x mjh It is a 0-1 variable, which takes the value 1 when the delivery vehicle h∈H passes through the path (m, j), otherwise it takes the value 0;

[0020] Can only be used once for any vehicle:

[0021] For any customer point, it can only be served by one delivery vehicle once: x jih is a 0-1 variable, which takes the value 1 when the delivery vehicle h∈H passes through the path (j,i), otherwise it takes the value 0;

[0022] The delivery vehicles enter and exit the customer point the same number of times, and each delivery vehicle serves the same customer point once:

[0023]

[0024] The goods ordered by the customer are delivered by a certain storage outlet:

[0025] Determine the variable z mhi The value of indicates that the customer's goods are delivered by a delivery vehicle from a storage outlet:

[0026]

[0027] If the delivery vehicle under the storage outlet is used, the delivery vehicle must depart from the storage outlet:

[0028]

[0029] Delivery vehicle load limit:

[0030] Time continuity of delivery vehicles from storage outlets to customer points:

[0031] t mj From the storage network m∈V D The travel time to customer point j; at jh is the time when the delivery vehicle h∈H arrives at the customer point j;

[0032]

[0033] Continuity of delivery vehicle loading and departure times:

[0034]

[0035] The basic time constraints for delivery vehicles to start loading at storage outlets and return to storage outlets at mh is the time when the delivery vehicle h∈H arrives at the storage outlet m;

[0036] Continuity of arrival time of delivery vehicles between customer points:

[0037]

[0038]

[0039] The basic time constraint for the delivery vehicle to arrive at the customer point, and the auxiliary constraint for the value of the unused delivery vehicles: [e jt ,l jt ] is the t∈Tth time window of customer point j, e jt and l jt They represent the start time and end time of the t-th time window of customer point j respectively;

[0040] Determine the variable sa iht The value of indicates that the delivery vehicle arrives at the customer point after a certain time window opens:

[0041]

[0042]

[0043] Determine the variable ca iht The value of indicates that the delivery vehicle arrives before a certain time window of the customer point closes:

[0044]

[0045]

[0046] Determine the variable sc iht The value of indicates the time window in which the delivery vehicle arrives at the customer point:

[0047]

[0048]

[0049] Time constraints for delivery vehicles to arrive at customer points:

[0050] The time limit for the delivery vehicle to leave the customer point, that is, the delivery vehicle needs to complete the service and leave the customer point within the time window in which it serves the customer point:

[0051]

[0052]

[0053] Auxiliary constraints for decision variables indicate that the nodes themselves have no direct communication:

[0054] Auxiliary constraints for time-continuous variables:

[0055] Among them, z mhi is a 0-1 variable. When customer point i∈V C The demand is generated by the distribution vehicle h∈H from the storage outlet m∈V D Take 1 when delivering; otherwise take 0;

[0056] M is a positive integer;

[0057] dt mh For the distribution vehicle h∈H from the storage network m∈V D Departure time, dt mh ≥0;

[0058] at ih is the time when the delivery vehicle h∈H arrives at the customer point or storage point i∈V, at ih ≥0;

[0059] lt mh For the automatic loading machine at the storage point m∈V D is the time when the delivery vehicle h∈H starts loading, lt mh ≥0;

[0060] w t is the number of time windows of the customer point, and the set T = {1,2,..w t};

[0061] s i is the delivery vehicle at customer point i∈V C service time;

[0062] [e it ,l it ] is the customer point i∈V C The t∈Tth time window, e it and l it They represent the start time and end time of the t-th time window of customer point i respectively;

[0063] [ET m ,LT m ] Open service time windows for storage outlets;

[0064] s iht is a 0-1 variable. When the delivery vehicle h∈H arrives at the customer point i∈V after the t∈Tth time window opens C , that is, when at ih ≥e it When it is 1, it is 0 otherwise.

[0065] ca ihtis a 0-1 variable. When the delivery vehicle h∈H arrives at the customer point i∈V before the t∈Tth time window closes C , that is, when at ih ≤l it -s i When it is 1, it is 0 otherwise.

[0066] sc iht is a 0-1 variable. iht =ca iht =1, that is, when the delivery vehicle h∈H arrives at the customer point i∈V within the t∈Tth time window C When it is 1, it is 0 otherwise.

[0067] Q is the rated load of the delivery vehicle.

[0068] The constraints ensure the normal operation of logistics distribution, and also provide constraints to minimize transportation costs.

[0069] The preferred solution of the logistics distribution allocation method under the warehousing and distribution integration mode: the storage network parameters include the number and location of storage network points, the time window for each storage network point to open services, and the loading operation speed of each storage network point;

[0070] The parameters of the delivery vehicle include the rated load of the delivery vehicle and the driving speed of the delivery vehicle;

[0071] The customer point parameters within the radiation range of each storage network include: the number and location of customer points with distribution needs within the radiation range of the storage network, the cargo demand of the customer points, the travel time between each node in the distribution transportation network, the number of time windows of the customer points, and the start and end time of each time window.

[0072] The preferred scheme of the logistics distribution allocation method under the warehouse and distribution integration model: the logistics distribution allocation scheme includes the number of delivery vehicles required by each storage outlet, the customer points that each delivery vehicle needs to deliver, the delivery time window of each customer point, the time when the automatic loader starts loading the delivery vehicle at the storage outlet, and the delivery route of each delivery vehicle.

[0073] The present invention also proposes a logistics distribution system under an integrated warehousing and distribution mode, including an information collection unit for collecting parameters of all warehousing outlets, distribution vehicle parameters, and customer point parameters within the radiation range of each warehousing outlet, the signal output end of the information collection unit is connected to a processing unit, and the processing unit performs logistics distribution according to the above-mentioned logistics distribution method under the integrated warehousing and distribution mode.

[0074] The beneficial effects of the present invention are as follows: the present invention comprehensively considers the efficiency of loading operations at storage outlets, multiple time window selection, transportation costs, etc., and combines the service timeliness requirements, customer point requirements, etc., and finally obtains a logistics distribution allocation plan, including the number of distribution vehicles required by each storage outlet, the customer points that each distribution vehicle needs to deliver, the delivery time window of each customer point, the time when the automatic loader starts loading operations for the distribution vehicle at the storage outlet, and the distribution path of each distribution vehicle, etc. The present invention realizes the optimized scheduling of logistics distribution under the warehousing integrated distribution model, improves the distribution efficiency, and saves the distribution cost; at the same time, since the present invention does not require that the storage outlet to which the transport vehicle returns must be the starting storage outlet, but adopts an open path in which the storage outlet to which the transport vehicle returns can be any storage outlet, the flexibility, efficiency, and economy of logistics distribution are further improved.

[0075] Additional aspects and advantages of the present invention will be given in part in the following description and in part will be obvious from the following description, or will be learned through practice of the present invention. BRIEF DESCRIPTION OF THE DRAWINGS

[0076] The above and / or additional aspects and advantages of the present invention will become apparent and easily understood from the description of the embodiments in conjunction with the following drawings, in which:

[0077] Figure 1 It is a schematic diagram of the distribution network path. DETAILED DESCRIPTION

[0078] Embodiments of the present invention are described in detail below, examples of which are shown in the accompanying drawings, wherein the same or similar reference numerals throughout represent the same or similar elements or elements having the same or similar functions. The embodiments described below with reference to the accompanying drawings are exemplary and are only used to explain the present invention, and cannot be understood as limiting the present invention.

[0079] In the description of the present invention, unless otherwise specified and limited, it should be noted that the terms "installed", "connected" and "connected" should be understood in a broad sense. For example, it can be a mechanical connection or an electrical connection, or it can be the internal connection between two components. It can be a direct connection or an indirect connection through an intermediate medium. For ordinary technicians in this field, the specific meanings of the above terms can be understood according to the specific circumstances.

[0080] The present invention provides an embodiment of a logistics distribution allocation method under a warehouse and distribution integration mode.

[0081] Here I will first introduce the logistics distribution under the integrated warehousing and distribution model. After accepting the customer's order, the goods at the storage outlets are loaded onto the delivery vehicle through an automatic loader, and then delivered to the customer points corresponding to each goods. Finally, all the goods are accurately delivered to each customer point to complete the delivery.

[0082] How to make distribution more efficient and cost-effective requires a comprehensive analysis. The specific steps are as follows:

[0083] In this embodiment, the transportation network of logistics distribution under the warehouse-distribution integration model includes two types of nodes: storage outlets and several customer points with distribution needs within the radiation range of storage outlets. The locations of all nodes are known. Storage outlets are the starting / ending points of distribution vehicles. Distribution vehicles can return from any storage outlet, that is, the vehicle path is semi-open. Storage outlets can directly accept orders from customer points and organize vehicles for distribution. Storage outlets have sufficient cargo volume.

[0084] Each storage outlet has a sufficient number of delivery vehicles of the same type, and their rated load, driving speed, maximum working time, etc. are all known.

[0085] The operating efficiency of the loading process in different storage outlets is different, that is, the operating speed of the automatic loaders is different, and the operating speeds are all known.

[0086] The cargo demand of customer points is known and cannot be divided. Each customer point can only be served by one delivery vehicle and can only be served once.

[0087] All customer points are subject to service time window restrictions. Each customer point has multiple time windows. For each customer point, its service time windows do not overlap with each other. The delivery vehicle can only choose one time window to serve the same customer point.

[0088] The delivery vehicle's service to the customer point must start after the corresponding time window opens and be completed before the time window closes, that is, the delivery vehicle cannot arrive at the customer point during the non-time window period.

[0089] Therefore, it is necessary to obtain the parameters of all storage outlets, the parameters of the distribution vehicles owned by each storage outlet, and the parameters of customer points within the coverage of each storage outlet.

[0090] Specifically, the warehousing network parameters include but are not limited to the number and locations of warehousing network points, the time windows for opening services of each warehousing network point, and the loading operation speed of each warehousing network point; the parameters of the delivery vehicle include but are not limited to the rated load of the delivery vehicle and the driving speed of the delivery vehicle; the customer point parameters within the radiation range of each warehousing network point include but are not limited to the number and locations of customer points with delivery needs within the radiation range of the warehousing network point, the cargo demand of the customer points, the travel time between each node in the distribution transportation network, the number of time windows of the customer points and the start time and end time of each time window.

[0091] Construct a logistics distribution objective function with the goal of minimizing distribution costs.

[0092] The logistics distribution objective function includes the driving cost of the distribution vehicles and the loading operation cost of the automatic loaders at the storage outlets.

[0093] Specifically, the logistics distribution objective function is: Where V is the set of storage outlets and customer points, V = V D ∪V C , V D V is a collection of storage outlets. C is a set of customer points with distribution needs within the radiation range of the warehousing network, H is the set of distribution vehicles owned by the warehousing network; i, j refer to different nodes in the set V, t ij is the travel time between nodes in the distribution transportation network, i,j∈V, and t ij =t ji , x ijh is a 0-1 variable. It takes 1 when the delivery vehicle h∈H passes through the path (i,j)(i,j∈V) and i≠j, otherwise it takes 0. i For customer point i∈V C The quantity of goods demanded, v m is the storage network m∈V D Loading speed, wc mi is a 0-1 variable. When the storage outlet m∈V D Service customer point i∈V C It takes 1 when the value is true; otherwise, it takes 0.

[0094] Establish constraints as follows:

[0095] The number of times the delivery vehicles enter and exit the storage outlets is the same: Refers to any h, x mjh It is a 0-1 variable, which takes the value 1 when the delivery vehicle h∈H passes through the path (m, j), otherwise it takes the value 0;

[0096] Can only be used once for any vehicle:

[0097] For any customer point, it can only be served by one delivery vehicle once: x jih is a 0-1 variable, which takes the value 1 when the delivery vehicle h∈H passes through the path (j,i), otherwise it takes the value 0;

[0098] The delivery vehicles enter and exit the customer point the same number of times, and each delivery vehicle serves the same customer point once:

[0099]

[0100] The goods ordered by the customer are delivered by a certain storage outlet:

[0101] Determine the variable z mhi The value of indicates that the customer's goods are delivered by a delivery vehicle from a storage outlet:

[0102]

[0103] If the delivery vehicle under the storage outlet is used, the delivery vehicle must depart from the storage outlet:

[0104]

[0105] Delivery vehicle load limit:

[0106] Time continuity of delivery vehicles from storage outlets to customer points:

[0107] t mj From the storage network m∈V D The travel time to customer point j; at jh is the time when the delivery vehicle h∈H arrives at the customer point j;

[0108]

[0109] Continuity of delivery vehicle loading and departure times:

[0110]

[0111] The basic time constraints for delivery vehicles to start loading at storage outlets and return to storage outlets at mh is the time when the delivery vehicle h∈H arrives at the storage outlet m;

[0112] Continuity of arrival time of delivery vehicles between customer points:

[0113]

[0114]

[0115] The basic time constraint for the delivery vehicle to arrive at the customer point, and the auxiliary constraint for the value of the unused delivery vehicles: [e jt ,l jt ] is the t∈Tth time window of customer point j, e jt and l jt They represent the start time and end time of the t-th time window of customer point j respectively;

[0116] Determine the variable saiht The value of indicates that the delivery vehicle arrives at the customer point after a certain time window opens:

[0117]

[0118]

[0119] Determine the variable ca iht The value of indicates that the delivery vehicle arrives before a certain time window of the customer point closes:

[0120]

[0121]

[0122] Determine the variable sc iht The value of indicates the time window in which the delivery vehicle arrives at the customer point:

[0123]

[0124]

[0125] Time constraints for delivery vehicles to arrive at customer points:

[0126] The time limit for the delivery vehicle to leave the customer point, that is, the delivery vehicle needs to complete the service and leave the customer point within the time window in which it serves the customer point:

[0127]

[0128]

[0129] Auxiliary constraints for decision variables indicate that the nodes themselves have no direct communication:

[0130] Auxiliary constraints for time-continuous variables:

[0131] Among them, z mhi is a 0-1 variable. When customer point i∈V C The demand is generated by the distribution vehicle h∈H from the storage outlet m∈V D Take 1 when delivering; otherwise take 0;

[0132] M is a positive integer;

[0133] dt mh For the distribution vehicle h∈H from the storage network m∈V D Departure time, dt mh ≥0;

[0134] atih is the time when the delivery vehicle h∈H arrives at the customer point or storage point i∈V, at ih ≥0;

[0135] lt mh For the automatic loading machine at the storage point m∈V D is the time when the delivery vehicle h∈H starts loading, lt mh ≥0;

[0136] w t is the number of time windows of the customer point, and the set T = {1,2,..w t};

[0137] s i is the delivery vehicle at customer point i∈V C service time;

[0138] [e it ,l it ] is the customer point i∈V C The t∈Tth time window, e it and l it They represent the start time and end time of the t-th time window of customer point i respectively;

[0139] [ET m ,LT m ] Open service time windows for storage outlets;

[0140] s iht is a 0-1 variable. When the delivery vehicle h∈H arrives at the customer point i∈V after the t∈Tth time window opens C , that is, when at ih ≥e it When it is 1, it is 0 otherwise.

[0141] ca iht is a 0-1 variable. When the delivery vehicle h∈H arrives at the customer point i∈V before the t∈Tth time window closes C , that is, when at ih ≤l it -s i When it is 1, it is 0 otherwise.

[0142] sc iht is a 0-1 variable. iht =ca iht =1, that is, when the delivery vehicle h∈H arrives at the customer point i∈V within the t∈Tth time window C It takes 1 when the value is true; otherwise, it takes 0.

[0143] Q is the rated load of the delivery vehicle.

[0144] Construct a target model for logistics distribution.

[0145] Then, based on the information of the orders to be delivered, the model is solved to obtain the optimal solution and the objective function value; the obtained optimal solution and objective function value are applied to the logistics distribution under the warehouse and distribution integration mode to obtain the logistics distribution allocation plan. In this embodiment, a mixed integer programming model is constructed, and the establishment of the logistics distribution system is realized by programming with CPLEX12.9 software. After obtaining various parameter information, the optimal solution and the objective function value can be directly obtained. The logistics distribution allocation plan includes the number of delivery vehicles required by each storage outlet, the customer points that each delivery vehicle needs to deliver, the delivery time window of each customer point (the most reasonable time window for delivery to each customer), the time when the automatic loader starts loading the delivery vehicle at the storage outlet, and the delivery path of each delivery vehicle. As shown in Table 1 and Figure 1 The logistics distribution allocation party of a case is shown.

[0146] Table 1

[0147]

[0148]

[0149] The present application also proposes a logistics distribution system under the warehousing and distribution integration mode, which includes an information collection unit for collecting parameters of all warehousing outlets, distribution vehicle parameters and customer point parameters within the radiation range of each warehousing outlet. The signal output end of the information collection unit is connected to a processing unit, and the processing unit performs logistics distribution according to the logistics distribution method under the warehousing and distribution integration mode mentioned above.

[0150] In the description of this specification, the description with reference to the terms "one embodiment", "some embodiments", "examples", "specific examples", or "some examples" means that the specific features, structures, materials or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the present invention. In this specification, the schematic representation of the above terms does not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described may be combined in any one or more embodiments or examples in a suitable manner.

[0151] Although the embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that various changes, modifications, substitutions and variations may be made to the embodiments without departing from the principles and spirit of the present invention, and that the scope of the present invention is defined by the claims and their equivalents.

Claims

1. A logistics distribution method under the warehouse and distribution integration mode, characterized in that: The following steps are involved: Obtain the parameters of all storage outlets, the parameters of the distribution vehicles owned by each storage outlet, and the parameters of customer points within the coverage area of ​​each storage outlet; Construct a logistics distribution objective function with the goal of minimizing distribution costs; The logistics distribution objective function includes the driving cost of the distribution vehicle and the loading operation cost of the automatic loading machine at the storage outlet; The logistics distribution objective function is: Where V is the set of storage outlets and customer points, V = V D ∪V C , V D V is a collection of storage outlets. C is a set of customer points with distribution needs within the radiation range of the storage outlets, H is the set of distribution vehicles owned by the storage outlets; the storage outlets and customer points are taken as nodes, t ij is the travel time between nodes in the distribution transportation network, i,j refers to different nodes in the set V, i,j∈V, set t ij =t ji , x ijh is a 0-1 variable. It takes 1 when the delivery vehicle h∈H passes through the path (i,j)(i,j∈V) and i≠j, otherwise it takes 0. i For customer point i∈V C The quantity of goods demanded, v m is the storage network m∈V D Loading speed, wc mi is a 0-1 variable. When the storage outlet m∈V D Service customer point i∈V C When it is 1, otherwise it is 0; Establish constraints; The constraints include: The number of times the delivery vehicles enter and exit the storage outlets is the same: Refers to any h, x mjh It is a 0-1 variable, which takes the value 1 when the delivery vehicle h∈H passes through the path (m, j), otherwise it takes the value 0; Can only be used once for any vehicle: For any customer point, it can only be served by one delivery vehicle once: x jih is a 0-1 variable, which takes the value 1 when the delivery vehicle h∈H passes through the path (j,i), otherwise it takes the value 0; The delivery vehicles enter and exit the customer point the same number of times, and each delivery vehicle serves the same customer point once: The goods ordered by the customer are delivered by a certain storage outlet: Determine the variable z mhi The value of indicates that the customer's goods are delivered by a delivery vehicle from a storage outlet: If the delivery vehicle under the storage outlet is used, the delivery vehicle must depart from the storage outlet: Delivery vehicle load limit: Time continuity of delivery vehicles from storage outlets to customer points: t mj From the storage network m∈V D The travel time to customer point j; at jh is the time when the delivery vehicle h∈H arrives at the customer point j; Continuity of delivery vehicle loading and departure times: The basic time constraints for delivery vehicles to start loading at storage outlets and return to storage outlets at mh is the time when the delivery vehicle h∈H arrives at the storage outlet m; Continuity of arrival time of delivery vehicles between customer points: The basic time constraint for the delivery vehicle to arrive at the customer point, and the auxiliary constraint for the value of the unused delivery vehicles: [e jt ,l jt ] is the t∈Tth time window of customer point j, e jt and l jt They represent the start time and end time of the t-th time window of customer point j respectively; Determine the variable sa iht The value of indicates that the delivery vehicle arrives at the customer point after a certain time window opens: Determine the variable ca iht The value of indicates that the delivery vehicle arrives before a certain time window of the customer point closes: Determine the variable sc iht The value of indicates the time window in which the delivery vehicle arrives at the customer point: Time constraints for delivery vehicles to arrive at customer points: The time limit for the delivery vehicle to leave the customer point, that is, the delivery vehicle needs to complete the service and leave the customer point within the time window in which it serves the customer point: Auxiliary constraints for decision variables indicate that the nodes themselves have no direct communication: Auxiliary constraints for time-continuous variables: Among them, z mhi is a 0-1 variable. When customer point i∈V C The demand is generated by the distribution vehicle h∈H from the storage outlet m∈V D Take 1 when delivering; otherwise take 0; M is a positive integer; dt mh For the distribution vehicle h∈H from the storage network m∈V D Departure time, dt mh ≥0; at ih is the time when the delivery vehicle h∈H arrives at the customer point or storage point i∈V, at ih ≥0; lt mh For the automatic loading machine at the storage point m∈V D is the time when the delivery vehicle h∈H starts loading, lt mh ≥0; w t is the number of time windows of the customer point, and the set T = {1,2,..w t }; s i is the delivery vehicle at customer point i∈V C service time; [e it ,l it ] is the customer point i∈V C The t∈Tth time window, e it and l it They represent the start time and end time of the t-th time window of customer point i respectively; [ET m ,LT m ] Open service time windows for storage outlets; s iht is a 0-1 variable. When the delivery vehicle h∈H arrives at the customer point i∈V after the t∈Tth time window opens C , that is, when at ih ≥e it When it is 1, otherwise it is 0; ca iht is a 0-1 variable. When the delivery vehicle h∈H arrives at the customer point i∈V before the t∈Tth time window closes C , that is, when at ih ≤l it -s i When it is 1, otherwise it is 0; sc iht is a 0-1 variable. iht =ca iht =1, that is, when the delivery vehicle h∈H arrives at the customer point i∈V within the t∈Tth time window C When it is 1, otherwise it is 0; Q is the rated load of the delivery vehicle; Construct a target model for logistics distribution; Based on the order information to be delivered, solving the model to obtain the optimal solution and the objective function value; The obtained optimal solution and objective function value are applied to the logistics distribution under the warehouse and distribution integration mode to obtain the logistics distribution allocation plan.

2. The logistics distribution method under the warehouse and distribution integration mode according to claim 1 is characterized in that: The storage network parameters include the number and location of storage network points, the time window for each storage network point to open services, and the loading operation speed of each storage network point; The parameters of the delivery vehicle include the rated load of the delivery vehicle and the driving speed of the delivery vehicle; The customer point parameters within the radiation range of each storage network include: the number and location of customer points with distribution needs within the radiation range of the storage network, the cargo demand of the customer points, the travel time between each node in the distribution transportation network, the number of time windows of the customer points, and the start and end time of each time window.

3. The logistics distribution method under the warehouse-distribution integration mode according to claim 1 is characterized in that: The logistics distribution allocation plan includes the number of delivery vehicles required by each storage outlet, the customer points that each delivery vehicle needs to deliver, the delivery time window of each customer point, the time when the automatic loader starts loading the delivery vehicle at the storage outlet, and the delivery route of each delivery vehicle.

4. A logistics distribution system under the warehouse and distribution integration mode, characterized in that: It includes an information collection unit that collects parameters of all storage outlets, distribution vehicle parameters and customer point parameters within the radiation range of each storage outlet. The signal output end of the information collection unit is connected to a processing unit. The processing unit performs logistics distribution according to the logistics distribution method under the warehouse and distribution integration mode described in any one of claims 1-3.

Citation Information

Patent Citations

  • Multi-agent automatic decision-making method for processing newly-added express pickup demand

    CN107704980A

  • Logistics distribution path planning method based on variable neighborhood parallel annealing algorithm

    CN111882099A

  • Transportation robot for truck loading

    CN112499298A

  • Multi-target vehicle distribution path determination method and system based on improved genetic algorithm

    CN112836892A