Logistics order delivery method, system, storage medium and electronic equipment
By determining the vehicle distribution method and dynamic waves in logistics distribution, the problems of high transportation costs and different transportation durations are solved, the full load rate and distribution efficiency of logistics orders are improved, and the logistics distribution process is optimized.
Patent Information
- Application Number
- CN201910203890.9
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2019-03-18
- Publication Date
- 2024-11-26
- Estimated Expiration
- 2039-03-18
AI Technical Summary
The existing logistics distribution methods lead to high transportation costs and different transportation time of logistics packages, which affects user experience and has the problem of wasting vehicle space.
By obtaining all logistics orders for the current wave, determine the vehicle allocation method and transportation path from the pickup warehouse to the sorting center, orders from different pickup warehouses share vehicles, and use genetic algorithms to weight historical order data, timeliness and cost-effectiveness based on historical order data, timeliness and cost-effectiveness Parameters determine dynamic wave times, optimize vehicle paths and distribution methods from sorting centers to destination sites.
It improves the vehicle full load rate during logistics order delivery, reduces transportation costs and timely costs, optimizes the order delivery process, and reduces transportation delays.
Smart Images

Figure CN111724086B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of logistics distribution, and in particular to a logistics order distribution method, system, storage medium and electronic equipment. Background Art
[0002] With the rapid development of Internet technology, the volume of Internet-based commodity transactions is increasing, which greatly facilitates people's shopping while also putting higher demands on the logistics and distribution of Internet platforms.
[0003] At present, when distributing items, Internet platforms usually arrange transportation vehicles for each receiving warehouse separately, and transport the items from the receiving warehouse to the sorting center in multiple waves within a day according to the different time when the user places an order. After being sorted by the sorting center, they are transported to the destination site, so that the items can reach the user as soon as possible. In the actual transportation process, the transportation vehicles leaving each receiving warehouse include both fully loaded vehicles and underloaded vehicles, and the cost of fully loaded vehicles and underloaded vehicles traveling the same distance is the same. It can be seen that the existing transportation methods not only increase the transportation cost, but also cause space waste of transportation vehicles. In addition, due to the different transmission distances and transmission methods from the receiving warehouse to the sorting center, and the different distances from the sorting center to the destination site, the transportation time of logistics packages in transit will vary, resulting in a large difference in the time to arrive at the destination site, and even some destination sites at longer distances will have a longer delay in receiving items, which not only increases the timeliness cost of transportation, but also seriously affects the user experience. Summary of the invention
[0004] The technical problem to be solved by the embodiments of the present invention is to overcome the defect of high vehicle transportation cost in logistics order delivery in the prior art, and to provide a logistics order delivery method, system, storage medium and electronic device.
[0005] The embodiment of the present invention solves the above technical problems through the following technical solutions:
[0006] An embodiment of the present invention provides a method for delivering a logistics order, the method comprising the following steps:
[0007] Obtain all logistics orders of the current wave, each of which includes a corresponding receiving warehouse, sorting center and destination station;
[0008] Determine, for each logistics order, an allocation method and a transportation route of a vehicle delivered from the corresponding receiving warehouse to the corresponding sorting center, so that the logistics orders delivered to different receiving warehouses of the same sorting center share vehicles;
[0009] All the logistics orders of the current wave are transported to the corresponding destination sites according to the vehicle allocation method and the transportation route.
[0010] Preferably, the delivery method further comprises the following steps:
[0011] Determine the dynamic wave from the receiving warehouse to the destination site according to historical order data, preset time weighted parameters and preset cost weighted parameters;
[0012] The current dynamic wave is set as the current wave.
[0013] Preferably, the step of determining the dynamic wave from the receiving warehouse to the destination site according to historical order data, preset time weighted parameters and preset cost weighted parameters includes:
[0014] Calculate the original cost based on the historical order data;
[0015] The dynamic wave is determined by using a genetic algorithm according to the original cost, the preset time weighted parameter and the preset cost weighted parameter.
[0016] Preferably, the dynamic wave includes n delivery sub-waves, where n is a natural number greater than 1; the historical order data includes m destination sites, where m is a natural number greater than 1;
[0017] The step of using a genetic algorithm to determine the dynamic wave according to the original cost, the preset time weighted parameter and the preset cost weighted parameter comprises:
[0018] The m destination sites are divided into n categories, each of which corresponds to a delivery sub-wave. The delivery time of each delivery sub-wave is different. Each destination site is randomly divided into different delivery sub-waves, and a total of n m Site division combination;
[0019] Calculating the actual cost of each site division combination according to the preset time weighted parameter and the preset cost weighted parameter;
[0020] The final delivery sub-wave is determined for each destination site according to the actual cost, the original cost and a preset standard, and the final delivery sub-wave corresponds to the final site division combination of the destination site.
[0021] Preferably, the step of determining, for each logistics order, the allocation method and transportation path of the vehicle for delivery from the corresponding receiving warehouse to the corresponding sorting center comprises:
[0022] Determine the number of complete vehicles required for the multiple receiving warehouses to be delivered to the same sorting center; the complete vehicle refers to a vehicle with a full load rate of 100%;
[0023] The number of motor vehicles and the corresponding transportation routes are determined according to the remaining orders from each receiving warehouse to the same sorting center.
[0024] Preferably, the whole vehicle includes a first type of vehicle and a second type of vehicle;
[0025] Determine the number of vehicles according to the first objective function:
[0026] min W 1 ·x+W 2 y;
[0027] The constraints of the first objective function include:
[0028] B 1 ·x+B 2 y ≥ num 订单量 ;
[0029] x·y=0, x and y are not 0 at the same time;
[0030] Where x is the number of vehicles of the first type, y is the number of vehicles of the second type, and W 1 is the single transportation cost of the first type of vehicle, W 2 is the single transportation cost of the second type of vehicle, B 1 is the maximum number of orders that can be loaded on the first type of vehicle at one time, B 2 is the maximum number of orders that can be loaded at one time on the second type of vehicle, num 订单量 The number of orders from one receiving warehouse to one sorting center.
[0031] Preferably, each of the cargo receiving warehouses corresponds to a virtual parking lot, and the virtual parking lot includes the motor vehicle;
[0032] The number of motor vehicles and the corresponding transportation routes are determined using the second objective function:
[0033]
[0034] The constraints of the second objective function include:
[0035]
[0036]
[0037]
[0038]
[0039]
[0040]
[0041]
[0042]
[0043]
[0044] The decision variables of the second objective function include:
[0045]
[0046]
[0047]
[0048] Among them, α is the preset time cost weighting parameter; β is the preset vehicle cost weighting parameter;
[0049] A is the set of final delivery destinations of the motor vehicle k;
[0050] C is the collection of receiving warehouses;
[0051] D is the set of virtual parking lots d;
[0052] q i The number of orders delivered from receiving warehouse i to a sorting center;
[0053] cc k represents the transportation cost of the motor vehicle k;
[0054] tc ijk is the time efficiency cost when the motor vehicle k is used as a shared vehicle between receiving warehouse i and receiving warehouse j;
[0055] K={k 1 ,…,k L} is the set of motor vehicles k, L represents the total number of motor vehicles k;
[0056] Q k is the maximum load capacity of the motor vehicle k;
[0057] K d is the set of motor vehicles k assigned to the virtual parking lot d;
[0058] d ijis the distance between receiving warehouse i and receiving warehouse j;
[0059] L k is the maximum drivable distance of the motor vehicle k;
[0060] cc 0 is the delivery cost of the whole vehicle.
[0061] The embodiment of the present invention further provides a logistics order delivery system, the delivery system comprising:
[0062] The logistics order acquisition module is used to acquire all logistics orders of the current wave, each of which includes a corresponding receiving warehouse, sorting center and destination station;
[0063] A delivery method determination module, used to determine, for each logistics order, an allocation method and a transportation path of a vehicle delivered from the corresponding receiving warehouse to the corresponding sorting center, so that the logistics orders delivered to different receiving warehouses of the same sorting center share vehicles;
[0064] A distribution execution module is used to transport all the logistics orders of the current wave to the corresponding destination sites according to the vehicle allocation method and the transportation route.
[0065] Preferably, the distribution system further comprises:
[0066] A dynamic wave determination module, used to determine the dynamic wave from the receiving warehouse to the destination site according to historical order data, preset time weighted parameters and preset cost weighted parameters;
[0067] The adjustment module is used to set the current dynamic wave as the current wave.
[0068] Preferably, the dynamic wave determination module includes:
[0069] An original cost calculation submodule, used to calculate the original cost based on the historical order data;
[0070] The iterative calculation submodule is used to determine the dynamic wave according to the original cost, the preset time weighted parameter and the preset cost weighted parameter by using a genetic algorithm.
[0071] Preferably, the dynamic wave includes n delivery sub-waves, where n is a natural number greater than 1; the historical order data includes m destination sites, where m is a natural number greater than 1;
[0072] The iterative calculation submodule includes:
[0073] The site division unit is used to divide the m destination sites into n categories, each of which corresponds to a delivery sub-wave, and the delivery time of each delivery sub-wave is different. Each destination site is randomly divided into different delivery sub-waves, and a total of n m Site division combination;
[0074] An actual cost calculation unit, used to calculate the actual cost of each of the site division combinations according to the preset time weighted parameter and the preset cost weighted parameter;
[0075] The distribution sub-wave determining unit is used to determine the final distribution sub-wave for each destination site according to the actual cost, the original cost and a preset standard, and the final distribution sub-wave corresponds to the final site division combination of the destination site.
[0076] Preferably, the delivery method determination module includes:
[0077] The vehicle planning submodule is used to determine the number of vehicles required for the multiple receiving warehouses to be delivered to the same sorting center; the vehicle refers to a vehicle with a full load rate of 100%;
[0078] The motor vehicle planning submodule is used to determine the number of motor vehicles and the corresponding transportation routes according to the remaining orders from each receiving warehouse to the same sorting center.
[0079] Preferably, the whole vehicle includes a first type of vehicle and a second type of vehicle;
[0080] The vehicle planning submodule is used to determine the number of the vehicles according to the first objective function:
[0081] Determine the number of vehicles according to the first objective function:
[0082] min W 1 ·x+W 2 y;
[0083] The constraints of the first objective function include:
[0084] B 1 ·x+B 2 y ≥ num 订单量 ;
[0085] x·y=0, x and y are not 0 at the same time;
[0086] Where x is the number of vehicles of the first type, y is the number of vehicles of the second type, and W 1 is the single transportation cost of the first type of vehicle, W 2is the single transportation cost of the second type of vehicle, B 1 is the maximum number of orders that can be loaded on the first type of vehicle at one time, B 2 is the maximum number of orders that can be loaded at one time on the second type of vehicle, num 订单量 The number of orders from one receiving warehouse to one sorting center.
[0087] Preferably, each of the cargo receiving warehouses corresponds to a virtual parking lot, and the virtual parking lot includes the motor vehicle;
[0088] The motor vehicle planning submodule is used to determine the number of motor vehicles and the corresponding transportation routes using a second objective function:
[0089]
[0090] The constraints of the second objective function include:
[0091]
[0092]
[0093]
[0094]
[0095]
[0096]
[0097]
[0098]
[0099]
[0100] The decision variables of the second objective function include:
[0101]
[0102]
[0103]
[0104] Among them, α is the preset time cost weighting parameter; β is the preset vehicle cost weighting parameter;
[0105] A is the set of final delivery destinations of the motor vehicle k;
[0106] C is the collection of receiving warehouses;
[0107] D is the set of virtual parking lots d;
[0108] q i The number of orders delivered from receiving warehouse i to a sorting center;
[0109] cc k represents the transportation cost of the motor vehicle k;
[0110] tc ijk is the time efficiency cost when the motor vehicle k is used as a shared vehicle between receiving warehouse i and receiving warehouse j;
[0111] K={k 1 ,…,k L} is the set of motor vehicles k, L represents the total number of motor vehicles k;
[0112] Q k is the maximum load capacity of the motor vehicle k;
[0113] K d is the set of motor vehicles k assigned to the virtual parking lot d;
[0114] d ij is the distance between receiving warehouse i and receiving warehouse j;
[0115] L k is the maximum drivable distance of the motor vehicle k;
[0116] cc 0 is the delivery cost of the whole vehicle.
[0117] An embodiment of the present invention also provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the steps of the logistics order delivery method when executing the computer program.
[0118] An embodiment of the present invention further provides a computer-readable storage medium having a computer program stored thereon, and when the computer program is executed by a processor, the steps of the method for delivering logistics orders are implemented.
[0119] The positive progressive effect of the embodiments of the present invention is that the logistics order distribution method, system, storage medium and electronic device provided by the embodiments of the present invention obtain all the logistics orders of the current wave, and then determine the allocation method and transportation path of the vehicles for distribution from the corresponding receiving warehouse to the corresponding sorting center for each logistics order, so that the logistics orders delivered to different receiving warehouses of the same sorting center share vehicles; then, the logistics orders are transported to the destination site according to the determined vehicle allocation method and transportation path, thereby improving the full load rate of the transportation vehicles when distributing logistics orders and effectively reducing transportation costs.
[0120] Furthermore, by delivering logistics orders through dynamic wave delivery methods, the order delivery process is optimized and the time cost of order delivery is effectively reduced. BRIEF DESCRIPTION OF THE DRAWINGS
[0121] Figure 1 This is a flow chart of the method for delivering logistics orders according to Example 1 of the present invention.
[0122] Figure 2 This is a flowchart of a non-limiting specific implementation of Example 1 of the present invention.
[0123] Figure 3 It is a flow chart of the method for delivering logistics orders according to Embodiment 2 of the present invention.
[0124] Figure 4 It is a flow chart of a non-limiting specific implementation of Example 2 of the present invention.
[0125] Figure 5 yes Figure 4 A flowchart of a specific implementation of step S42 in FIG.
[0126] Figure 6 It is a structural block diagram of the logistics order distribution system of Example 3 of the present invention.
[0127] Figure 7 It is a structural block diagram of the distribution system of the logistics order of the fourth embodiment of the present invention.
[0128] Figure 8 It is a schematic diagram of the structure of an electronic device for implementing a method for delivering logistics orders according to Embodiment 5 of the present invention. DETAILED DESCRIPTION
[0129] The present invention is further described below by way of examples, but the present invention is not limited to the scope of the examples.
[0130] Example 1
[0131] This embodiment provides a method for delivering a logistics order, such as Figure 1 As shown, the delivery method may include the following steps:
[0132] Step S1: Obtain all logistics orders of the current wave, each of which includes a corresponding receiving warehouse, sorting center and destination station;
[0133] Step S2: determining, for each logistics order, an allocation method and a transportation route of a vehicle delivered from the corresponding receiving warehouse to the corresponding sorting center, so that the logistics orders delivered to different receiving warehouses of the same sorting center share a vehicle;
[0134] Step S3: transporting all the logistics orders of the current wave to the corresponding destination sites according to the allocation method of the vehicles and the transportation route.
[0135] In this embodiment, the shared vehicle means that several receiving warehouses can share the same delivery vehicle to transport logistics orders to the same sorting center. For example: there are multiple receiving warehouses (H1, H2, H3...) that store logistics orders that need to be transported to the same sorting center (Z). After a transport vehicle loads an order in the receiving warehouse H1, if the vehicle is not fully loaded, then the transport vehicle can drive to the receiving warehouse H2 to continue loading the order. If the vehicle is fully loaded after the loading is completed in the receiving warehouse H2, the vehicle can go to the sorting center Z. If it is still not fully loaded at the receiving warehouse H2, the vehicle can continue to go to the receiving warehouse H3 to load the order. If the vehicle is fully loaded after the loading is completed in the receiving warehouse H3, the vehicle can go to the sorting center Z. If it is still not fully loaded at the receiving warehouse H3, the transport vehicle can continue to go to other receiving warehouses to load orders until the vehicle is fully loaded. In this way, the full load rate of the transport vehicle can be improved, thereby reducing the overall transportation cost.
[0136] Furthermore, if Figure 2 As shown, step S2 may include the following steps:
[0137] Step S21: Determine the number of complete vehicles required for multiple receiving warehouses to be delivered to the same sorting center; the complete vehicle refers to a vehicle with a full load rate of 100%;
[0138] Step S22: Determine the number of motor vehicles and corresponding transportation routes according to the remaining orders from each receiving warehouse to the same sorting center.
[0139] Specifically, the entire vehicle may include a first type of vehicle and a second type of vehicle.
[0140] The number of the vehicles can be determined according to the first objective function:
[0141] min W 1 ·x+W2 y;
[0142] The constraints of the first objective function include:
[0143] B 1 ·x+B 2 y ≥ num 订单量 ;
[0144] x·y=0, x and y are not 0 at the same time;
[0145] Where x is the number of vehicles of the first type, y is the number of vehicles of the second type, and W 1 is the single transportation cost of the first type of vehicle, W 2 is the single transportation cost of the second type of vehicle, B 1 is the maximum number of orders that can be loaded on the first type of vehicle at one time, B 2 is the maximum number of orders that can be loaded at one time on the second type of vehicle, num 订单量 The number of orders from one receiving warehouse to one sorting center.
[0146] The specific models, lengths and the maximum number of orders that can be loaded at a single time of the first type of vehicle and the second type of vehicle can be adaptively selected according to specific needs and application scenarios, and the embodiment of the present invention does not limit this.
[0147] How to allocate vehicles is described in detail below using a specific non-limiting implementation method.
[0148] In this embodiment, the first type of vehicle can be a 4.2-meter-long truck with a maximum load of 570 pieces and a single transportation cost of 150 yuan / time. The second type of vehicle can be a 9.6-meter-long truck with a maximum load of 3,000 pieces and a single transportation cost of 500 yuan / time.
[0149] Next, the number of the vehicles can be determined according to the first objective function:
[0150] min 150·x+500·y;
[0151] The constraints of the first objective function include:
[0152] 570·x+3000·y>=num 订单量 ;
[0153] x·y=0;
[0154] Wherein, x is the number of vehicles of the first type, y is the number of vehicles of the second type,
[0155] num订单量 The number of orders from one receiving warehouse to one sorting center.
[0156] It should be noted that each receiving warehouse can only choose one type of vehicle for transportation in one wave, and cannot choose both a 4.2-meter-long truck and a 9.6-meter-long truck for full-vehicle transportation at the same time.
[0157] In this embodiment, the vehicle type with lower vehicle cost (i.e., vehicle transportation cost) can be selected for transportation first, and its full load rate must meet the preset requirements. The decision variables x and y are the number of selected vehicles, both of which are real numbers. In addition, when loading goods at the receiving warehouse, the truck must load goods according to the destination station. After the order of one destination station is loaded, the order of the next destination station will be loaded.
[0158] After calculating using the first objective function, a real number with decimal places may be obtained. Next, the decimal part can be taken out separately. If the decimal part is recorded as De, when De≥0.5, it is considered that the full load rate meets the preset requirements and the vehicle is dispatched directly. When De<0.5, the remaining part of the order volume is retained. For example: If the calculated number of vehicles x is 4.47, it can be considered that there are 4 4.2-meter-long trucks with a full load rate of 100%. These 4 4.2-meter-long trucks can be dispatched immediately according to the determined transportation route. At this point, the preliminary processing of orders from a receiving warehouse to a sorting center is completed, and the orders of each receiving warehouse are processed in this way in turn, and finally the preliminary arrangement of order delivery from each receiving warehouse to the same sorting center is completed.
[0159] Next, the remaining orders that cannot be loaded by the four vehicles mentioned above need to be processed. The decimal part 0.47 refers to the loading rate of the fifth vehicle. In the case of remaining orders, motor vehicles can be shared among multiple receiving warehouses to transport the remaining orders of multiple receiving warehouses using motor vehicles.
[0160] Specifically, each of the cargo receiving warehouses may correspond to a virtual parking lot, and the virtual parking lot includes the motor vehicles.
[0161] The number of motor vehicles and the corresponding transportation routes can be determined using a second objective function:
[0162]
[0163] The constraints of the second objective function include:
[0164]
[0165]
[0166]
[0167]
[0168]
[0169]
[0170]
[0171]
[0172]
[0173] The decision variables of the second objective function include:
[0174]
[0175]
[0176]
[0177] Among them, α is the preset time cost weighting parameter; β is the preset vehicle cost weighting parameter;
[0178] A is the set of final delivery destinations of the motor vehicle k;
[0179] C is the collection of receiving warehouses;
[0180] D is the set of virtual parking lots d;
[0181] q i The number of orders delivered from receiving warehouse i to a sorting center;
[0182] cc k represents the transportation cost of the motor vehicle k;
[0183] tc ijk is the time efficiency cost when the motor vehicle k is used as a shared vehicle between receiving warehouse i and receiving warehouse j;
[0184] Specifically, tc ijk It may include the time when the motor vehicle k arrives from one receiving warehouse i to another receiving warehouse j, the time when the order is packed, the delivery time of the receiving warehouse, the sorting and delivery time of the sorting center, and the time when the vehicle is sealed and unsealed from the sorting center to the destination station. Preferably, tc ijk It is the average value of each time point or time period mentioned above.
[0185] K={k 1 ,…,k L} is the set of motor vehicles k, L represents the total number of motor vehicles k;
[0186] Q k is the maximum load capacity of the motor vehicle k;
[0187] K d is the set of motor vehicles k assigned to the virtual parking lot d;
[0188] d ij is the distance between receiving warehouse i and receiving warehouse j;
[0189] L k is the maximum drivable distance of the motor vehicle k;
[0190] cc 0 is the delivery cost of the whole vehicle.
[0191] In this embodiment, the principle of graph theory can be used to represent the vehicle path planning problem from the receiving warehouse to the sorting center as a complete graph G=(V,E), where V={0,1,…,N,N+1,…,N+M} represents a node set, which is composed of three subsets: the final destination of vehicle distribution A={0}, the customer set (i.e., the receiving warehouse) C={1,…,N}, and the parking lot set D={N+1,…,N+M} (the parking lot set represents M virtual parking lots. In order to realize that vehicles between receiving warehouses can be shared, each receiving warehouse can be extended to a virtual parking lot, i.e., M=N, and the cost from the receiving warehouse to its corresponding virtual parking lot can be regarded as 0). It can also be represented as V=A∪C∪D, where E={(i,j)|i,j∈V,i≠j} represents an arc set, i.e., the path of the vehicle between any two receiving warehouses. At this time, each receiving warehouse can be represented as a node in the complete graph G=(V,E).
[0192] The constraints of the second objective function are described in detail below:
[0193] It means that the number of vehicles participating in the delivery task of each virtual parking lot cannot exceed the total number of vehicles owned by the virtual parking lot.
[0194] It means that each car belongs to only one virtual parking lot.
[0195] It means that the delivery vehicle cannot drive directly from one virtual parking lot to another virtual parking lot, that is, the delivery vehicle can only drive between any two different virtual parking lots.
[0196] It means that all delivery vehicles can only depart from the virtual parking lot, and all delivery vehicles departing at the same time will arrive at the sorting center.
[0197] This means that each receiving depot is served only once and only one vehicle is used to provide the service.
[0198] It means that the order quantity of the receiving warehouse in any route cannot exceed the maximum loading capacity of the delivery vehicle.
[0199] This means that the distance of any route cannot exceed the maximum drivable distance of the corresponding delivery vehicle.
[0200] It means that the delivery vehicle cannot drive directly from a sorting center to another sorting center.
[0201] It means that after the delivery vehicle arrives at the sorting center, it will no longer return to other receiving warehouses for service.
[0202] When shared vehicles are used to deliver the remaining orders, the required number of shared vehicles and route planning can be solved using existing solving tools (for example, Jsprit (a route planning tool), OR-Tools (another route planning tool)), and the remaining orders are delivered according to the solved results.
[0203] The technical solution provided in this embodiment can deliver logistics orders by combining whole vehicle delivery and shared motor vehicle delivery, thereby increasing the full load rate of transportation vehicles when delivering logistics orders and effectively reducing overall transportation costs.
[0204] Example 2
[0205] This embodiment provides a method for delivering a logistics order, such as Figure 3-5 As shown, the distribution method in this embodiment is a further improvement based on Example 1.
[0206] Specifically, please refer to Figure 3 , the distribution method may further include the following steps:
[0207] Step S4: determining the dynamic wave from the receiving warehouse to the destination site according to historical order data, preset time weighted parameters and preset cost weighted parameters;
[0208] Step S5: setting the current dynamic wave as the current wave.
[0209] Specifically, the dynamic wave shown can be regarded as transformed from an original wave, or it can be said that the original wave can be divided into multiple sub-waves with different delivery times. For example, the original wave B is shipped out of the warehouse at 11:00 and arrives at the destination site at 13:00. Wave B can be divided into three sub-waves B1, B2, and B3, where sub-wave B1 is shipped out of the warehouse at 11:00 and arrives at the destination site at 13:00, sub-wave B2 is shipped out of the warehouse at 11:30 and arrives at the destination site at 13:00, and sub-wave B3 is shipped out of the warehouse at 11:20 and arrives at the destination site at 13:00. For each of the aforementioned sub-waves, the order delivery process of step S1-step S3 will be executed separately, that is, when sub-wave B1 needs to be executed, sub-wave B1 is used as the current wave; next, when sub-wave B2 needs to be executed, sub-wave B2 is used as the current wave; next, when sub-wave B3 needs to be executed, sub-wave B3 is used as the current wave. In other words, each sub-wave is executed separately and sequentially.
[0210] For further information, please refer to Figure 4 , the step S4 may include the following steps:
[0211] Step S41: Calculating the original cost according to the historical order data;
[0212] Step S42: Determine the dynamic wave according to the original cost, the preset time weighted parameter and the preset cost weighted parameter by using a genetic algorithm.
[0213] The original cost refers to the cost of delivering logistics orders without using a combination of full truck delivery and shared motor vehicle delivery. The original cost includes the original vehicle cost and the original time cost.
[0214] Those skilled in the art may select the collection interval of the historical order data according to the requirements of specific calculation accuracy. For example, all historical order data from 6 months before the current time may be collected.
[0215] It should be noted that the computational principles of the genetic algorithm such as replication, crossover, and mutation are all computational methods in the genetic algorithm in the prior art. After providing basic parameters to the genetic algorithm model in this embodiment, the genetic algorithm model can output a final site division combination that meets business requirements after a preset number of iterative calculations.
[0216] Furthermore, the dynamic wave may include n delivery sub-waves, where n is a natural number greater than 1; and the historical order data includes m destination sites, where m is a natural number greater than 1.
[0217] In this case, please refer to Figure 5, the step S42 may specifically include the following steps:
[0218] Step S421: Divide the m destination sites into n categories, each of which corresponds to a delivery sub-wave, and each delivery sub-wave has a different delivery time. Randomly divide each destination site into different delivery sub-waves, and obtain n m Site division combination;
[0219] Step S422: Calculate the actual cost of each site division combination according to the preset time weighted parameter and the preset cost weighted parameter;
[0220] Step S423: determining the final delivery sub-wave for each destination site according to the actual cost, the original cost and a preset standard, wherein the final delivery sub-wave corresponds to the final site division combination of the destination site.
[0221] In a non-limiting specific embodiment, the following basic parameters can be set for the execution of the genetic algorithm:
[0222] Maximum number of genetic iterations of the algorithm = 500;
[0223] Population size = 300;
[0224] Crossover probability = 0.8;
[0225] Mutation probability = 0.1;
[0226] Wave classification quantity = 2 (this embodiment takes two small delivery waves as an example);
[0227] Standard value aging = 18000s (seconds) (used when calculating aging cost);
[0228] Standard value cost = 35,000 yuan (used when calculating vehicle cost);
[0229] 4.2m (meter) truck loading = 570 orders;
[0230] 4.2m single transport cost = 150 yuan / time;
[0231] 9.6m truck loading = 3000 orders;
[0232] 9.6m single transport cost = 500 yuan / time;
[0233] (α, β)={(0,1), (0.1,0.9),...(0.9,0.1), (1,0)};
[0234] α is the preset time-efficiency cost weighting parameter; β is the preset vehicle cost weighting parameter.
[0235] In this embodiment, the value of n is 2, that is, all sites can be pre-divided into two categories, and the two categories are represented by 0 or 1, respectively, where 0 can represent a category with a longer transportation time from the receiving warehouse to the destination site, and 1 can represent a category with a shorter transportation time from the receiving warehouse to the destination site. When delivering logistics orders, the category with a longer average transportation time can be given priority. The initial classification of the destination site can be shown in Table 1.
[0236] Table 1
[0237] Site 1 Site 2 Site 3 … Site m 1 0 1 … 0
[0238] After initializing marking for all sites, an initialized site division combination can be obtained. Next, the vehicle cost and time efficiency cost corresponding to the initialized site division combination can be calculated using the second objective function.
[0239] If the selected combination of the preset time-efficiency cost weighting parameter and the preset vehicle cost weighting parameter is (0, 1), the actual cost of the initialized site division combination can be calculated according to the preset time-efficiency cost weighting parameter and the preset vehicle cost weighting parameter respectively.
[0240] Next, adjust the site division combination method of the m destination sites, and calculate the remaining 2 under the premise that the combination of the preset time cost weighting parameter and the preset vehicle cost weighting parameter is (0,1). m -1 site division combination, compare the actual costs of all site division combinations, and take the site division combination with the lowest actual cost as the optimal site division combination under the combination of preset time cost weighting parameter and preset vehicle cost weighting parameter (0,1). Each site included in the optimal site division combination can be regarded as the optimal individual under the combination of preset time cost weighting parameter and preset vehicle cost weighting parameter (0,1).
[0241] In the same way, the optimal site division combinations corresponding to the weighted parameter combinations of (0.1, 0.9), (0.2, 0.8), (0.3, 0.7) ... (0.9, 0.1), (1, 0), etc. are calculated respectively. Each optimal site division combination corresponds to an actual cost, which includes the actual vehicle cost and the actual time cost.
[0242] The actual vehicle cost corresponding to each optimal site division combination is compared with the original vehicle cost calculated above, the actual time efficiency cost is compared with the original time efficiency cost calculated above, and the final delivery sub-wave is determined for each destination site in combination with preset standards.
[0243] Specifically, the preset standard is related to business needs, for example, the preset standard may be "giving priority to the lowest actual vehicle cost", "giving priority to the lowest actual timeliness cost", or "giving priority to the lowest sum of actual vehicle cost and actual timeliness cost", etc.
[0244] In specific applications, if the optimal site division combination W1 corresponding to the weighted parameter combination (0.9, 0.1) has the lowest actual time efficiency cost, but the actual vehicle cost is not the lowest; the optimal site division combination W2 corresponding to the weighted parameter combination (0.6, 0.4) does not have the lowest actual time efficiency cost, but the sum of the actual vehicle cost and the actual time efficiency cost is the lowest. If the selected preset standard is "giving priority to the lowest actual time efficiency cost", the weighted parameter combination (0.9, 0.1) can be finally selected according to business needs. Correspondingly, the optimal site division combination W1 corresponding to the weighted parameter combination (0.9, 0.1) is the final site division combination output by the genetic algorithm, which corresponds to the final dynamic wave of the m destination sites, that is, the distribution sub-wave of each of the m destination sites.
[0245] Next, the logistics orders can be distributed according to the final station division combination. First, the first objective function is used to determine the number of complete vehicles from each receiving warehouse to the same sorting center. For the remaining orders of each receiving warehouse, the second objective function can be used to determine the number of motor vehicles that can be shared and the transportation path. The specific planning method of the complete vehicles and motor vehicles can refer to the specific description in Example 1, which will not be repeated here.
[0246] Although this embodiment uses the dynamic wave including two delivery sub-waves as an example to illustrate the solution process of the optimal site division combination, this embodiment does not limit the specific number of delivery sub-waves. Technical personnel in this field can adaptively set the number of delivery sub-waves according to specific business needs. For example, the number of delivery sub-waves can be 3, 4, 5 or 7, etc.
[0247] The technical solution provided in this embodiment can deliver logistics orders through a dynamic wave delivery method, optimize the order delivery process, and effectively reduce the time cost of order delivery.
[0248] Example 3
[0249] This embodiment provides a logistics order distribution system, such as Figure 6As shown, the distribution system 1 may include: a logistics order acquisition module 11, used to acquire all logistics orders of the current wave, each of the logistics orders including a corresponding receiving warehouse, a sorting center and a destination site; a distribution method determination module 12, used to determine the allocation method and transportation path of the vehicle for distribution from the corresponding receiving warehouse to the corresponding sorting center for each logistics order, so that the logistics orders delivered to different receiving warehouses of the same sorting center share vehicles; a distribution execution module 13, used to transport all the logistics orders of the current wave to the corresponding destination site according to the allocation method of the vehicle and the transportation path.
[0250] Furthermore, the distribution method determination module 12 may include: a vehicle planning submodule 121, which is used to determine the number of vehicles required for multiple receiving warehouses to reach the same sorting center; the vehicle refers to a vehicle with a full load rate of 100%; a motor vehicle planning submodule 122, which is used to determine the number of motor vehicles and the corresponding transportation routes based on the remaining orders from each receiving warehouse to the same sorting center.
[0251] Furthermore, the entire vehicle may include a first type of vehicle and a second type of vehicle.
[0252] The vehicle planning submodule 121 is used to determine the number of vehicles according to the first objective function:
[0253] min W 1 ·x+W 2 y;
[0254] The constraints of the first objective function include:
[0255] B 1 ·x+B 2 y ≥ num 订单量 ;
[0256] x·y=0, x and y are not 0 at the same time;
[0257] Where x is the number of vehicles of the first type, y is the number of vehicles of the second type, and W 1 is the single transportation cost of the first type of vehicle, W 2 is the single transportation cost of the second type of vehicle, B 1 is the maximum number of orders that can be loaded on the first type of vehicle at one time, B 2 is the maximum number of orders that can be loaded at one time on the second type of vehicle, num 订单量 The number of orders from one receiving warehouse to one sorting center.
[0258] Furthermore, each of the cargo receiving warehouses corresponds to a virtual parking lot, and the virtual parking lot includes the motor vehicles.
[0259] The motor vehicle planning submodule 122 is used to determine the number of motor vehicles and the corresponding transportation routes using a second objective function:
[0260]
[0261] The constraints of the second objective function include:
[0262]
[0263]
[0264]
[0265]
[0266]
[0267]
[0268]
[0269]
[0270]
[0271] The decision variables of the second objective function include:
[0272]
[0273]
[0274]
[0275] Among them, α is the preset time cost weighting parameter; β is the preset vehicle cost weighting parameter;
[0276] A is the set of final delivery destinations of the motor vehicle k;
[0277] C is the collection of receiving warehouses;
[0278] D is the set of virtual parking lots d;
[0279] q i The number of orders delivered from receiving warehouse i to a sorting center;
[0280] cc k represents the transportation cost of the motor vehicle k;
[0281] tc ijk is the time efficiency cost when the motor vehicle k is used as a shared vehicle between receiving warehouse i and receiving warehouse j;
[0282] Specifically, tc ijk It may include the time when the motor vehicle k arrives from one receiving warehouse i to another receiving warehouse j, the time when the order is packed, the delivery time of the receiving warehouse, the sorting and delivery time of the sorting center, and the time when the vehicle is sealed and unsealed from the sorting center to the destination station. Preferably, tc ijk It is the average value of each time point or time period mentioned above.
[0283] K={k 1 ,…,k L} is the set of motor vehicles k, L represents the total number of motor vehicles k;
[0284] Q k is the maximum load capacity of the motor vehicle k;
[0285] K d is the set of motor vehicles k assigned to the virtual parking lot d;
[0286] d ij is the distance between receiving warehouse i and receiving warehouse j;
[0287] L k is the maximum drivable distance of the motor vehicle k;
[0288] cc 0 is the delivery cost of the whole vehicle.
[0289] For more details about the working principle and working mode of the distribution system in Example 3, please refer to the relevant description about the distribution method in Example 1, which will not be repeated here.
[0290] The distribution system provided in this embodiment can deliver logistics orders by combining whole vehicle distribution and shared motor vehicle distribution during operation, thereby increasing the full load rate of transportation vehicles during logistics order distribution and effectively reducing overall transportation costs.
[0291] Example 4
[0292] This embodiment provides a logistics order distribution system, such as Figure 7 As shown, the distribution system in this embodiment is a further improvement based on embodiment 3.
[0293] Furthermore, the distribution system 1 may also include: a dynamic wave determination module 14, which is used to determine the dynamic wave from the receiving warehouse to the destination site based on historical order data, preset time weighted parameters and preset cost weighted parameters; an adjustment module 15, which is used to set the current dynamic wave as the current wave.
[0294] Furthermore, the dynamic wave determination module 14 may include: an original cost calculation submodule 141, used to calculate the original cost based on the historical order data; an iterative calculation submodule 142, used to determine the dynamic wave based on the original cost, the preset time weighted parameter and the preset cost weighted parameter using a genetic algorithm.
[0295] Furthermore, the dynamic wave may include n delivery sub-waves, where n is a natural number greater than 1; and the historical order data includes m destination sites, where m is a natural number greater than 1.
[0296] The iterative calculation submodule 142 may include: a site division unit 1421, which is used to divide the m destination sites into n categories, each of which corresponds to a delivery sub-wave, and the delivery time of each delivery sub-wave is different. Each destination site is randomly divided into different delivery sub-waves, and a total of n m site division combinations; an actual cost calculation unit 1422, used to calculate the actual cost of each of the site division combinations according to the preset time weighted parameter and the preset cost weighted parameter; a distribution sub-wave determination unit 1423, used to determine the final distribution sub-wave for each destination site according to the actual cost, the original cost and the preset standard, and the final distribution sub-wave corresponds to the final site division combination of the destination site.
[0297] For more details about the working principle and working mode of the distribution system in Example 4, please refer to the relevant description of the distribution method in Example 2, which will not be repeated here.
[0298] The distribution system provided in this embodiment can distribute logistics orders through a dynamic wave distribution method during operation, thereby optimizing the order distribution process and effectively reducing the time cost of order distribution.
[0299] Example 5
[0300] Figure 8 A schematic diagram of the structure of an electronic device provided in Example 5 of the present invention. The electronic device may include a memory, a processor, and a computer program stored in the memory and executable on the processor, and the processor implements the steps of the logistics order delivery method in Example 1 or 2 when executing the computer program.
[0301] Understandably, Figure 8 The electronic device shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present invention.
[0302] like Figure 8 As shown, the electronic device 2 may be in the form of a general-purpose computing device, for example, it may be a server device. The components of the electronic device 2 may include, but are not limited to, the at least one processor 3, the at least one memory 4, and a bus 5 connecting different system components (including the memory 4 and the processor 3).
[0303] The bus 5 may include a data bus, an address bus and a control bus.
[0304] The memory 4 may include a volatile memory, such as a random access memory (RAM) 41 and / or a cache memory 42 , and may further include a read-only memory (ROM) 43 .
[0305] The memory 4 may also include a program tool 45 (or utility) having a set (at least one) of program modules 44, such program modules 44 including but not limited to: an operating system, one or more application programs, other program modules and program data, each of which or some combination may include the implementation of a network environment.
[0306] The processor 3 executes various functional applications and data processing by running the computer program stored in the memory 4, such as the steps of the logistics order delivery method in Embodiment 1 or 2 of the present invention.
[0307] The electronic device 2 may also communicate with one or more external devices 6 (e.g., keyboard, pointing device, etc.). Such communication may be performed via an input / output (I / O) interface 7. Furthermore, the model generating electronic device 2 may also communicate with one or more networks (e.g., a local area network LAN, a wide area network WAN, and / or a public network) via a network adapter 8.
[0308] like Figure 8 As shown, the network adapter 8 can communicate with other modules of the model-generated electronic device 2 through the bus 5. It should be understood by those skilled in the art that, although not shown in the figure, other hardware and / or software modules can be used in conjunction with the model-generated electronic device 2, including but not limited to: microcode, device drivers, redundant processors, external disk drive arrays, RAID (disk array) systems, tape drives, and data backup storage systems, etc.
[0309] It should be noted that, although several units / modules or sub-units / modules of the electronic device are mentioned in the above detailed description, this division is merely exemplary and not mandatory. In fact, according to an embodiment of the present invention, the features and functions of two or more units / modules described above may be embodied in one unit / module. Conversely, the features and functions of one unit / module described above may be further divided into multiple units / modules for embodiment.
[0310] Example 6
[0311] This embodiment provides a computer-readable storage medium on which a computer program is stored. When the program is executed by a processor, the steps of the method for delivering logistics orders in Embodiment 1 or 2 are implemented.
[0312] Among them, more specific forms in which computer-readable storage media can be used include but are not limited to: portable disks, hard disks, random access memories, read-only memories, erasable programmable read-only memories, optical storage devices, magnetic storage devices, or any suitable combination of the above.
[0313] In a possible implementation, the present invention can also be implemented in the form of a program product, which includes program code. When the program product runs on a terminal device, the program code is used to enable the terminal device to execute the steps of the logistics order delivery method in Example 1 or 2.
[0314] Among them, the program code for executing the present invention can be written in any combination of one or more programming languages, and the program code can be executed completely on the user device, partially on the user device, as an independent software package, partially on the user device and partially on a remote device, or completely on the remote device.
[0315] Although the specific embodiments of the present invention are described above, it should be understood by those skilled in the art that this is only for illustration and the protection scope of the present invention is defined by the appended claims. Those skilled in the art may make various changes or modifications to these embodiments without departing from the principles and essence of the present invention, but these changes and modifications all fall within the protection scope of the present invention.
Claims
1. A method for delivering a logistics order, characterized in that: The delivery method comprises the following steps: Obtain all logistics orders of the current wave, each of which includes a corresponding receiving warehouse, sorting center and destination station; Determine, for each logistics order, an allocation method and a transportation route of a vehicle delivered from the corresponding receiving warehouse to the corresponding sorting center, so that the logistics orders delivered to different receiving warehouses of the same sorting center share vehicles; Transporting all the logistics orders of the current wave to the corresponding destination sites according to the vehicle allocation method and the transportation route; The delivery method further comprises the following steps: Determining the dynamic wave from the receiving warehouse to the destination site according to historical order data, preset time weighted parameters, and preset cost weighted parameters includes: Calculate the original cost based on the historical order data; Determining the dynamic wave according to the original cost, the preset time weighted parameter and the preset cost weighted parameter by using a genetic algorithm; The dynamic wave includes n delivery sub-waves, where n is a natural number greater than 1; the historical order data includes m destination sites, where m is a natural number greater than 1; The step of using a genetic algorithm to determine the dynamic wave according to the original cost, the preset time weighted parameter and the preset cost weighted parameter comprises: The m destination sites are divided into n categories, each of which corresponds to a delivery sub-wave. The delivery time of each delivery sub-wave is different. Each destination site is randomly divided into different delivery sub-waves, and a total of n m Site division combination; Calculating the actual cost of each site division combination according to the preset time weighted parameter and the preset cost weighted parameter; Determine the final delivery sub-wave for each destination site according to the actual cost, the original cost and a preset standard, the final delivery sub-wave corresponding to the final site division combination of the destination site; The current dynamic wave is set as the current wave.
2. The method for delivering logistics orders according to claim 1, characterized in that: The step of determining the allocation method and transportation path of the vehicle for delivery from the corresponding receiving warehouse to the corresponding sorting center for each logistics order includes: Determine the number of complete vehicles required for the multiple receiving warehouses to be delivered to the same sorting center; the complete vehicle refers to a vehicle with a full load rate of 100%; The number of motor vehicles and the corresponding transportation routes are determined according to the remaining orders from each receiving warehouse to the same sorting center.
3. The method for delivering logistics orders according to claim 2, characterized in that: The whole vehicle includes a first type of vehicle and a second type of vehicle; Determine the number of vehicles according to the first objective function: min W1·x+W2·y; The constraints of the first objective function are include: B1·x+B2·y≥num 订单量 ; x·y=0; Where x is the number of vehicles of the first type, y is the number of vehicles of the second type, W1 is the single transportation cost of the first type of vehicle, W2 is the single transportation cost of the second type of vehicle, B1 is the maximum number of orders that can be loaded on the first type of vehicle at one time, B2 is the maximum number of orders that can be loaded on the second type of vehicle at one time, num 订单量 The number of orders from one receiving warehouse to one sorting center.
4. The method for delivering logistics orders according to claim 2, characterized in that: Each of the cargo receiving warehouses corresponds to a virtual parking lot, and the virtual parking lot includes the motor vehicles; The number of motor vehicles and the corresponding transportation routes are determined using the second objective function: The constraints of the second objective function include: The decision variables of the second objective function include: Among them, α is the preset time cost weighting parameter; β is the preset vehicle cost weighting parameter; A is the set of final delivery destinations of the motor vehicle k; C is the collection of receiving warehouses; D is the set of virtual parking lots d; q i The number of orders delivered from receiving warehouse i to a sorting center; cc k represents the transportation cost of the motor vehicle k; tc ijk is the time efficiency cost when the motor vehicle k is used as a shared vehicle between receiving warehouse i and receiving warehouse j; K={k1,…,k L } is the set of motor vehicles k, L represents the total number of motor vehicles k; Q k is the maximum load capacity of the motor vehicle k; K d is the set of motor vehicles k assigned to the virtual parking lot d; d ij is the distance between receiving warehouse i and receiving warehouse j; L k is the maximum drivable distance of the motor vehicle k; cc0 is the delivery cost of the whole vehicle.
5. A logistics order distribution system, characterized in that: The delivery system comprises: The logistics order acquisition module is used to acquire all logistics orders of the current wave, each of which includes a corresponding receiving warehouse, sorting center and destination station; A delivery method determination module, used to determine, for each logistics order, an allocation method and a transportation path of a vehicle delivered from the corresponding receiving warehouse to the corresponding sorting center, so that the logistics orders delivered to different receiving warehouses of the same sorting center share vehicles; A distribution execution module, used to transport all the logistics orders of the current wave to the corresponding destination sites according to the allocation method of the vehicles and the transportation route; The delivery system also includes: A dynamic wave determination module, used to determine the dynamic wave from the receiving warehouse to the destination site according to historical order data, preset time weighted parameters and preset cost weighted parameters; An adjustment module, used for setting the current dynamic wave as the current wave; The dynamic wave determination module includes: An original cost calculation submodule, used to calculate the original cost based on the historical order data; An iterative calculation submodule, used for determining the dynamic wave according to the original cost, the preset time weighted parameter and the preset cost weighted parameter by using a genetic algorithm; The iterative calculation submodule includes: The site division unit is used to divide the m destination sites into n categories, each of which corresponds to a delivery sub-wave, and the delivery time of each delivery sub-wave is different. Each destination site is randomly divided into different delivery sub-waves, and a total of n m Site division combination; An actual cost calculation unit, used to calculate the actual cost of each of the site division combinations according to the preset time weighted parameter and the preset cost weighted parameter; The distribution sub-wave determining unit is used to determine the final distribution sub-wave for each destination site according to the actual cost, the original cost and a preset standard, and the final distribution sub-wave corresponds to the final site division combination of the destination site.
6. The logistics order distribution system according to claim 5, characterized in that: The delivery method determination module includes: The vehicle planning submodule is used to determine the number of vehicles required for the multiple receiving warehouses to be delivered to the same sorting center; the vehicle refers to a vehicle with a full load rate of 100%; The motor vehicle planning submodule is used to determine the number of motor vehicles and the corresponding transportation routes according to the remaining orders from each receiving warehouse to the same sorting center.
7. The logistics order distribution system according to claim 6, characterized in that: The whole vehicle includes a first type of vehicle and a second type of vehicle; The vehicle planning submodule is used to determine the number of the vehicles according to the first objective function: min W1·x+W2·y; The constraints of the first objective function are include: B1·x+B2·y≥num 订单量 ; x·y=0; Where x is the number of vehicles of the first type, y is the number of vehicles of the second type, W1 is the single transportation cost of the first type of vehicle, w2 is the single transportation cost of the second type of vehicle, B1 is the maximum number of orders that can be loaded on the first type of vehicle at one time, B2 is the maximum number of orders that can be loaded on the second type of vehicle at one time, num 订单量 The number of orders from one receiving warehouse to one sorting center.
8. The logistics order delivery system according to claim 6, characterized in that: Each of the cargo receiving warehouses corresponds to a virtual parking lot, and the virtual parking lot includes the motor vehicles; The motor vehicle planning submodule is used to determine the number of motor vehicles and the corresponding transportation routes using a second objective function: The constraints of the second objective function include: The decision variables of the second objective function include: Wherein, α is a preset time-efficiency cost weighting parameter; β is a preset vehicle cost weighting parameter; A is the set of final delivery destinations of the motor vehicle k; C is the collection of receiving warehouses; D is the set of virtual parking lots d; q i The number of orders delivered from receiving warehouse i to a sorting center; cc k represents the transportation cost of the motor vehicle k; tc ijk is the time efficiency cost when the motor vehicle k is used as a shared vehicle between receiving warehouse i and receiving warehouse j; K={k1,…,k L } is the set of motor vehicles k, L represents the total number of motor vehicles k; Q k is the maximum load capacity of the motor vehicle k; K d is the set of motor vehicles k assigned to the virtual parking lot d; d ij is the distance between receiving warehouse i and receiving warehouse j; L k is the maximum drivable distance of the motor vehicle k; cc0 is the delivery cost of the whole vehicle.
9. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the computer program, the steps of the logistics order delivery method described in any one of claims 1-4 are implemented.
10. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the logistics order delivery method described in any one of claims 1-4 are implemented.
