Truck loading method and device, electronic equipment and storage medium

Abstract

The invention provides a loading method and device, electronic equipment and a storage medium, and relates to the technical field of railway transportation dispatch, and the method comprises the steps: carrying out the statistics of the vehicle sum of empty vehicles and loaded vehicles of each station in a target area, and adding each station into a first set according to the sequence of the vehicle sum from large to small; and circularly executing the following steps until the updated number of loaded columns reaches the target number of loaded columns, and outputting final loading: aiming at the target station with the first sequence in the first set, determining whether loading in columns can be carried out at the target station based on the sum of the vehicles corresponding to the target station and the number of the vehicles of each train; under the condition that the vehicles can be loaded in columns in the target station, the number of loaded columns and the time for loading are updated; determining whether the updated number of loaded columns reaches a target number of loaded columns; and under the condition that the updated number of loaded columns does not reach the target number of loaded columns, deleting the target station from the first set. The loading efficiency can be improved.

Description

Technical Field

[0001] The present invention relates to the technical field of railway transportation dispatching, and particularly to a loading method, device, electronic device and storage medium. Background Art

[0002] Freight trains are an important carrier for railway freight transportation. With the continuous improvement of the railway freight network, freight trains have gradually taken on the main transportation tasks. However, freight trains are usually loaded manually based on experience, and the problem of low loading efficiency has become increasingly prominent. Summary of the Invention

[0003] The present invention provides a loading method, device, electronic device, storage medium and computer program product to solve the defect that in the prior art, freight trains are usually loaded manually based on experience and the problem of low loading efficiency has become increasingly prominent, and achieve the purpose of improving loading efficiency.

[0004] The present invention provides a loading method, including: Count the total number of empty and loaded vehicles at each station in the target area, and add each of the stations to the first set in descending order of the total number of vehicles; Loop and execute the following steps until the updated number of loaded trains reaches the target number of loaded trains, and output the final loading time: For the target station ranked first in the first set, determine whether it is possible to form a loaded train at the target station based on the total number of vehicles corresponding to the target station and the number of vehicles per train; In the case where it is possible to form a loaded train at the target station, update the number of loaded trains and the loading time; Determine whether the updated number of loaded trains reaches the target number of loaded trains; In the case where the updated number of loaded trains does not reach the target number of loaded trains, delete the target station from the first set.

[0005] According to the loading method provided by the present invention, it further includes: In the case where it is not possible to form a loaded train at the target station, add each of the other stations to the second set in ascending order of the distance between the other stations and the target station, where the other stations are the stations other than the target station among all the stations; Loop and execute the following steps until it is possible to form a loaded train at the target station: For the target other station ranked first in the second set, determine whether the number of empty vehicles at the target other station reaches the difference between the number of vehicles per train and the total number of empty and loaded vehicles at the target station; In the case where the number of empty cars at the target other station does not reach the difference between the number of cars per train and the total number of empty and loaded cars at the target station, a first dispatching instruction is issued to the target other station. The first dispatching instruction is used to allocate all the empty cars at the target other station to the target station, update the number of empty cars at the target station, and delete the target other station from the second set.

[0006] A loading method provided by the present invention further includes: In the case where the number of empty cars at the target other station reaches the difference between the number of cars per train and the total number of empty and loaded cars at the target station, a second dispatching instruction is issued to the target other station. The second dispatching instruction is used to allocate some of the empty cars at the target other station to the target station and load them into trains at the target station, and update the number of loaded trains, the loading time, and the number of empty cars at the target other station.

[0007] According to a loading method provided by the present invention, after updating the number of loaded trains, the loading time, and the number of empty cars at the target other station, it is continued to determine whether the updated number of loaded trains reaches the target number of loaded trains.

[0008] According to a loading method provided by the present invention, the updating of the number of loaded trains and the loading time in the case where trains can be loaded into trains at the target station includes: In the case where trains can be loaded into trains at the target station, a rounding operation is performed on the ratio between the total number of empty and loaded cars at the target station and the number of cars per train to obtain the first number of trains; The number of loaded trains is updated based on the first number of trains; The product of the number of cars per train, the updated number of loaded trains, and the loading time per vehicle at the target station is calculated as the first loading time; The product of the difference between the product of the number of cars per train and the updated number of loaded trains and the number of empty cars at the target station and the unloading time per vehicle at the target station is calculated as the first unloading time; The loading time is updated based on the first loading time and the first unloading time.

[0009] According to a loading method provided by the present invention, the number of empty cars allocated from the target other station to the target station is calculated through the following steps: A rounding operation is performed on the ratio of the sum of the total number of empty and loaded cars at the target station and the number of empty cars at the target other station to the number of cars per train to obtain the second number of trains; Calculate the product of the number of the second column and the number of vehicles of each train, and subtract the total number of empty and loaded vehicles at the target station to obtain the number of empty vehicles allocated from the target other stations to the target station.

[0010] According to a loading method provided by the present invention, the updating of the number of loaded trains, the loading time, and the number of empty vehicles at the target other stations includes: Round the ratio between the sum of the number of empty and loaded vehicles at the target station and the number of empty vehicles allocated from the target other stations to the target station and the number of vehicles of each train to obtain a third column of numbers; Update the number of loaded trains based on the third column of numbers; Calculate the product of the number of loaded vehicles at the target station and the unloading time of each vehicle at the target station as the second unloading time; Calculate the product of the sum of the number of empty and loaded vehicles at the target station and the loading time of each vehicle at the target station as the second loading time; Calculate the sum of the second unloading time and the second loading time as the first time; Calculate the product of the number of empty vehicles allocated from the target other stations to the target station and the loading time of each vehicle at the target station as the third loading time; Calculate the ratio between the distance between the target other station and the target station and the train running speed as the empty vehicle dispatching time; Calculate the sum of the third loading time and the empty vehicle dispatching time as the second time; Update the loading time based on the maximum of the first time and the second time; Update the number of empty vehicles at the target other stations based on the number of empty vehicles allocated from the target other stations to the target station.

[0011] The present invention also provides a loading device, including: A vehicle statistics module for statistically calculating the total number of empty and loaded vehicles at each station in the target area; A set adding module for adding each of the stations to a first set in descending order of the total number of vehicles; A loading module for repeatedly executing the following steps until the updated number of loaded trains reaches the target number of loaded trains, and outputting the final loading time: For the target station ranked first in the first set, determine whether it is possible to load trains into columns at the target station based on the total number of vehicles corresponding to the target station and the number of vehicles of each train; In the case where it is possible to load trains into columns at the target station, update the number of loaded trains and the loading time; Determine whether the updated number of loaded train formations reaches the target number of loaded train formations; In the case where the updated number of loaded train formations does not reach the target number of loaded train formations, delete the target station from the first set.

[0012] The present invention also provides an electronic device, including a memory, a processor, and a computer program stored on the memory and executable on the processor. When the processor executes the computer program, the loading method described in any one of the above is implemented.

[0013] The present invention also provides a non-transitory computer-readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, the loading method described in any one of the above is implemented.

[0014] The present invention also provides a computer program product, including a computer program. When the computer program is executed by a processor, the loading method described in any one of the above is implemented.

[0015] The loading method, device, electronic device, and storage medium provided by the present invention first count the total number of empty and loaded vehicles at each station in the target area, and add each station to the first set in descending order of the total number of vehicles; then, loop to execute the following steps until the updated number of loaded train formations reaches the target number of loaded train formations, and output the final loading time: for the target station ranked first in the first set, determine whether it is possible to form a train at the target station based on the total number of vehicles corresponding to the target station and the number of vehicles per train; that is, first judge whether the vehicles at the target station with the largest total number of vehicles in the first set can form a train; in the case where it is possible to form a train at the target station, it means that a new number of loaded train formations and loading time are added, and update the number of loaded train formations and loading time; since the number of loaded train formations has been updated, determine whether the updated number of loaded train formations reaches the target number of loaded train formations; in the case where the updated number of loaded train formations does not reach the target number of loaded train formations, delete the target station from the first set, which means that a new target station needs to be selected from the first set to continue loading. Compared with manual experience, the demand for the target number of loaded train formations can be quickly realized. Therefore, the present invention can improve the loading efficiency. Description of the Drawings

[0016] In order to more clearly illustrate the technical solutions in the present invention or the prior art, the following will briefly introduce the drawings required for the description of the embodiments or the prior art. Obviously, the drawings in the following description are some embodiments of the present invention. For those of ordinary skill in the art, other drawings can be obtained based on these drawings without creative efforts.

[0017] Figure 1 It is a flowchart of the loading method provided by an embodiment of the present invention.

[0018] Figure 2 It is a schematic structural diagram of the loading device provided by an embodiment of the present invention.

[0019] Figure 3 It is a schematic structural diagram of the electronic device provided by an embodiment of the present invention. Detailed implementation manners

[0020] To make the objectives, technical solutions and advantages of the present invention clearer, the technical solutions in the present invention will be clearly and completely described below with reference to the accompanying drawings in the present invention. Apparently, the described embodiments are some but not all of the embodiments of the present invention. All other embodiments obtained by those of ordinary skill in the art based on the embodiments in the present invention without any creative efforts shall fall within the protection scope of the present invention.

[0021] Next, in conjunction with Figure 1 Describe the loading method of the present invention.

[0022] Please refer to Figure 1 , Figure 1 It is a schematic flowchart of the loading method provided by an embodiment of the present invention. As Figure 1 shown, the method may include the following steps 101-step 106.

[0023] Step 101: Count the total number of empty and loaded vehicles at each station in the target area, and add each station to the first set in descending order of the total number of vehicles.

[0024] Specifically, the target area may refer to the urban area. For example, there are stations such as the East Station, West Station, and North Station in the urban area. Count the number of empty vehicles and the number of loaded vehicles at each station in the target area, that is, the total number of vehicles . Initialize the first set , and add each station to the first set in descending order of the total number of vehicles

[0025] Step 102: For the target station ranked first in the first set, judge whether it is possible to load trains at the target station based on the total number of vehicles corresponding to the target station and the number of vehicles per train; if so, proceed to step 103.

[0026] Specifically, take the target station ranked first in the first set , and judge whether holds, that is, by judging the total number of vehicles corresponding to the target station Whether it is greater than or equal to the number of vehicles in each train , to determine whether it is possible to form a train at the target station . If , it means that it is possible to form a train at the target station . If , it means that it is not possible to form a train at the target station .

[0027] Step 103: Update the number of loaded trains and the loading time.

[0028] Specifically, initialize the number of loaded trains , the loading time . If , it means that it is possible to form a train at the target station . After the train formation is completed, the number of loaded trains and the loading time will increase, and the number of loaded trains and the loading time need to be updated.

[0029] Optionally, Step 103 includes:[[]] Step 1031: Perform a rounding operation on the ratio between the total number of empty and loaded vehicles at the target station and the number of vehicles in each train to obtain the first number of trains ; ; Step 1032: Update the number of loaded trains based on the first number of trains, that is ; Step 1033: Calculate the product of the number of vehicles in each train , the updated number of loaded trains and the loading duration of each vehicle at the target station as the first loading duration ; Step 1034: Calculate the product of the number of vehicles in each train and the updated number of loaded trains subtract the difference between the number of empty vehicles at the target station and the product of the unloading duration of each vehicle at the target station as the first unloading duration ; ; Step 1035: Update the loading time based on the first loading duration and the first unloading duration, that is .

[0030] ​​Step 104: Determine whether the updated number of loaded train formations has reached the target number of loaded train formations; if so, proceed to Step 106; if not, proceed to Step 105.

[0031] Specifically, determine whether it holds, that is, determine whether the updated number of loaded train formations has reached the target number of loaded train formations . If , it means that the updated number of loaded train formations has reached the target number of loaded train formations . If , it means that the updated number of loaded train formations has not reached the target number of loaded train formations .

[0032] Step 105: Delete the target station from the first set and return to Step 102.

[0033] Specifically, if the updated number of loaded train formations has not reached the target number of loaded train formations , delete the target station from the first set , that is , return to Step 102, which means that a new target station needs to be selected from the first set to continue loading.

[0034] Step 106: Output the final loading time.

[0035] Specifically, if the updated number of loaded train formations has reached the target number of loaded train formations , output the final loading time .

[0036] The loading method provided by the embodiment of the present invention is as follows. First, count the total number of empty and loaded vehicles at each station in the target area, and add each station to the first set in descending order of the total number of vehicles. Then, loop through the following steps until the updated number of loaded trains reaches the target number of loaded trains, and output the final loading time: For the target station ranked first in the first set, determine whether it is possible to form a loaded train at the target station based on the total number of vehicles corresponding to the target station and the number of vehicles per train; that is, first judge whether the vehicles at the target station with the largest total number of vehicles in the first set can form a loaded train. If it is possible to form a loaded train at the target station, it means that a new number of loaded trains and loading time are added, and update the number of loaded trains and loading time; since the number of loaded trains has been updated, determine whether the updated number of loaded trains reaches the target number of loaded trains. If the updated number of loaded trains does not reach the target number of loaded trains, delete the target station from the first set, which means that a new target station needs to be selected from the first set to continue loading. Compared with manual experience, the requirement of the target number of loaded trains can be quickly achieved. Therefore, the embodiment of the present invention can improve the loading efficiency.

[0037] In one embodiment, as Figure 1 shown, the method further includes steps 107-109.

[0038] In step 102, if not, then go to step 107.

[0039] Step 107: Add each other station to the second set in ascending order of the distance between the other station and the target station. The other stations are the stations other than the target station among all stations.

[0040] Specifically, the other stations are the stations other than the target station among all stations. Count the distance between the other station and the target station . Initialize the second set , and add each other station to the second set in ascending order of the distance .

[0041] Step 108: For the target other station ranked first in the second set, judge whether the number of empty vehicles at the target other station reaches the difference between the number of vehicles per train and the total number of empty and loaded vehicles at the target station; if not, go to step 109.

[0042] Specifically, take the target other station ranked first in the second set , and judge Whether it holds, that is, to judge the target other stations the number of empty cars is greater than or equal to the number of cars per train minus the target station the total number of empty and loaded cars the difference .

[0043] Step 109: Issue a first dispatching instruction to the target other stations. The first dispatching instruction is used to allocate all the empty cars of the target other stations to the target station, update the number of empty cars at the target station, and delete the target other stations from the second set, then return to Step 108.

[0044] Specifically, if , it means that the number of empty cars at the target other stations still cannot meet the requirement of forming a train at the target station . Issue a first dispatching instruction to the target other stations , instructing the target other stations to allocate all the empty cars to the target station , that is, the number of empty cars allocated by the target other stations to the target station is = . Update the number of empty cars at the target station , that is = . And delete the target other stations from the second set , that is . Return to Step 108, which means that a new target other station needs to be selected from the second set to continue allocating empty cars.

[0045] In this embodiment, for the case where a train cannot be formed at the target station, all the empty cars of the nearest target other station are preferentially allocated to the target station. If a train still cannot be formed at the target station, the empty cars of a new target other station are continuously allocated to the target station, which can improve the efficiency of empty car allocation at nearby stations.

[0046] In one embodiment, as Figure 1 shown, the method further includes Step 110.

[0047] In Step 108, if so, transfer to Step 110.

[0048] Step 110: Issue a second dispatching instruction to the target other station. The second dispatching instruction is used to allocate some empty cars of the target other station to the target station and load them into a train at the target station, and update the number of loaded trains, the loading time, and the number of empty cars at the target other station.

[0049] Specifically, if , it means that the number of empty cars at the target other station can meet the requirement of loading into a train at the target station. Issue a second dispatching instruction to the target other station , instructing the target other station to allocate some empty cars of the target other station to the target station . Then, the cars can be loaded into a train at the target station . Update the number of loaded trains , the loading time , and the number of empty cars at the target other station and the target other station 's number of empty cars .

[0050] Optionally, as Figure 1 shown, after updating the number of loaded trains, the loading time, and the number of empty cars at the target other station in Step 110, continue to determine whether the updated number of loaded trains reaches the target number of loaded trains, that is, return to Step 104.

[0051] Optionally, the number of empty cars allocated from the target other station to the target station is calculated through the following steps: Take the integer part of the ratio of the sum of the number of empty cars and loaded cars at the target station to the number of cars per train to obtain the second number of trains . Calculate the product of the second number of trains and the number of cars per train minus the sum of the number of empty cars and loaded cars at the target station to get the number of empty cars allocated from the target other station to the target station , that is, the difference between the number of cars required at the target station and the existing number of cars at the target station . This difference is the number of empty cars that need to be allocated from the target other station to the target station , which is the number of empty cars required at the target station and the existing number of cars at the target station . The difference is the number of empty cars that need to be allocated from the target other station , which is .

[0052] Optionally, update the number of loaded trains in step 110 , loading time and the number of empty cars at other target stations , including: ; Take the integer operation on the ratio between the sum of the number of empty and loaded cars at the target station and the sum of the number of empty cars allocated from other target stations to the target station and the number of cars per train to obtain the third column number ; Update the number of loaded trains based on the third column number, i.e., ; ; Calculate the product of the number of loaded cars at the target station and the unloading duration of each car at the target station as the second unloading duration ; Calculate the product of the sum of the number of empty and loaded cars at the target station and the loading duration of each car at the target station as the second loading duration ; Calculate the sum of the second unloading duration and the second loading duration as the first duration ; Calculate the product of the number of empty cars allocated from other target stations to the target station and the loading duration of each car at the target station as the third loading duration ; Calculate the ratio between the distance between other target stations and the target station and the train running speed as the empty car dispatching duration ; Calculate the sum of the third loading duration and the empty car dispatching duration as the second duration ; Based on the first duration and the second duration ; ; ; ; Calculate the sum of the third loading duration and the empty car dispatching duration as the second duration ; Based on the first duration and the second duration Update the loading time of the maximum duration in it, that is ; Based on the target station Allocate the empty cars of other target stations The number of empty cars Update other target stations The number of empty cars , that is .

[0053] In this embodiment, for the case where a train can be loaded at the target station, directly allocate some empty cars from the nearest other target station to the target station, and a train can be loaded at the target station.

[0054] The loading device provided by the present invention will be described below. The loading device described below can be mutually corresponding and referred to the loading method described above.

[0055] Please refer to Figure 2 , Figure 2 It is a schematic structural diagram of the loading device provided by an embodiment of the present invention. As Figure 2 shown, the device may include: The vehicle statistics module 10 is used to count the total number of empty and loaded cars at each station in the target area; The set adding module 20 is used to add each station to the first set in descending order of the total number of vehicles; The loading module 30 is used to repeatedly execute the following steps until the updated number of loaded trains reaches the target number of loaded trains, and output the final loading time: For the target station ranked first in the first set, determine whether a train can be loaded at the target station based on the total number of vehicles corresponding to the target station and the number of vehicles per train; When a train can be loaded at the target station, update the number of loaded trains and the loading time; Determine whether the updated number of loaded trains reaches the target number of loaded trains; When the updated number of loaded trains does not reach the target number of loaded trains, delete the target station from the first set.

[0056] In one embodiment, the loading module 30 is further used for: When a train cannot be loaded at the target station, add each other station to the second set in ascending order of the distance between the other station and the target station. The other stations are the stations except the target station among all stations; Repeatedly execute the following steps until a train can be loaded at the target station: For the target other station ranked first in the second set, determine whether the number of empty cars at the target other station reaches the difference between the number of cars per train and the total number of empty and loaded cars at the target station; In the case where it is determined that the number of empty cars at the target other station does not reach the difference between the number of cars per train and the total number of empty and loaded cars at the target station, issue a first scheduling instruction to the target other station. The first scheduling instruction is used to allocate all the empty cars of the target other station to the target station, update the number of empty cars at the target station, and delete the target other station from the second set.

[0057] In one embodiment, the loading module 30 is further configured to: In the case where it is determined that the number of empty cars at the target other station reaches the difference between the number of cars per train and the total number of empty and loaded cars at the target station, issue a second scheduling instruction to the target other station. The second scheduling instruction is used to allocate a part of the empty cars of the target other station to the target station and load them into a train at the target station, and update the number of loaded trains, the loading time, and the number of empty cars at the target other station.

[0058] In one embodiment, the loading module 30 is further configured to, after updating the number of loaded trains, the loading time, and the number of empty cars at the target other station, continue to determine whether the updated number of loaded trains reaches the target number of loaded trains.

[0059] In one embodiment, the loading module 30 is specifically configured to: In the case where it is possible to load a train at the target station, perform a rounding operation on the ratio between the total number of empty and loaded cars at the target station and the number of cars per train to obtain the first number of trains; Update the number of loaded trains based on the first number of trains; Calculate the product of the number of cars per train, the updated number of loaded trains, and the loading time per vehicle at the target station as the first loading time; Calculate the product of the difference between the product of the number of cars per train and the updated number of loaded trains minus the number of empty cars at the target station and the unloading time per vehicle at the target station as the first unloading time; Update the loading time based on the first loading time and the first unloading time.

[0060] In one embodiment, the loading module 30 is specifically configured to: Perform a rounding operation on the ratio of the sum of the total number of empty and loaded cars at the target station and the number of empty cars at the target other station to the number of cars per train to obtain the second number of trains; Calculate the product of the second number of trains and the number of cars per train minus the total number of empty and loaded cars at the target station to obtain the number of empty cars of the target other station to be allocated to the target station.

[0061] In one embodiment, the loading module 30 is specifically configured to: Round the ratio between the total number of empty and loaded vehicles at the target station, the sum of the number of empty vehicles allocated from other target stations to the target station, and the number of vehicles per train to obtain a third column number; Update the number of loaded trains based on the third column number; Calculate the product of the number of loaded vehicles at the target station and the unloading duration per vehicle at the target station as the second unloading duration; Calculate the product of the total number of empty and loaded vehicles at the target station and the loading duration per vehicle at the target station as the second loading duration; Calculate the sum of the second unloading duration and the second loading duration as the first duration; Calculate the product of the number of empty vehicles allocated from other target stations to the target station and the loading duration per vehicle at the target station as the third loading duration; Calculate the ratio between the distance between the other target station and the target station and the train running speed as the empty vehicle dispatching duration; Calculate the sum of the third loading duration and the empty vehicle dispatching duration as the second duration; Update the loading time based on the maximum duration among the first duration and the second duration; Update the number of empty vehicles at the other target station based on the number of empty vehicles allocated from the other target station to the target station.

[0062] Figure 3 An example of the physical structure diagram of an electronic device is shown in Figure 3 As shown, the electronic device may include: a processor 310, a communication interface 320, a memory 330, and a communication bus 340. Among them, the processor 310, the communication interface 320, and the memory 330 complete mutual communication through the communication bus 340. The processor 310 can call the logical instructions in the memory 330 to execute the loading method, which includes: counting the total number of empty and loaded vehicles at each station in the target area, and adding each station to the first set in descending order of the total number of vehicles; repeatedly execute the following steps until the updated number of loaded trains reaches the target number of loaded trains, and output the final loading time: for the target station ranked first in the first set, determine whether it is possible to load trains into columns at the target station based on the total number of vehicles corresponding to the target station and the number of vehicles per train; in the case where it is possible to load trains into columns at the target station, update the number of loaded trains and the loading time; determine whether the updated number of loaded trains reaches the target number of loaded trains; in the case where the updated number of loaded trains does not reach the target number of loaded trains, delete the target station from the first set.

[0063] In addition, when the logical instructions in the above-mentioned memory 330 can be implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on such an understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art, or a part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in various embodiments of the present invention. The aforementioned storage medium includes: various media such as USB flash drives, mobile hard disks, read-only memories (ROM, Read-Only Memory), random access memories (RAM, Random Access Memory), magnetic disks, or optical discs that can store program codes.

[0064] On the other hand, the present invention also provides a computer program product. The computer program product includes a computer program that can be stored on a non-transitory computer-readable storage medium. When the computer program is executed by a processor, the computer can execute the loading method provided in each of the above method embodiments. The method includes: counting the total number of empty and loaded vehicles at each station in the target area, and adding each station to the first set in descending order of the total number of vehicles; repeatedly executing the following steps until the updated number of loaded trains reaches the target number of loaded trains, and outputting the final loading time: for the target station ranked first in the first set, determine whether it is possible to form a loaded train at the target station based on the total number of vehicles corresponding to the target station and the number of vehicles per train; in the case where it is possible to form a loaded train at the target station, update the number of loaded trains and the loading time; determine whether the updated number of loaded trains reaches the target number of loaded trains; in the case where the updated number of loaded trains does not reach the target number of loaded trains, delete the target station from the first set.

[0065] In another aspect, the present invention further provides a non-transitory computer-readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, it implements the loading method provided in the above method embodiments. The method includes: counting the total number of empty and loaded vehicles at each station in the target area, and adding each station to the first set in descending order of the total number of vehicles; repeatedly executing the following steps until the updated number of loaded trains reaches the target number of loaded trains, and outputting the final loading time: for the target station ranked first in the first set, determine whether it is possible to form a loaded train at the target station based on the total number of vehicles corresponding to the target station and the number of vehicles per train; in the case where it is possible to form a loaded train at the target station, update the number of loaded trains and the loading time; determine whether the updated number of loaded trains reaches the target number of loaded trains; in the case where the updated number of loaded trains does not reach the target number of loaded trains, delete the target station from the first set.

[0066] The device embodiments described above are merely illustrative. The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place, or may be distributed to multiple network units. Some or all of the modules can be selected according to actual needs to achieve the purpose of the solution of this embodiment. Those of ordinary skill in the art can understand and implement it without creative effort.

[0067] Through the description of the above embodiments, those skilled in the art can clearly understand that each embodiment can be implemented by means of software plus a necessary general hardware platform, and of course, also by hardware. Based on this understanding, the essence of the above technical solution, or the part that contributes to the prior art, can be embodied in the form of a software product. The computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, magnetic disk, optical disk, etc., and includes several instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods described in each embodiment or some parts of the embodiments.

[0068] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, and are not intended to limit them; although the present invention has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that they can still modify the technical solutions described in the foregoing embodiments, or perform equivalent replacements for some of the technical features; and these modifications or replacements do not make the essence of the corresponding technical solutions deviate from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A loading method, characterized in that, Including: Count the total number of empty and loaded vehicles at each station within the target area, and add each of the stations to the first set in descending order of the total number of vehicles; Loop and execute the following steps until the updated number of loaded train formations reaches the target number of loaded train formations, and output the final loading time: For the target station ranked first in the first set, determine whether it is possible to form a train formation for loading at the target station based on the total number of vehicles corresponding to the target station and the number of vehicles per train; In the case where it is possible to form a train formation for loading at the target station, update the number of loaded train formations and the loading time; Determine whether the updated number of loaded train formations reaches the target number of loaded train formations; In the case where the updated number of loaded train formations does not reach the target number of loaded train formations, delete the target station from the first set.

2. The loading method according to claim 1, wherein Also including: In the case where it is not possible to form a train formation for loading at the target station, add each of the other stations to the second set in ascending order of the distance between the other stations and the target station, where the other stations are the stations other than the target station among all the stations; Loop and execute the following steps until it is possible to form a train formation for loading at the target station: For the target other station ranked first in the second set, determine whether the number of empty vehicles at the target other station reaches the difference between the number of vehicles per train and the total number of empty and loaded vehicles at the target station; In the case where it is determined that the number of empty vehicles at the target other station does not reach the difference between the number of vehicles per train and the total number of empty and loaded vehicles at the target station, issue a first dispatching instruction to the target other station, where the first dispatching instruction is used to allocate all the empty vehicles of the target other station to the target station, update the number of empty vehicles at the target station, and delete the target other station from the second set.

3. The loading method according to claim 2, characterized in that, Also including: In the case where it is determined that the number of empty vehicles at the target other station reaches the difference between the number of vehicles per train and the total number of empty and loaded vehicles at the target station, issue a second dispatching instruction to the target other station, where the second dispatching instruction is used to allocate some of the empty vehicles of the target other station to the target station and form a train formation for loading at the target station, and update the number of loaded train formations, the loading time, and the number of empty vehicles at the target other station.

4. The loading method according to claim 3, wherein After updating the number of loaded train formations, the loading time, and the number of empty vehicles at the target other station, continue to determine whether the updated number of loaded train formations reaches the target number of loaded train formations.

5. The loading method according to claim 1, characterized in that The step of updating the number of loaded train formations and the loading time in the case where it is possible to form a train formation for loading at the target station includes: In the case where it is possible to form a train formation for loading at the target station, perform a rounding operation on the ratio between the total number of empty and loaded vehicles at the target station and the number of vehicles per train to obtain the number of the first train formation; Update the number of loaded train formations based on the number of the first train formation; Calculate the product of the number of vehicles per train, the updated number of loaded train formations, and the loading time per vehicle at the target station as the first loading time; Calculate the product of the number of vehicles per train and the updated number of loaded trains, subtract the number of empty cars at the target station, and then multiply the difference by the unloading time per vehicle at the target station to obtain the first unloading time. Update the loading time based on the first loading time and the first unloading time.

6. The loading method according to claim 3, wherein The number of empty cars allocated from the target other station to the target station is calculated through the following steps: Round the ratio of the sum of the number of empty and loaded cars at the target station, the sum of the number of empty cars at the target other station, and the number of vehicles per train to obtain the second number of trains. Calculate the product of the second number of trains and the number of vehicles per train, and subtract the sum of the number of empty and loaded cars at the target station to obtain the number of empty cars allocated from the target other station to the target station.

7. The loading method according to claim 6, wherein The update of the number of loaded trains, the loading time, and the number of empty cars at the target other station includes: Round the ratio of the sum of the number of empty and loaded cars at the target station, the number of empty cars allocated from the target other station to the target station, and the number of vehicles per train to obtain the third number of trains. Update the number of loaded trains based on the third number of trains. Calculate the product of the number of loaded cars at the target station and the unloading time per vehicle at the target station to obtain the second unloading time. Calculate the product of the sum of the number of empty and loaded cars at the target station and the loading time per vehicle at the target station to obtain the second loading time. Calculate the sum of the second unloading time and the second loading time as the first time. Calculate the product of the number of empty cars allocated from the target other station to the target station and the loading time per vehicle at the target station as the third loading time. Calculate the ratio of the distance between the target other station and the target station to the train running speed as the empty car dispatching time. Calculate the sum of the third loading time and the empty car dispatching time as the second time. Update the loading time based on the maximum time of the first time and the second time. Update the number of empty cars at the target other station based on the number of empty cars allocated from the target other station to the target station.

8. A loading device, characterized in that, It includes: A vehicle statistics module for counting the sum of the number of empty and loaded cars at each station in the target area. A set addition module for adding each station to the first set in descending order of the vehicle sum. A loading module for repeatedly executing the following steps until the updated number of loaded trains reaches the target number of loaded trains, and outputting the final loading time: For the target station ranked first in the first set, determine whether it is possible to load trains into columns at the target station based on the vehicle sum corresponding to the target station and the number of vehicles per train. When it is possible to load trains into columns at the target station, update the number of loaded trains and the loading time. Determine whether the updated number of loaded trains reaches the target number of loaded trains. When the updated number of loaded trains does not reach the target number of loaded trains, delete the target station from the first set.

9. An electronic device, comprising a memory, a processor, and a computer program stored on the memory and running on the processor, characterized in that, When the processor executes the computer program, it implements the loading method according to any one of claims 1 to 7.

10. A non-transitory computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by the processor, it implements the loading method according to any one of claims 1 to 7.

Images