Coal transfer point optimization method and system based on Internet of Things

Abstract

The invention relates to the field of coal transportation, in particular to a coal transfer point optimization method and system based on the Internet of Things, and the method comprises the steps: obtaining the order information of a starting point, the order information comprising a plurality of termination points; acquiring a first path of the order information and a second path of each termination point by using a path planning algorithm; calculating a candidate value of each position point in the first path; sequentially adding the position points to the transfer point set according to the descending order of the candidate values, and calculating the efficiency value of the transfer point set; and drawing an efficiency value curve, and taking a transfer point set of inflection points in the efficiency value curve as an optimization result. According to the technical scheme of the invention, when the historical order route does not have the cross position, the position of the transfer point can be accurately positioned, and the optimization result of the transfer point is obtained.

Description

Technical Field

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

[0002] Coal transportation is the transportation of mined coal from the mining location to the use location, and is an important part of coal mining. During the coal transportation process, one mining location often receives orders from multiple use locations. In order to improve the efficiency of coal transportation, it is often necessary to set up transfer points between the mining location and multiple use locations. The coal can be first transported from the mining location to the transfer point, and then transported from the transfer point to multiple use locations.

[0003] At present, a patent application document with publication number CN107578131A discloses a large-scale logistics path planning system, which includes a transshipment optimal suggestion system. The transshipment optimal suggestion system can plan the optimal transshipment point according to historical data by introducing self-learning or optimization technology, specifically including: collecting logistics data D within a period of time; according to the historical data of logistics order routes, counting the locations where the routes intersect, and selecting n from the locations where the routes frequently intersect as candidate transshipment points C1, C2, ..., Cn; evaluating the candidate transshipment point C1, adding the transshipment point C1 to the logistics system, using the logistics data D to simulate the historical logistics orders, and calculating the operating cost Hc1 required to complete these historical logistics orders; according to the above steps of evaluating the candidate transshipment points, the operating costs Hc1, Hc2, Hc3, ..., Hcn of the n transshipment points are simulated in turn, and the transshipment point corresponding to the minimum value is taken as the optimal transshipment point, and the selection of the optimal transshipment point is completed.

[0004] The above method directly takes the locations where routes frequently intersect as candidate transfer points, thereby realizing the selection of the optimal transfer point. However, when there is no intersection in the logistics order routes, the above method cannot achieve the optimization of the transfer points. Therefore, there is an urgent need for a method for optimizing transfer points when there is no intersection in the logistics order routes. Summary of the invention

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

[0006] In a first aspect, a method for optimizing coal transfer points based on the Internet of Things includes: obtaining order information of a starting point, the order information including multiple termination points; obtaining a first path of the order information and a second path of each termination point using a path planning algorithm, the first path including a starting point and multiple termination points, and the second path including a starting point and a corresponding termination point; calculating a candidate value for each position point in the first path, the candidate value being 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 a transfer point set in descending order of the candidate value, and calculating the efficiency value of the transfer point set, including: taking the termination point corresponding to the second path starting from the transfer point and having no overlapping area with the first path as the transfer termination point; deleting the transfer termination point in the first path to obtain a third path; taking the third path and the second path from the transfer point to each transfer termination 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 taking the transfer point set of the inflection point in the efficiency value curve as the optimization result.

[0007] By adopting the above technical solution, a first path from the starting point to multiple terminal points and a second path from the starting point to each terminal 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 descending order of the candidate value. After the transfer point is set 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 according to the length of the transfer path and the travel cost of each position point. The larger the efficiency value, the more effectively the transportation length and transportation cost can be reduced after the transfer point is set according to the transfer point set; further Step 1, draw the efficiency value curve. With the continuous increase in the number of transfer points, in order to maintain the normal operation of the transfer points, the human cost and operating cost required will continue to increase. The inflection point in the efficiency value curve is obtained. Before the inflection point, the change range of the efficiency value is large, and after the inflection point, the change range of the efficiency value tends to be stable. Therefore, the transfer point set corresponding to the inflection point in the efficiency value curve is taken 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 between the historical order routes, the position of the transfer point can be accurately located to obtain the optimization result of the transfer point.

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

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

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

[0011] In one embodiment, the location point Candidate value of for: , and Position points and location points The number of occurrences in all second paths.

[0012] The effect of setting up transfer points at each position in the first path can be quantified. If the candidate value of a position point is larger, it means that after using this position point as a transfer point, more terminal points can be used to transport coal according to the corresponding second path, and the effect of setting a transfer point at this position point is better.

[0013] In one embodiment, the transfer point set Efficiency value for: , is the length of the first path, is the length of the transfer path, is the Relu activation function.

[0014] when When , it means that the travel length of coal transportation has not been reduced after the transfer point is set, and the Relu activation function will Set to 0, that is ;when When , it means that setting up a transfer point can reduce the travel length of coal transportation. The output of the Relu activation function is , as a set of transfer points Efficiency value .

[0015] In one embodiment, the order information also includes the order quantity of each terminal point, and the calculation of the efficiency value of the transfer point set also includes: 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 respectively; 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 each terminal point after the position point in the corresponding path.

[0016] After setting up the transfer points, the loads of vehicles at different points in the transfer route are different, and the heavier the load, the higher the energy consumption of the vehicle. In other words, the heavier the load, the higher the transportation cost of the coal. Therefore, when calculating the efficiency value of the transfer point set, it is also necessary to consider the load of each point in the transfer route to achieve accurate calculation of the efficiency value.

[0017] In one embodiment, the transfer point set Efficiency value for: , is the length of the first path, is the length of the transfer path, is the first cost, For transportation costs, is the Relu activation function.

[0018] In one embodiment, 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.

[0019] Usually there are more than one starting points, and as the number of transfer points continues to increase, the labor cost and operating cost will also continue to increase. After setting the maximum number of transfer points M according to the preset cost, the location of the final transfer point can be determined by combining the optimization results of all starting points.

[0020] In one embodiment, M is set according to a preset cost.

[0021] In a second aspect, a coal transfer point optimization system based on the Internet of Things includes: a processor and a memory, wherein the memory stores computer program instructions, and when the computer program instructions are executed by the processor, any one of the coal transfer point optimization methods based on the Internet of Things is implemented.

[0022] The present invention has the following effects: According to the order information of the starting point, the first path from the starting point to multiple terminal points and the second path from the starting point to each terminal point are determined; 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 descending order of the candidate value. After the transfer point is set 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 according to the length of the transfer path and the driving cost of each position point. The larger the efficiency value, the more effective it is to reduce the transportation length and transportation cost after the transfer point is set according to the transfer point set; further, the efficiency value curve is drawn. With the continuous increase in the number of transfer points, in order to maintain the normal operation of the transfer point, the human cost and operating cost required will continue to increase, and the inflection point in the efficiency value curve is obtained. Before the inflection point, the change range of the efficiency value is large, and after the inflection point, the change range of the efficiency value tends to be stable. Therefore, the transfer point set corresponding to the inflection point in the efficiency value curve is taken 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 between the historical order routes, the position of the transfer point can be accurately located to obtain the transfer point optimization result. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0024] Figure 2 Schematic diagram of a first path and a second path with a termination point 3 according to an embodiment of the present invention.

[0025] Figure 3 is a schematic diagram of a transport path according to an embodiment of the present invention.

[0026] Figure 4 A structural block diagram of a coal transfer point optimization system based on the Internet of Things according to an embodiment of the present invention. DETAILED DESCRIPTION

[0027] The technical solutions in the embodiments of the present invention will be described clearly and completely below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, rather than all of the embodiments.

[0028] The specific embodiments of the present invention are described in detail below with reference to the accompanying drawings.

[0029] Reference Figure 1 , a coal transfer point optimization method based on the Internet of Things includes steps S1-S5, which are as follows: S1: Obtain the order information of the starting point, which includes multiple end points.

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

[0031] In other embodiments, the order information further includes order quantities of multiple end points, that is, the weight of coal ordered at each end point.

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

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

[0034] Wherein, the path planning algorithm is Dijkstra algorithm, A* algorithm or LPA* algorithm.

[0035] For example, if the number of termination points in the order information is 3, it is recorded as , and , then there are 6 permutations and combinations of each end point; As an example, first use the path planning algorithm to obtain the starting point To the end point The shortest path , and then get the end point in turn To the end point The shortest path , and the end point To the end point The shortest path , the shortest path , shortest path and the shortest path The complete path composed as a permutation In this way, the initial paths of each permutation and combination are obtained, and the first path is the initial path with the shortest length.

[0036] In one embodiment, each end 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 end point. The shortest path of each end point can be obtained by a path planning algorithm, which will not be described in detail here.

[0037] In this way, the first path of the order information of a starting point and the second path of each end point in the order information are obtained; the first path is the shortest path to transport coal from the starting point to each end point, and the second path of an end point is the shortest path to transport coal from the starting point to the end point.

[0038] S3: Calculate the candidate value 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.

[0039] In one embodiment, see Figure 2 , is a schematic diagram of a first path and a second path at the end point 3 of an embodiment of the present invention, wherein 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 at the end point 3 starts from the starting point, passes through the end point 1 and directly reaches the end point 3; and there is a partial overlap between the first path and the second path at the end point 3, and they are bifurcated at the end point 1, and the end point 1 is recorded as the bifurcation point.

[0040] It can be understood that, in the absence of a transfer point, the vehicle transports coal along the first route, and after the vehicle arrives at the end point 1, it unloads according to the order quantity of the end point 1, and then continues along the first route to the end point 2, and unloads according to the order quantity of the end point 2; finally, it arrives at 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 route, after arriving at 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 along the first route to the end point 2. At the same time, there will also be another vehicle at the transfer point that transports the order quantity of the end point 3 to the end point 3 along the second route; the order information is completed.

[0041] In this way, the transportation route of coal will change before and after the transfer point is set up, and the transfer point can provide transportation vehicles, thereby achieving the effect of transfer, and 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.

[0042] 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. The larger the candidate value of a position point is, the more end points can be used to transport coal according to the corresponding second path after the position point is used as the transfer point, and the better the effect of setting a transfer point at the position point. Candidate value of for: , and Position points and location points The number of occurrences in all second paths.

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

[0044] S4: Add each location point to the transfer point set in descending order of candidate value, and calculate the efficiency value of the transfer point set.

[0045] In one embodiment, the larger the candidate value of a location point is, the better the effect of setting the location point as a transfer point is. Therefore, each location point is added to the transfer point set in descending order of the candidate value, and the efficiency value of the transfer point set is calculated.

[0046] Specifically, calculating the efficiency value of the transfer point set includes: taking the end point corresponding to the second path that takes the transfer point as the starting 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 path from the transfer point to 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.

[0047] Transfer point collection Efficiency value for: , is the length of the first path, is the length of the transfer path, is the Relu activation function. When , it means that the travel length of coal transportation has not been reduced after the transfer point is set, and the Relu activation function will Set to 0, that is ;when When , it means that setting up a transfer point can reduce the length of coal transportation. The output of the Relu activation function is , as a set of transfer points Efficiency value .

[0048] For example, see Figure 3, is a schematic diagram of the transfer path of an embodiment of the present invention; the transfer point set only includes one transfer point, namely, the termination point 1; with the transfer point as the starting point, a total of three second paths can be obtained, namely, the second path of the termination point 2 (overlapping with the first path), the second path of the termination point 3, and the second path of the termination point 4; the second paths that do not overlap with the first path are the second path of the termination point 3 and the second path of the termination point 4, and therefore, the termination point 3 and the termination point 4 are the transfer termination points; further, the transfer termination points in the first path are deleted, that is, the termination points 3 and 4 in the first path are removed, and the third path is the part from the starting point to the termination point 1, and then from the termination point 1 to the termination point 2 in the first path; then the transfer path of the transfer point set includes the third path, the second path from the transfer point to the transfer termination point 3, and the second path from the transfer point to the transfer termination point 4.

[0049] It can be understood that the vehicle loaded with the order quantities of all the end points starts from the starting point, and after arriving at end point 1, the order quantities of end point 1 are unloaded to complete the delivery of end point 1, and the order quantities of end points 3 and 4 are unloaded at the transfer point, and then continue to drive to end point 2 to complete the delivery of end point 2; at the same time, there will be other vehicles at the transfer point carrying the order quantities of end points 3 and 4 to complete the delivery of end points 3 and 4, thus completing the order information of the starting point.

[0050] In another embodiment, after the transfer point is set, the transportation path of the coal will change, and more end points can be transported according to the shortest path from the starting point to the end 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 positions in the transfer path is different, and the greater the load, the higher the energy consumption of the vehicle, that is, the greater the load, the higher the transportation cost of the coal. Therefore, when calculating the efficiency value of the transfer point set, it is also necessary to consider the load of each position point in the transfer path, and the load is related to the order volume of each end point.

[0051] Specifically, the order information also includes the order quantity of each terminal point, and the calculation of the efficiency value of the transfer point set includes: 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 respectively; 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 each terminal point after the position point in the corresponding path.

[0052] It can be understood that for any position point in the first path, the load of the vehicle at that position point should at least be equal to the order quantity of each terminal point after that position point in order to meet the coal demand of each terminal point after that position point, and the load can reflect the energy consumption of the vehicle. Therefore, the sum of the order quantities of each terminal point after the position point in the first path can represent the driving cost of the vehicle at that position point in the first path.

[0053] Taking into account the order volume of each terminal point, the transfer point set Efficiency value for: , is the length of the first path, is the length of the transfer path, is the first cost, For transportation costs, is the Relu activation function.

[0054] In this way, after setting the transfer points 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 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.

[0055] S5: Draw an efficiency value curve, and take the transfer point set of the inflection point in the efficiency value curve as the optimization result.

[0056] 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 value of each transfer point set is calculated to obtain an efficiency value curve; the horizontal axis of the efficiency value curve is the transfer point set with different numbers of location points, and the vertical axis is the efficiency value of each transfer point set.

[0057] As the number of transfer points continues to increase, in order to maintain the normal operation of the transfer points, the manpower cost and operating cost required will continue to increase. The inflection point in the efficiency value curve is obtained. Before the inflection point, the efficiency changes greatly, while after the inflection point, the efficiency changes tend to be stable. Therefore, the set of transfer points corresponding to the inflection points in the efficiency value curve is taken as the optimization result. When there is no need to collect historical order routes or there is no intersection between the historical order routes, the position of the transfer points can be accurately located to obtain the transfer point optimization result.

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

[0059] The present invention also provides a coal transfer point optimization system based on the Internet of Things. Figure 4 is a structural block diagram of a coal transfer point optimization system based on the Internet of Things according to an embodiment of the present invention. Figure 4As shown, the system 50 includes a processor and a memory, wherein the memory stores computer program instructions, and when the computer program instructions are executed by the processor, a method for optimizing coal transfer points based on the Internet of Things according to the present invention is implemented. The system also includes other components well known to those skilled in the art, such as a communication bus and a communication interface, whose settings and functions are known in the art, and therefore will not be described in detail here.

[0060] It should be noted that, for ordinary technicians in this field, several modifications and improvements can be made without departing from the concept of this application, which are all within the scope of protection of this application. Therefore, the scope of protection of the patent of this application shall be based on the attached claims.

Claims

1. A coal transfer point optimization method based on the Internet of Things, characterized in that: The optimization method comprises: obtaining order information of a starting point, the order information comprising a plurality of 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 includes a starting point and multiple end points, and the second path includes a starting point and a corresponding end point; Calculate 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 location 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 starting from the transfer point and having 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 path from the transfer point to 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; Draw an efficiency value curve, and take the transfer point set of the inflection point in the efficiency value curve as the optimization result.

2. The method for optimizing coal transfer points based on the Internet of Things according to claim 1, characterized in that: The method for obtaining the first path includes: Obtain the permutations and combinations of the end points, use the path planning algorithm to obtain the initial paths of the permutations and combinations, and use the initial path with the shortest length as the first path.

3. The method for optimizing coal transfer points based on the Internet of Things according to claim 2, characterized in that: The path planning algorithm is Dijkstra algorithm, A* algorithm or LPA* algorithm.

4. The method for optimizing coal transfer points based on the Internet of Things according to claim 1, characterized in that: Location Point Candidate value of for: , and Position points and location points The number of occurrences in all second paths.

5. The method for optimizing coal transfer points based on the Internet of Things according to claim 1, characterized in that: Transfer point collection Efficiency value for: , is the length of the first path, is the length of the transfer path, is the Relu activation function.

6. The method for optimizing coal transfer points based on the Internet of Things according to claim 1, characterized in that: The order information also includes the order quantity of each terminal point, and the efficiency value of the calculated transfer point set also includes: The sum of the travel costs of each location point in the first path and the transfer path is taken as the first cost and the transfer cost respectively; The efficiency value is positively correlated with the difference between the first cost and the transit cost; The travel cost is the sum of the order quantities of each terminal point after the location point in the corresponding path.

7. The method for optimizing coal transfer points based on the Internet of Things according to claim 6, characterized in that: Transfer point collection Efficiency value for: , is the length of the first path, is the length of the transfer path, is the first cost, For transportation costs, is the Relu activation function.

8. The 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: The number of occurrences of each transfer point in the optimization results of multiple starting points is counted, and the top M transfer points are selected in descending order of the number of occurrences.

9. The method for optimizing coal transfer points based on the Internet of Things according to claim 8, characterized in that: M is set according to the preset cost.

10. A coal transfer point optimization system based on the Internet of Things, characterized in that: include: A processor and a memory, wherein the memory stores computer program instructions, and when the computer program instructions are executed by the processor, the method for optimizing coal transfer points based on the Internet of Things according to any one of claims 1 to 9 is implemented.

Images