Coal Transportation Route Optimization Methods and Systems from a Supply Chain Perspective

Abstract

This invention provides a method and system for optimizing coal transportation routes from a supply chain perspective, belonging to the field of coal supply chain technology. The method includes: acquiring current coal transportation plan information and identifying all candidate transportation routes based on the plan information; collecting information on each preset reference item on each transportation route based on all candidate routes; evaluating each preset reference item on each transportation route using an improved Topsis algorithm, and evaluating each transportation route based on the evaluation results; comparing the evaluation results of each transportation route, selecting the optimal transportation route, and using this route as the final transportation route. This invention solves the problems of poor optimization performance and poor risk resistance in existing coal supply chain transportation route determination schemes.

Description

Technical Field

[0001] This invention relates to the field of coal supply chain technology, specifically to a coal transportation route optimization method and a coal transportation route optimization system from a supply chain perspective. Background Technology

[0002] The coal supply chain refers to the network structure surrounding the operations of coal production enterprises, encompassing related activities and the flow of logistics, information, and value from suppliers to end-users. It primarily focuses on the optimal allocation of coal resources between production and demand. The main stakeholders include resource exploration companies, production companies, sales companies, transportation companies, and users. External factors include macroeconomic policies, the natural environment, and the international market environment. While creating high added value for customers and the market through economic efficiency, reliability, matching, and consistency, the coal supply chain is a complex adaptive system for achieving win-win outcomes among enterprises. The coal supply chain consists of coal enterprises, railways, ports, shipping, and power plants. For precise coal transportation, the corresponding transportation routes connecting these nodes are crucial. For example, if a railway line is interrupted at a certain point, upstream wagons cannot pass, and downstream areas face a situation where no coal can be unloaded. It could also prevent the control chain from returning to its original position, affecting upstream emptying, which in turn affects loading.

[0003] Under current technological conditions, supply chain inventory modeling research is mainly achieved through network and multi-modeling techniques, while simulation research is primarily conducted using multi-agent distributed simulation methods, HLA simulation methods, and simulation tools such as Witness, Lingo, and MATLAB to simulate transportation routes. However, because the routes connecting each node are not unique, multiple candidate transportation routes emerge after each route simulation. In existing methods, users can choose any transportation route to meet their needs, but considering reality, different transportation routes experience corresponding transfer pressures at different stages. If the actual conditions of each transfer route are not comprehensively considered, and transportation routes are arbitrarily specified based solely on the simulation model, the transportation effect is likely to fail to meet expectations. To address the problems of poor optimization performance and weak risk resistance in existing coal supply chain transportation route determination schemes, a new coal transportation route optimization method from a supply chain perspective is needed. Summary of the Invention

[0004] The purpose of this invention is to provide a method and system for optimizing coal transportation routes from a supply chain perspective, so as to at least solve the problems of poor optimization performance and poor risk resistance of existing coal supply chain transportation route determination schemes.

[0005] To achieve the above objectives, the first aspect of the present invention provides a method for optimizing coal transportation routes from a supply chain perspective. The method includes: acquiring current coal transportation plan information and identifying all candidate transportation routes based on the transportation plan information; collecting information on each preset reference item on each transportation route based on all candidate transportation route information; evaluating each preset reference item on each transportation route based on an improved Topsis algorithm, and evaluating each transportation route based on the evaluation results of each preset reference item; comparing the evaluation results of each transportation route, selecting the optimal transportation route, and using this transportation route as the final transportation route.

[0006] Optionally, the transportation plan information includes: coal supply point information, coal demand point information, and transportation route information; wherein, the coal supply point information includes the location information of each coal supply point and the total amount of coal to be dispatched; the coal demand point information includes the location information of each coal demand point and the total amount of coal to be delivered.

[0007] Optionally, the transportation route information includes: the railway transportation route of each coal supply point, the frequency of railway train departures, the transportation volume per railway train, the location of the port connecting to the railway, the coal storage capacity of the connecting port, the frequency of train departures from the connecting port, and the transportation volume per train at the connecting port.

[0008] Optionally, the preset reference information includes: railway single-car loading time, empty car turnaround frequency, single-car unloading time at the docking port, coal output per unit time at the docking port, weather information along the transportation route, and real-time transportation restriction information.

[0009] Optionally, the step of collecting preset reference information on each transportation route based on all candidate transportation route information includes: based on the railway transportation path of each coal supply point, calling the weather information and real-time transportation restriction information on the corresponding transportation path; calculating the empty car turnaround frequency and the unloading time of a single car at the connecting port based on the railway train departure frequency, the railway single train transportation volume, the port location connected to the railway, the coal storage capacity of the connecting port, the train departure frequency of the connecting port, and the single train transportation volume of the connecting port; and reading the daily coal throughput information of the corresponding port based on the port location connected to the railway, and determining the coal output per unit time of the connecting port based on the daily coal throughput information.

[0010] Optionally, the evaluation of each preset reference item based on the improved Topsis algorithm, and the evaluation of each transportation route based on the evaluation results of each preset reference item, includes: classifying each preset reference item to obtain extremely large indicators, extremely small indicators, and feasibility evaluation indicators; wherein, the extremely large indicators include: the frequency of empty car turnarounds and the coal output per unit time at the docking port; the extremely small indicators include: the loading time of a single train trip on the railway and the unloading time of a single train trip at the docking port; the feasibility evaluation indicators include: weather and real-time transportation restriction information on the transportation route; each transportation route is reviewed based on the feasibility evaluation indicators; if the feasibility evaluation fails, the corresponding transportation route is determined to be unsatisfactory; if the feasibility evaluation passes, the Topsis algorithm is executed based on the extremely large indicators and the extremely small indicators to obtain the evaluation score of the corresponding transportation route; and the evaluation of whether each transportation route meets expectations is performed based on the evaluation scores of each transportation route and the preset pass scores.

[0011] Optionally, before executing the Topsis algorithm based on the extremely large and extremely small indicators to obtain the corresponding transportation route evaluation score, the method further includes: performing positive transformation on the extremely small indicators, with the following processing rule:

[0012] x , =Mx

[0013] Where, x , M is the positive evaluation index for x minimal indicators; M is the maximum value among the x minimal indicators for each transportation route; x is the x minimal indicators for the current transportation route.

[0014] Optionally, the step of executing the Topsis algorithm based on the extremely large indicators and the extremely small indicators to obtain the corresponding transportation route evaluation score includes: constructing a standardized matrix based on the extremely large indicators and the positive evaluation indicators, including: standardizing each extremely large indicator and each positive evaluation indicator for cadres of each transportation route, with the following processing rules:

[0015]

[0016] Where i∈I, I is the set of all transport routes; j=1,2,3,4; represents each evaluation index; j=1 represents the frequency of empty car turnarounds; j=2 represents the coal output per unit time at the docking port; j=3 represents the positive evaluation index of the loading time of a single train trip on the railway; j=4 represents the positive evaluation index of the unloading time of a single train trip at the docking port; Z ij X is the standardized value of the i-th transportation route on the j-th evaluation index; ij Let be the original value of the i-th transportation route on the j-th evaluation index; n is the number of transportation routes; the expression of the standardized matrix is:

[0017]

[0018] From the standardized matrix, the maximum and minimum values ​​in each column of data are selected as the optimal and worst solution vectors, respectively. The distances between the evaluation indicators of each transportation route and the optimal and worst solution vectors are calculated. Based on the calculation results, the evaluation scores of the cadres for each transportation route are obtained, including: the formula for calculating the distances between the evaluation indicators of each transportation route and the optimal and worst solution vectors is:

[0019]

[0020]

[0021] in, Let be the optimal solution vector for the j-th evaluation index; Let w be the worst-case solution vector for the j-th evaluation index; j Let be the weight of the j-th evaluation indicator; m = 1, 2, 3, 4; represent each evaluation indicator. Let be the distance between the evaluation index of the i-th transportation route and the optimal solution vector; Let be the distance between the evaluation index of each of the i transportation routes and the worst solution vector; the evaluation score of each transportation route is calculated based on the distance between the evaluation index of each transportation route and the optimal and worst solution vectors, using the following formula:

[0022]

[0023] Among them, C i Let be the evaluation score for the i-th transport route.

[0024] A second aspect of the present invention provides a coal transportation route optimization system from a supply chain perspective. The system includes: a data acquisition unit, configured to: acquire current coal transportation plan information and identify all candidate transportation route information based on the transportation plan information; and acquire information on each preset reference item on each transportation route based on all candidate transportation route information; a processing unit, configured to evaluate the information on each preset reference item on each transportation route based on an improved Topsis algorithm, and evaluate each transportation route based on the evaluation results of each preset reference item; and a route determination unit, configured to compare the evaluation results of each transportation route, select the optimal transportation route, and use this transportation route as the final transportation route.

[0025] On the other hand, the present invention provides a computer-readable storage medium storing instructions that, when executed on a computer, cause the computer to perform the aforementioned coal transportation route optimization method from a supply chain perspective.

[0026] Through the above technical solution, after obtaining multiple candidate transportation routes, the present invention identifies real-time transportation route information, evaluates preset reference items, and uses an improved Topsis algorithm to evaluate the feasibility and overall effect of the candidate routes. Ultimately, it obtains a feasible transportation route with the best overall effect, ensuring that this route has the strongest risk resistance when used for coal transportation and preventing the entire coal supply chain from being blocked due to unforeseen circumstances. The present invention solves the problems of poor optimization performance and poor risk resistance in existing coal supply chain transportation route determination schemes.

[0027] Other features and advantages of the embodiments of the present invention will be described in detail in the following detailed description section. Attached Figure Description

[0028] The accompanying drawings are provided to further illustrate embodiments of the present invention and form part of the specification. They are used together with the following detailed description to explain the embodiments of the present invention, but do not constitute a limitation thereof. In the drawings:

[0029] Figure 1 This is a flowchart of the steps of a coal transportation route optimization method from a supply chain perspective provided by one embodiment of the present invention.

[0030] Figure 2 This is a flowchart of the process for obtaining reference item information according to one embodiment of the present invention;

[0031] Figure 3 This is a system structure diagram of a coal transportation route optimization system from a supply chain perspective, provided by one embodiment of the present invention. Detailed Implementation

[0032] The specific embodiments of the present invention will be described in detail below with reference to the accompanying drawings. It should be understood that the specific embodiments described herein are for illustration and explanation only and are not intended to limit the present invention.

[0033] A supply chain system is a global network of suppliers, factories, warehouses, distribution centers, and retailers through which raw materials can be procured, transformed, and delivered to customers. In today's increasingly competitive business environment, gaining control and priority in the supply chain is, in a sense, winning the market. Supply chain management, as a rapidly developing discipline, began with organizations' need to improve their inventory management and production planning control. It has evolved through stages: the systematization of materials, production, and transportation management; the Material Requirements Planning (MRP) stage with inventory control as its focus; the Total Quality Management (TQM) and Lean Manufacturing stages to reduce inventory through quality and process improvements; and the Agile Supply Chain stage to adapt to ever-changing demands. As the focus of supply chain management continues to shift, the complexity, dynamism, and cross-cutting nature of supply chains have become more pronounced. The role of the supply chain as a major cost driver has long been recognized, offering significant opportunities for achieving cost advantages.

[0034] The coal supply chain refers to the network structure surrounding the operations of coal production enterprises, encompassing related activities and the flow of logistics, information, and value from suppliers to end-users. It primarily focuses on the optimal allocation of coal resources between production and demand. The main stakeholders include resource exploration companies, production companies, sales companies, transportation companies, and users. External environmental factors include macroeconomic policies, the natural environment, and the international market environment. While creating high added value for customers and the market through economic efficiency, reliability, matching, and consistency, the coal supply chain is a complex adaptive system for achieving win-win outcomes among enterprises.

[0035] Coal supply chain inventory refers to the reserves of coal resources. In a broad sense, it refers to the coal raw materials, finished coal products, and semi-finished products that coal producers hold for production needs, as well as the finished coal products that wholesalers and retailers hold to meet their sales needs. The traditional understanding of coal supply chain inventory is the storage of coal resources or their substitutes in warehouses. The modern understanding is the temporary idleness of coal resources to meet future market needs.

[0036] The coal supply chain consists of coal companies, railways, ports, shipping, and power plants. To achieve precise coal transportation, the transportation routes connecting these nodes are crucial. For example, if a railway line is interrupted at a certain point, upstream wagons cannot pass through, leaving downstream areas without coal to unload. It could also prevent the control chain from returning to its original position after the railway interruption, affecting upstream emptying. Without empty wagons, loading will be affected.

[0037] Under the current technological background, supply chain inventory modeling research is mainly achieved through network and multi-modeling techniques, while simulation research is mainly achieved through multi-agent distributed simulation methods, HLA simulation methods, and simulation tools such as Witness, Lingo, and MATLAB, simulating transportation routes. However, because the routes connecting each node are not unique, multiple candidate transportation routes emerge after each route simulation. In existing methods, users can choose any transportation route to meet their needs, but considering reality, different transportation routes have corresponding transit pressures at different stages. If the actual situation of each transit route is not comprehensively considered, and transportation routes are arbitrarily specified based solely on the simulation model, the transportation effect is likely to fail to meet expectations. To address the problems of poor optimization performance and weak risk resistance in existing coal supply chain transportation route determination schemes, this invention proposes a coal transportation route optimization method from a supply chain perspective. After obtaining multiple candidate transportation routes, the system identifies real-time transportation route information, evaluates preset reference items, and evaluates the feasibility and overall effect of the candidate routes based on the improved Topsis algorithm. Finally, it obtains a feasible transportation route with the best overall effect to ensure that the obtained route has the strongest risk resistance when used for coal transportation, and avoids the blockage of the entire coal supply chain due to unforeseen circumstances.

[0038] Figure 1 This is a flowchart of a coal transportation route optimization method from a supply chain perspective, provided by one embodiment of the present invention. Figure 1 As shown, this invention provides a method for optimizing transportation routes based on the coal supply chain, the method comprising:

[0039] Step S10: Obtain the current coal transportation plan information and identify all candidate transportation routes based on the transportation plan information.

[0040] Specifically, as mentioned above, simulation of transportation routes based on simulation models is already quite common in this technical field. The simulation model, based on real-time supply and demand relationships and preset transportation link relationships, simulates transportation routes that meet transportation needs and generates multiple candidate transportation routes. These candidate transportation routes can theoretically meet the demand; however, because they are generated based on theoretically satisfying supply and demand relationships, their feasibility in real-world situations, and the ability to find an optimal transportation route among multiple routes, still need to be verified.

[0041] This invention is based on this requirement, and subsequent feasibility analysis and comprehensive evaluation of each transportation route are needed. Therefore, it is first necessary to obtain complete transportation plan information, including coal supply point information, coal demand point information, and transportation route information. The coal supply point information includes the location of each coal supply point and the total amount of coal to be dispatched; the coal demand point information includes the location of each coal demand point and the total amount of coal to be received. Subsequently, this transportation plan information needs to be used as a reference for resource allocation, such as limiting coal loading and unloading speeds.

[0042] Preferably, the transportation route information includes: railway transportation routes, railway train numbers, railway train departure frequency, railway train volume per train, port location connecting to the railway, coal storage capacity of the connecting port, shipping vessel numbers at the connecting port, departure frequency of the connecting port, and volume per shipping vessel at the connecting port.

[0043] In this embodiment of the invention, as previously known, the coal supply chain is a complete transportation chain consisting of coal enterprises, railways, ports, shipping, and power plants. The transportation routes connecting each node are the foundation for ensuring coal transportation. The most crucial transportation segments are the transport segments from coal enterprises to ports and from ports to power plants; the former is the railway transportation segment, and the latter is the shipping transportation segment. Whether coal can be stably and orderly unloaded from coal enterprises to ports and then shipped out is a crucial factor to consider. Therefore, the transportation route information that this invention needs to consider includes: the railway transportation route at each coal supply point, railway train numbers, railway train departure frequency, railway train volume per train trip, the location of the port connecting to the railway, the coal storage capacity of the connecting port, the shipping vessel numbers at the connecting port, the departure frequency of the shipping vessels at the connecting port, and the volume of a single shipping vessel at the connecting port.

[0044] Step S20: Based on all transportation route information, collect information on each preset reference item on each transportation route.

[0045] Specifically, the preset reference information includes: railway single-car loading time, empty car turnaround frequency, single-car unloading time at the docking port, coal output per unit time at the docking port, weather along the transportation route, and real-time transportation restriction information.

[0046] In this embodiment of the invention, the solution mainly requires evaluation in two aspects: first, feasibility evaluation, and second, comprehensive effect evaluation. The former considers whether the corresponding route can be implemented under actual conditions. This includes weather conditions and real-time transportation restrictions. For example, freezing of trains in winter (coal mining involves groundwater or sun-drying, cooling, dust suppression, washing, and coal moisture content; antifreeze powder protection only lasts 48 hours, causing the trains to freeze and making unloading difficult) can cause severe congestion, requiring decisive orders to reduce loading upstream. In this example, if user demand is high, but loading must be restricted due to weather conditions, user demand cannot be met, making the candidate route unfeasible. Other factors, such as typhoons in shipping, can also affect the feasibility of specific transportation routes. Therefore, conducting continuous feasibility analysis based on weather factors is essential.

[0047] Real-time transportation restriction information includes policy-based control information such as flight restrictions due to the pandemic. This control information needs to be taken into account comprehensively. Any transportation route that includes controlled road sections should be deemed an infeasible transportation route.

[0048] The loading time of a single railway train, the frequency of empty train round trips, the unloading time of a single train at the docking port, and the coal output per unit time at the docking port are all related to the upstream coal outflow rate and the downstream coal transfer rate. This rate directly affects whether users can receive the full amount of coal they have ordered before the scheduled time.

[0049] Preferably, it is necessary to obtain the information of each preset reference item one by one, such as Figure 2 This includes the following steps:

[0050] Step S201: Obtain numerical weather information and real-time transportation restriction information.

[0051] Specifically, based on the railway transportation routes of each coal supply point, the system retrieves weather information and real-time transportation restriction information for the corresponding routes. The weather information for the corresponding routes is numerical weather prediction information, for example, obtained by reading numerical weather forecast information from the GRAPES (China Meteorological Administration Numerical Weather Prediction System) system and the latitude and longitude coordinates of the corresponding routes, and then using the reading results as the weather information for the corresponding routes. Real-time transportation restriction information can be obtained through real-time synchronization of restriction information from the company's own system, or it can be automatically retrieved from other transportation management portals.

[0052] Step S202: Obtain the frequency of empty car turnarounds and the unloading time of a single car at the docking port.

[0053] Specifically, based on the railway transport train number, the railway train departure frequency, the railway single train transport volume, the port location connected to the railway, the coal storage capacity of the connected port, the shipping vessel number of the connected port, the vessel departure frequency of the connected port, and the single-vehicle transport volume of the connected port, the empty car turnaround frequency information and the single train unloading time information of the connected port are calculated.

[0054] In this embodiment of the invention, it is generally understood that the frequency of empty car turnarounds is related to the number of departures and the unloading speed. That is, the time required for a fully loaded car, or from the time it leaves the depot, includes the time it takes to reach the unloading point and the time it takes to completely unload at the unloading point. Further, a certain unloading waiting time is introduced upon reaching the unloading point. This unloading waiting time includes waiting for the preceding car to unload and waiting for the coal to be transferred out of the docking port's storage facilities. The coal storage transfer time is, in turn, related to the frequency of departures from the docking port and the single-trip transport volume at the docking port. Therefore, calculating the frequency of empty car turnarounds involves a chain of interconnected relationships, requiring step-by-step calculations to obtain the final result. To avoid impacting transportation efficiency in extreme cases, the calculation of the frequency of empty car turnarounds is performed under extreme conditions. Assuming the port warehouses are completely full of coal, the coal unloading from the railway is directly and equivalently transferred to the ferry for loading. Therefore, when the coal loading speed exceeds the railway unloading speed, the railway can unload at its standard speed, and the unloading time at the unloading point is equal to the normal unloading time. If the coal loading speed is less than the railway unloading speed, then because the warehouses are full, the unloading speed equals the loading speed. In this case, the train's dwell time at the unloading point is the ratio of the single-trip transport volume to the coal unloading speed, denoted as:

[0055]

[0056] Where t represents the time required for a single train to unload coal; P represents the transport volume of a single train trip; v1 represents the coal unloading speed; and v2 represents the coal loading speed. The coal unloading speed can be obtained based on historical unloading data for the corresponding unloading point. The coal loading speed is related to the frequency of ferry departures. For example, if each ferry waits 30 minutes after loading before the next ferry arrives for loading, then 30 minutes must be added to the total time for speed calculation. The calculation rule is that the total time is the sum of the loading time for a single train trip and the arrival time for that train trip, and the total load volume for a single train trip is the total volume. The corresponding speed is then calculated.

[0057] Once the time required for a single train to unload coal is obtained, queuing time can be calculated based on the train's departure frequency. First, the train's transport distance is determined based on the port location where the railway connects. Then, the transport time is determined based on this distance and the train's speed. The difference between the time required for a single train to unload coal and the train's transport time yields the corresponding waiting time. If the difference is positive, the corresponding value is the waiting time; if the difference is 0 or negative, no waiting is required. Assuming the train's loading and unloading speeds are the same, the frequency of empty car turnarounds can be calculated based on the railway train departure frequency and the corresponding waiting time.

[0058] Step S203: Obtain the coal output per unit time of the docking port.

[0059] Specifically, in step S202, the calculation rules for the loading speed of each round have been obtained. After reading the daily coal throughput information of the corresponding port based on the location of the port connected to the railway, the coal output per unit time of the connected port can be directly calculated.

[0060] Step S30: Evaluate the information of each preset reference item on each transportation route based on the improved Topsis algorithm, and evaluate each transportation route based on the evaluation results of each preset reference item.

[0061] Specifically, the preset reference items are categorized to obtain extremely large indicators, extremely small indicators, and feasibility evaluation indicators. The extremely large indicators include: the frequency of empty train round-trips and the coal output per unit time at the docking port. The extremely small indicators include: the loading time of a single train trip on the railway and the unloading time of a single train trip at the docking port. The feasibility evaluation indicators include: weather and real-time transportation restriction information along the transportation route. Each transportation route is reviewed based on these feasibility evaluation indicators. If the feasibility evaluation fails, the corresponding transportation route is deemed not to meet expectations. If the feasibility evaluation passes, the Topsis algorithm is executed based on the extremely large and extremely small indicators to obtain the evaluation score for the corresponding transportation route. Based on the evaluation scores of each transportation route and the preset passing score, an evaluation is conducted to determine whether each transportation route meets expectations.

[0062] Furthermore, before executing the Topsis algorithm based on the extremely large and extremely small indicators to obtain the corresponding transportation route evaluation score, the method further includes: performing positive transformation on the extremely small indicators, with the following processing rule:

[0063] x , =Mx

[0064] Where, x ,M is the positive evaluation index for x minimal indicators; M is the maximum value among the x minimal indicators for each transportation route; x is the x minimal indicators for the current transportation route.

[0065] Furthermore, the step of executing the Topsis algorithm based on the extremely large indicators and the extremely small indicators to obtain the corresponding transportation route evaluation score includes: constructing a standardized matrix based on the extremely large indicators and the positive evaluation indicators; and including: standardizing each extremely large indicator and each positive evaluation indicator for cadres of each transportation route, with the following processing rules:

[0066]

[0067] Where i∈I, I is the set of all transport routes; j=1,2,3,4; represents each evaluation index; j=1 represents the frequency of empty car turnarounds; j=2 represents the coal output per unit time at the docking port; j=3 represents the positive evaluation index of the loading time of a single train trip on the railway; j=4 represents the positive evaluation index of the unloading time of a single train trip at the docking port; Z ij X is the standardized value of the i-th transportation route on the j-th evaluation index; ij Let be the original value of the i-th transportation route on the j-th evaluation index; n is the number of transportation routes; the expression of the standardized matrix is:

[0068]

[0069] From the standardized matrix, the maximum and minimum values ​​in each column of data are selected as the optimal and worst solution vectors, respectively. The distances between the evaluation indicators of each transportation route and the optimal and worst solution vectors are calculated. Based on the calculation results, the evaluation scores of the cadres for each transportation route are obtained, including: the formula for calculating the distances between the evaluation indicators of each transportation route and the optimal and worst solution vectors is:

[0070]

[0071]

[0072] in, Let be the optimal solution vector for the j-th evaluation index; Let w be the worst-case solution vector for the j-th evaluation index; j Let be the weight of the j-th evaluation indicator; m = 1, 2, 3, 4; represent each evaluation indicator. Let be the distance between the evaluation index of the i-th transportation route and the optimal solution vector; Let be the distance between the evaluation index of each of the i transportation routes and the worst solution vector; the evaluation score of each transportation route is calculated based on the distance between the evaluation index of each transportation route and the optimal and worst solution vectors, using the following formula:

[0073]

[0074] Among them, C i Let be the evaluation score for the i-th transport route.

[0075] Step S40: Compare the evaluation results of each transportation route, select the optimal transportation route, and use this transportation route as the final transportation route.

[0076] Specifically, the evaluation scores of each transportation route are ranked, and the route with the highest score is selected as the subsequent transportation route. Based on this determined transportation route, the previously obtained transportation plan information is then used to facilitate subsequent transportation based on this plan.

[0077] Figure 3 This is a system structure diagram of a coal transportation route optimization system from a supply chain perspective, provided by one embodiment of the present invention. (See diagram below.) Figure 3 As shown, this invention provides a coal transportation route optimization system from a supply chain perspective. The system includes: a data acquisition unit, configured to: acquire current coal transportation plan information and identify all candidate transportation routes based on the transportation plan information; and collect information on each preset reference item on each transportation route based on all candidate transportation route information; a processing unit, configured to evaluate the information on each preset reference item on each transportation route based on an improved Topsis algorithm, and evaluate each transportation route based on the evaluation results of each preset reference item; and a route determination unit, configured to compare the evaluation results of each transportation route, select the optimal transportation route, and use this transportation route as the final transportation route.

[0078] The present invention also provides a computer-readable storage medium storing instructions that, when executed on a computer, cause the computer to perform the aforementioned coal transportation route optimization method from a supply chain perspective.

[0079] Those skilled in the art will understand that all or part of the steps in the methods of the above embodiments can be implemented by a program instructing related hardware. This program is stored in a storage medium and includes several instructions to cause a microcontroller, chip, or processor to execute all or part of the steps of the methods described in the various embodiments of the present invention. The aforementioned storage medium includes various media capable of storing program code, such as a USB flash drive, a portable hard drive, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk.

[0080] The optional embodiments of the present invention have been described in detail above with reference to the accompanying drawings. However, the embodiments of the present invention are not limited to the specific details described above. Within the scope of the technical concept of the embodiments of the present invention, various simple modifications can be made to the technical solutions of the embodiments of the present invention, and these simple modifications all fall within the protection scope of the embodiments of the present invention. It should also be noted that the various specific technical features described in the above specific embodiments can be combined in any suitable manner without contradiction. To avoid unnecessary repetition, the embodiments of the present invention will not further describe the various possible combinations.

[0081] Furthermore, various different embodiments of the present invention can be combined in any way, as long as they do not violate the spirit of the embodiments of the present invention, they should also be regarded as the content disclosed by the embodiments of the present invention.

Claims

1. A method for optimizing coal transportation routes from a supply chain perspective, characterized in that, The method includes: Obtain the current coal transportation plan information, and identify all candidate transportation routes based on the transportation plan information; Based on all candidate transportation route information, collect information on each preset reference item on each transportation route; The improved Topsis algorithm is used to evaluate the information of each preset reference item on each transportation route, and the evaluation results of each preset reference item are used to evaluate each transportation route; among them, The improved Topsis algorithm is used to evaluate each preset reference item, and the evaluation results of each preset reference item are used to evaluate each transportation route. This includes: classifying each preset reference item to obtain extremely large indicators, extremely small indicators, and feasibility evaluation indicators; wherein, the extremely large indicators include: the frequency of empty car turnarounds and the coal output per unit time at the docking port; the extremely small indicators include: the loading time of a single train trip on the railway and the unloading time of a single train trip at the docking port; the feasibility evaluation indicators include: weather and real-time transportation restriction information on the transportation route; each transportation route is reviewed based on the feasibility evaluation indicators. If the feasibility evaluation fails, the corresponding transportation route is determined to be unsatisfactory; if the feasibility evaluation passes, the Topsis algorithm is executed based on the extremely large indicators and the extremely small indicators to obtain the evaluation score of the corresponding transportation route; and the evaluation of whether each transportation route meets expectations is based on the evaluation scores of each transportation route and the preset pass scores. The step of executing the Topsis algorithm based on the extremely large indicators and the extremely small indicators to obtain the corresponding transportation route evaluation score includes: constructing a standardized matrix based on the extremely large indicators and positive evaluation indicators, including: standardizing each extremely large indicator and each positive evaluation indicator for cadres of each transportation route, with the following processing rules: Where i∈I, I is the set of all transport routes; j=1,2,3,4; represents each evaluation index; j=1 represents the frequency of empty car turnarounds; j=2 represents the coal output per unit time at the docking port; j=3 represents the positive evaluation index of the loading time of a single railway train; j=4 represents the positive evaluation index of the unloading time of a single train at the docking port. Let be the standardized value of the i-th transportation route on the j-th evaluation index; Let be the original value of the i-th transportation route on the j-th evaluation index; n is the number of transportation routes; the expression of the standardized matrix is: From the standardized matrix, the maximum and minimum values ​​in each column of data are selected as the optimal and worst solution vectors, respectively. The distances between the evaluation indicators of each transportation route and the optimal and worst solution vectors are calculated. Based on the calculation results, the evaluation scores of the cadres for each transportation route are obtained, including: the formula for calculating the distances between the evaluation indicators of each transportation route and the optimal and worst solution vectors is: in, Let be the optimal solution vector for the j-th evaluation index; Let the worst-case solution vector be the j-th evaluation index; Let be the weight of the j-th evaluation indicator; m = 1, 2, 3, 4; represent each evaluation indicator. Let be the distance between the evaluation index of the i-th transportation route and the optimal solution vector; Let be the distance between the evaluation index of each of the i transportation routes and the worst solution vector; the evaluation score of each transportation route is calculated based on the distance between the evaluation index of each transportation route and the optimal and worst solution vectors, using the following formula: in, Let be the evaluation score for the i-th transportation route; By comparing the evaluation results of each transportation route, the optimal transportation route is selected and used as the final transportation route.

2. The method according to claim 1, characterized in that, The transportation plan information includes: Information on coal supply points, coal demand points, and transportation routes; among which... The coal supply point information includes the location information of each coal supply point and the total amount of coal that needs to be delivered. The coal demand point information includes the location information of each coal demand point and the total amount of coal that needs to be delivered.

3. The method according to claim 1, characterized in that, The transportation route information includes: The railway transportation routes, frequency of railway train departures, volume of transported per train, location of ports connecting to the railway, coal storage capacity of the connecting ports, frequency of train departures from the connecting ports, and volume of transported per train at the connecting ports are all factors to consider.

4. The method according to claim 3, characterized in that, The information for each preset reference item includes: The data includes railway single-car loading time, empty car turnaround frequency, single-car unloading time at the docking port, coal output per unit time at the docking port, weather information along the transportation route, and real-time transportation restriction information.

5. The method according to claim 4, characterized in that, The process of collecting information on each preset reference item on each transportation route based on all candidate transportation route information includes: Based on the railway transportation routes of each coal supply point, retrieve the weather information and real-time transportation restriction information for the corresponding transportation routes; Based on the railway train departure frequency, the railway single train transport volume, the port location connected to the railway, the coal storage capacity of the connected port, the train departure frequency of the connected port, and the single train transport volume of the connected port, the empty car turnaround frequency and the unloading time of the connected port are calculated. Based on the location of the port connected to the railway, the daily coal throughput information of the corresponding port is read, and the coal output per unit time of the connected port is determined based on the daily coal throughput information.

6. The method according to claim 1, characterized in that, Before executing the Topsis algorithm based on the extremely large and extremely small indicators to obtain the corresponding transportation route evaluation score, the method further includes: For extremely small indicators, positive conversion is performed according to the following rules: in, For x very small indicators, positive evaluation indicators; This represents the maximum value among the x minimal indicators for each transport route; x represents x minimal indicators of the current transportation route.

7. A coal transportation route optimization system from a supply chain perspective, characterized in that, The system is used to execute the coal transportation route optimization method from a supply chain perspective as described in any one of claims 1-6, and the system includes: The acquisition unit is used for: Obtain the current coal transportation plan information, and identify all candidate transportation routes based on the transportation plan information; Based on all candidate transportation route information, collect information on each preset reference item on each transportation route; The processing unit is used to evaluate the information of each preset reference item on each transportation route based on the improved Topsis algorithm, and to evaluate each transportation route based on the evaluation results of each preset reference item. The route determination unit is used to compare the evaluation results of various transportation routes, select the optimal transportation route, and use this transportation route as the final transportation route.

8. A computer-readable storage medium storing instructions that, when executed on a computer, cause the computer to perform the coal transportation route optimization method from a supply chain perspective as described in any one of claims 1-6.

Images