CN113011659A - Logistics distribution method and device and computer readable storage medium - Google Patents
Logistics distribution method and device and computer readable storage medium Download PDFInfo
- Publication number
- CN113011659A CN113011659A CN202110309008.6A CN202110309008A CN113011659A CN 113011659 A CN113011659 A CN 113011659A CN 202110309008 A CN202110309008 A CN 202110309008A CN 113011659 A CN113011659 A CN 113011659A
- Authority
- CN
- China
- Prior art keywords
- distribution
- network
- sub
- point
- target
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 60
- 230000000875 corresponding effect Effects 0.000 claims description 53
- 230000008569 process Effects 0.000 claims description 17
- 238000013138 pruning Methods 0.000 claims description 12
- 230000008859 change Effects 0.000 claims description 10
- 238000012545 processing Methods 0.000 claims description 10
- 230000002596 correlated effect Effects 0.000 claims description 6
- 230000006870 function Effects 0.000 description 21
- 238000010586 diagram Methods 0.000 description 9
- 235000019801 trisodium phosphate Nutrition 0.000 description 4
- 238000004364 calculation method Methods 0.000 description 3
- 239000011159 matrix material Substances 0.000 description 3
- 238000012937 correction Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 238000012217 deletion Methods 0.000 description 1
- 230000037430 deletion Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000014509 gene expression Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 230000001960 triggered effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
- G06Q10/0835—Relationships between shipper or supplier and carriers
- G06Q10/08355—Routing methods
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Marketing (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Game Theory and Decision Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The method comprises the steps of generating a target distribution network based on the positions of a warehouse and the positions of distribution points, dividing the target distribution network into a plurality of sub-networks, determining the required number of distribution vehicles and the sub-networks corresponding to the distribution vehicles according to the distribution time length corresponding to the sub-networks and the working time length threshold of the distribution vehicles, and generating distribution routes of the distribution vehicles.
Description
Technical Field
The invention belongs to the technical field of logistics, and particularly relates to a logistics distribution method and device and a computer readable storage medium.
Background
The MTSP Problem (Multiple travel line Salesman project, Multiple traveler Problem) means that Multiple travelers go to a travel city, all start from the same starting place, return to the original starting point after all the cities are traversed, and require that each city can be traversed only once by a certain traveler. In urban logistics distribution, goods in a warehouse need to be transported to distribution points distributed all over the city by a plurality of distribution vehicles, and in order to save distribution cost, each distribution point is required to be delivered by only one distribution vehicle.
According to the above, there is a certain similarity between the urban logistics distribution and the MTSP problem, but unlike the MTSP problem, in the process of urban logistics distribution, the maximum load capacity and the working time of a distribution vehicle are limited, and cannot be simply equivalent to the MTSP problem, so that the method for solving the MTSP problem in the prior art is difficult to effectively solve the urban logistics distribution problem.
Disclosure of Invention
In view of the above, an object of the present invention is to provide a logistics distribution method, a logistics distribution device, and a computer-readable storage medium, which can provide the number of distribution vehicles required for completing goods distribution and distribution routes corresponding to the distribution vehicles, so as to solve the problem of urban logistics distribution in the prior art, and the specific scheme is as follows:
in a first aspect, the present invention provides a logistics distribution method, including:
acquiring basic information influencing a distribution process, wherein the basic information comprises: the position of the cargo compartment, the position and the required cargo weight of each distribution point, and the load threshold and the working time threshold of the distribution vehicle;
generating a target distribution network according to the positions of the warehouse and the positions of the distribution points;
dividing the target distribution network into a plurality of sub-networks, wherein the sum of the required cargo weights of distribution points included in any sub-network is not greater than the load threshold;
calculating the corresponding distribution time length of each sub-network;
determining the required number of the distribution vehicles and the sub-networks corresponding to the distribution vehicles according to the distribution time length corresponding to each sub-network and the working time length threshold;
and respectively generating a distribution route of each distribution vehicle according to the sub-network corresponding to each distribution vehicle.
Optionally, the generating a target distribution network according to the location of the warehouse and the location of each distribution point includes:
generating an initial distribution network according to the positions of the warehouse and the positions of the distribution points;
and correcting the initial distribution network according to a preset pruning principle to obtain a target distribution network.
Optionally, the generating an initial distribution network according to the location of the warehouse and the location of each distribution point includes:
determining the distribution cost from the warehouse to any one distribution point and between any two distribution points according to the position of the warehouse and the position of each distribution point;
and generating an initial distribution network according to the distribution cost.
Optionally, the modifying the initial distribution network according to the preset pruning principle to obtain the target distribution network includes:
taking a distribution point directly connected with the warehouse in the initial distribution network as a primary distribution point;
respectively judging whether each primary distribution point has an optimized distribution route with lower distribution cost according to a first preset sequence;
if at least one first-level distribution point has an optimized distribution route with lower distribution cost, correcting the initial distribution network according to the optimized distribution route corresponding to each first-level distribution point to obtain a corrected distribution network;
taking the distribution point which is connected with only one other distribution point in the corrected distribution network as a final distribution point;
respectively judging whether each final-stage distribution point has an optimized distribution route with lower distribution cost according to a second preset sequence;
and if at least one final-stage distribution point has an optimized distribution route with lower distribution cost, correcting the corrected distribution route according to the optimized distribution route corresponding to each final-stage distribution point to obtain a target distribution network.
Optionally, the determining, according to a first preset order, whether each of the primary distribution points has an optimized distribution route with lower distribution cost includes:
determining the grade of each primary distribution point according to a first preset grade function;
the score output by the first preset score function is positively correlated with the distribution distance from the distribution point to the warehouse and the required cargo weight of the distribution point;
and respectively judging whether the optimal distribution route with lower distribution cost exists in each primary distribution point according to the sequence from high to low of the score of each primary distribution point.
Optionally, the dividing the target distribution network into a plurality of sub-networks includes:
taking a distribution point directly connected with the warehouse in the target distribution network as a reference distribution point;
for each reference distribution point, dividing a distribution point in the target distribution network, which has a direct or indirect connection relation with the reference distribution point, and the basic distribution point into an initial sub-network;
and processing each initial sub-network according to the magnitude relation between the sum of the required cargo weights of each distribution point in each initial sub-network and the load threshold value, so that the sum of the required cargo weights of each distribution point in any sub-network is not greater than the load threshold value.
Optionally, before the calculating the delivery time duration corresponding to each of the sub-networks, the method further includes:
and merging at least two sub-networks meeting the preset merging rules into one sub-network.
Optionally, before the calculating the delivery time duration corresponding to each of the sub-networks, the method further includes:
judging whether distribution point change occurs in the target distribution network;
and if the target distribution network has distribution point change, updating the target distribution network.
In a second aspect, the present invention provides a logistics distribution apparatus, comprising:
an obtaining unit, configured to obtain basic information that affects a distribution process, where the basic information includes: the position of the cargo compartment, the position and the required cargo weight of each distribution point, and the load threshold and the working time threshold of the distribution vehicle;
the first generation unit is used for generating a target distribution network according to the position of the warehouse and the position of each distribution point;
the dividing unit is used for dividing the target distribution network into a plurality of sub-networks, and the sum of the required cargo weights of distribution points included in any sub-network is not greater than the load threshold;
a calculating unit, configured to calculate a delivery duration corresponding to each of the sub-networks;
a determining unit, configured to determine the required number of the delivery vehicles and the sub-networks corresponding to the delivery vehicles according to the delivery time length corresponding to each sub-network and the operating time length threshold;
and a second generation unit configured to generate a distribution route of each of the distribution vehicles, respectively, based on the sub-network corresponding to each of the distribution vehicles.
In a third aspect, the present invention provides a computer-readable storage medium, on which computer instructions are stored, the computer instructions being executed to perform the steps of the logistics distribution method according to any one of the first aspect of the present invention.
Based on the technical scheme, the logistics distribution method provided by the invention divides the target distribution network into a plurality of sub-networks after the target distribution network is generated based on the positions of the warehouse and the positions of the distribution points, and the sum of the demanded cargo weights of the distribution points included within any one sub-network is not greater than the load threshold of the distribution vehicle, determining the required number of the delivery vehicles and the sub-networks corresponding to the delivery vehicles according to the delivery time length corresponding to each sub-network and the working time length threshold of the delivery vehicles, the logistics distribution method provided by the invention determines the required number of the distribution vehicles and the distribution routes of the distribution vehicles by comprehensively considering the load threshold and the working time threshold of the distribution vehicles, and can effectively solve the problem of urban logistics distribution in the prior art.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to these drawings without creative efforts.
Fig. 1 is a flow chart of a logistics distribution method provided by an embodiment of the invention;
FIG. 2 is a schematic diagram of an initial distribution network according to an embodiment of the present invention;
FIG. 3 is a schematic structural diagram of a target distribution network according to an embodiment of the present invention;
fig. 4 is a block diagram of a logistics distribution apparatus according to an embodiment of the present invention;
fig. 5 is a block diagram of another logistics distribution apparatus provided in the embodiment of the invention;
fig. 6 is a block diagram of a logistics distribution apparatus according to another embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Referring to fig. 1, fig. 1 is a flowchart of a logistics distribution method according to an embodiment of the present invention, where the method is applicable to an electronic device, and the electronic device may be an electronic device such as a notebook computer, a PC (personal computer), a tablet computer, and the like, which has data processing capability and can run different application software. The flow of the logistics distribution method provided by the embodiment of the invention can comprise the following steps:
and S100, acquiring basic information influencing the distribution process.
In an actual urban logistics distribution process, the supply-demand relationship between a warehouse and a distribution point is often determined, that is, goods are provided to a plurality of distribution points nearby through a certain warehouse, so that basic information influencing the distribution process can be definitely known when the logistics distribution problem of the warehouse is processed in a determined area or determined.
Specifically, the basic information includes: the position of the cargo compartment, the position and the required cargo weight of each distribution point, the load threshold value and the working time threshold value of the distribution vehicle. The weight of the required goods of each distribution point is different due to different scales of the distribution points, goods sales capacity and the like, and in practical application, the weight of the required goods can be determined according to the demand information fed back by each distribution point and historical data; the load threshold value of the delivery vehicle can be determined according to the rated load of the vehicle type specifically selected by the warehouse; the operation time threshold of the delivery vehicle can be determined according to specific operation requirements, for example, the operation time threshold can be set to a legal operation time of 8 hours, and can be floated within a certain range on the basis of the legal operation time threshold.
The specific acquisition process of the basic information can be determined based on the above contents in combination with the actual situation in the actual application, and is not described in detail here.
And S110, generating a target distribution network according to the positions of the warehouse and the positions of the distribution points.
Optionally, in the logistics distribution method provided in the embodiment of the present invention, an initial distribution network is generated based on the positions of the warehouse and the positions of the distribution points, and then the target distribution network is obtained finally after performing pruning processing on the initial distribution network twice.
Specifically, the distribution cost between the warehouse and any one distribution point and the distribution cost between any two distribution points are determined according to the position of the warehouse and the positions of the distribution points. Alternatively, the distribution cost described in the embodiment of the present invention may be expressed by at least one of a distribution distance and a distribution time. It should be noted that, in the case of representing the distribution cost by both the distribution distance and the distribution time, the distribution cost may be combined by setting different weighting coefficients, that is, the distribution cost is a × the distribution distance + b × the distribution time, where a represents a weighting coefficient corresponding to the distribution distance, and b represents a weighting coefficient corresponding to the distribution time.
Further, an initial distribution network may be generated based on the resulting distribution costs.
Optionally, a distribution cost matrix may be constructed on the basis of the obtained distribution cost between the warehouse and any distribution point and the distribution cost between any two distribution points, where rows and columns of the distribution cost matrix are both the warehouse and each distribution point, and correspondingly, an intersection between a row and a column is the distribution cost between the warehouse and the distribution, or between the distribution points. Of course, the intersection points corresponding to the same distribution point are free from distribution cost.
Based on the resulting distribution cost matrix, an initial distribution network may be generated. It should be noted that many methods for generating the initial distribution network in the prior art may be obtained based on Dijkstra algorithm, for example, and the specific generation process of the initial distribution network is not limited in the present invention. For the basic structure of the initial distribution network, reference can be made to fig. 2, in which point H in fig. 2 represents a warehouse, and points other than point H represent distribution points. It should be noted that in actual transportation, "the sum of two sides is greater than the third side" in the triangle may not be true in actual transportation because the route is not always a straight line, i.e., it is not necessarily far/slow from point a to point C via point B.
After the initial distribution network is obtained, the initial distribution network can be corrected according to a preset pruning principle, and finally the target distribution network is obtained. The specific correction process is as follows:
for convenience of description, the distribution point in the resulting initial distribution network directly connected to the warehouse, that is, the distribution point capable of directly reaching the warehouse without passing through any other distribution point, is taken as a primary distribution point. And respectively judging whether each first-level distribution point has an optimized distribution route with lower distribution cost according to a first preset sequence.
Optionally, an embodiment of the present invention provides a first preset scoring function, where a score output by the first preset scoring function is positively correlated with a distribution distance from a distribution point to a warehouse and a required cargo weight of the distribution point, that is, the farther a distribution distance between the distribution point and the warehouse is, the higher a required cargo weight corresponding to the distribution point is, the higher a score of the distribution point is. Based on the first preset scoring function, scoring can be performed on each primary distribution point determined in the content, and then whether an optimized distribution route with lower distribution cost exists in each primary distribution point is respectively judged according to the sequence from high to low of the score of each primary distribution point.
For any one first-level distribution point, if the distribution cost of the first-level distribution point from other distribution points in the initial distribution network to the warehouse is lower than the distribution cost of the first-level distribution point directly reaching the warehouse, the first-level distribution point can be determined to have an optimized distribution route with lower distribution cost, and conversely, if the distribution route with lower distribution cost than the existing route does not exist, the first-level distribution point is determined to have no optimized distribution route with lower distribution cost.
After traversing all the first-level distribution points, if at least one first-level distribution point has an optimized distribution route with lower distribution cost, the initial distribution network is corrected according to the optimized distribution route corresponding to each first-level distribution point, and the specific correction mode can be that the connection between the first-level distribution point with the optimized distribution route and a warehouse is cut off, the distribution network is updated according to the corresponding optimized distribution route until all the first-level distribution points with the optimized distribution route are corrected, the corrected distribution network is obtained, and the first pruning operation of the initial distribution network is realized.
After obtaining the modified distribution network, the distribution point in the modified distribution network connected to only one other distribution point is used as the final distribution point, and in practical applications, the final distribution point often corresponds to the distribution point of the last distribution. And then, respectively judging whether each final-stage distribution point has an optimized distribution route with lower distribution cost according to a second preset sequence.
Optionally, similar to the process of the first pruning operation, the embodiment of the present invention provides a second preset scoring function, where the score output by the second preset scoring function is in positive correlation with the distribution distance from the distribution point to the warehouse and the weight of the goods required by the distribution point, and the score of each final distribution point can be determined by the second preset scoring function, and the specific scoring process may refer to the above contents and is not further expanded here. It should be noted that, although the second preset scoring function and the first preset scoring function are the same in scoring principle, in practical applications, the second preset scoring function and the first preset scoring function may be implemented by using different functional expressions, and specifically, the second preset scoring function and the first preset scoring function need to be set according to the examination emphasis of the first-stage distribution point and the last-stage distribution point in the actual project.
After the scores of the final delivery points are obtained, whether an optimized delivery route with lower delivery cost exists in each final delivery point can be judged according to the sequence from high to low of the scores of the final delivery points. The optimized distribution route of the final distribution point is slightly different from that of the first-level distribution point, and for any final distribution point, if the distribution cost of the final distribution point finally reaching the warehouse through other distribution points except the existing distribution route is lower than that of the existing distribution route, the final distribution point can be judged to have the optimized distribution route.
And if at least one final-stage distribution point has an optimized distribution route with lower distribution cost after traversing all the final-stage distribution points, correcting the corrected distribution route according to the optimized distribution route corresponding to each final-stage distribution point, deleting the distribution route in the corrected distribution network, updating the optimized distribution route corresponding to each final-stage distribution point, finally obtaining a target distribution network, and finishing secondary pruning operation. Optionally, referring to fig. 3, fig. 3 is a schematic structural diagram of a target distribution network according to an embodiment of the present invention, and it can be seen from combining the initial distribution network corresponding to fig. 2 and the target distribution network corresponding to fig. 3 that the target distribution network obtained through two pruning operations has a simpler and clearer distribution route.
And S120, dividing the target distribution network into a plurality of sub-networks, wherein the sum of the required cargo weights of distribution points included in any sub-network is not greater than the load threshold.
In order to solve the problem of reducing the processing difficulty, the logistics distribution method provided by the embodiment of the invention further splits the target distribution network to obtain a plurality of mutually independent sub-networks, so that the MTSP problem is simplified into a plurality of TSPs.
Alternatively, first, a distribution point directly connected to the warehouse in the target distribution network is used as a reference distribution point (which is equivalent to the primary distribution point in the foregoing, and is defined as a reference distribution point herein for distinguishing from the primary distribution point), and for each reference distribution point, the distribution point in the target distribution network, which has a direct or indirect connection relationship with the reference distribution point, and the basic distribution point are divided into an initial sub-network.
Similar to the above, when the network division is performed according to the reference distribution points, the reference distribution points may also be scored, and for this purpose, the embodiment of the present invention provides a third preset scoring function, which mainly relates to two input contents, one of which is the sum of the required cargo weights of the reference distribution points and other distribution points directly or indirectly connected with the reference distribution points, and may be defined as the initial sub-network required cargo weight; the second is the load threshold of the delivery vehicle. In this embodiment, the third predetermined scoring function is inversely related to the difference between the initial subnetwork demand cargo weight and the load threshold.
After the reference distribution points are scored based on the third preset scoring function, the initial sub-networks can be processed according to the order of the scores from high to low, namely according to the magnitude relation between the sum of the required cargo weights of the distribution points in the initial sub-networks and the load threshold value, so that the sum of the required cargo weights of the distribution points in any sub-network is not larger than the load threshold value. That is, any one of the subnets obtained by the processing of this step can be distributed by one distribution vehicle.
Specifically, for each initial sub-network, the size relationship between the weight of the goods required by the initial sub-network of the initial sub-network and the load threshold is judged, and if the weight of the goods required by the initial sub-network does not exceed the distribution threshold, the initial sub-network is directly used as a sub-network; conversely, if the weight of the required cargo of the initial sub-network exceeds the distribution threshold, the initial sub-network needs to be split into at least two sub-networks until the weight of the required cargo of the split network is smaller than the load threshold, so that a plurality of sub-networks are obtained.
When splitting the initial sub-networks, each final distribution point in any initial sub-network may be scored according to a fourth preset scoring function provided by the embodiment of the present invention, and then the sub-branches related to the final distribution point are intercepted from the initial sub-network in an order from high to low according to the scoring, so that the weight of the goods required by the initial sub-network after removing the sub-branches does not exceed the load threshold, and the initial sub-network after removing the sub-branches is further used as the sub-network used in the subsequent steps. Meanwhile, the intercepted subbranch is connected to the origin. And repeating the operation until the whole target distribution network is divided into a plurality of sub-networks which are not connected with each other, and the sum of the required cargo weights of all distribution points in each sub-network is not more than the load threshold of the distribution vehicle.
The fourth preset scoring function is positively correlated with the difference between the total weight of the required cargo of each distribution point included after the sub-branch is deleted from the initial sub-network and the load threshold, and is positively correlated with the distribution distance between the reference distribution point corresponding to the initial sub-network and the final distribution point.
It is conceivable that the above-mentioned division process may also be a case where the obtained plurality of sub-networks may include sub-networks whose sum of the weights of the required goods is much smaller than the loading threshold, and in order to minimize the number of delivery vehicles used, a merging process may be performed on such sub-networks, and at least two sub-networks may be merged into one sub-network.
Optionally, the preset merging rule for merging the sub-networks may be:
1. the sum of the required cargo weights of all distribution points in the sub-networks obtained after combination is still smaller than the load threshold value.
2. The shortest distribution route of the sub-networks after merging is smaller than the sum of the shortest distribution routes of each sub-network before merging.
It should be noted that the two merging conditions need to be satisfied simultaneously. And the shortest distribution route corresponding to each sub-network can be realized based on a K-opt algorithm or other algorithms, and is not expanded here.
And S130, calculating the distribution time length corresponding to each sub-network.
After the target distribution network is divided into a plurality of sub-networks, the distribution time length corresponding to each sub-network needs to be further calculated, so as to prepare for determining the number of distribution vehicles according to the distribution time length of the sub-networks in the subsequent steps.
As mentioned above, the positions of the warehouse and the distribution points are determined, so that for any sub-network, the distribution distance of the distribution points in the sub-network triggered and completed by the warehouse can be definitely determined, and the distribution time length of each sub-network can be obtained naturally on the premise that the vehicle running speed is known. For the calculation of the distribution time length of each sub-network, other calculation methods in the prior art may also be used for calculation, and details are not described here.
And S140, determining the required number of the delivery vehicles and the sub-networks corresponding to the delivery vehicles according to the delivery time length and the working time length threshold corresponding to each sub-network.
In this step, the main principle is to make the best use of each delivery vehicle as possible on the premise of ensuring that the operating time of each delivery vehicle does not exceed the operating time threshold. For example, when the distribution time of the sub-network a is 4 hours, the distribution time of the sub-network B is 3 hours, and the operation time threshold is 8 hours, it means that the operation time of a distribution vehicle is still less than 8 hours all day after the distribution tasks of the sub-networks a and B are completed, in this case, the sub-networks a and B can be allocated to the same distribution vehicle. For another example, the distribution time of the sub-network C is 6 hours, and the distribution time of the other sub-networks is greater than 2 hours, in this case, the distribution vehicle responsible for the distribution task of the sub-network C can only be responsible for the distribution of the sub-network C in one day, and then is in an idle state.
Based on the above, in practical applications, the required number of the distribution vehicles is not higher than the number of the sub-networks, any distribution vehicle may correspond to at least one sub-network, and the sub-networks corresponding to the distribution vehicles are different, and for a sub-network, any sub-network may correspond to only one distribution vehicle.
It is conceivable that, after the processing of this step, when the distribution vehicles distribute the goods to the sub-networks one by one, the problem of TSP is all the issue, that is, how to make one distribution vehicle complete the distribution task of each distribution point in one sub-network.
It should be noted that, when a vehicle is assigned, other assignment methods in the prior art, such as a total route balancing method, a total cargo balancing method, etc., may also be used, and the detailed description is not repeated here, and the specific application may be implemented by referring to the prior art.
S150, a distribution route of each distribution vehicle is generated based on the sub-network corresponding to each distribution vehicle.
As described above, since the MTSP problem has been converted into the TSP problem through the foregoing steps, when this step is executed, the distribution routes of the respective distribution vehicles can be generated based on the sub-networks corresponding to the respective distribution vehicles by referring to the method in the related art, and are not expanded here.
In summary, the logistics distribution method provided by the invention can convert the complex MTSP problem into the more manageable TSP problem, and meanwhile, in the conversion process, the load threshold and the working duration threshold of the distribution vehicles are comprehensively considered, the required number of the distribution vehicles and the distribution routes of each distribution vehicle are determined, and the problem of urban logistics distribution in the prior art can be effectively solved.
Optionally, in practical application, the increase and decrease of the distribution points are inevitably changed, and therefore, the logistics distribution method provided by the embodiment of the invention may further determine whether the distribution point change occurs in the target distribution network before calculating the distribution time duration corresponding to each sub-network, and if the distribution point change occurs in the target distribution network, update the target distribution network.
It is conceivable that the method completes the processing of increasing and decreasing the distribution points on the basis of the target distribution network, and at this time, only the added and deleted nodes need to be modified on the basis of the sub-network, and then the steps of sub-network processing and the like are performed by directly comparing with the original distribution scheme. Since the newly generated result differs from the original result only on a certain branch of the subnetwork. For actually operated transportation personnel, compared with a daily route, the temporarily changed route only generates the change of one or more distribution points, does not influence the whole area and route, is beneficial to maintaining the familiarity of work content and reducing work errors.
Furthermore, the method provided by the embodiment can adapt to the great change of the number of vehicles and the load, timely respond to the temporary addition and deletion of the distribution points, the distributed cargo quantity and the like, and does not influence the whole distribution network, so that the system has certain robustness and high automation degree.
In the following, the logistics distribution device provided by the embodiment of the invention is introduced, and the logistics distribution device described below may be regarded as a functional module architecture that needs to be set in a central device to implement the logistics distribution method provided by the embodiment of the invention; the following description may be cross-referenced with the above.
Fig. 4 is a block diagram of a logistics distribution apparatus according to an embodiment of the present invention, and referring to fig. 4, the logistics distribution apparatus may include:
an obtaining unit 10, configured to obtain basic information that affects a distribution process, where the basic information includes: the position of the cargo compartment, the position and the required cargo weight of each distribution point, and the load threshold and the working time threshold of the distribution vehicle;
a first generating unit 20, configured to generate a target distribution network according to the location of the warehouse and the location of each distribution point;
a dividing unit 30, configured to divide the target distribution network into a plurality of sub-networks, where a sum of required cargo weights of distribution points included in any sub-network is not greater than a load threshold;
a calculating unit 40, configured to calculate a delivery duration corresponding to each sub-network;
a determining unit 50, configured to determine the required number of the delivery vehicles and the sub-networks corresponding to the delivery vehicles according to the delivery duration and the working duration threshold corresponding to each sub-network;
the second generating unit 60 is configured to generate a distribution route of each distribution vehicle based on the sub-network corresponding to each distribution vehicle.
Optionally, the first generating unit 20 is configured to generate the target distribution network according to the location of the warehouse and the location of each distribution point, and includes:
generating an initial distribution network according to the positions of the warehouse and the positions of the distribution points;
and correcting the initial distribution network according to a preset pruning principle to obtain a target distribution network.
Optionally, the first generating unit 20 is configured to generate an initial distribution network according to the location of the warehouse and the location of each distribution point, and includes:
determining the distribution cost from the warehouse to any distribution point and between any two distribution points according to the position of the warehouse and the positions of the distribution points;
an initial delivery network is generated based on the delivery costs.
Optionally, the first generating unit 20 is configured to modify the initial distribution network according to a preset pruning principle to obtain a target distribution network, and includes:
taking a distribution point directly connected with a warehouse in an initial distribution network as a primary distribution point;
respectively judging whether each first-level distribution point has an optimized distribution route with lower distribution cost according to a first preset sequence;
if at least one first-level distribution point has an optimized distribution route with lower distribution cost, correcting the initial distribution network according to the optimized distribution route corresponding to each first-level distribution point to obtain a corrected distribution network;
taking the distribution point which is connected with only one other distribution point in the corrected distribution network as a final distribution point;
respectively judging whether each final-stage distribution point has an optimized distribution route with lower distribution cost according to a second preset sequence;
and if at least one final-stage distribution point has an optimized distribution route with lower distribution cost, correcting the corrected distribution route according to the optimized distribution route corresponding to each final-stage distribution point to obtain the target distribution network.
Optionally, the first generating unit 20 is configured to respectively determine whether each first-level distribution point has an optimized distribution route with lower distribution cost according to a first preset order, and includes:
determining the grade of each primary distribution point according to a first preset grade function;
the score output by the first preset score function is positively correlated with the distribution distance from the distribution point to the warehouse and the required cargo weight of the distribution point;
and respectively judging whether each first-level distribution point has an optimized distribution route with lower distribution cost according to the sequence of the scores of the first-level distribution points from high to low.
Optionally, the dividing unit 30 is configured to divide the target distribution network into a plurality of sub-networks, and includes:
taking a distribution point directly connected with a warehouse in a target distribution network as a reference distribution point;
for each reference distribution point, dividing a distribution point and a basic distribution point which have direct or indirect connection relation with the reference distribution point in a target distribution network into an initial sub-network;
and processing each initial sub-network according to the magnitude relation between the sum of the required cargo weights of each distribution point in each initial sub-network and the load threshold value, so that the sum of the required cargo weights of each distribution point in any sub-network is not greater than the load threshold value.
Optionally, referring to fig. 5, fig. 5 is a block diagram of another logistics distribution apparatus provided in the embodiment of the present invention, and on the basis of the embodiment shown in fig. 4, the logistics distribution apparatus further includes:
a merging unit 70, configured to merge at least two sub-networks meeting a preset merging rule into one sub-network.
Optionally, referring to fig. 6, fig. 6 is a block diagram of a structure of a logistics distribution apparatus according to another embodiment of the present invention, and on the basis of the embodiment shown in fig. 4, the logistics distribution apparatus further includes:
an updating unit 80, configured to determine whether a distribution point change occurs in the target distribution network; and if the target distribution network has distribution point change, updating the target distribution network.
Optionally, the present invention further provides a computer-readable storage medium, on which computer instructions are stored, and when the computer instructions are executed, the steps of the logistics distribution method according to any one of the above embodiments of the present invention are executed.
The embodiments in the present description are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same and similar parts among the embodiments are referred to each other. The device disclosed by the embodiment corresponds to the method disclosed by the embodiment, so that the description is simple, and the relevant points can be referred to the method part for description.
Those of skill would further appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both, and that the various illustrative components and steps have been described above generally in terms of their functionality in order to clearly illustrate this interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
The steps of a method or algorithm described in connection with the embodiments disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. A software module may reside in Random Access Memory (RAM), memory, Read Only Memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (10)
1. A logistics distribution method, comprising:
acquiring basic information influencing a distribution process, wherein the basic information comprises: the position of the cargo compartment, the position and the required cargo weight of each distribution point, and the load threshold and the working time threshold of the distribution vehicle;
generating a target distribution network according to the positions of the warehouse and the positions of the distribution points;
dividing the target distribution network into a plurality of sub-networks, wherein the sum of the required cargo weights of distribution points included in any sub-network is not greater than the load threshold;
calculating the corresponding distribution time length of each sub-network;
determining the required number of the distribution vehicles and the sub-networks corresponding to the distribution vehicles according to the distribution time length corresponding to each sub-network and the working time length threshold;
and respectively generating a distribution route of each distribution vehicle according to the sub-network corresponding to each distribution vehicle.
2. The logistics distribution method of claim 1, wherein the generating of the target distribution network according to the location of the warehouse and the location of each distribution point comprises:
generating an initial distribution network according to the positions of the warehouse and the positions of the distribution points;
and correcting the initial distribution network according to a preset pruning principle to obtain a target distribution network.
3. The logistics distribution method of claim 2, wherein the generating an initial distribution network based on the location of the warehouse and the location of each distribution point comprises:
determining the distribution cost from the warehouse to any one distribution point and between any two distribution points according to the position of the warehouse and the position of each distribution point;
and generating an initial distribution network according to the distribution cost.
4. The logistics distribution method of claim 3, wherein the modifying the initial distribution network according to the preset pruning principle to obtain the target distribution network comprises:
taking a distribution point directly connected with the warehouse in the initial distribution network as a primary distribution point;
respectively judging whether each primary distribution point has an optimized distribution route with lower distribution cost according to a first preset sequence;
if at least one first-level distribution point has an optimized distribution route with lower distribution cost, correcting the initial distribution network according to the optimized distribution route corresponding to each first-level distribution point to obtain a corrected distribution network;
taking the distribution point which is connected with only one other distribution point in the corrected distribution network as a final distribution point;
respectively judging whether each final-stage distribution point has an optimized distribution route with lower distribution cost according to a second preset sequence;
and if at least one final-stage distribution point has an optimized distribution route with lower distribution cost, correcting the corrected distribution route according to the optimized distribution route corresponding to each final-stage distribution point to obtain a target distribution network.
5. The logistics distribution method of claim 4, wherein the determining whether each of the primary distribution points has an optimized distribution route with lower distribution cost according to the first preset sequence comprises:
determining the grade of each primary distribution point according to a first preset grade function;
the score output by the first preset score function is positively correlated with the distribution distance from the distribution point to the warehouse and the required cargo weight of the distribution point;
and respectively judging whether the optimal distribution route with lower distribution cost exists in each primary distribution point according to the sequence from high to low of the score of each primary distribution point.
6. The logistics distribution method of claim 1, wherein the dividing the target distribution network into a plurality of sub-networks comprises:
taking a distribution point directly connected with the warehouse in the target distribution network as a reference distribution point;
for each reference distribution point, dividing a distribution point in the target distribution network, which has a direct or indirect connection relation with the reference distribution point, and the basic distribution point into an initial sub-network;
and processing each initial sub-network according to the magnitude relation between the sum of the required cargo weights of each distribution point in each initial sub-network and the load threshold value, so that the sum of the required cargo weights of each distribution point in any sub-network is not greater than the load threshold value.
7. The logistics distribution method of any one of claims 1 to 6, wherein before the calculating of the distribution time period corresponding to each of the sub-networks, the logistics distribution method further comprises:
and merging at least two sub-networks meeting the preset merging rules into one sub-network.
8. The logistics distribution method of any one of claims 1 to 6, wherein before the calculating of the distribution time period corresponding to each of the sub-networks, the logistics distribution method further comprises:
judging whether distribution point change occurs in the target distribution network;
and if the target distribution network has distribution point change, updating the target distribution network.
9. A logistics distribution apparatus, comprising:
an obtaining unit, configured to obtain basic information that affects a distribution process, where the basic information includes: the position of the cargo compartment, the position and the required cargo weight of each distribution point, and the load threshold and the working time threshold of the distribution vehicle;
the first generation unit is used for generating a target distribution network according to the position of the warehouse and the position of each distribution point;
the dividing unit is used for dividing the target distribution network into a plurality of sub-networks, and the sum of the required cargo weights of distribution points included in any sub-network is not greater than the load threshold;
a calculating unit, configured to calculate a delivery duration corresponding to each of the sub-networks;
a determining unit, configured to determine the required number of the delivery vehicles and the sub-networks corresponding to the delivery vehicles according to the delivery time length corresponding to each sub-network and the operating time length threshold;
and a second generation unit configured to generate a distribution route of each of the distribution vehicles, respectively, based on the sub-network corresponding to each of the distribution vehicles.
10. A computer-readable storage medium having computer instructions stored thereon, wherein the computer instructions are operable to perform the steps of the logistics distribution method of any of claims 1-8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110309008.6A CN113011659B (en) | 2021-03-23 | 2021-03-23 | Logistics distribution method and device and computer readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110309008.6A CN113011659B (en) | 2021-03-23 | 2021-03-23 | Logistics distribution method and device and computer readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113011659A true CN113011659A (en) | 2021-06-22 |
| CN113011659B CN113011659B (en) | 2024-03-29 |
Family
ID=76405477
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110309008.6A Active CN113011659B (en) | 2021-03-23 | 2021-03-23 | Logistics distribution method and device and computer readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113011659B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116308018A (en) * | 2023-03-24 | 2023-06-23 | 深圳市凯东源现代物流股份有限公司 | Matching method and device of distribution area and distribution point and storage medium |
| WO2023173992A1 (en) * | 2022-03-15 | 2023-09-21 | 深圳市海柔创新科技有限公司 | Goods delivery method and apparatus, and device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106980912A (en) * | 2017-04-07 | 2017-07-25 | 广东电网有限责任公司佛山供电局 | A kind of multiple spot distribution routing planning method and system |
| CN107977739A (en) * | 2017-11-22 | 2018-05-01 | 深圳北斗应用技术研究院有限公司 | Optimization method, device and the equipment in logistics distribution path |
| CN109902990A (en) * | 2019-01-16 | 2019-06-18 | 江苏玄通供应链股份有限公司 | A kind of supply chain logistics distribution routing planning system |
| CN110390409A (en) * | 2018-04-17 | 2019-10-29 | 北京京东尚科信息技术有限公司 | The determination method, apparatus and computer readable storage medium of distribution project |
-
2021
- 2021-03-23 CN CN202110309008.6A patent/CN113011659B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106980912A (en) * | 2017-04-07 | 2017-07-25 | 广东电网有限责任公司佛山供电局 | A kind of multiple spot distribution routing planning method and system |
| CN107977739A (en) * | 2017-11-22 | 2018-05-01 | 深圳北斗应用技术研究院有限公司 | Optimization method, device and the equipment in logistics distribution path |
| CN110390409A (en) * | 2018-04-17 | 2019-10-29 | 北京京东尚科信息技术有限公司 | The determination method, apparatus and computer readable storage medium of distribution project |
| CN109902990A (en) * | 2019-01-16 | 2019-06-18 | 江苏玄通供应链股份有限公司 | A kind of supply chain logistics distribution routing planning system |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2023173992A1 (en) * | 2022-03-15 | 2023-09-21 | 深圳市海柔创新科技有限公司 | Goods delivery method and apparatus, and device |
| CN116308018A (en) * | 2023-03-24 | 2023-06-23 | 深圳市凯东源现代物流股份有限公司 | Matching method and device of distribution area and distribution point and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113011659B (en) | 2024-03-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Park | A hybrid genetic algorithm for the vehicle scheduling problem with due times and time deadlines | |
| CN113011659A (en) | Logistics distribution method and device and computer readable storage medium | |
| Kılıç et al. | A demand based route generation algorithm for public transit network design | |
| CN105550225B (en) | Index structuring method, querying method and device | |
| JP2020060563A (en) | Plural vehicle route planning method and plural vehicle route planning system | |
| CN111860858B (en) | Method and device for determining model updating parameters and readable storage medium | |
| Saeed et al. | Enhancing the service quality of transit systems in rural areas by flexible transport services | |
| CN115062868B (en) | Pre-polymerization type vehicle distribution path planning method and device | |
| Herrero et al. | Solving vehicle routing problems with asymmetric costs and heterogeneous fleets | |
| US20140074541A1 (en) | Stack handling operation method, system, and computer program | |
| EP3786816A1 (en) | Local search with global view for large scale combinatorial optimization | |
| CN110727746B (en) | Buffer analysis parallel scheduling method and device based on secondary task division strategy | |
| JP2022032678A (en) | Collection and delivery plan optimization device, collection and delivery plan optimization method and program | |
| CN113034088A (en) | Warehouse logistics task scheduling method and device, electronic equipment and storage medium | |
| Senna et al. | An exact method for a last-mile delivery routing problem with multiple deliverymen | |
| Diastivena et al. | Grey Wolf Optimizer algorithm for solving the multi depot vehicle routing problem and its implementation | |
| Bruniecki et al. | Evaluation of vehicle routing problem algorithms for transport logistics using dedicated GIS system | |
| US9952055B2 (en) | Method for determining correction values for a route calculation algorithm | |
| CN117195441A (en) | Method and related device for generating intersection surface | |
| Christiansen et al. | A branch-and-cut-and-price algorithm for the multi-depot capacitated vehicle routing problem with stochastic demands | |
| Cipta et al. | Optimal Vehicle Routing Problem (VRP) For the distribution of medical devices by applying the clarke-wright algorithm | |
| JP7042322B1 (en) | Decision support device, decision support program and decision support method | |
| CN116628119B (en) | Road section starting and ending point name assignment method, device, equipment and medium | |
| Sangeetha et al. | Fuzzy Transportation Problem is Solved Utilizing Simple Arithmetic Operations, Advanced concept, and Ranking techniques | |
| Zhu et al. | The capacitated vehicle routing problem with drones considering stochastic demands and restricted return trip |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |