An Optimization Method and System for Coal Transfer Points Based on the Internet of Things

Abstract

The present invention relates to the field of coal transportation, and specifically relates to an optimization method and system for coal transfer points based on the Internet of Things. The method includes: obtaining order information of the starting point, where the order information includes multiple end points; using a path planning algorithm to obtain a first path of the order information and second paths of each end point; calculating candidate values of each position point in the first path; sequentially adding each position point to the transfer point set in descending order of the candidate values, and calculating the efficiency value of the transfer point set; plotting an efficiency value curve, and taking the transfer point set at the inflection point in the efficiency value curve as the optimization result. Through the technical solution of the present invention, when there is no intersection position in the historical order route, the position of the transfer point can be accurately located, and the optimization result of the transfer point can be obtained.

Description

Technical Field

[0001] The present invention relates to the field of coal transportation. More specifically, the present invention relates to an optimization method and system for coal transfer points based on the Internet of Things. Background Art

[0002] Coal transportation is to transport the mined coal from the mining location to the using location, which is an important part of coal mining; during the coal transportation process, an order from multiple using locations is often received at one mining location. To improve the efficiency of coal transportation, it is often necessary to set up transfer points between the mining location and multiple using locations. The coal can be first transported from the mining location to the transfer point and then from the transfer point to multiple using locations.

[0003] Currently, the patent application document with the publication number CN107578131A discloses a large-scale logistics path planning system, which includes a transfer optimal recommendation system. By introducing self-learning or optimization technology, the transfer optimal recommendation system can plan the optimal transfer point according to historical data. Specifically, it includes: collecting logistics data D for a period of time; according to the historical data of the logistics order route, counting the positions where the routes intersect, and selecting n positions from the positions where the routes frequently intersect as candidate transfer points C1, C2,..., Cn; evaluating the candidate transfer point C1, adding the transfer point C1 to the logistics system, simulating the historical logistics orders using the logistics data D, and calculating the required operating cost Hc1 for completing these historical logistics orders; successively simulating the operating costs Hc1, Hc2, Hc3,..., Hcn of n transfer points according to the above steps of evaluating the candidate transfer points, and taking the transfer point corresponding to the minimum value as the optimal transfer point to complete the selection of the optimal transfer point.

[0004] The above method directly uses the positions where the routes frequently intersect as candidate transfer points, and then realizes the selection of the optimal transfer point. However, when there is no intersection position in the logistics order route, the above method cannot optimize the transfer point. Therefore, there is an urgent need for an optimization method for transfer points when there is no intersection position in the logistics order route. Summary of the Invention

[0005] To solve the technical problem that the transfer point cannot be optimized when there is no intersection position in the order route, the present invention provides solutions in the following aspects.

[0006] In a first aspect, an Internet of Things-based optimization method for coal transfer points includes: obtaining order information of a starting point, where the order information includes multiple end points; using a path planning algorithm to obtain a first path of the order information and a second path of each end point, the first path including the starting point and multiple end points, and the second path including the starting point and the corresponding end point; calculating a candidate value for each position point in the first path, where the candidate value is the difference between the number of occurrences of the previous adjacent position point in the second path and the number of occurrences of the next adjacent position point in the second path; adding each position point to the transfer point set in order from largest to smallest candidate value, and calculating the efficiency value of the transfer point set, including: using the end point corresponding to the second path that starts from the transfer point and has no overlapping area with the first path as the transfer end point; deleting the transfer end point in the first path to obtain a third path; using the third path and the second path between the transfer point and each transfer end point as the transfer path; the efficiency value is positively correlated with the length difference between the first path and the transfer path; drawing an efficiency value curve, and using the transfer point set at the inflection point of the efficiency value curve as the optimization result.

[0007] By adopting the above technical solution, the first path from the starting point to multiple end points and the second path from the starting point to each end point are determined according to the order information of the starting point; the candidate value of each position point in the first path is calculated, and each position point is added to the transfer point set in order from largest to smallest candidate value. After setting the transfer point according to the transfer point set, the transfer path corresponding to the transfer point set is obtained, and the efficiency value of each transfer point set is calculated based on the length of the transfer path and the driving cost of each position point. The larger the efficiency value, the more effectively the transportation length and transportation cost can be reduced after setting the transfer point according to the transfer point set; further, draw an efficiency value curve. As the number of transfer points continues to increase, in order to maintain the normal operation of the transfer points, the labor cost and operating cost that need to be invested will also continue to increase. Obtain the inflection point in the efficiency value curve. Before the inflection point, the change range of the efficiency value is relatively large, and after the inflection point, the change range of the efficiency value tends to be stable. Therefore, use the transfer point set corresponding to the inflection point of the efficiency value curve as the optimization result to balance the input cost of the transfer point and the efficiency value of coal transportation. When there is no need to collect historical order routes or there is no intersection in the historical order routes, the position of the transfer point can be accurately located to obtain the transfer point optimization result.

[0008] In one embodiment, the method for obtaining the first path includes: obtaining the permutations and combinations of each end point, using a path planning algorithm to obtain the initial paths of each permutation and combination, and using the initial path with the minimum length as the first path.

[0009] The shortest path for transporting coal from the starting point to multiple end points in sequence without setting transfer points is determined.

[0010] In one embodiment, the path planning algorithm is Dijkstra algorithm, A* algorithm or LPA* algorithm.

[0011] In one embodiment, the candidate values of the position points are:

[0012] , and are respectively the occurrence times of the position points and the position points in all the second paths.

[0013] It can quantify the effect of setting transfer points at each position in the first path. If the candidate value of a position point is larger, it means that after using this position point as a transfer point, more end points can transport coal according to the corresponding second path, and the effect of setting a transfer point at this position is better.

[0014] In one embodiment, the efficiency value of the transfer point set is:

[0015] , is the length of the first path, is the length of the transfer path, is the Relu activation function.

[0016] When , it means that the driving length during coal transportation is not reduced after setting the transfer point, and the Relu activation function sets to 0, that is, ; when , it means that setting the transfer point can reduce the driving length during coal transportation, and the output of the Relu activation function is , which is used as the efficiency value of the transfer point set .

[0017] In one embodiment, the order information further includes the order volume of each end point, and calculating the efficiency value of the transfer point set further includes: respectively taking the sum of the driving costs of each position point in the first path and the transfer path as the first cost and the transfer cost; the efficiency value is positively correlated with the difference between the first cost and the transfer cost; the driving cost is the sum of the order volumes of the end points after the position point in the corresponding path.

[0018] After setting the transfer points, the load of the vehicles at different positions in the transfer path is different, and the greater the load, the higher the energy consumption of the vehicle. That is to say, the greater the load, the higher the transportation cost of coal. Therefore, when calculating the efficiency value of the set of transfer points, it is also necessary to consider the load at each position in the transfer path to achieve accurate calculation of the efficiency value.

[0019] In one embodiment, the efficiency value of the set of transfer points is:

[0020] , is the length of the first path, is the length of the transfer path, is the first cost, is the transfer cost, is the Relu activation function.

[0021] In one embodiment, after obtaining the optimization result, the optimization method further includes: counting the occurrence times of each transfer point in the optimization results of multiple starting points, and selecting the top M transfer points in descending order of the occurrence times.

[0022] Usually, the number of starting points is more than one, and as the number of transfer points increases continuously, the labor cost and operation cost will also increase continuously. After setting the maximum number M of transfer points according to the preset cost, the final position of the transfer points can be determined by integrating the optimization results of all starting points.

[0023] In one embodiment, M is set according to the preset cost.

[0024] In a second aspect, an optimization system for coal transfer points based on the Internet of Things includes: a processor and a memory, and the memory stores computer program instructions, which implement any one of the optimization methods for coal transfer points based on the Internet of Things when the computer program instructions are executed by the processor.

[0025] The present invention has the following effects:

[0026] Determine the first path from the starting point to multiple end points and the second path from the starting point to each end point according to the order information of the starting point; calculate the candidate values of each position point in the first path, and add each position point to the transfer point set in order from largest to smallest according to the candidate values. After setting the transfer points based on the transfer point set, obtain the transfer path corresponding to the transfer point set, and calculate the efficiency value of each transfer point set according to the length of the transfer path and the driving cost of each position point. The larger the efficiency value, the more effectively the transportation length and transportation cost can be reduced after setting the transfer points according to the transfer point set; further, draw an efficiency value curve. As the number of transfer points continues to increase, in order to maintain the normal operation of the transfer points, the labor cost and operation cost that need to be invested will also continue to increase. Obtain the inflection point in the efficiency value curve. Before the inflection point, the change range of the efficiency value is large, while after the inflection point, the change range of the efficiency value tends to be stable. Therefore, use the transfer point set corresponding to the inflection point in the efficiency value curve as the optimization result to balance the input cost of the transfer points and the efficiency value of coal transportation. When there is no need to collect historical order routes or there is no intersection in the historical order routes, the position of the transfer points can be accurately located to obtain the optimized result of the transfer points. BRIEF DESCRIPTION OF THE DRAWINGS

[0027] Figure 1 It is a flowchart of the method in steps S1-S5 of an optimization method for coal transfer points based on the Internet of Things according to an embodiment of the present invention.

[0028] Figure 2 It is a schematic diagram of the first path and the second path of the end point 3 according to an embodiment of the present invention.

[0029] Figure 3 It is a schematic diagram of the transfer path according to an embodiment of the present invention.

[0030] Figure 4 A structural block diagram of an optimization system for coal transfer points based on the Internet of Things according to an embodiment of the present invention. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0031] Next, the technical solutions in the embodiments of the present invention will be clearly and completely described in conjunction with the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, rather than all of the embodiments.

[0032] Next, the specific embodiments of the present invention will be described in detail with reference to the accompanying drawings.

[0033] Refer to Figure 1 , an optimization method for coal transfer points based on the Internet of Things includes steps S1-S5, specifically as follows:

[0034] S1: Obtain the order information of the starting point, and the order information includes multiple end points.

[0035] In one embodiment, the starting point can be a location that can provide coal, such as a coal mine, a mining location, or a coal storage location, and the ending point is a location with a demand for coal. The order information of the starting point includes multiple ending points, and the starting point needs to supply coal to the multiple ending points in the order information.

[0036] In other embodiments, the order information further includes the order quantity of multiple ending points; that is, the weight of coal ordered by each ending point.

[0037] S2: Use a path planning algorithm to obtain the first path of the order information and the second path of each ending point. The first path includes the starting point and multiple ending points, and the second path includes the starting point and the corresponding ending point.

[0038] In one embodiment, the first path is the shortest path for transporting coal from the starting point to multiple ending points; the method for obtaining the first path includes: obtaining the permutations and combinations of each ending point, using a path planning algorithm to obtain the initial paths of each permutation and combination, and taking the initial path with the minimum length as the first path.

[0039] Among them, the path planning algorithm is the Dijkstra algorithm, the A* algorithm, or the LPA* algorithm.

[0040] Exemplarily, if the number of ending points in the order information is 3, denoted as , and , then there are 6 permutations and combinations of each ending point; taking the permutation and combination as an example, first use a path planning algorithm to obtain the shortest path from the starting point to the ending point , then sequentially obtain the shortest path from the ending point to the ending point , and the shortest path from the ending point to the ending point . Combine the shortest path , the shortest path , and the shortest path to form a complete path as the initial path of the permutation and combination ; in this way, the initial paths of each permutation and combination are obtained, and the first path is the initial path with the minimum length.

[0041] In one embodiment, each ending point in the order information corresponds to a second path, which is the shortest path for transporting coal from the starting point to the corresponding ending point. The shortest path of each ending point can be obtained by a path planning algorithm, which will not be elaborated here.

[0042] Thus, a first path of the starting point order information and second paths of each end point in the order information are obtained; the first path is the shortest path for transporting coal from the starting point to each end point, and the second path of an end point is the shortest path for transporting coal from the starting point to that end point.

[0043] S3: Calculate the candidate values of each position point in the first path, where the candidate value is the difference between the number of occurrences of the previous adjacent position point in the second path and the number of occurrences of the next adjacent position point in the second path.

[0044] In one embodiment, please refer to Figure 2 , which is a schematic diagram of the first path and the second path of the end point 3 in the embodiment of the present invention. The first path starts from the starting point, passes through the end point 1 and the end point 2 in sequence, and reaches the end point 3; the second path of the end point 3 starts from the starting point, passes through the end point 1 and then directly reaches the end point 3; and there is partial overlap between the first path and the second path of the end point 3, and it bifurcates at the end point 1, and the end point 1 is denoted as the bifurcation point.

[0045] It can be understood that in the case where no transfer point is set, the vehicle transports coal along the first path. After the vehicle reaches the end point 1, it unloads according to the order quantity of the end point 1, and then continues to reach the end point 2 along the first path and unloads according to the order quantity of the end point 2; finally, it reaches the end point 3 to complete the order information. If a transfer point is set at the bifurcation point (end point 1), during the process of the vehicle transporting coal along the first path, after reaching the end point 1 and unloading according to the order quantity of the end point 1, the order quantity of the end point 3 is unloaded to the transfer point (i.e., the end point 1), and then the vehicle continues to reach the end point 2 along the first path. At the same time, there will be another vehicle at the transfer point transporting the order quantity of the end point 3 to the end point 3 along the second path; the order information is completed.

[0046] Thus, before and after setting the transfer point, the transportation path of coal will change, and the transfer point can provide transportation vehicles, thereby achieving the transfer effect. Moreover, the transportation path to the end point 3 after transfer is the shortest path from the starting point to the end point 3 (the second path of the end point 3), which improves the transportation efficiency of coal.

[0047] Therefore, for each position point in the first path, the difference between the number of occurrences of the previous adjacent position point in the second path and the number of occurrences of the next adjacent position point in the second path is used as the candidate value. If the candidate value of a position point is larger, it means that after using this position point as the transfer point, more end points can transport coal according to the corresponding second path, and the effect of setting the transfer point at this position point is better. The candidate value of the position point is: as follows:

[0048] , and are the occurrence times of location points and location points in all second paths, respectively.

[0049] In this way, the candidate values of each location point in the first path are obtained. The larger the candidate value is, the more end points can transport coal according to the second path (the shortest path from the starting point to the end point) after setting the location point as the transfer point, and the better the effect of setting the location point as the transfer point is.

[0050] S4: Add each location point to the transfer point set in order from largest to smallest candidate value, and calculate the efficiency value of the transfer point set.

[0051] In one embodiment, the larger the candidate value of a location point is, the better the effect of setting the location point as the transfer point is. Therefore, add each location point to the transfer point set in order from largest to smallest candidate value, and calculate the efficiency value of the transfer point set.

[0052] Specifically, calculating the efficiency value of the transfer point set includes: using the end point corresponding to the second path that starts from the transfer point and has no overlapping area with the first path as the transfer end point; deleting the transfer end point in the first path to obtain the third path; using the third path and the second path between the transfer point and each transfer end point as the transfer path; the efficiency value is positively correlated with the length difference between the first path and the transfer path.

[0053] The transfer point set 's efficiency value is:

[0054] , is the length of the first path, is the length of the transfer path, is the Relu activation function. Among them, when , it means that the driving length during coal transportation is not reduced after setting the transfer point, and the Relu activation function sets to 0, that is ; when , it means that setting the transfer point can reduce the form length during coal transportation, and the output of the Relu activation function is , as the efficiency value of the transfer point set .

[0055] Exemplarily, please refer to Figure 3, which is a schematic diagram of the transfer path in an embodiment of the present invention; the transfer point set only includes one transfer point, i.e., termination point 1; starting from the transfer point, a total of 3 second paths can be obtained, which are the second path to termination point 2 (coinciding with the first path), the second path to termination point 3, and the second path to termination point 4; the second paths that do not overlap with the first path are the second path to termination point 3 and the second path to termination point 4. Therefore, termination point 3 and termination point 4 are transfer termination points; further, the transfer termination points in the first path are deleted, that is, termination point 3 and termination point 4 in the first path are removed. The third path is the part from the starting point to termination point 1 and then from termination point 1 to termination point 2 in the first path; then the transfer path of the transfer point set includes the third path, the second path between the transfer point and transfer termination point 3, and the second path between the transfer point and transfer termination point 4.

[0056] It can be understood that the vehicle starts from the starting point with the order quantities of all termination points. After arriving at termination point 1, the order quantity of termination point 1 is unloaded from the vehicle to complete the delivery of termination point 1. After unloading the order quantities of termination point 3 and termination point 4 at the transfer point, the vehicle continues to drive to termination point 2 to complete the delivery of termination point 2; at the same time, at the transfer point, there will be other vehicles carrying the order quantities of termination point 3 and termination point 4 to complete the delivery of termination point 3 and termination point 4. In this way, the order information at the starting point is completed.

[0057] In another embodiment, after setting the transfer point, the transportation path of coal will change. More termination points can be transported according to the shortest path from the starting point to the termination point, reducing the total length of the transportation path of the order information and improving the transportation efficiency. In addition, the load of the vehicle at different position points in the transfer path is different, and the greater the load, the higher the energy consumption of the vehicle. That is to say, the greater the load, the higher the transportation cost of coal. Therefore, when calculating the efficiency value of the transfer point set, the load at each position point in the transfer path also needs to be considered, and the load is related to the order quantity of each termination point.

[0058] Specifically, the order information further includes the order quantity of each termination point. The calculation of the efficiency value of the transfer point set includes: respectively taking the sum of the driving costs of each position point in the first path and the transfer path as the first cost and the transfer cost; the efficiency value is positively correlated with the difference between the first cost and the transfer cost; the driving cost is the sum of the order quantities of the termination points after the position point in the corresponding path.

[0059] It can be understood that for any position point in the first path, the load of the vehicle at this position point should be at least equal to the sum of the order quantities of the termination points after this position point to meet the coal demand of the termination points after this position point. And the load can reflect the vehicle energy consumption. Therefore, the sum of the order quantities of the termination points after the position point in the first path can represent the driving cost of the vehicle at this position point in the first path.

[0060] After considering the order volumes at each termination point, the transfer point set of efficiency values is as follows:

[0061] , is the length of the first path, is the length of the transfer path, is the first cost, is the transfer cost, is the Relu activation function.

[0062] Thus, after setting the transfer points according to the transfer point set, the transfer paths corresponding to the transfer point set are obtained, and the efficiency values of each transfer point set are calculated based on the length of the transfer path and the driving costs of each location point. The larger the efficiency value, the more effectively the transportation length and transportation cost can be reduced after setting the transfer points according to the transfer point set.

[0063] S5: Plot the efficiency value curve, and use the transfer point set at the inflection point of the efficiency value curve as the optimization result.

[0064] In one embodiment, each transfer point set corresponds to an efficiency value. New location points are continuously added to the transfer point set, and the efficiency values of each transfer point set are calculated to obtain the efficiency value curve; the abscissa of the efficiency value curve is the transfer point set with different numbers of location points, and the ordinate is the efficiency value of each transfer point set.

[0065] As the number of transfer points continues to increase, in order to maintain the normal operation of the transfer points, the labor cost and operating cost that need to be invested will also continue to increase. Obtain the inflection point in the efficiency value curve. Before the inflection point, the change range of efficiency is relatively large, while after the inflection point, the change range of efficiency tends to be stable. Therefore, use the transfer point set corresponding to the inflection point in the efficiency value curve as the optimization result. When there is no need to collect historical order routes or there is no intersection in the historical order routes, the location of the transfer points can be accurately located to obtain the transfer point optimization result.

[0066] In other embodiments, usually the number of starting points is more than one, and as the number of transfer points continues to increase, the labor cost and operating cost will also continue to increase. The maximum number M of transfer points can be set according to the preset cost. The optimization method further includes: counting the occurrence times of each transfer point in the optimization results of multiple starting points, and selecting the top M transfer points in descending order of the occurrence times.

[0067] The present invention also provides an optimization system for coal transfer points based on the Internet of Things. Figure 4 is a structural block diagram of an optimization system for coal transfer points based on the Internet of Things according to an embodiment of the present invention. As Figure 4As shown, the system 50 includes a processor and a memory. The memory stores computer program instructions which, when executed by the processor, implement an optimization method for coal transfer points based on the Internet of Things according to the present invention. The system also includes a communication bus, a communication interface, and other components well-known to those skilled in the art. Their settings and functions are known in the art, so they will not be elaborated here.

[0068] It should be noted that for those of ordinary skill in the art, without departing from the concept of the present application, several modifications and improvements can still be made, and these all fall within the protection scope of the present application. Therefore, the protection scope of the patent of the present application shall be subject to the appended claims.

Claims

1. An optimization method for coal transfer points based on the Internet of Things, characterized in that, The optimization method includes: obtaining order information of the starting point, where the order information includes multiple end points; using a path planning algorithm to obtain a first path of the order information and second paths of each end point. The first path includes the starting point and multiple end points, and the second path includes the starting point and the corresponding end point. The second path is the shortest path from the starting point to the end point; calculating candidate values of each position point in the first path. The candidate value is the difference between the number of occurrences of the previous adjacent position point in the second path and the number of occurrences of the next adjacent position point in the second path; successively adding each position point to the transfer point set in descending order of the candidate value, and calculating the efficiency value of the transfer point set, including: taking the end point corresponding to the second path that starts from the transfer point and has no overlapping area with the first path as the transfer end point; deleting the transfer end point in the first path to obtain a third path; taking the third path and the second paths from the transfer point to each transfer end point as the transfer paths; the efficiency value is positively correlated with the length difference between the first path and the transfer paths; drawing an efficiency value curve, and taking the transfer point set at the inflection point in the efficiency value curve as the optimization result; The method for obtaining the first path includes: obtaining permutations and combinations of each end point, using a path planning algorithm to obtain initial paths of each permutation and combination, and taking the initial path with the minimum length as the first path; Transfer point set The efficiency value is: , is the length of the first path, is the length of the transfer path, is the Relu activation function; The order information further includes the order volume of each end point, and the calculating of the efficiency value of the transfer point set further includes: respectively taking the sum of the driving costs of each position point in the first path and the transfer paths as the first cost and the transfer cost; the efficiency value is positively correlated with the difference between the first cost and the transfer cost; the driving cost is the sum of the order volumes of the end points after the position point in the corresponding path; or Transfer point set The efficiency value is as follows: , is the first cost, is the transfer cost.

2. The optimization method for coal transfer points based on the Internet of Things according to claim 1, wherein the path planning algorithm is Dijkstra algorithm, A* algorithm or LPA* algorithm.

3. The optimization method for coal transfer points based on the Internet of Things according to claim 1, characterized in that, Position point Candidate values are as follows: , and are the occurrence times of the position points and the position points in all the second paths, respectively.

4. A method for optimizing coal transfer points based on the Internet of Things according to claim 1, characterized in that, After obtaining the optimization result, the optimization method further includes: counting the number of occurrences of each transfer point in the optimization results of multiple starting points, and selecting the top M transfer points in descending order of the number of occurrences.

5. The optimization method for coal transfer points based on the Internet of Things according to claim 4, characterized in that M is set according to a preset cost.

6. An optimization system for coal transfer points based on the Internet of Things, characterized in that, including: a processor and a memory, where the memory stores computer program instructions, and when the computer program instructions are executed by the processor, the optimization method for coal transfer points based on the Internet of Things according to any one of claims 1-5 is implemented.

Images