Logistics path planning method, device, computer equipment and storage medium

By using genetic algorithms and non-dominant sorting technologies in logistics path planning, combining cargo information and transportation constraints, optimizing logistics paths, the problem of not considering the status and attributes of vehicles in the existing methods is solved, and the accuracy of path planning is improved and adaptability.

CN111985730BActive Publication Date: 2024-11-29SOUTHERN POWER GRID DIGITAL GRID RESEARCH INSTITUTE CO LTD
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202010934076.7
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2020-09-08
Publication Date
2024-11-29
Estimated Expiration
2040-09-08

AI Technical Summary

Technical Problem

The existing logistics path planning methods fail to fully consider the status and cargo properties of the vehicle, resulting in the resulting optimal path contrary to the actual working conditions and is of low accuracy.

Method used

The genetic algorithm is used to update the initial logistics path planning scheme with preset updates, obtain multiple logistics path planning schemes, and determine the path with the greatest fitness based on the cargo information as the target path, consider the cargo constraints and transportation information, and pass the intersection Optimize paths for methods such as mutation processing and non-dominant sorting.

Benefits of technology

It improves the accuracy of logistics path planning, makes the optimal path more in line with the actual working conditions, and enhances the adaptability and effectiveness of the path.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN111985730B_ABST
    Figure CN111985730B_ABST
Patent Text Reader

Abstract

The present application relates to a logistics path planning method, device, computer equipment and storage medium. The method includes: obtaining an initial logistics path planning scheme and cargo information of the cargo to be transported; based on the cargo information, using a genetic algorithm to update the initial logistics path planning scheme for a preset update round to obtain multiple logistics path planning schemes; determining the logistics transportation information corresponding to each logistics path planning scheme, and determining the fitness of each logistics path planning scheme based on the logistics transportation information; using the logistics path planning scheme with the largest fitness as the target logistics path planning scheme, and transporting the cargo to be transported based on the target logistics path planning scheme. The use of this method can make the optimal path fit the actual working situation, thereby improving the accuracy of the obtained logistics path planning method.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the technical field of path planning, and in particular to a logistics path planning method, apparatus, computer equipment and storage medium. Background Art

[0002] With the development of artificial intelligence technology, artificial intelligence technology has been widely used in various fields. For example, for the optimization problem in operations research, it can be solved by adopting heuristic algorithms. Among them, path planning problem, as a kind of optimization problem, has attracted more and more attention.

[0003] At present, the logistics path planning problem can be solved by genetic algorithms. The biological knowledge such as coding, reproduction, crossover, mutation and iteration can be used to deal with the path planning problem, and then the optimal path can be screened out. However, the current logistics path planning methods do not take the status and properties of the cargo on the vehicle into consideration. This will cause the optimal path to deviate from the actual working situation and have low accuracy. Summary of the invention

[0004] Based on this, it is necessary to provide a logistics path planning method, device, computer equipment and storage medium to address the above technical problems.

[0005] A logistics path planning method, the method comprising:

[0006] Obtaining the initial logistics route planning plan and cargo information of the cargo to be transported;

[0007] Based on the cargo information, the initial logistics path planning scheme is updated by using a genetic algorithm for a preset update round to obtain multiple logistics path planning schemes;

[0008] Determine the logistics transportation information corresponding to each logistics path planning scheme, and determine the fitness of each logistics path planning scheme based on the logistics transportation information;

[0009] The logistics path planning scheme with the greatest fitness is used as the target logistics path planning scheme, and the goods to be transported are transported based on the target logistics path planning scheme.

[0010] In one embodiment, the update round includes at least two times; based on the cargo information, the initial logistics path planning scheme is updated for a preset update round using a genetic algorithm, including: obtaining preset cargo constraints; based on the cargo information and the cargo constraints, determining multiple first logistics path planning schemes from the initial logistics path planning scheme; selecting a preset number of second logistics path planning schemes from the multiple first logistics path planning schemes; the second logistics path planning scheme is the preset number of first logistics path planning schemes with the largest fitness; cross-mutation processing is performed on the second logistics path planning scheme to obtain multiple third logistics path planning schemes; obtaining the current update round, if the current update round is less than the preset update round, then using the second logistics path planning scheme and the third logistics path planning scheme as the initial logistics path planning scheme for the next update round.

[0011] In one of the embodiments, based on the cargo information and the cargo constraints, multiple first logistics path planning schemes are determined from the initial logistics path planning schemes, including: based on the cargo information, the initial logistics path planning schemes that meet the cargo constraints are deleted, and the retained initial logistics path planning schemes are used as the first logistics path planning schemes.

[0012] In one of the embodiments, based on the cargo information, deleting the initial logistics path planning schemes that satisfy the cargo constraint conditions includes: determining the load factor of each transport vehicle under each initial logistics path planning scheme based on the cargo information, and deleting the initial logistics path planning schemes that satisfy the load factor being greater than a preset load factor threshold; determining the volume utilization rate of each transport vehicle under each initial logistics path planning scheme based on the cargo information, and deleting the initial logistics path planning schemes that satisfy the volume utilization rate being greater than a preset volume utilization threshold; determining the cargo placement position of the cargo to be transported in each transport vehicle under each initial logistics path planning scheme based on the cargo information, and deleting the initial logistics path planning schemes that satisfy the volume utilization rate being greater than a preset volume utilization threshold. The initial logistics path planning schemes in which the cargo placement position is such that heavy cargo is placed above light cargo are deleted; based on the cargo information, the cargo placement position order of each transport vehicle under each initial logistics path planning scheme and the order of delivery locations of the cargo to be transported by the transport vehicle are determined, and the initial logistics path planning schemes that satisfy the corresponding placement position order and delivery location order are deleted; and / or based on the cargo information, the relative position of the carriage of each transport vehicle and the cargo to be transported under each initial logistics path planning scheme are determined, and the initial logistics path planning schemes that satisfy the relative position that the cargo position of the cargo to be transported exceeds the carriage position of the carriage are deleted.

[0013] In one of the embodiments, the logistics transportation information includes logistics transportation time and logistics transportation distance; determining the fitness of each logistics path planning scheme based on the logistics transportation information includes: determining the logistics transportation time and logistics transportation distance corresponding to each logistics path planning scheme, and layering the each logistics path planning scheme according to multiple non-dominated levels according to the logistics transportation time and logistics transportation distance; taking the logistics path planning scheme with the greatest fitness as the target logistics path planning scheme includes: selecting the logistics path planning scheme with the greatest congestion from the logistics path planning schemes with the non-dominated level as the first level as the logistics path planning scheme with the greatest fitness.

[0014] In one of the embodiments, the selecting a preset number of second logistics path planning schemes from the multiple first logistics path planning schemes includes: determining the non-dominated level corresponding to each first logistics path planning scheme, and determining the congestion degree of each first logistics path planning scheme in the non-dominated level corresponding to the first logistics path planning scheme; performing ascending processing on the first logistics path planning schemes according to the number of levels of the non-dominated levels, and performing descending processing on the ascending first logistics path planning schemes according to the congestion degree in the non-dominated level corresponding to the first logistics path planning scheme, and selecting the first preset number of first logistics path planning schemes after the descending processing as the second logistics path planning scheme.

[0015] In one embodiment, determining the non-dominated hierarchy corresponding to each first logistics path planning scheme includes: determining the current first logistics path planning scheme, and the first logistics transportation time and the first logistics transportation distance corresponding to the current first logistics path planning scheme; traversing the first logistics path planning scheme, and determining multiple second logistics transportation times and multiple second logistics transportation distances corresponding to other first logistics path planning schemes; the other first logistics path planning schemes are any first logistics path planning schemes in the first logistics path planning scheme except the current first logistics path planning scheme; if the first logistics transportation time is less than the second logistics transportation time, and the first logistics transportation distance is less than the second logistics transportation distance, then determining that the non-dominated hierarchy of the current first logistics path planning scheme is less than the non-dominated hierarchy of the other first logistics path planning schemes; if the first logistics transportation time is less than the second logistics transportation time and the first logistics transportation distance is greater than the second logistics transportation distance, or, the first logistics transportation time is greater than the second logistics transportation time and the If the first logistics transportation distance is less than the second logistics transportation distance, it is determined that the non-dominated level of the current first logistics path planning scheme is the same as the non-dominated level of the other first logistics path planning schemes; the determination of the congestion degree of each first logistics path planning scheme in the non-dominated level corresponding to the first logistics path planning scheme includes: obtaining the first logistics path planning scheme with the smallest time difference with the first logistics transportation time as the first same-level logistics path planning scheme, and obtaining the first logistics path planning scheme with the smallest distance difference with the first logistics transportation distance as the second same-level logistics path planning scheme; obtaining the third logistics transportation time and the third logistics transportation distance corresponding to the first same-level logistics path planning scheme, and the fourth logistics transportation time and the fourth logistics transportation distance corresponding to the second same-level logistics path planning scheme; summing the absolute value of the difference between the third logistics transportation time and the fourth logistics transportation time, and the absolute value of the difference between the third logistics transportation distance and the fourth logistics transportation distance, as the congestion degree of the current first logistics path planning scheme.

[0016] A logistics path planning device, the device comprising:

[0017] A cargo information acquisition module is used to obtain the initial logistics path planning plan and cargo information of the cargo to be transported;

[0018] A logistics path updating module, used to update the initial logistics path planning scheme for a preset update round using a genetic algorithm based on the cargo information to obtain multiple logistics path planning schemes;

[0019] A fitness determination module, used to determine the logistics transportation information corresponding to each logistics path planning scheme, and determine the fitness of each logistics path planning scheme based on the logistics transportation information;

[0020] The target path determination module is used to take the logistics path planning scheme with the greatest fitness as the target logistics path planning scheme, and transport the goods to be transported based on the target logistics path planning scheme.

[0021] A computer device comprises a memory and a processor, wherein the memory stores a computer program, and the processor implements the steps of the above method when executing the computer program.

[0022] A computer-readable storage medium stores a computer program, which implements the steps of the above method when executed by a processor.

[0023] The above-mentioned logistics path planning method, device, computer equipment and storage medium obtain the initial logistics path planning scheme and the cargo information of the goods to be transported; based on the cargo information, the initial logistics path planning scheme is updated for a preset update round using a genetic algorithm to obtain multiple logistics path planning schemes; the logistics transportation information corresponding to each logistics path planning scheme is determined, and the fitness of each logistics path planning scheme is determined based on the logistics transportation information; the logistics path planning scheme with the largest fitness is used as the target logistics path planning scheme, and the goods to be transported are transported based on the target logistics path planning scheme. In the logistics path planning method provided in the present application, the initial logistics path planning scheme can be updated based on the cargo information, and the logistics path planning scheme with the largest fitness is used as the target logistics path planning scheme for cargo transportation. When the optimal path is obtained, the cargo information is taken into account, so that the optimal path can be made to fit the actual working situation, thereby improving the accuracy of the obtained logistics path planning method. BRIEF DESCRIPTION OF THE DRAWINGS

[0024] Figure 1 A schematic diagram of a flow chart of a logistics path planning method in one embodiment;

[0025] Figure 2 A schematic diagram of a process for updating an initial logistics path planning scheme based on cargo information using a genetic algorithm for a preset update round in one embodiment;

[0026] Figure 3 A schematic diagram of a process of selecting a preset number of second logistics path planning solutions from a plurality of first logistics path planning solutions in one embodiment;

[0027] Figure 4 A schematic diagram of a process for determining a non-dominated hierarchy corresponding to each first logistics path planning solution in an embodiment;

[0028] Figure 5 A schematic diagram of a process for determining the congestion degree of each first logistics path planning scheme in a non-dominated hierarchy corresponding to the first logistics path planning scheme in an embodiment;

[0029] Figure 6 A flowchart of a non-dominated sorting genetic algorithm with an elite strategy in an application example;

[0030] Figure 7 It is a flowchart of the fast non-dominated sorting algorithm in an application example;

[0031] Figure 8 A schematic diagram of congestion in an application example;

[0032] Fig. 9 It is a schematic diagram of the elite strategy in the application example;

[0033] Fig.10 It is a structural block diagram of a logistics path planning device in one embodiment;

[0034] Fig.11 FIG. 4 is a diagram showing the internal structure of a computer device in one embodiment. DETAILED DESCRIPTION

[0035] In order to make the purpose, technical solution and advantages of the present application more clearly understood, the present application is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application.

[0036] In one embodiment, Figure 1 As shown, a logistics path planning method is provided. This embodiment uses the method applied to a terminal as an example for illustration. It can be understood that the method can also be applied to a server, and can also be applied to a system including a terminal and a server, and is implemented through the interaction between the terminal and the server. In this embodiment, the method includes the following steps:

[0037] Step S101, the terminal obtains an initial logistics path planning solution and cargo information of the cargo to be transported.

[0038] Among them, the initial logistics path planning plan refers to the logistics path planning plan generated randomly and autonomously by the terminal. There can be multiple plans, and the cargo information of the goods to be transported refers to the cargo information of the goods transported during the logistics transportation process, such as the weight of the goods, the volume of the goods, and the order of cargo transportation, etc. The terminal can read the logistics information from the server that stores the logistics information to obtain the cargo information of the goods to be transported.

[0039] Step S102, based on the cargo information, the terminal uses a genetic algorithm to update the initial logistics path planning scheme for a preset update round to obtain multiple logistics path planning schemes.

[0040] Among them, the update round refers to the number of times the initial logistics path planning scheme is updated. Specifically, since the obtained logistics path planning scheme needs to be adapted to the cargo information, for example, if the weight of the cargo loaded on a logistics transport vehicle in the obtained logistics path planning scheme exceeds the total weight it can carry, then this logistics path planning scheme cannot be adapted to the cargo information. Therefore, the terminal needs to use the genetic algorithm to complete multiple iterations based on the cargo information. Each time the genetic algorithm is iterated, the initial logistics path planning scheme will be updated once until the update round reaches the preset update round. The preset update round can be set according to user needs, for example, it can be set to 80 times. In each update process, the terminal can obtain multiple logistics path planning schemes adapted to the cargo information.

[0041] Step S103, the terminal determines the logistics transportation information corresponding to each logistics path planning scheme, and determines the fitness of each logistics path planning scheme based on the logistics transportation information.

[0042] Among them, logistics transportation information refers to the transportation information of different logistics path planning schemes, such as the transportation path distance or transportation time of each logistics path planning scheme, etc., and fitness refers to the evaluation criteria used to judge the pros and cons of different logistics path planning schemes. When the fitness of one logistics path planning scheme is greater than the fitness of another logistics path planning scheme, then this logistics path planning scheme will be better than the other logistics path planning scheme. Specifically, after the terminal obtains multiple logistics path planning schemes, it can determine the logistics transportation information corresponding to each logistics path planning scheme, and obtain the fitness of each logistics path planning scheme based on the logistics transportation information.

[0043] In step S104, the terminal uses the logistics path planning scheme with the greatest fitness as the target logistics path planning scheme, and transports the goods to be transported based on the target logistics path planning scheme.

[0044] Among them, the target logistics path planning scheme refers to the logistics path planning scheme with the largest fitness obtained in step S103. The terminal can determine the maximum fitness and the logistics path planning scheme corresponding to the maximum fitness from the fitness of multiple logistics path planning schemes obtained, and use it as the target logistics path planning scheme, and transport the goods to be transported based on the target logistics path planning scheme.

[0045] In the above-mentioned logistics path planning method, an initial logistics path planning scheme and cargo information of the goods to be transported are obtained; based on the cargo information, the initial logistics path planning scheme is updated for a preset update round using a genetic algorithm to obtain multiple logistics path planning schemes; the logistics transportation information corresponding to each logistics path planning scheme is determined, and the fitness of each logistics path planning scheme is determined based on the logistics transportation information; the logistics path planning scheme with the greatest fitness is used as the target logistics path planning scheme, and the goods to be transported are transported based on the target logistics path planning scheme. In the logistics path planning method provided in the present application, the initial logistics path planning scheme can be updated based on the cargo information, and the logistics path planning scheme with the greatest fitness is used as the target logistics path planning scheme for cargo transportation. When the optimal path is obtained, the cargo information is taken into account, so that the optimal path can be made to fit the actual working situation, thereby improving the accuracy of the obtained logistics path planning method.

[0046] In one embodiment, Figure 2 As shown, step S102 may include:

[0047] Step S201, the terminal obtains preset cargo constraint conditions;

[0048] Step S202: Based on the cargo information and cargo constraints, the terminal determines a plurality of first logistics path planning schemes from the initial logistics path planning schemes.

[0049] Among them, the cargo constraint condition refers to the constraint condition that needs to be met in the process of logistics transportation of cargo. The constraint condition can be obtained by the user by setting it according to actual needs, for example, the maximum weight that can be loaded on each transport vehicle can be set, etc., and the first logistics path planning scheme refers to the initial logistics path planning scheme that is compatible with the cargo constraint condition. After the terminal obtains the cargo constraint condition, it can use the obtained cargo information and cargo constraint condition to screen the initial logistics path planning scheme, so as to determine multiple first logistics path planning schemes from multiple initial logistics path planning schemes. For example, it can be determined whether the cargo loaded on each transport vehicle in each initial logistics path planning scheme exceeds the maximum loadable weight according to the cargo weight in the cargo information. If the loading weight of all transport vehicles does not exceed the maximum weight, then the initial logistics path planning scheme can be used as the first logistics path planning scheme.

[0050] Step S203, the terminal selects a preset number of second logistics path planning schemes from multiple first logistics path planning schemes; the second logistics path planning scheme is a preset number of first logistics path planning schemes with the greatest fitness.

[0051] Among them, the preset number can be set according to user needs, and the second logistics path planning scheme is the first logistics path planning scheme with the largest preset number of fitness among the first logistics path planning schemes. For example, the preset number set by the user can be 2, and the obtained first logistics path planning scheme includes 4. Then the terminal can use the 2 first logistics path planning schemes with the largest fitness as the second logistics path planning schemes.

[0052] Step S204, the terminal performs cross-variation processing on the second logistics path planning scheme to obtain multiple third logistics path planning schemes;

[0053] Step S205, the terminal obtains the current update round. If the current update round is less than the preset update round, the second logistics path planning scheme and the third logistics path planning scheme are used as the initial logistics path planning scheme for the next update round.

[0054] After the terminal obtains multiple second logistics path planning schemes, it can first copy the chromosome codes of each second logistics path planning scheme, and use crossover mutation and other algorithms to transform the chromosome codes to obtain a third logistics path planning scheme. The terminal can then determine the current update round. If the current update round is less than the preset update round, that is, the current update round has not reached the preset update round, then the terminal will use the obtained second logistics path planning scheme and the third logistics path planning scheme as the initial logistics path planning scheme for the next round, that is, the initial logistics path planning scheme after the update of this round. After that, the terminal will again use the cargo information and cargo constraints to screen out the first logistics path planning scheme, and find a preset number of second logistics path planning schemes for crossover mutation processing, and obtain the third logistics path planning scheme for the next round again, until the current update round reaches the preset update round.

[0055] In the above embodiment, by selecting a logistics path planning scheme with high fitness as the parent to obtain offspring, and using the obtained offspring and the parent with high fitness as input for the next round, the loss of excellent parents can be avoided, thereby further improving the accuracy of the obtained target logistics path planning scheme.

[0056] Furthermore, step S202 may further include: the terminal deletes the initial logistics path planning scheme that meets the cargo constraint conditions based on the cargo information, and uses the retained initial logistics path planning scheme as the first logistics path planning scheme.

[0057] For example, the cargo constraint condition may be whether the load of each transport vehicle in the initial logistics path planning plan is higher than the rated load. If there is a transport vehicle whose load is higher than the rated load, the terminal may delete the initial logistics path planning plan, and finally use the retained initial logistics path planning plan as the first logistics path planning plan.

[0058] Furthermore, the terminal deletes the initial logistics path planning scheme that meets the cargo constraint conditions based on the cargo information, which may include:

[0059] Based on the cargo information, the terminal determines the load factor of each transport vehicle under each initial logistics path planning scheme, and deletes the initial logistics path planning scheme that satisfies the load factor greater than the preset load factor threshold, where the preset load factor threshold can be 100%, that is, it is necessary to ensure that each transport vehicle does not exceed the load-bearing capacity of the vehicle. If it exceeds, the terminal should delete this initial logistics path planning scheme.

[0060] Based on the cargo information, the terminal determines the volume utilization of each transport vehicle under each initial logistics path planning scheme, and deletes the initial logistics path planning scheme that satisfies the volume utilization greater than the preset volume utilization threshold, where the preset volume utilization threshold can be 100%, that is, it is necessary to ensure that the volume of the cargo loaded on each transport vehicle does not exceed the maximum volume that the vehicle can accommodate. If it exceeds the maximum volume, the terminal should delete this initial logistics path planning scheme.

[0061] Based on the cargo information, the terminal determines the cargo placement positions of the goods to be transported in each transport vehicle under each initial logistics path planning scheme, and deletes the initial logistics path planning scheme that satisfies the cargo placement position that heavy cargo is located above light cargo. That is, the terminal needs to first determine the position of each transport vehicle loading the cargo under the initial logistics path planning scheme. If there is heavy cargo located above light cargo, that is, heavy cargo is pressed on light cargo, then the terminal will delete this initial logistics path planning scheme.

[0062] Based on the cargo information, the terminal determines the cargo placement order of each transport vehicle under each initial logistics path planning scheme and the order of the delivery locations of the transport vehicles to be transported, and deletes the initial logistics path planning schemes that satisfy the corresponding order of placement order and delivery location order. Among them, the correspondence between the order of placement order and the order of delivery location means that the first delivered goods are placed first, and in order to facilitate the unloading of goods, during the transportation process, the goods must be delivered first and then loaded, so that the first delivered goods can be loaded at the rear of the car. Therefore, the terminal will delete the initial logistics path planning schemes that satisfy the corresponding order of placement order and delivery location order.

[0063] Based on the cargo information, the terminal determines the relative position of the carriage of each transport vehicle and the cargo to be transported under each initial logistics path planning scheme, and deletes the initial logistics path planning scheme that satisfies the relative position that the cargo position of the cargo to be transported exceeds the carriage position of the carriage. Since the cargo cannot exceed the range of the carriage, the terminal can first determine the relative position of the carriage of each transport vehicle and the cargo to be transported under each initial logistics path planning scheme. If there is a cargo position of the cargo to be transported that exceeds the carriage position of the carriage, the terminal can delete the initial logistics path planning scheme.

[0064] In the above embodiment, by setting cargo constraints, the initial logistics path planning scheme that meets the cargo constraints can be deleted based on the cargo information, so that the retained scheme can be used as the first logistics path planning scheme. In addition, multiple cargo constraints can be set for screening, thereby further improving the fit between the logistics path planning and the actual scenario, thereby further improving the accuracy of the obtained logistics path planning scheme.

[0065] In addition, in this embodiment, the logistics transportation information includes logistics transportation time and logistics transportation distance. Step S103 may further include: the terminal determines the logistics transportation time and logistics transportation distance corresponding to each logistics path planning scheme, and hierarchically processes each logistics path planning scheme according to multiple non-dominated levels according to the logistics transportation time and logistics transportation distance; step S104 may further include: the terminal selects the logistics path planning scheme with the largest congestion from the logistics path planning schemes with the non-dominated level as the first level as the logistics path planning scheme with the largest adaptability.

[0066] Among them, the non-dominated hierarchy can include multiple levels, which are used to evaluate the fitness of the logistics path planning scheme. The higher the number of levels in the non-dominated hierarchy, the smaller the corresponding fitness. Since the logistics transportation information includes two types, namely, logistics transportation time and logistics transportation distance, there may be a situation where the logistics transportation time of a logistics path planning scheme is shorter than that of another logistics path planning scheme, but the corresponding logistics transportation distance is longer. Therefore, the two logistics path planning schemes cannot be used to compare the degree of superiority and inferiority, and the fitness cannot be compared. Then, the two logistics path planning schemes can be set to the same non-dominated hierarchy, and only when the logistics transportation time and logistics transportation distance of a logistics path planning scheme are shorter than those of another logistics path planning scheme, the terminal will use the other scheme as the upper layer of this scheme. Therefore, in this embodiment, the terminal is a method of layering each logistics path planning scheme according to the logistics transportation time and the logistics transportation distance, and firstly, the logistics path planning scheme is layered according to multiple non-dominated hierarchies.

[0067] After that, the terminal needs to find the logistics path planning scheme with the largest fitness as the target logistics path planning scheme, and can select it from the logistics path planning schemes with the non-dominated layer as the first layer. Specifically, the terminal can first confirm multiple logistics path planning schemes with the non-dominated layer as the first layer, and determine the congestion corresponding to each logistics path planning scheme, and then select the logistics path planning scheme with the non-dominated layer as the first layer and the largest congestion as the target logistics path planning scheme.

[0068] Furthermore, if Figure 3 As shown, step S203 may further include:

[0069] Step S301: The terminal determines a non-dominated hierarchy corresponding to each first logistics path planning scheme, and determines a congestion degree of each first logistics path planning scheme in the non-dominated hierarchy corresponding to the first logistics path planning scheme.

[0070] After the terminal obtains the first logistics path planning scheme, it can firstly perform layered processing on the first logistics path planning scheme according to multiple non-dominated levels, and determine the non-dominated level corresponding to each first logistics path planning scheme. Then, for each non-dominated level, it can determine the congestion corresponding to each first logistics path planning scheme in each non-dominated level.

[0071] For example: the first logistics path planning scheme may include scheme A, scheme B, scheme C and scheme D. First, the schemes may be layered according to the non-dominated hierarchy. For example, scheme A may belong to the first layer of the non-dominated hierarchy, and schemes B, C and D may belong to the second layer of the non-dominated hierarchy. Then, the congestion of scheme A may be calculated in the first layer, and the congestion of schemes B, C and D may be calculated in the second layer.

[0072] In step S302, the terminal processes the first logistics path planning schemes in ascending order according to the number of levels of the non-dominated hierarchy, and processes the first logistics path planning schemes after the ascending order in descending order according to the congestion degree in the non-dominated hierarchy corresponding to the first logistics path planning schemes, and selects a preset number of first logistics path planning schemes after the descending order as the second logistics path planning scheme.

[0073] In step S301, after the terminal obtains the non-dominated level of each first logistics path planning scheme and the congestion of the level it is in, it can firstly process the first logistics path planning schemes in ascending order according to the non-dominated level, and then process the first logistics path planning schemes in descending order according to the congestion of the level they are in, and then select a preset number of first logistics path planning schemes as the second logistics path planning scheme.

[0074] In the above example, if plan A belongs to the first layer in the non-dominated hierarchy, plan B, plan C and plan D belong to the second layer of the non-dominated hierarchy, and the congestion of plan C is greater than that of plan B, and the congestion of plan B is greater than that of plan D, then the terminal first processes in ascending order according to the non-dominated hierarchy, that is, plan A, plan B, plan C, plan D, and then processes in descending order for the plans in the same non-dominated hierarchy. The processed results are plan A, plan C, plan B, plan D. If the preset number of first logistics path planning plans to be selected is 2, then the first two plans, that is, plan A and plan C, are selected as the second logistics path planning plans.

[0075] Furthermore, if Figure 4 As shown, in step S301, the terminal determines the non-dominated levels corresponding to each first logistics path planning solution, which may further include:

[0076] Step S401, the terminal determines the current first logistics path planning scheme, and the first logistics transportation time and the first logistics transportation distance corresponding to the current first logistics path planning scheme;

[0077] Step S402, the terminal traverses the first logistics path planning scheme, and determines multiple second logistics transportation times and multiple second logistics transportation distances corresponding to other first logistics path planning schemes; the first logistics transportation time and the first logistics transportation distance are any first logistics path planning scheme in the first logistics path planning scheme except the current first logistics path planning scheme.

[0078] Among them, the current first logistics path planning scheme refers to the first logistics path planning scheme currently being processed, and other first logistics path planning schemes refer to any first logistics path planning schemes other than the current first logistics path planning scheme among the multiple first logistics path planning schemes obtained. Specifically, the terminal can first determine the current first logistics path planning scheme and the corresponding other first logistics path planning schemes from the multiple first logistics path planning schemes, and obtain the logistics transportation time and logistics transportation distance corresponding to the current first logistics path planning scheme as the first logistics transportation time and the first logistics transportation distance, and obtain the logistics transportation time and logistics transportation distance corresponding to each other first logistics path planning scheme, and obtain multiple second logistics transportation times and multiple second logistics transportation distances.

[0079] Step S403, if the first logistics transportation time is less than the second logistics transportation time, and the first logistics transportation distance is less than the second logistics transportation distance, the terminal determines that the non-dominated level of the current first logistics path planning scheme is less than the non-dominated level of other first logistics path planning schemes;

[0080] Step S404, if the first logistics transportation time is less than the second logistics transportation time and the first logistics transportation distance is greater than the second logistics transportation distance, or the first logistics transportation time is greater than the second logistics transportation time and the first logistics transportation distance is less than the second logistics transportation distance, then determine that the non-dominated level of the current first logistics path planning scheme is the same as the non-dominated level of other first logistics path planning schemes.

[0081] If the logistics transportation time and logistics transportation distance corresponding to the current first logistics path planning scheme are shorter than the logistics transportation time and logistics transportation distance corresponding to one of the other first logistics path planning schemes, then it is determined that the current first logistics path planning scheme is more advantageous than the other first logistics path planning scheme, so the other first logistics path planning scheme can be used as the upper layer of the current first logistics path planning scheme. If the current first logistics path planning scheme is compared with the other first logistics path planning scheme, the logistics transportation time is shorter but the logistics transportation distance is longer, or the logistics transportation time is longer but the logistics transportation distance is shorter, then it is determined that the other first logistics path planning scheme is at the same non-dominated level as the current first logistics path planning scheme.

[0082] For example, taking plan A and plan B as examples, if the logistics transportation time and logistics transportation distance of plan A are both less than the logistics transportation time and logistics transportation distance of plan B, then the terminal can consider that the non-dominated level of plan B is higher than the non-dominated level of plan A, and if the logistics transportation time of plan A is less than that of plan B, but the logistics transportation distance is greater than that of plan B, or the logistics transportation time of plan A is greater than that of plan B, but the logistics transportation distance is less than that of plan B, then it is considered that plan A and plan B are at the same non-dominated level. The terminal can divide each first logistics path planning plan into multiple non-dominated levels in the above manner.

[0083] In addition, if Figure 5 As shown, in step S301, the terminal determines the congestion degree of each first logistics path planning scheme in the non-dominated hierarchy corresponding to the first logistics path planning scheme, which may further include:

[0084] Step S501, the terminal obtains the first logistics path planning scheme with the smallest time difference with the first logistics transportation time as the first same-level logistics path planning scheme, and obtains the first logistics path planning scheme with the smallest distance difference with the first logistics transportation distance as the second same-level logistics path planning scheme.

[0085] First, after the terminal completes the hierarchical processing of the non-dominated levels of each first logistics path planning scheme, it can determine the first logistics path planning scheme with the smallest time difference with the logistics transportation time of the current first logistics path planning scheme in the non-dominated level corresponding to the current first logistics path planning scheme as the first same-level logistics path planning scheme, and at the same time, the first logistics path planning scheme with the smallest distance difference with the logistics transportation distance of the current first logistics path planning scheme is used as the second same-level logistics path planning scheme.

[0086] Taking Plan A, Plan B, Plan C and Plan D at the same non-dominated level as an example, if Plan A is used as the current first logistics path planning plan, it is necessary to find the first same-level logistics path planning plan and the second same-level logistics path planning plan corresponding to Plan A from Plan B, Plan C and Plan D. If the time difference between the logistics transportation time of Plan B and the logistics transportation time of Plan A is the smallest, then Plan B can be used as the first same-level logistics path planning plan, and if the distance difference between the logistics transportation distance of Plan D and the logistics transportation distance of Plan A is the smallest, then Plan D can be used as the second same-level logistics path planning plan.

[0087] Step S502, the terminal obtains the third logistics transportation time and the third logistics transportation distance corresponding to the first same-layer logistics path planning scheme, and the fourth logistics transportation time and the fourth logistics transportation distance corresponding to the second same-layer logistics path planning scheme.

[0088] After the terminal determines the first same-level logistics path planning scheme and the second same-level logistics path planning scheme corresponding to the current first logistics path planning scheme, it can respectively obtain the logistics transportation time and logistics transportation distance corresponding to the first same-level logistics path planning scheme as the third logistics transportation time and the third logistics transportation distance, and the logistics transportation time and logistics transportation distance corresponding to the second same-level logistics path planning scheme as the fourth logistics transportation time and the fourth logistics transportation distance.

[0089] In step S503, the terminal sums the first absolute value of the difference between the third logistics transportation time and the fourth logistics transportation time, and the absolute value of the difference between the third logistics transportation distance and the fourth logistics transportation distance as the congestion degree of the current first logistics path planning scheme.

[0090] Finally, the terminal can calculate the absolute value of the difference between the third logistics transportation time and the fourth logistics transportation time, and calculate the absolute value of the difference between the third logistics transportation distance and the fourth logistics transportation distance, and sum them up as the congestion degree of the current first logistics path planning scheme. After that, the terminal can obtain the congestion degree of all first logistics path planning schemes in the above manner.

[0091] In the above embodiment, through non-dominated hierarchical processing and a method for obtaining the congestion degree of solutions at the same non-dominated level, a logistics path planning solution with high adaptability that takes into account both logistics transportation time and logistics transportation distance can be obtained. While ensuring the accuracy of logistics transportation planning, it also reduces the complexity of calculation time, thereby improving processing efficiency.

[0092] In an application example, a logistics path planning method based on an improved genetic algorithm is provided. This method uses a non-dominated sorting genetic algorithm with an elite strategy for path planning. Figure 6 As shown, the method may specifically include the following steps:

[0093] Step 1: Initialization, randomly generate an initial population P of size N t , and generate the offspring population Q according to the traditional genetic algorithm t , and finally the population P t and population Q t Merge into a population X of size 2N t ;

[0094] Step 2: Considering that a vehicle can carry multiple delivery orders and the delivery order number is unique, a mixed coding is used, where the vehicle is coded with an integer and the delivery order is coded with a permutation code.

[0095] Step 3: Use the fast non-dominated sorting algorithm to calculate the fitness of each individual. The core concept is that for each individual i, there will be two parameters n i and S i , where n i is the number of solution individuals that dominate individual i in the entire population, S i is the set of solution individuals dominated by individual i, such as Figure 7 As shown, the specific calculation steps of the fast non-dominated sorting algorithm are as follows.

[0096] Step 3.1: Traverse the population to find all n i =0 individuals, store them into the current set Z1;

[0097] Step 3.2: For each individual j in the current set Z1, examine the individual set S it dominates j , and the set S j For each individual k in n k minus 1, that is, the number of solution individuals that dominate individual k is minus 1 (the reason is that individual j that dominates individual k has been stored in the current set Z1). If n k -1=0, store individual k into another set H;

[0098] Step 3.3: Take Z1 as the first-level non-dominated individual set. The individuals in Z1 are the best. They only dominate individuals and are not dominated by any other individuals. Give the individuals in this set the same non-dominated order i rank , and then continue to perform the above classification operation on the set H and assign the corresponding non-dominated order until all individuals are classified;

[0099] Step 3.4: Repeat steps 3.1 and 3.2 for N times;

[0100] Step 4: Introduce the concepts of congestion and congestion comparison operator, and consider the state of the cargo and the attributes of the cargo when selecting the parent body to participate in the reproduction, and use them as features to participate in the calculation;

[0101] Step 4.1: The crowding degree in step 4 represents the density of individuals around a given point in the population. d Intuitively, it can be represented by the length of the largest rectangle around individual i that contains individual i but does not contain the rest of the individuals, such as Figure 8 As shown. In the non-dominated sorting genetic algorithm with elite strategy, crowding is an important link to ensure population diversity. The specific calculation steps are as follows;

[0102] Step 4.1.1: Set the crowdedness of each point i d Set to 0;

[0103] Step 4.1.2: For each target, perform non-dominated sorting on the population, and set the crowding degree of the two individuals on the boundary to be infinite, that is, o d = l d =∞;

[0104] Step 4.1.3: Apply the formula to other individuals Calculate the congestion degree, where i d represents the congestion degree of point i, f i+1 represents the jth objective function value at point i+1, f i-1 Represents the j-th objective function value at point i-1;

[0105] Step 4.2: After the previous fast non-dominated sorting and crowding calculation, each individual i in the population will have two attributes, namely the non-dominated order i determined by the non-dominated sorting rank and congestion degree i d ,Based on these two attributes, we can define the crowding comparison operator in step 4 to compare individual i with another individual j. The specific steps are as follows;

[0106] Step 4.2.1: Compare the non-dominated layers. If the non-dominated layer of individual i is better than the non-dominated layer of individual j, then i rank <j rank, then individual i wins, otherwise individual j wins;

[0107] Step 4.2.2: If they have the same rank, calculate the crowding distance. If individual i has a larger crowding distance than individual j, then i d >j d , then individual i wins, otherwise individual j wins:

[0108] Step 4.2.3: The winning individual proceeds to the next step;

[0109] Step 4.3: Select the best individuals based on the status of the cargo on the vehicle and the attributes of the cargo, mainly including the vehicle space size, load capacity, cargo stacking degree, cargo volume, etc. At this point, each individual is equivalent to the obtained path plan, and considers what cargo should be loaded on the vehicle and how to deliver different cargoes to different destinations in order. The specific rules and steps for selection are as follows:

[0110] Step 4.3.1: Calculate the load factor of each vehicle under each individual's corresponding solution. The larger the better, indicating that the individual fully utilizes the vehicle's load-bearing capacity. If the load factor is greater than 100%, the individual is discarded.

[0111] Step 4.3.2: Calculate the volume utilization rate of each vehicle under each individual's corresponding solution. The larger the better, indicating that the individual fully utilizes the vehicle's space capacity. If the volume utilization rate is greater than 100%, the individual is discarded.

[0112] Step 4.3.3: The cargo must not be pressed by heavy cargo. Calculate the spatial position of cargo on each vehicle under each individual's corresponding solution, and determine whether there is heavy cargo pressed on light cargo. If not, keep the individual, otherwise discard the individual;

[0113] Step 4.3.4: The goods must be delivered first and loaded later, so that the first delivered goods can be loaded at the rear of the car for easy unloading. Determine the order of placement of goods in each vehicle under each individual's corresponding plan, and combine the order of the vehicles passing different destinations to determine whether the principle of delivery first and loading later is met. If it is met, keep the individual, otherwise discard it;

[0114] Step 4.3.5: The cargo cannot exceed the carriage. That is, calculate the relative position of the cargo and the carriage of each vehicle under each individual corresponding solution. If any cargo exceeds the range of the carriage, the individual is discarded, otherwise it is retained;

[0115] Step 4.3.6: When evaluating the quality of each individual, call Amap in real time to calculate the total path and total time of each individual according to the road conditions, and select the solution with the shortest path and the least time consumption;

[0116] Step 5: Copy the genes of the father and mother, and use crossover, mutation and other algorithms to generate offspring. In the process of reproduction, an elite strategy is used to prevent the loss of excellent individuals, that is, by mixing all individuals of the parent and offspring and performing non-dominated sorting, the loss of excellent individuals in the parent generation can be better avoided. Fig. 9 As shown, the specific steps of the elite strategy are as follows;

[0117] Step 5.1: First, the new population Q generated in the tth generation t With the parent P t Combined to form population X t , whose size is 2N;

[0118] Step 5.2: Then X t Perform non-dominated sorting to generate a series of non-dominated sets Z i and calculate its congestion;

[0119] Step 5.3: Since both the offspring and parent individuals are included in X t In the set, the individuals contained in the non-dominated set Z1 after the non-dominated sorting operation should be X t The best one among them, so put Z1 into the new parent population P t+1 middle;

[0120] Step 5.4: Observe P t+1 If its size is less than N, continue to repeat steps 5.2 and 5.3 to P t+1 Continue to fill the next level of non-dominated set Z2;

[0121] Step 5.5: When filling the non-dominated set makes P t+1 When the size exceeds N, the current Z n The individuals in the crowding comparison operator are intercepted before {num(Z n )-(num(P t+1 )-N)} individuals, so that P t+1 The number of individuals is exactly equal to N;

[0122] Step 5.6: Use universal genetic operators for crossover and mutation to generate a new offspring population Q t+1 ;

[0123] Step 6: Determine whether to continue iterative reproduction based on specific criteria.

[0124] In this application example, when using genetic algorithms to solve the path planning problem, the state and attributes of the cargo on the vehicle are taken into account and used as features to participate in the fitness calculation. This improvement allows the genetic algorithm to be more in line with the actual situation when calculating the optimal path, making it more practical. At the same time, the non-dominated sorting genetic algorithm with elite strategy is used for path planning. Compared with traditional algorithms, it has the advantages of reducing the complexity of calculation time, preserving excellent individuals of the parent class, and using crowding to ensure population diversity.

[0125] It should be understood that, although the various steps in the flowchart of the present application are displayed in sequence according to the indication of the arrows, these steps are not necessarily executed in sequence in the order indicated by the arrows. Unless there is a clear description in this article, the execution of these steps is not strictly limited in order, and these steps can be executed in other orders. Moreover, at least a portion of the steps in the figure may include multiple steps or multiple stages, and these steps or stages are not necessarily executed at the same time, but can be executed at different times, and the execution order of these steps or stages is not necessarily to be carried out in sequence, but can be executed in turn or alternately with other steps or at least a portion of the steps or stages in other steps.

[0126] In one embodiment, Fig.10 As shown, a logistics path planning device is provided, including: a cargo information acquisition module 1001, a logistics path update module 1002, a fitness determination module 1003 and a target path determination module 1004, wherein:

[0127] The cargo information acquisition module 1001 is used to acquire the initial logistics path planning solution and cargo information of the cargo to be transported;

[0128] The logistics path updating module 1002 is used to update the initial logistics path planning scheme by a preset update round based on the cargo information using a genetic algorithm to obtain multiple logistics path planning schemes;

[0129] The fitness determination module 1003 is used to determine the logistics transportation information corresponding to each logistics path planning scheme, and determine the fitness of each logistics path planning scheme based on the logistics transportation information;

[0130] The target path determination module 1004 is used to take the logistics path planning scheme with the greatest fitness as the target logistics path planning scheme, and transport the goods to be transported based on the target logistics path planning scheme.

[0131] In one embodiment, the logistics path update module 1002 is further used to obtain preset cargo constraints; based on cargo information and cargo constraints, determine multiple first logistics path planning schemes from the initial logistics path planning schemes; select a preset number of second logistics path planning schemes from the multiple first logistics path planning schemes; the second logistics path planning scheme is a preset number of first logistics path planning schemes with the largest fitness; cross-mutation processing is performed on the second logistics path planning scheme to obtain multiple third logistics path planning schemes; obtain the current update round, if the current update round is less than the preset update round, the second logistics path planning scheme and the third logistics path planning scheme are used as the initial logistics path planning schemes for the next update round.

[0132] In one embodiment, the logistics path updating module 1002 is further used to delete the initial logistics path planning scheme that meets the cargo constraint conditions based on the cargo information, and use the retained initial logistics path planning scheme as the first logistics path planning scheme.

[0133] In one embodiment, the logistics path updating module 1002 is further used to determine the load factor of each transport vehicle under each initial logistics path planning scheme based on the cargo information, and delete the initial logistics path planning scheme that satisfies the load factor greater than a preset load factor threshold; determine the volume utilization rate of each transport vehicle under each initial logistics path planning scheme based on the cargo information, and delete the initial logistics path planning scheme that satisfies the volume utilization rate greater than the preset volume utilization rate threshold; determine the cargo placement position of the cargo to be transported in each transport vehicle under each initial logistics path planning scheme based on the cargo information, and delete the initial logistics path planning scheme that satisfies the cargo placement position. Initial logistics path planning schemes in which heavy goods are located above light goods are deleted; based on the cargo information, the cargo placement order of each transport vehicle under each initial logistics path planning scheme and the order of delivery locations of the goods to be transported by the transport vehicle are determined, and the initial logistics path planning schemes that satisfy the corresponding placement position order and delivery location order are deleted; and / or based on the cargo information, the relative position of the carriage of each transport vehicle and the goods to be transported under each initial logistics path planning scheme is determined, and the initial logistics path planning schemes that satisfy the relative position of the cargo to be transported beyond the carriage position are deleted.

[0134] In one embodiment, the logistics transportation information includes logistics transportation time and logistics transportation distance; the fitness determination module 1003 is further used to determine the logistics transportation time and logistics transportation distance corresponding to each logistics path planning scheme, and hierarchically process each logistics path planning scheme according to multiple non-dominated levels according to the logistics transportation time and logistics transportation distance; the target path determination module 1004 is further used to select the logistics path planning scheme with the largest congestion from the logistics path planning schemes with the non-dominated level as the first level as the logistics path planning scheme with the largest fitness.

[0135] In one embodiment, the logistics path update module 1002 is further used to determine the non-dominated hierarchy corresponding to each first logistics path planning scheme, and determine the congestion degree of each first logistics path planning scheme in the non-dominated hierarchy corresponding to the first logistics path planning scheme; the first logistics path planning schemes are sorted in ascending order according to the number of levels of the non-dominated hierarchy, and the first logistics path planning schemes after the ascending order are sorted in descending order according to the congestion degree in the non-dominated hierarchy corresponding to the first logistics path planning scheme, and a preset number of first logistics path planning schemes after the descending order are selected as the second logistics path planning scheme.

[0136] In one embodiment, the logistics path updating module 1002 is further used to traverse the first logistics path planning scheme, determine multiple second logistics transportation times and multiple second logistics transportation distances corresponding to other first logistics path planning schemes respectively; other first logistics path planning schemes are any first logistics path planning schemes in the first logistics path planning scheme excluding the current first logistics path planning scheme; if the first logistics transportation time is less than the second logistics transportation time, and the first logistics transportation distance is less than the second logistics transportation distance, then determine that the non-dominated hierarchy of the current first logistics path planning scheme is less than the non-dominated hierarchy of other first logistics path planning schemes; if the first logistics transportation time is less than the second logistics transportation time and the first logistics transportation distance is greater than the second logistics transportation distance, or the first logistics transportation time is greater than the second logistics transportation time and the first logistics transportation distance is less than the second logistics transportation distance transport distance, it is determined that the non-dominated level of the current first logistics path planning scheme is the same as the non-dominated level of other first logistics path planning schemes; and the first logistics path planning scheme with the smallest time difference with the first logistics transportation time is obtained as the first same-level logistics path planning scheme, and the first logistics path planning scheme with the smallest distance difference with the first logistics transportation distance is obtained as the second same-level logistics path planning scheme; the third logistics transportation time and the third logistics transportation distance corresponding to the first same-level logistics path planning scheme are obtained, and the fourth logistics transportation time and the fourth logistics transportation distance corresponding to the second same-level logistics path planning scheme are obtained; the absolute value of the difference between the third logistics transportation time and the fourth logistics transportation time, and the absolute value of the difference between the third logistics transportation distance and the fourth logistics transportation distance are summed up as the congestion degree of the current first logistics path planning scheme.

[0137] For the specific definition of the logistics path planning device, please refer to the definition of the logistics path planning method above, which will not be repeated here. Each module in the above-mentioned logistics path planning device can be implemented in whole or in part by software, hardware and a combination thereof. The above-mentioned modules can be embedded in or independent of the processor in the computer device in the form of hardware, or can be stored in the memory of the computer device in the form of software, so that the processor can call and execute the operations corresponding to the above modules.

[0138] In one embodiment, a computer device is provided. The computer device may be a terminal, and its internal structure diagram may be as follows: Fig.11As shown. The computer device includes a processor, a memory, a communication interface, a display screen and an input device connected through a system bus. Among them, the processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The communication interface of the computer device is used to communicate with an external terminal in a wired or wireless manner, and the wireless manner can be achieved through WIFI, an operator network, NFC (near field communication) or other technologies. When the computer program is executed by the processor, a logistics path planning method is implemented. The display screen of the computer device can be a liquid crystal display screen or an electronic ink display screen, and the input device of the computer device can be a touch layer covering the display screen, or a key, trackball or touchpad set on the computer device housing, or an external keyboard, touchpad or mouse, etc.

[0139] Those skilled in the art will understand that Fig.11 The structure shown in the figure is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied. The specific computer device may include more or fewer components than those shown in the figure, or combine certain components, or have a different arrangement of components.

[0140] In one embodiment, a computer device is further provided, including a memory and a processor, wherein a computer program is stored in the memory, and the processor implements the steps in the above-mentioned method embodiments when executing the computer program.

[0141] In one embodiment, a computer-readable storage medium is provided, on which a computer program is stored. When the computer program is executed by a processor, the steps in the above-mentioned method embodiments are implemented.

[0142] Those of ordinary skill in the art can understand that all or part of the processes in the above-mentioned embodiment methods can be completed by instructing the relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to memory, storage, database or other media used in the embodiments provided in this application can include at least one of non-volatile and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory or optical memory, etc. Volatile memory can include random access memory (RAM) or external cache memory. As an illustration and not limitation, RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM).

[0143] The technical features of the above embodiments may be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0144] The above-mentioned embodiments only express several implementation methods of the present application, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the scope of the invention patent. It should be pointed out that, for a person of ordinary skill in the art, several variations and improvements can be made without departing from the concept of the present application, and these all belong to the protection scope of the present application. Therefore, the protection scope of the patent of the present application shall be subject to the attached claims.

Claims

1. A logistics path planning method, characterized in that: The method comprises: Obtaining the initial logistics route planning plan and cargo information of the cargo to be transported; Based on the cargo information, the initial logistics path planning scheme is updated by using a genetic algorithm for a preset update round to obtain multiple logistics path planning schemes; Determine the logistics transportation information corresponding to each logistics path planning scheme, and determine the fitness of each logistics path planning scheme based on the logistics transportation information; Taking the logistics path planning scheme with the greatest fitness as the target logistics path planning scheme, and transporting the goods to be transported based on the target logistics path planning scheme; The updating rounds include at least two times; based on the cargo information, the initial logistics path planning scheme is updated by using a genetic algorithm for a preset updating round, including: obtaining preset cargo constraints; based on the cargo information and the cargo constraints, determining a plurality of first logistics path planning schemes from the initial logistics path planning scheme; selecting a preset number of second logistics path planning schemes from the plurality of first logistics path planning schemes; the second logistics path planning scheme is the preset number of first logistics path planning schemes with the largest fitness; performing cross-mutation processing on the second logistics path planning scheme to obtain a plurality of third logistics path planning schemes; obtaining the current updating round, if the current updating round is less than the preset updating round, using the second logistics path planning scheme and the third logistics path planning scheme as the initial logistics path planning scheme for the next updating round; The logistics transportation information includes logistics transportation time and logistics transportation distance; the determining of the fitness of each logistics path planning scheme based on the logistics transportation information includes: determining the logistics transportation time and logistics transportation distance corresponding to each logistics path planning scheme, and hierarchically processing each logistics path planning scheme according to multiple non-dominated levels according to the logistics transportation time and logistics transportation distance; the taking of the logistics path planning scheme with the greatest fitness as the target logistics path planning scheme includes: selecting the logistics path planning scheme with the greatest congestion from the logistics path planning schemes with the non-dominated level as the first level as the logistics path planning scheme with the greatest fitness; The selecting of a preset number of second logistics path planning schemes from the plurality of first logistics path planning schemes comprises: determining a non-dominated hierarchy corresponding to each first logistics path planning scheme, and determining a congestion degree of each first logistics path planning scheme in the non-dominated hierarchy corresponding to the first logistics path planning scheme; performing ascending processing on the first logistics path planning schemes according to the number of levels of the non-dominated hierarchy, and performing descending processing on the ascending first logistics path planning schemes according to the congestion degree in the non-dominated hierarchy corresponding to the first logistics path planning scheme, and selecting the first logistics path planning schemes after the descending processing, which are the preset number, as the second logistics path planning schemes; The determining of the non-dominated hierarchy corresponding to each first logistics path planning scheme includes: determining the current first logistics path planning scheme, and the first logistics transportation time and the first logistics transportation distance corresponding to the current first logistics path planning scheme; traversing the first logistics path planning scheme, and determining a plurality of second logistics transportation times and a plurality of second logistics transportation distances respectively corresponding to other first logistics path planning schemes; the other first logistics path planning schemes are any first logistics path planning schemes in the first logistics path planning scheme except the current first logistics path planning scheme; if the first logistics transportation time is less than the second logistics transportation time, and the first logistics transportation distance is less than the second logistics transportation distance, then determining that the non-dominated hierarchy of the current first logistics path planning scheme is less than the non-dominated hierarchy of the other first logistics path planning schemes; if the first logistics transportation time is less than the second logistics transportation time and the first logistics transportation distance is greater than the second logistics transportation distance, or the first logistics transportation time is greater than the second logistics transportation time and the first logistics transportation distance is less than the second logistics transportation distance, then determining that the non-dominated hierarchy of the current first logistics path planning scheme is the same as the non-dominated hierarchy of the other first logistics path planning schemes; The method of determining the congestion degree of each first logistics path planning scheme in the non-dominated level corresponding to the first logistics path planning scheme includes: obtaining the first logistics path planning scheme with the smallest time difference with the first logistics transportation time as the first same-level logistics path planning scheme, and obtaining the first logistics path planning scheme with the smallest distance difference with the first logistics transportation distance as the second same-level logistics path planning scheme; obtaining the third logistics transportation time and the third logistics transportation distance corresponding to the first same-level logistics path planning scheme, and the fourth logistics transportation time and the fourth logistics transportation distance corresponding to the second same-level logistics path planning scheme; summing the absolute value of the difference between the third logistics transportation time and the fourth logistics transportation time, and the absolute value of the difference between the third logistics transportation distance and the fourth logistics transportation distance, as the congestion degree of the current first logistics path planning scheme.

2. The method according to claim 1, characterized in that The determining a plurality of first logistics path planning schemes from the initial logistics path planning schemes based on the cargo information and the cargo constraint conditions includes: Based on the cargo information, the initial logistics path planning scheme that meets the cargo constraint condition is deleted, and the retained initial logistics path planning scheme is used as the first logistics path planning scheme.

3. The method according to claim 2, characterized in that The deleting the initial logistics path planning scheme that meets the cargo constraint condition based on the cargo information includes: Based on the cargo information, determine the load factor of each transport vehicle under each initial logistics path planning scheme, and delete the initial logistics path planning scheme that satisfies the load factor greater than a preset load factor threshold; Based on the cargo information, determine the volume utilization rate of each transport vehicle under each initial logistics path planning scheme, and delete the initial logistics path planning scheme that satisfies the volume utilization rate greater than a preset volume utilization rate threshold; Based on the cargo information, determine the cargo placement positions of the cargo to be transported in each transport vehicle under each initial logistics path planning scheme, and delete the initial logistics path planning scheme that satisfies the cargo placement position that the heavy cargo is placed above the light cargo; Based on the cargo information, determine the cargo placement position sequence of each transport vehicle under each initial logistics path planning scheme and the order of the delivery locations of the cargo to be transported by the transport vehicle, and delete the initial logistics path planning scheme that satisfies the corresponding placement position sequence and the delivery location sequence; and / or Based on the cargo information, the relative position of the carriage of each transport vehicle and the cargo to be transported under each initial logistics path planning scheme is determined, and the initial logistics path planning scheme that satisfies the relative position that the cargo position of the cargo to be transported exceeds the carriage position of the carriage will be deleted.

4. The method according to claim 1, characterized in that: The preset update rounds are 80 times.

5. A logistics path planning device, characterized in that: The device comprises: A cargo information acquisition module is used to obtain the initial logistics path planning plan and cargo information of the cargo to be transported; A logistics path updating module, used to update the initial logistics path planning scheme for a preset update round using a genetic algorithm based on the cargo information to obtain multiple logistics path planning schemes; A fitness determination module, used to determine the logistics transportation information corresponding to each logistics path planning scheme, and determine the fitness of each logistics path planning scheme based on the logistics transportation information; A target path determination module, used to take the logistics path planning scheme with the greatest fitness as the target logistics path planning scheme, and transport the goods to be transported based on the target logistics path planning scheme; The update round includes at least two times; the logistics path update module is further used to obtain preset cargo constraints; based on the cargo information and the cargo constraints, multiple first logistics path planning schemes are determined from the initial logistics path planning schemes; a preset number of second logistics path planning schemes are selected from the multiple first logistics path planning schemes; the second logistics path planning scheme is the preset number of first logistics path planning schemes with the largest fitness; the second logistics path planning scheme is cross-mutated to obtain multiple third logistics path planning schemes; the current update round is obtained, and if the current update round is less than the preset update round, the second logistics path planning scheme and the third logistics path planning scheme are used as the initial logistics path planning schemes for the next update round; The logistics transportation information includes logistics transportation time and logistics transportation distance; the fitness determination module is further used to determine the logistics transportation time and logistics transportation distance corresponding to each logistics path planning scheme, and hierarchically process the logistics path planning schemes according to multiple non-dominated levels according to the logistics transportation time and logistics transportation distance; the logistics path planning scheme with the largest fitness as the target logistics path planning scheme includes: selecting the logistics path planning scheme with the largest congestion from the logistics path planning schemes with the non-dominated level as the first level as the logistics path planning scheme with the largest fitness; The logistics path updating module is further used to determine the non-dominated hierarchy corresponding to each first logistics path planning scheme, and determine the congestion degree of each first logistics path planning scheme in the non-dominated hierarchy corresponding to the first logistics path planning scheme; the first logistics path planning schemes are processed in ascending order according to the number of levels of the non-dominated hierarchy, and the first logistics path planning schemes processed in ascending order are processed in descending order according to the congestion degree in the non-dominated hierarchy corresponding to the first logistics path planning scheme, and a preset number of first logistics path planning schemes processed in descending order are selected as the second logistics path planning scheme; The logistics path updating module is further used to determine the current first logistics path planning scheme, and the first logistics transportation time and the first logistics transportation distance corresponding to the current first logistics path planning scheme; traverse the first logistics path planning scheme to determine multiple second logistics transportation times and multiple second logistics transportation distances corresponding to other first logistics path planning schemes; the other first logistics path planning schemes are any first logistics path planning schemes in the first logistics path planning scheme except the current first logistics path planning scheme; if the first logistics transportation time is less than the second logistics transportation time, and the first logistics transportation distance is less than the second logistics transportation distance, then determine that the non-dominated hierarchy of the current first logistics path planning scheme is less than the non-dominated hierarchy of the other first logistics path planning schemes; if the first logistics transportation time is less than the second logistics transportation time and the first logistics transportation distance is greater than the second logistics transportation distance, or, the first logistics transportation time is greater than the first If there are two logistics transportation times and the first logistics transportation distance is less than the second logistics transportation distance, it is determined that the non-dominated level of the current first logistics path planning scheme is the same as the non-dominated level of the other first logistics path planning schemes; and the first logistics path planning scheme with the smallest time difference with the first logistics transportation time is obtained as the first same-level logistics path planning scheme, and the first logistics path planning scheme with the smallest distance difference with the first logistics transportation distance is obtained as the second same-level logistics path planning scheme; the third logistics transportation time and the third logistics transportation distance corresponding to the first same-level logistics path planning scheme are obtained, and the fourth logistics transportation time and the fourth logistics transportation distance corresponding to the second same-level logistics path planning scheme are obtained; the absolute value of the difference between the third logistics transportation time and the fourth logistics transportation time, and the absolute value of the difference between the third logistics transportation distance and the fourth logistics transportation distance are summed up as the congestion degree of the current first logistics path planning scheme.

6. The device according to claim 5, characterized in that The logistics path updating module is further used to delete the initial logistics path planning scheme that meets the cargo constraint conditions based on the cargo information, and use the retained initial logistics path planning scheme as the first logistics path planning scheme.

7. The device according to claim 6, characterized in that The logistics path updating module is further used to determine the load factor of each transport vehicle under each initial logistics path planning scheme based on the cargo information, and delete the initial logistics path planning scheme that satisfies the load factor greater than a preset load factor threshold; determine the volume utilization rate of each transport vehicle under each initial logistics path planning scheme based on the cargo information, and delete the initial logistics path planning scheme that satisfies the volume utilization rate greater than the preset volume utilization threshold; determine the cargo placement position of the cargo to be transported in each transport vehicle under each initial logistics path planning scheme based on the cargo information, and delete the cargo that satisfies the cargo placement position of a large weight at the weight position. The initial logistics path planning schemes above the small cargo are deleted; based on the cargo information, the cargo placement position sequence of each transport vehicle and the delivery location sequence of the cargo to be transported by the transport vehicle under each initial logistics path planning scheme are determined, and the initial logistics path planning schemes that satisfy the placement position sequence and the delivery location sequence are deleted; and / or based on the cargo information, the relative position of the carriage of each transport vehicle and the cargo to be transported under each initial logistics path planning scheme are determined, and the initial logistics path planning schemes that satisfy the relative position that the cargo position of the cargo to be transported exceeds the carriage position of the carriage are deleted.

8. The device according to claim 5, characterized in that The preset update rounds are 80 times.

9. A computer device comprising a memory and a processor, wherein the memory stores a computer program, wherein: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 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 method according to any one of claims 1 to 4 are implemented.

Citation Information

Patent Citations

  • Logistics path planning method and device and driver scheduling method and device

    CN108921483A

  • A multi-objective optimization logistics method and system

    CN109726863A