Coordinated dispatching management method and system for port terminal and railway freight

By obtaining cargo loading information and resource information in port terminals and railway freight systems, and using ant colony algorithm to optimize the scheduling solution, the problem of information islands and low resource utilization in coordinated scheduling management of port terminals and railway freight is solved, and the scheduling is improved Efficiency and transportation quality.

CN118396345BActive Publication Date: 2024-11-08NINGBO PORT INFORMATION COMM CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202410840459.6
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-06-27
Publication Date
2024-11-08
Estimated Expiration
2044-06-27

AI Technical Summary

Technical Problem

The current coordinated dispatching and management methods of port terminals and railway freight have problems such as information islands, low resource utilization rate, and low scheduling efficiency, which seriously restricts the overall efficiency of ports and railway transportation.

Method used

By obtaining the train's cargo loading information and port and terminal resource information in the database, the initial cargo scheduling plan is optimized based on the ant colony algorithm, the target cargo scheduling plan is generated, the train's target unloading location and entry route are determined, and the resource utilization and scheduling efficiency are optimized.

Benefits of technology

It improves the scientificity of the scheduling method, resource utilization efficiency and flexibility, reduces operating costs, and helps improve the quality of transportation services.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118396345B_ABST
    Figure CN118396345B_ABST
Patent Text Reader

Abstract

The present application relates to the technical field of collaborative dispatching management, and provides a collaborative dispatching management method and system for port terminals and railway freight, the method comprising: obtaining cargo loading information of a train in a database, and obtaining current port terminal resource information; wherein the port terminal resource information includes the yard information and loading and unloading equipment information of the port terminal; generating the target unloading position and train approach route of the train based on the cargo loading information and the yard information; generating the initial cargo dispatching plan of the train based on the cargo loading information and the loading and unloading equipment information; optimizing the initial cargo dispatching plan based on a preset ant colony algorithm to obtain a target cargo dispatching plan; dispatching each piece of cargo in the carriage of the train based on the target cargo dispatching plan. The method effectively improves the scientificity, resource utilization efficiency and flexibility of the dispatching method, and reduces operating costs.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the technical field of collaborative dispatching management, and in particular to a method and system for collaborative dispatching management of port terminals and railway freight. Background Art

[0002] With the acceleration of global economic integration, the volume of international trade continues to grow. Ports and railways, as important logistics hubs and transportation methods, play a vital role in the modern logistics system. Port terminals are important channels for the entry and exit of international goods, while railways are an important means of inland transportation. The coordinated operation of ports and railways is not only related to the efficiency and cost of cargo transportation, but also affects the stability and reliability of the entire supply chain. Therefore, the efficient coordinated dispatching and management of port terminals and railway freight has become an important issue that needs to be solved in the field of modern logistics.

[0003] However, the current collaborative dispatching and management methods for port terminals and railway freight generally have problems such as information islands, low resource utilization, and low dispatching efficiency, which seriously restrict the overall efficiency of port and railway transportation. Summary of the invention

[0004] The present application provides a coordinated dispatching management method and system for port terminals and railway freight to solve the problems raised by the above-mentioned background technology.

[0005] In a first aspect, the present application provides a coordinated dispatching management method for port terminals and railway freight, comprising:

[0006] Obtaining cargo loading information of the train in the database, and obtaining current port terminal resource information; wherein the port terminal resource information includes the port terminal yard information and loading and unloading equipment information;

[0007] generating a target unloading position of the train and a train approach route based on the cargo loading information and the yard information;

[0008] generating an initial cargo dispatching plan for the train based on the cargo loading information and the loading and unloading equipment information;

[0009] Optimizing the initial cargo scheduling plan based on a preset ant colony algorithm to obtain a target cargo scheduling plan;

[0010] Each piece of cargo in the carriage of the train is scheduled based on the target cargo scheduling plan.

[0011] In a possible implementation, the cargo loading information includes cargo attributes and cargo volume of each cargo in the carriage of the train, the yard information includes the transportation efficiency and available volume of each yard of the port terminal, and the generating of the target unloading position of the train and the train approach route based on the cargo loading information and the yard information includes:

[0012] For each piece of cargo in the carriage of the train, determining a target transportation urgency coefficient of the cargo based on the attributes of the cargo;

[0013] Determine a corresponding storage yard for each piece of the cargo in each storage yard based on the cargo volume and target transportation urgency coefficient of each piece of the cargo, the transportation efficiency and available volume of each storage yard;

[0014] The number of goods that the train needs to deliver at each of the yards is counted respectively, and a target yard is determined based on the number of goods that the train needs to deliver at each of the yards; wherein the number of goods that the train needs to deliver at the target yard is the largest;

[0015] Determine the unloading location corresponding to the target yard as the target unloading location;

[0016] The train approach route is generated based on the current position of the train and the target unloading position.

[0017] In a possible implementation, the cargo attributes include cargo category and customer transportation deadline requirement information, and determining the target transportation urgency coefficient of the cargo based on the cargo attributes includes:

[0018] Traversing a preset cargo attribute-initial transport emergency coefficient mapping relationship table to determine an initial transport emergency coefficient corresponding to the cargo;

[0019] Determining whether the customer has made any requirements on the transportation period of the goods based on the customer's transportation period requirement information;

[0020] If not, determining the initial transport emergency coefficient as the target transport emergency coefficient;

[0021] If so, the initial transportation urgency coefficient is corrected based on the transportation deadline requirement of the goods proposed by the customer and a preset transportation urgency coefficient correction logic to obtain the target transportation urgency coefficient.

[0022] In a possible implementation, determining a corresponding delivery yard for each piece of the cargo in each of the yards based on the cargo volume and target transportation urgency coefficient of each piece of the cargo, the transportation efficiency and available volume of each of the yards includes:

[0023] Arranging each of the goods in sequence based on the target transportation urgency coefficient corresponding to each of the goods to obtain a first goods sequence; wherein, in the first goods sequence, the target transportation urgency coefficient corresponding to each of the goods decreases in sequence;

[0024] Based on the cargo volume of each piece of the cargo, the transportation efficiency and available volume of each of the storage yards, the first cargo sequence sequentially determines a corresponding delivery yard for each piece of the cargo in each of the storage yards.

[0025] In a possible implementation, the cargo loading information includes the loading position of each piece of cargo in the carriage of the train in the carriage, the loading and unloading equipment information includes the loading and unloading equipment information of each of the delivery yards, each of the delivery yards includes a loading and unloading equipment, and the loading and unloading equipment information includes the capacity and position of the loading and unloading equipment. Generating an initial cargo scheduling plan for the train based on the cargo loading information and the loading and unloading equipment information includes:

[0026] Determining the unloading order of each piece of cargo based on the loading position of each piece of cargo in the carriage;

[0027] Integrate the goods that the train needs to deliver at each delivery yard to obtain a set of goods corresponding to each delivery yard;

[0028] Determining the cargo unloading routes corresponding to each cargo set based on the unloading order corresponding to each cargo in each cargo set; wherein each cargo unloading route includes at least one cargo unloading node;

[0029] For each of the cargo collections, determining a dispatching route corresponding to the cargo collection based on the location and capacity of the loading and unloading equipment of the delivery yard corresponding to the cargo collection, the cargo volume of each cargo in the cargo collection, and the cargo unloading route;

[0030] An initial cargo scheduling plan for the train is generated based on the unloading order of each cargo in the carriage and each of the scheduling routes.

[0031] In a possible implementation, the initial cargo scheduling scheme is optimized based on a preset ant colony algorithm to obtain a target cargo scheduling scheme, including:

[0032] Constructing a virtual scene corresponding to the initial cargo scheduling plan;

[0033] Setting an initial pheromone concentration for each virtual path corresponding to the virtual scene based on the initialization parameters of the ant colony algorithm;

[0034] Based on the initial cargo scheduling plan, the virtual ants in the ant colony algorithm are controlled to perform virtual cargo scheduling in the virtual scene, and the first updated pheromone concentration of each first intermediate target virtual path is obtained; wherein the first intermediate target virtual path is the virtual path passed by the virtual ants when performing virtual cargo scheduling, and when the virtual ants pass through the first intermediate target virtual path, the initial pheromone concentration of the first intermediate target virtual path is updated based on the virtual road condition of the first intermediate target virtual path to obtain the first updated pheromone concentration;

[0035] Determine a first intermediate target virtual path whose first updated pheromone concentration is greater than a preset pheromone concentration as a second intermediate target virtual path, and control the virtual ants in the ant colony algorithm to perform virtual cargo scheduling in the virtual scene based on the initial cargo scheduling plan and each of the second intermediate target virtual paths, and obtain the second updated pheromone concentration of each third intermediate target virtual path; wherein the third intermediate target virtual path is a virtual path passed by the virtual ants when performing virtual cargo scheduling, and when the virtual ants pass through the third intermediate target virtual path, the initial pheromone concentration of the third intermediate target virtual path is updated based on the virtual road condition of the third intermediate target virtual path to obtain a second updated pheromone concentration;

[0036] Iterate the previous method step until the final updated pheromone concentration of each target virtual path passed by the virtual ant when performing virtual cargo scheduling is greater than the preset pheromone concentration, and obtain the target virtual scheduling path corresponding to the initial cargo scheduling plan;

[0037] The initial cargo scheduling plan is optimized based on the target virtual scheduling path to obtain the target cargo scheduling plan.

[0038] In a second aspect, the present application provides a coordinated dispatching management system for port terminals and railway freight, including:

[0039] An acquisition module is used to acquire the cargo loading information of the train from the database and to acquire the current port terminal resource information; wherein the port terminal resource information includes the port terminal yard information and loading and unloading equipment information;

[0040] A first generating module, configured to generate a target unloading position of the train and a train approach route based on the cargo loading information and the yard information;

[0041] A second generating module, configured to generate an initial cargo dispatching plan for the train based on the cargo loading information and the loading and unloading equipment information;

[0042] An optimization module, used to optimize the initial cargo scheduling plan based on a preset ant colony algorithm to obtain a target cargo scheduling plan;

[0043] A scheduling module is used to schedule each piece of cargo in the carriage of the train based on the target cargo scheduling plan.

[0044] In a possible implementation, the optimization module includes:

[0045] A construction unit, used to construct a virtual scene corresponding to the initial cargo scheduling plan;

[0046] A setting unit, configured to set an initial pheromone concentration for each virtual path corresponding to the virtual scene based on an initialization parameter of the ant colony algorithm;

[0047] A first control unit is used to control the virtual ants in the ant colony algorithm to perform virtual cargo scheduling in the virtual scene based on the initial cargo scheduling plan, and obtain a first updated pheromone concentration of each first intermediate target virtual path; wherein the first intermediate target virtual path is a virtual path passed by the virtual ants when performing virtual cargo scheduling, and when the virtual ants pass through the first intermediate target virtual path, the initial pheromone concentration of the first intermediate target virtual path is updated based on the virtual road condition of the first intermediate target virtual path to obtain a first updated pheromone concentration;

[0048] a second control unit, for determining a first intermediate target virtual path whose first updated pheromone concentration is greater than a preset pheromone concentration as a second intermediate target virtual path, and controlling the virtual ants in the ant colony algorithm to perform virtual cargo scheduling in the virtual scene based on the initial cargo scheduling plan and each of the second intermediate target virtual paths, and obtaining the second updated pheromone concentration of each third intermediate target virtual path; wherein the third intermediate target virtual path is a virtual path passed by the virtual ants when performing virtual cargo scheduling, and when the virtual ants pass through the third intermediate target virtual path, the initial pheromone concentration of the third intermediate target virtual path is updated based on the virtual road condition of the third intermediate target virtual path to obtain a second updated pheromone concentration;

[0049] A third control unit is used to iterate the previous step until the final updated pheromone concentration of each target virtual path passed by the virtual ant when performing virtual cargo scheduling is greater than the preset pheromone concentration, and the target virtual scheduling path corresponding to the initial cargo scheduling plan is obtained;

[0050] The optimization unit is used to optimize the initial cargo scheduling plan based on the target virtual scheduling path to obtain the target cargo scheduling plan.

[0051] The present application provides a coordinated dispatching management method and system for port terminals and railway freight. The method includes: obtaining cargo loading information of trains in a database, and obtaining current port terminal resource information; wherein the port terminal resource information includes the port terminal yard information and loading and unloading equipment information;

[0052] Based on the cargo loading information and the yard information, the target unloading location and train approach route of the train are generated; based on the cargo loading information and the loading and unloading equipment information, the initial cargo scheduling plan of the train is generated; based on the preset ant colony algorithm, the initial cargo scheduling plan is optimized to obtain the target cargo scheduling plan; based on the target cargo scheduling plan, each piece of cargo in the carriage of the train is scheduled. This method effectively improves the scientificity, resource utilization efficiency and flexibility of the scheduling method, reduces operating costs, and helps to improve the quality of transportation services. BRIEF DESCRIPTION OF THE DRAWINGS

[0053] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the accompanying drawings required for use in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other accompanying drawings can be obtained based on these accompanying drawings without paying any creative work.

[0054] Figure 1 A flow chart of a coordinated dispatching management method for port terminals and railway freight provided in an embodiment of the present application;

[0055] Figure 2 A schematic block diagram of the structure of the coordinated dispatching management system for port terminals and railway freight provided in an embodiment of the present application;

[0056] Figure 3 A schematic block diagram of the structure of a computer device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0057] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0058] The flowcharts shown in the accompanying drawings are only examples and do not necessarily include all the contents and operations / steps, nor must they be executed in the order described. For example, some operations / steps may also be decomposed, combined or partially merged, so the actual execution order may change according to actual conditions.

[0059] It should also be understood that the terms used in this application specification are only for the purpose of describing specific embodiments and are not intended to limit the application. As used in this application specification and the appended claims, unless the context clearly indicates otherwise, the singular forms "a", "an" and "the" are intended to include plural forms.

[0060] It should be further understood that the term “and / or” used in the specification and appended claims refers to any combination and all possible combinations of one or more of the associated listed items, and includes these combinations.

[0061] With the acceleration of the process of global economic integration, the volume of international trade continues to grow. Ports and railways, as important logistics hubs and modes of transportation, play a vital role in the modern logistics system. Port terminals are important channels for the entry and exit of international goods, while railways are an important means of inland transportation. The coordinated operation of ports and railways is not only related to the efficiency and cost of cargo transportation, but also affects the stability and reliability of the entire supply chain. Therefore, the efficient collaborative scheduling management of port terminals and railway freight has become an important issue to be urgently addressed in the field of modern logistics. However, the current collaborative scheduling management methods for port terminals and railway freight generally have problems such as information islands, low resource utilization, and low scheduling efficiency, which seriously restrict the overall efficiency of port and railway transportation. To this end, the present application provides a collaborative scheduling management method and system for port terminals and railway freight to solve the above problems.

[0062] In conjunction with the accompanying drawings, some embodiments of the present application are described in detail below. In the absence of conflict, the following embodiments and features in the embodiments can be combined with each other.

[0063] See also Figure 1 , Figure 1 A flow chart of the coordinated dispatching management method for port terminals and railway freight provided in the embodiment of the present application is as follows: Figure 1 As shown, the coordinated dispatching management method for port terminals and railway freight provided in the embodiment of the present application includes steps S100 to S500.

[0064] Step S100, obtaining cargo loading information of the train in the database, and obtaining current port terminal resource information; wherein the port terminal resource information includes the port terminal yard information and loading and unloading equipment information.

[0065] Specifically, first, the train number code of the train is obtained, and the cargo loading information is obtained in the database based on the train number code, and then the current port terminal resource information is obtained through various IoT sensors set up in the port terminal. The database is provided with a corresponding relationship between each train number code and its corresponding cargo loading information, and the IoT sensors include visual sensors, positioning sensors, etc.

[0066] Step S200: generating a target unloading location of the train and a train approach route based on the cargo loading information and the yard information.

[0067] Specifically, the cargo loading information includes cargo attributes and cargo volume of each cargo in the carriage of the train, and the yard information includes the transportation efficiency and available volume of each yard of the port terminal. Step S200 specifically includes the following steps:

[0068] For each piece of cargo in the carriage of the train, determining a target transportation urgency coefficient of the cargo based on the attributes of the cargo;

[0069] Determine a corresponding storage yard for each piece of the cargo in each storage yard based on the cargo volume and target transportation urgency coefficient of each piece of the cargo, the transportation efficiency and available volume of each storage yard;

[0070] The number of goods that the train needs to deliver at each of the yards is counted respectively, and a target yard is determined based on the number of goods that the train needs to deliver at each of the yards; wherein the number of goods that the train needs to deliver at the target yard is the largest;

[0071] Determine the unloading location corresponding to the target yard as the target unloading location;

[0072] The train approach route is generated based on the current position of the train and the target unloading position.

[0073] It can be understood that since the train needs to deliver the largest amount of goods at the target yard, this solution helps to reduce the length of the goods transportation path during the scheduling process and improve the scheduling efficiency of the goods by determining the unloading location corresponding to the target yard as the target unloading location.

[0074] The cargo attributes include cargo category and customer transportation deadline requirement information, and determining the target transportation urgency coefficient of the cargo based on the cargo attributes includes the following steps:

[0075] Traversing a preset cargo attribute-initial transport emergency coefficient mapping relationship table to determine an initial transport emergency coefficient corresponding to the cargo;

[0076] Determining whether the customer has made any requirements on the transportation period of the goods based on the customer's transportation period requirement information;

[0077] If not, determining the initial transport emergency coefficient as the target transport emergency coefficient;

[0078] If so, the initial transportation urgency coefficient is corrected based on the transportation deadline requirement of the goods proposed by the customer and a preset transportation urgency coefficient correction logic to obtain the target transportation urgency coefficient.

[0079] It can be understood that this solution helps to meet the customer's transportation needs for the goods and improve customer satisfaction with the delivery of goods by judging whether the customer has any requirements for the transportation time limit of the goods based on the customer's transportation time limit demand information, and setting a target transportation urgency coefficient for the goods based on the specific judgment result.

[0080] The method of determining a corresponding storage yard for each piece of the cargo in each storage yard based on the cargo volume and target transportation emergency coefficient of each piece of the cargo, the transportation efficiency and available volume of each storage yard comprises:

[0081] Arranging each of the goods in sequence based on the target transportation urgency coefficient corresponding to each of the goods to obtain a first goods sequence; wherein, in the first goods sequence, the target transportation urgency coefficient corresponding to each of the goods decreases in sequence; it should be noted that the transportation urgency of the goods is positively correlated with the target transportation urgency coefficient corresponding to the goods;

[0082] Based on the cargo volume of each piece of the cargo, the transportation efficiency and available volume of each of the yards, the first cargo sequence determines the corresponding delivery yard for each piece of the cargo in each of the yards in sequence. Specifically, for the first cargo in the first cargo sequence, first, based on the cargo volume of the first cargo and the available volume of each yard, a potential delivery yard is selected for the first cargo; wherein the available volume of each potential delivery yard is greater than the cargo volume of the first cargo; then, based on the transportation efficiency of each potential delivery yard, a delivery yard is determined for the first cargo, wherein the delivery yard is the yard with the highest transportation efficiency among all potential delivery yards; finally, the cargo volume of the first cargo is subtracted from the available volume of the delivery yard corresponding to the first cargo to obtain the new available volume corresponding to the delivery yard corresponding to the first cargo. Based on the above method of selecting a delivery yard for the first cargo in the first cargo sequence, delivery yards are selected in sequence for the remaining cargo in the first cargo sequence.

[0083] It can be understood that this solution determines the corresponding delivery yard for each piece of the cargo in each yard in sequence based on the cargo volume of each piece of the cargo, the transportation efficiency and available volume of each yard, and the first cargo sequence. On the one hand, it is conducive to making full use of the resources of each yard, and on the other hand, it provides a reliable guarantee for the orderly scheduling of subsequent cargo, which helps to improve the efficiency of the coordinated scheduling management method of port terminals and railway freight.

[0084] Step S300: generating an initial cargo scheduling plan for the train based on the cargo loading information and the loading and unloading equipment information.

[0085] Specifically, the cargo loading information includes the loading position of each piece of cargo in the carriage of the train in the carriage, the loading and unloading equipment information includes the loading and unloading equipment information of each of the delivery yards, each of the delivery yards includes a loading and unloading equipment, each of the loading and unloading equipment includes a lifting device and a box body, the lifting device is used to carry cargo, and the box body is used to load cargo, the loading and unloading equipment information includes the capacity and position of the loading and unloading equipment, and step S300 specifically includes the following steps:

[0086] Determining the unloading order of each piece of cargo based on the loading position of each piece of cargo in the carriage;

[0087] Integrate the goods that the train needs to deliver at each delivery yard to obtain a set of goods corresponding to each delivery yard;

[0088] Based on the unloading order corresponding to each cargo in each cargo set, the cargo unloading route corresponding to each cargo set is determined; wherein each cargo unloading route includes at least one cargo unloading node; specifically, firstly, based on the unloading order corresponding to each cargo in the cargo set, each cargo in the cargo set is arranged in sequence to obtain a second cargo sequence corresponding to the cargo set, and then, based on the loading position corresponding to each cargo in the cargo set and the second cargo sequence corresponding to the cargo set, the cargo unloading route corresponding to the cargo set is generated.

[0089] For each of the cargo collections, determining a dispatching route corresponding to the cargo collection based on the location and capacity of the loading and unloading equipment of the delivery yard corresponding to the cargo collection, the cargo volume of each cargo in the cargo collection, and the cargo unloading route;

[0090] An initial cargo scheduling plan for the train is generated based on the unloading order of each cargo in the carriage and each of the scheduling routes.

[0091] Step S400: Optimize the initial cargo scheduling plan based on a preset ant colony algorithm to obtain a target cargo scheduling plan.

[0092] Specifically, step S400 includes the following steps:

[0093] Constructing a virtual scene corresponding to the initial cargo scheduling plan; understandably, the virtual scene corresponding to the initial cargo scheduling plan is a virtual scene corresponding to the port terminal;

[0094] Setting an initial pheromone concentration for each virtual path corresponding to the virtual scene based on the initialization parameters of the ant colony algorithm;

[0095] Based on the initial cargo scheduling plan, the virtual ants in the ant colony algorithm are controlled to perform virtual cargo scheduling in the virtual scene, and the first updated pheromone concentration of each first intermediate target virtual path is obtained; wherein the first intermediate target virtual path is the virtual path passed by the virtual ants when performing virtual cargo scheduling, and when the virtual ants pass through the first intermediate target virtual path, the initial pheromone concentration of the first intermediate target virtual path is updated based on the virtual road condition of the first intermediate target virtual path to obtain the first updated pheromone concentration;

[0096] Determine the first intermediate target virtual path whose first updated pheromone concentration is greater than the preset pheromone concentration as the second intermediate target virtual path, and control the virtual ants in the ant colony algorithm to perform virtual cargo scheduling in the virtual scene based on the initial cargo scheduling plan and each of the second intermediate target virtual paths, and obtain the second updated pheromone concentration of each third intermediate target virtual path; wherein the third intermediate target virtual path is the virtual path passed by the virtual ants when performing virtual cargo scheduling, and when the virtual ants pass through the third intermediate target virtual path, the initial pheromone concentration of the third intermediate target virtual path is updated based on the virtual road conditions of the third intermediate target virtual path to obtain the second updated pheromone concentration; it can be understood that since the first updated pheromone concentration corresponding to the second intermediate target virtual path is greater than the preset pheromone concentration, the second intermediate target virtual path is the necessary path for the virtual ants to perform virtual cargo scheduling in the virtual scene;

[0097] Iterate the previous method step until the final updated pheromone concentration of each target virtual path passed by the virtual ant when performing virtual cargo scheduling is greater than the preset pheromone concentration, and obtain the target virtual scheduling path corresponding to the initial cargo scheduling plan;

[0098] The initial cargo scheduling plan is optimized based on the target virtual scheduling path to obtain the target cargo scheduling plan.

[0099] It can be understood that the ant colony algorithm is based on the principles of bionics. By simulating the self-organization and pheromone mechanism principles in the foraging behavior of ants, it globally optimizes the initial cargo scheduling plan, effectively avoiding the local optimal problems common in traditional methods, and can effectively improve the scientificity, accuracy and flexibility of scheduling management, improve resource utilization efficiency, and reduce operating costs.

[0100] Step S500: dispatch each piece of cargo in the carriage of the train based on the target cargo dispatching plan.

[0101] The solution provided in this embodiment optimizes the initial cargo scheduling plan through the ant colony algorithm to obtain the target cargo scheduling plan, which effectively improves the scientific nature, resource utilization efficiency and flexibility of the scheduling method, reduces operating costs, and helps to improve the quality of transportation services.

[0102] See also Figure 2 , Figure 2 The structure schematic block diagram of the coordinated dispatching management system 100 for port terminals and railway freight provided in the embodiment of the present application is as follows: Figure 2 As shown, the coordinated dispatching management system 100 for port terminals and railway freight transport includes:

[0103] The acquisition module 110 is used to acquire the cargo loading information of the train from the database and acquire the current port terminal resource information; wherein the port terminal resource information includes the port terminal yard information and loading and unloading equipment information.

[0104] The first generating module 120 is used to generate a target unloading position of the train and a train approach route based on the cargo loading information and the yard information.

[0105] The second generating module 130 is used to generate an initial cargo scheduling plan for the train based on the cargo loading information and the loading and unloading equipment information.

[0106] The optimization module 140 is used to optimize the initial cargo scheduling plan based on a preset ant colony algorithm to obtain a target cargo scheduling plan.

[0107] The scheduling module 150 is used to schedule each piece of cargo in the carriage of the train based on the target cargo scheduling plan.

[0108] In some embodiments, the optimization module includes:

[0109] A construction unit, used to construct a virtual scene corresponding to the initial cargo scheduling plan;

[0110] A setting unit, configured to set an initial pheromone concentration for each virtual path corresponding to the virtual scene based on an initialization parameter of the ant colony algorithm;

[0111] A first control unit is used to control the virtual ants in the ant colony algorithm to perform virtual cargo scheduling in the virtual scene based on the initial cargo scheduling plan, and obtain a first updated pheromone concentration of each first intermediate target virtual path; wherein the first intermediate target virtual path is a virtual path passed by the virtual ants when performing virtual cargo scheduling, and when the virtual ants pass through the first intermediate target virtual path, the initial pheromone concentration of the first intermediate target virtual path is updated based on the virtual road condition of the first intermediate target virtual path to obtain a first updated pheromone concentration;

[0112] a second control unit, for determining a first intermediate target virtual path whose first updated pheromone concentration is greater than a preset pheromone concentration as a second intermediate target virtual path, and controlling the virtual ants in the ant colony algorithm to perform virtual cargo scheduling in the virtual scene based on the initial cargo scheduling plan and each of the second intermediate target virtual paths, and obtaining the second updated pheromone concentration of each third intermediate target virtual path; wherein the third intermediate target virtual path is a virtual path passed by the virtual ants when performing virtual cargo scheduling, and when the virtual ants pass through the third intermediate target virtual path, the initial pheromone concentration of the third intermediate target virtual path is updated based on the virtual road condition of the third intermediate target virtual path to obtain a second updated pheromone concentration;

[0113] A third control unit is used to iterate the previous step until the final updated pheromone concentration of each target virtual path passed by the virtual ant when performing virtual cargo scheduling is greater than the preset pheromone concentration, and the target virtual scheduling path corresponding to the initial cargo scheduling plan is obtained;

[0114] The optimization unit is used to optimize the initial cargo scheduling plan based on the target virtual scheduling path to obtain the target cargo scheduling plan.

[0115] It should be noted that technical personnel in the relevant technical field can clearly understand that, for the convenience and conciseness of description, the specific working processes of the system, modules and units described above can refer to the corresponding processes in the aforementioned embodiment of the collaborative dispatching management method for port terminals and railway freight, and will not be repeated here.

[0116] The coordinated dispatching management system 100 for port terminals and railway freight provided in the above embodiment can be implemented in the form of a computer program. The computer program can be used in Figure 3 The computer device 200 is shown running.

[0117] See also Figure 3 , Figure 3The computer device 200 provided in the embodiment of the present application is a schematic block diagram of the structure, wherein the computer device 200 includes a processor 201 and a memory 202, wherein the processor 201 and the memory 202 are connected via a device bus 203, wherein the memory 202 may include a non-volatile storage medium and an internal memory.

[0118] The non-volatile storage medium can store a computer program. The computer program includes program instructions, and when the program instructions are executed by the processor 201, the processor 201 can execute any of the above-mentioned coordinated dispatching management methods for port terminals and railway freight.

[0119] The processor 201 is used to provide computing and control capabilities and support the operation of the entire computer device 200 .

[0120] The internal memory provides an environment for the operation of the computer program in the non-volatile storage medium. When the computer program is executed by the processor 201, the processor 201 can execute any of the above-mentioned coordinated scheduling management methods for port terminals and railway freight.

[0121] Those skilled in the art will understand that Figure 3 The structure shown in the figure is only a block diagram of a part of the structure related to the present application scheme, and does not constitute a limitation on the computer device 200 involved in the present application scheme. The specific computer device 200 may include more or fewer components than shown in the figure, or combine certain components, or have a different component arrangement.

[0122] It should be understood that the processor 201 may be a central processing unit (CPU), and the processor 201 may also be other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. Among them, the general-purpose processor may be a microprocessor or the processor may also be any conventional processor, etc.

[0123] In some embodiments, the processor 201 is used to run a computer program stored in the memory to implement the following steps:

[0124] Obtaining cargo loading information of the train in the database, and obtaining current port terminal resource information; wherein the port terminal resource information includes the port terminal yard information and loading and unloading equipment information;

[0125] generating a target unloading position of the train and a train approach route based on the cargo loading information and the yard information;

[0126] generating an initial cargo dispatching plan for the train based on the cargo loading information and the loading and unloading equipment information;

[0127] Optimizing the initial cargo scheduling plan based on a preset ant colony algorithm to obtain a target cargo scheduling plan;

[0128] Each piece of cargo in the carriage of the train is scheduled based on the target cargo scheduling plan.

[0129] It should be noted that technical personnel in the relevant field can clearly understand that for the convenience and simplicity of description, the specific working process of the computer device 200 described above can refer to the corresponding process of the aforementioned collaborative scheduling management method for port terminals and railway freight, and will not be repeated here.

[0130] An embodiment of the present application also provides a computer-readable storage medium, which stores a computer program. When the computer program is executed by one or more processors, the one or more processors implement the collaborative scheduling management method for port terminals and railway freight as provided in the embodiment of the present application.

[0131] The computer-readable storage medium may be an internal storage unit of the computer device 200 in the aforementioned embodiment, such as a hard disk or memory of the computer device 200. The computer-readable storage medium may also be an external storage device of the computer device 200, such as a plug-in hard disk, a smart memory card (Smart Media Card, SMC), a secure digital (Secure Digital, SD) card, a flash card (Flash Card), etc. equipped with the computer device 200.

[0132] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any technician familiar with the technical field can easily think of various equivalent modifications or replacements within the technical scope disclosed in the present application, and these modifications or replacements should be included in the protection scope of the present application. Therefore, the protection scope of the present application shall be based on the protection scope of the claims.

Claims

1. A coordinated dispatching management method for port terminals and railway freight, characterized in that: include: Obtaining cargo loading information of the train in the database, and obtaining current port terminal resource information; wherein the port terminal resource information includes the port terminal yard information and loading and unloading equipment information; generating a target unloading position of the train and a train approach route based on the cargo loading information and the yard information; generating an initial cargo dispatching plan for the train based on the cargo loading information and the loading and unloading equipment information; Optimizing the initial cargo scheduling plan based on a preset ant colony algorithm to obtain a target cargo scheduling plan; Scheduling each piece of cargo in the carriage of the train based on the target cargo scheduling plan; The method of optimizing the initial cargo scheduling plan based on a preset ant colony algorithm to obtain a target cargo scheduling plan includes: Constructing a virtual scene corresponding to the initial cargo scheduling plan; Setting an initial pheromone concentration for each virtual path corresponding to the virtual scene based on the initialization parameters of the ant colony algorithm; Based on the initial cargo scheduling plan, the virtual ants in the ant colony algorithm are controlled to perform virtual cargo scheduling in the virtual scene, and the first updated pheromone concentration of each first intermediate target virtual path is obtained; wherein the first intermediate target virtual path is the virtual path passed by the virtual ants when performing virtual cargo scheduling, and when the virtual ants pass through the first intermediate target virtual path, the initial pheromone concentration of the first intermediate target virtual path is updated based on the virtual road condition of the first intermediate target virtual path to obtain the first updated pheromone concentration; Determine a first intermediate target virtual path whose first updated pheromone concentration is greater than a preset pheromone concentration as a second intermediate target virtual path, and control the virtual ants in the ant colony algorithm to perform virtual cargo scheduling in the virtual scene based on the initial cargo scheduling plan and each of the second intermediate target virtual paths, and obtain the second updated pheromone concentration of each third intermediate target virtual path; wherein the third intermediate target virtual path is a virtual path passed by the virtual ants when performing virtual cargo scheduling, and when the virtual ants pass through the third intermediate target virtual path, the initial pheromone concentration of the third intermediate target virtual path is updated based on the virtual road condition of the third intermediate target virtual path to obtain a second updated pheromone concentration; Iterate the previous method step until the final updated pheromone concentration of each target virtual path passed by the virtual ant when performing virtual cargo scheduling is greater than the preset pheromone concentration, and obtain the target virtual scheduling path corresponding to the initial cargo scheduling plan; The initial cargo scheduling plan is optimized based on the target virtual scheduling path to obtain the target cargo scheduling plan.

2. The coordinated dispatching management method for port terminals and railway freight according to claim 1 is characterized in that: The cargo loading information includes cargo attributes and cargo volume of each cargo in the carriage of the train, the yard information includes the transportation efficiency and available volume of each yard of the port terminal, and the generating of the target unloading position of the train and the train approach route based on the cargo loading information and the yard information includes: For each piece of cargo in the carriage of the train, determining a target transportation urgency coefficient of the cargo based on the attributes of the cargo; Determine a corresponding storage yard for each piece of the cargo in each storage yard based on the cargo volume and target transportation urgency coefficient of each piece of the cargo, the transportation efficiency and available volume of each storage yard; The number of goods that the train needs to deliver at each of the yards is counted respectively, and a target yard is determined based on the number of goods that the train needs to deliver at each of the yards; wherein the number of goods that the train needs to deliver at the target yard is the largest; Determine the unloading location corresponding to the target yard as the target unloading location; The train approach route is generated based on the current position of the train and the target unloading position.

3. The coordinated dispatching management method for port terminals and railway freight according to claim 2 is characterized in that: The cargo attributes include cargo category and customer transportation deadline requirement information, and determining the target transportation urgency coefficient of the cargo based on the cargo attributes includes: Traversing a preset cargo attribute-initial transport emergency coefficient mapping relationship table to determine an initial transport emergency coefficient corresponding to the cargo; Determining whether the customer has made any requirements on the transportation period of the goods based on the customer's transportation period requirement information; If not, determining the initial transport emergency coefficient as the target transport emergency coefficient; If so, the initial transportation urgency coefficient is corrected based on the transportation deadline requirement of the goods proposed by the customer and a preset transportation urgency coefficient correction logic to obtain the target transportation urgency coefficient.

4. The coordinated dispatching management method for port terminals and railway freight according to claim 2 is characterized in that: The step of determining a corresponding storage yard for each piece of the cargo in each storage yard based on the cargo volume and target transportation emergency coefficient of each piece of the cargo, the transportation efficiency and available volume of each storage yard comprises: Arranging each of the goods in sequence based on the target transportation urgency coefficient corresponding to each of the goods to obtain a first goods sequence; wherein, in the first goods sequence, the target transportation urgency coefficient corresponding to each of the goods decreases in sequence; Based on the cargo volume of each piece of the cargo, the transportation efficiency and available volume of each of the storage yards, the first cargo sequence sequentially determines a corresponding delivery yard for each piece of the cargo in each of the storage yards.

5. The coordinated dispatching management method for port terminals and railway freight according to claim 2 is characterized in that: The cargo loading information includes the loading position of each cargo in the carriage of the train, the loading and unloading equipment information includes the loading and unloading equipment information of each delivery yard, each delivery yard includes a loading and unloading equipment, and the loading and unloading equipment information includes the capacity and position of the loading and unloading equipment. The initial cargo scheduling plan of the train is generated based on the cargo loading information and the loading and unloading equipment information, including: Determining the unloading order of each piece of cargo based on the loading position of each piece of cargo in the carriage; Integrate the goods that the train needs to deliver at each delivery yard to obtain a set of goods corresponding to each delivery yard; Determining the cargo unloading routes corresponding to each cargo set based on the unloading order corresponding to each cargo in each cargo set; wherein each cargo unloading route includes at least one cargo unloading node; For each of the cargo collections, determining a dispatching route corresponding to the cargo collection based on the location and capacity of the loading and unloading equipment of the delivery yard corresponding to the cargo collection, the cargo volume of each cargo in the cargo collection, and the cargo unloading route; An initial cargo scheduling plan for the train is generated based on the unloading order of each cargo in the carriage and each of the scheduling routes.

6. A coordinated dispatching and management system for port terminals and railway freight, characterized in that: include: An acquisition module is used to acquire the cargo loading information of the train from the database and to acquire the current port terminal resource information; wherein the port terminal resource information includes the port terminal yard information and loading and unloading equipment information; A first generating module, configured to generate a target unloading position of the train and a train approach route based on the cargo loading information and the yard information; A second generating module, configured to generate an initial cargo dispatching plan for the train based on the cargo loading information and the loading and unloading equipment information; An optimization module, used to optimize the initial cargo scheduling plan based on a preset ant colony algorithm to obtain a target cargo scheduling plan; A scheduling module, used for scheduling each piece of cargo in the carriage of the train based on the target cargo scheduling plan; The method of optimizing the initial cargo scheduling plan based on a preset ant colony algorithm to obtain a target cargo scheduling plan includes: Constructing a virtual scene corresponding to the initial cargo scheduling plan; Setting an initial pheromone concentration for each virtual path corresponding to the virtual scene based on the initialization parameters of the ant colony algorithm; Based on the initial cargo scheduling plan, the virtual ants in the ant colony algorithm are controlled to perform virtual cargo scheduling in the virtual scene, and the first updated pheromone concentration of each first intermediate target virtual path is obtained; wherein the first intermediate target virtual path is the virtual path passed by the virtual ants when performing virtual cargo scheduling, and when the virtual ants pass through the first intermediate target virtual path, the initial pheromone concentration of the first intermediate target virtual path is updated based on the virtual road condition of the first intermediate target virtual path to obtain the first updated pheromone concentration; Determine a first intermediate target virtual path whose first updated pheromone concentration is greater than a preset pheromone concentration as a second intermediate target virtual path, and control the virtual ants in the ant colony algorithm to perform virtual cargo scheduling in the virtual scene based on the initial cargo scheduling plan and each of the second intermediate target virtual paths, and obtain the second updated pheromone concentration of each third intermediate target virtual path; wherein the third intermediate target virtual path is a virtual path passed by the virtual ants when performing virtual cargo scheduling, and when the virtual ants pass through the third intermediate target virtual path, the initial pheromone concentration of the third intermediate target virtual path is updated based on the virtual road condition of the third intermediate target virtual path to obtain a second updated pheromone concentration; Iterate the previous method step until the final updated pheromone concentration of each target virtual path passed by the virtual ant when performing virtual cargo scheduling is greater than the preset pheromone concentration, and obtain the target virtual scheduling path corresponding to the initial cargo scheduling plan; The initial cargo scheduling plan is optimized based on the target virtual scheduling path to obtain the target cargo scheduling plan.