A multimodal transport method for emergency supplies based on emergency scenarios

Abstract

The present invention provides a multimodal transport method for emergency materials based on emergency scenarios, which determines the key nodes of materials and effective transportation information according to the current emergency scenario information, constructs the current emergency material joint transport network, determines the transportation priority corresponding to the material demand point, obtains the material demand corresponding to the material demand point and the transportation capacity information of the current emergency material joint transport network, sets constraints, initializes multiple transport paths according to the constraints, and then determines the objective function, updates the transport path using a damage repair algorithm to obtain a new transport path, and re-determines the objective function, iterates and updates the preset number of times to reach the preset stop condition, and obtains the final objective function. The optimal transport path corresponding to the final objective function is a multimodal transport plan that transports emergency materials from the material supply point to the material demand point via the material transfer point. The present application can achieve the joint transportation of emergency materials in a shorter time and at a lower cost.

Description

Technical Field

[0001] The present invention relates to the technical field of emergency material transportation management, and in particular to a multimodal transportation method for emergency materials based on emergency scenarios. Background Art

[0002] When facing emergencies, the demand and traffic conditions at the disaster site are highly uncertain, and the demand is often large and urgent. The transportation network is facing the possibility of interruption. It is difficult for a single means of transportation to meet the various transportation requirements in emergency scenarios. Compared with a single means of transportation, multimodal transportation has better robustness to emergencies. When facing emergencies, it can quickly identify the needs of the demand points, including the types and quantities of materials, and respond quickly. Through combined transportation such as trucks, trains and helicopters, the routes are reasonably planned to deliver emergency materials to the demand points. Multimodal transportation can meet complex transportation environments and different transportation needs, avoid dependence on a single means of transportation, and even achieve the last mile transportation of emergency materials, increasing transportation efficiency.

[0003] The common method of traditional multimodal transport is to convert the emergency material transportation problem into a special VRP problem and solve it using optimization methods. For example, for small-scale emergency material transportation problems, mathematical programming methods such as mixed integer programming can be used to model and use exact solution algorithms such as branch and bound algorithms to solve them. For larger-scale path planning problems, heuristic algorithms such as genetic algorithms and simulated annealing algorithms are constructed to solve them.

[0004] However, these solutions all treat demand as deterministic and do not highlight the uncertainty of emergencies and the urgency of emergency material demand. Therefore, how to efficiently complete the transportation of emergency materials in the shortest possible time and at the lowest cost in response to emergencies and the accompanying uncertain material demand has become a major problem that needs to be solved in the multimodal transport of emergency materials.

[0005] In view of this, it is necessary to propose a multimodal transport method for emergency materials based on emergency scenarios to solve or at least alleviate the above-mentioned defects. Summary of the invention

[0006] The main purpose of the present invention is to provide a multimodal transport method for emergency materials based on emergency scenarios, so as to solve the problem that the optimization solution method of the multimodal transport scheme in the prior art does not highlight the uncertainty characteristics of emergencies and the urgency of the demand for emergency materials, resulting in low transportation efficiency and high cost.

[0007] To achieve the above object, the present invention provides a multimodal transport method for emergency materials based on emergency scenarios, comprising the steps of:

[0008] S1, obtaining current emergency scenario information, and determining key material nodes and effective transportation information between each key material node according to the current emergency scenario information; wherein the key material nodes include material supply points, material transfer points and material demand points;

[0009] S2, constructing a current emergency material joint transportation network according to the material key nodes and the effective transportation tool information;

[0010] S3, sort all material demand points by urgency to obtain the corresponding delivery priorities of all material demand points;

[0011] S4, obtaining the material demand corresponding to the material demand point and the transportation capacity information of the current emergency material joint transportation network, setting constraints, initializing multiple transportation paths from the material supply point to the material demand point via the material transfer point according to the constraints, and then determining the objective function for selecting the optimal transportation path among all transportation paths; wherein the transportation capacity information includes the operating speed information, operating time information, maximum transportation volume information and transfer information of the transportation tool, and the constraints include flow conservation constraints, capacity constraints and integer programming constraints;

[0012] S5, updating the transport path by using a damage repair algorithm to obtain a new transport path, and re-determining the objective function for selecting the optimal transport path among all the new transport paths;

[0013] S6, after iterating and updating step S5 for a preset number of times, reaching a preset stop condition, the final objective function is obtained; wherein the optimal transportation path corresponding to the final objective function is a multimodal transport solution that transports emergency supplies from the supply point to the demand point via the transfer point.

[0014] Preferably, the step S2 specifically comprises the steps of:

[0015] S21, obtaining the geographical coordinates corresponding to each of the material supply points, material transfer points and material demand points, and constructing a supply point coordinate set based on the geographical coordinates of all material supply points , Construct a transfer point coordinate set based on the geographic coordinates of all material transfer points , and construct a demand point coordinate set based on the geographic coordinates of all material demand points ;

[0016] S22, based on the supply point coordinate set , the transfer point coordinate set And the demand point coordinate set Constructing a preliminary set of key node coordinates ;

[0017] S23, acquiring traffic condition data between key material nodes according to the current emergency scenario information, eliminating inaccessible key material nodes according to the traffic condition data, and updating the preliminary key node coordinate set to obtain a valid key node coordinate set;

[0018] S24, constructing a current emergency material joint transportation network according to the valid key node coordinate set and the valid transportation tool information; wherein the valid transportation tool information is , Indicates truck, Indicates train, Indicates helicopter.

[0019] Preferably, the step S3 specifically comprises the steps of:

[0020] S31, establishing a priority hierarchy model of material demand points; wherein the priority hierarchy model includes a target layer, a criterion layer and a scheme layer, with the transportation priority of the material demand points as the target layer, the disaster data and traffic data of the material demand points as the criterion layer, and each material demand point as the scheme layer; wherein the disaster data includes population density data C1, emergency material reserve data C2 of the disaster-affected points, and the traffic data includes traffic road network distribution density data C3;

[0021] S32, construct indicator comparison matrix respectively and the Program-Criteria Comparison Matrix ; Among them, the indicator comparison matrix A is a judgment matrix obtained by comparing the elements in the criterion layer with each other for the target layer, and the scheme-criterion comparison matrix B is a judgment matrix obtained by comparing the elements in the scheme layer with each other for each element in the criterion layer;

[0022] S33, performing hierarchical single sorting on the elements in the criterion layer and the scheme layer in pairs, and performing hierarchical single sorting on the elements in the target layer and the elements in the criterion layer in pairs, and calculating the maximum eigenvalue of the scheme-criterion comparison matrix B and the eigenvector And normalized , calculate the maximum eigenvalue of the index comparison matrix A and the eigenvector And normalized ;in, and is the relative weight of the compared elements for the criterion calculated by the judgement matrix;

[0023] S34, perform hierarchical total sorting on the elements at different levels to obtain the final sorting result , and the final sorting result The weight in As the delivery priority corresponding to the material demand point; among them, ,in, is the number of elements in the criterion layer.

[0024] Preferably, the transport capacity information in step S4 specifically includes:

[0025] The maximum transport capacity information is , is the maximum capacity of the transport, where e represents the type of transport, represents the transport volume of the i-th vehicle in the e-th mode of transport, where e is one of the following: road, rail, or helicopter;

[0026] The running speed information is , , , represent the transport speeds by road, rail and helicopter respectively;

[0027] Transfer information is ,in, Indicates the key nodes of materials Material capacity, is the transfer point coordinate set, ,in, Indicates that vehicle m is on the route The maximum transport volume on is the preliminary key node coordinate set;

[0028] The operating time information is that trucks can transport all day and trains have departure times. , the flight time is limited .

[0029] Preferably, in step S4, constraint conditions are set, and multiple transportation paths from the material supply point to the material demand point via the material transfer point are initialized according to the constraint conditions, and then the objective function for selecting the optimal transportation path among all transportation paths is determined, which specifically includes:

[0030] According to the constraints, multiple transportation paths are initialized from the material supply point to the material demand point via the material transfer point; wherein the flow conservation constraints are satisfied at the key material nodes, specifically:

[0031] ;

[0032] Among them, l and k are nodes on the path, s is the initial node, and o is the terminal node, i.e. the destination of transportation. is the set of available transportation tools between nodes l and k, and the decision variable Used to indicate the passage of materials through transportation From key nodes k to l; decision variables It is used to indicate that at the key material node l, the type of transportation changes from m to n;

[0033] The transportation path meets the constraints of transportation tools. The same logistics demand uses no more than one transportation tool on a transportation path. This constraint ensures the continuity of transportation between nodes to exclude the situation where multiple transportation tools are used simultaneously on the same transportation path between nodes. Specifically:

[0034] ;

[0035] The transit meets the constraints of the means of transport. The transit link of goods at a node does not exceed one. This constraint ensures the continuity of the transit process to exclude multiple transits at the same node. Specifically:

[0036] ;

[0037] The path satisfies the transport capacity constraint. The transport volume on the transport route does not exceed the maximum transport volume on the route. This constraint ensures the effectiveness of transportation to exclude the situation of overloading of vehicles. Specifically:

[0038] ;

[0039] Among them, Q is the cargo transportation volume, is the maximum transport capacity of vehicle m on the path from node k to l;

[0040] The transfer satisfies the transfer node capacity constraint. The transfer volume at the transfer node does not exceed the maximum transfer volume of the node. This constraint ensures the effectiveness of the transfer to exclude the situation where the transfer node is overloaded. Specifically:

[0041] ;

[0042] in, represents the maximum transfer volume of node l;

[0043] The objective function used to calculate the optimal transportation path among all transportation paths satisfies the integer programming constraints, specifically:

[0044] ;

[0045] ;

[0046] The transportation time T includes the transportation time on the line, the transit time and the transit waiting time. Indicates using transportation m from node arrive Time taken, Indicates that it is in the transit node At , the time it takes for the transportation mode to be converted from m to n, represents the waiting time at the node;

[0047] ;

[0048] The transportation cost C includes the transportation cost on the route and the transit cost, and Q is the freight volume. To use transportation m from node arrive The unit cost required, Representation Node The unit cost required to convert from m to n;

[0049] ;

[0050] According to the formula Obtain the objective function for selecting the optimal transportation path among all transportation paths ;in, , is the weight coefficient.

[0051] Preferably, the step S5 specifically comprises the steps of:

[0052] S51, randomly select a transport path from the existing transport paths and destroy one of the nodes except the departure and arrival nodes;

[0053] S52, selecting the remaining passable nodes to reconnect the transport path to obtain a new transport path, and obtaining valid transportation tool information corresponding to the new transport path;

[0054] S53, recalculating the objective function for selecting the optimal transportation path among all new transportation paths.

[0055] Preferably, the step S6 further includes the following steps:

[0056] S61, acquiring real-time transportation data of the transportation process, and determining whether road transportation interruption occurs during the transportation process according to the transportation data;

[0057] S62, when the transportation data determines that road transportation is interrupted during the transportation process, the inaccessible material transfer points are determined according to the real-time transportation data, and the transportation paths that cannot be connected due to the inaccessible material transfer points are deleted, and then the process returns to step S1.

[0058] Preferably, the step S61 further includes the following steps:

[0059] S63, when the transportation data determines that there is no road transportation interruption in the transportation process, maintain the current state and continue.

[0060] The present invention also provides an electronic device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the computer program, the steps of the multimodal transport method for emergency materials based on emergency scenarios as described above are implemented.

[0061] The present invention also provides a storage medium storing a computer program, which, when executed by a processor, implements the steps of the multimodal transport method for emergency materials based on emergency scenarios as described above.

[0062] Compared with the prior art, the present invention has the following beneficial effects:

[0063] This application fully considers the uncertainty characteristics of emergency scenarios and the urgency of the demand for emergency materials at different disaster-stricken points, and can achieve efficient joint transportation of emergency materials in a shorter time and at a lower cost. Specifically, the multimodal transport scheme of this application selects the most economical means of transportation based on the transportation material information and the transportation capacity information of the current emergency material joint transportation network, and at the same time sets constraints to select the most economical means of transportation, so it can effectively reduce transportation costs and avoid the high cost of a single means of transportation, thereby reducing the transportation cost of the overall transportation plan. Secondly, this application organically combines various means of transportation and fully utilizes the advantages of various means of transportation. While ensuring the smooth delivery of emergency materials, it improves transportation efficiency and shortens transportation time; in addition, this application can also select different means of transportation according to specific circumstances, flexibly respond to different transportation needs and transportation conditions, improve the adaptability of the transportation plan, and at the same time disperse transportation risks, avoid the problem of process interruption that a single means of transportation may face, and improve the reliability and safety of the transportation process. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0065] Figure 1 It is a schematic diagram of a flow chart in one embodiment of the present invention;

[0066] Figure 2 This is a flow chart showing the steps included in step S2 in one embodiment of the present invention;

[0067] Figure 3 It is a flowchart diagram of the steps included in step S5 in one embodiment of the present invention;

[0068] Figure 4 is a schematic diagram of the architecture of a priority hierarchy model in one embodiment of the present invention;

[0069] Figure 5 Schematic diagram of a joint transportation network for emergency supplies in one embodiment of the present invention.

[0070] The purpose, features and advantages of the present invention will be further described with reference to the accompanying drawings in conjunction with the embodiments. DETAILED DESCRIPTION

[0071] It should be understood that the specific embodiments described herein are only used to explain the present invention, and are not used to limit the present invention.

[0072] 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 only 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.

[0073] It should be noted that all directional indications (such as up, down, left, right, front, back, etc.) in the embodiments of the present invention are only used to explain the relative position relationship, movement status, etc. between the components under a certain specific posture (as shown in the accompanying drawings). If the specific posture changes, the directional indication will also change accordingly.

[0074] In addition, the descriptions of "first", "second", etc. in the present invention are only used for descriptive purposes and cannot be understood as indicating or implying their relative importance or implicitly indicating the number of the indicated technical features. Therefore, the features defined as "first" and "second" may explicitly or implicitly include at least one of the features. In addition, the technical solutions between the various embodiments can be combined with each other, but they must be based on the ability of ordinary technicians in the field to implement them. When the combination of technical solutions is contradictory or cannot be implemented, it should be deemed that such a combination of technical solutions does not exist and is not within the scope of protection required by the present invention.

[0075] What the technicians in the relevant field should know is that with the progress of science and technology and the development of technology, the comprehensive transportation network has been basically improved, providing a good guarantee for the transportation of emergency materials. Multimodal transport refers to a combined transportation tool that is completed by two or more modes of transportation cooperating with each other and connecting at nodes. It mainly includes five types of transportation tools: road transportation, railway transportation, water transportation, air transportation and pipeline transportation.

[0076] Due to the increasingly diversified material demands, rising transportation costs and complex transportation environment, the limitations of a single means of transportation have gradually become apparent. Although railway transportation has a large transportation volume and high safety, it is suitable for long-distance transportation of bulk goods, but it also has the limitations of poor flexibility and high infrastructure requirements; road transportation has good flexibility, convenience and speed, but the single transportation volume is small and it is not suitable for large-scale transportation; water transportation has low costs and large cargo volumes, but is severely restricted by geographical locations and inconvenient loading and unloading; air transportation is fast, but has the limitations of high costs and small transportation volumes; pipeline transportation is basically used in oil and gas transportation.

[0077] See also Figures 1 to 5 In one embodiment of the present invention, a multimodal transport method for emergency materials based on an emergency scenario includes the following steps:

[0078] S1, obtaining current emergency scenario information, and determining key material nodes and effective transportation information between each key material node according to the current emergency scenario information; wherein the key material nodes include material supply points, material transfer points and material demand points;

[0079] S2, constructing a current emergency material joint transportation network according to the material key nodes and the effective transportation tool information;

[0080] S3, sort all material demand points by urgency to obtain the corresponding delivery priorities of all material demand points;

[0081] S4, obtaining the material demand corresponding to the material demand point and the transportation capacity information of the current emergency material joint transportation network, setting constraints, initializing multiple transportation paths from the material supply point to the material demand point via the material transfer point according to the constraints, and then determining the objective function for selecting the optimal transportation path among all transportation paths; wherein the transportation capacity information includes the operating speed information, operating time information, maximum transportation volume information and transfer information of the vehicle, and the constraints include flow conservation constraints, capacity constraints and integer programming constraints; wherein the transfer information is the maximum transfer volume of the transfer node.

[0082] S5, updating the transport path by using a damage repair algorithm to obtain a new transport path, and re-determining the objective function for selecting the optimal transport path among all the new transport paths;

[0083] S6, after iterating and updating step S5 for a preset number of times, reaching a preset stop condition, the final objective function is obtained; wherein the optimal transportation path corresponding to the final objective function is a multimodal transport solution that transports emergency supplies from the supply point to the demand point via the transfer point.

[0084] As a preferred implementation, step S2 specifically includes the following steps:

[0085] S21, obtaining the geographical coordinates corresponding to each of the material supply points, material transfer points and material demand points, and constructing a supply point coordinate set based on the geographical coordinates of all material supply points , Construct a transfer point coordinate set based on the geographic coordinates of all material transfer points , and construct a demand point coordinate set based on the geographic coordinates of all material demand points ;

[0086] S22, based on the supply point coordinate set , the transfer point coordinate set And the demand point coordinate set Constructing a preliminary set of key node coordinates ;

[0087] S23, acquiring traffic condition data between key material nodes according to the current emergency scenario information, eliminating inaccessible key material nodes according to the traffic condition data, and updating the preliminary key node coordinate set to obtain a valid key node coordinate set;

[0088] S24, constructing a current emergency material joint transportation network according to the valid key node coordinate set and the valid transportation tool information; wherein the valid transportation tool information is , Indicates truck, Indicates train, Indicates helicopter.

[0089] As a preferred implementation, step S3 specifically includes the following steps:

[0090] S31, establishing a priority hierarchy model of material demand points; wherein the priority hierarchy model includes a target layer, a criterion layer and a scheme layer, with the transportation priority of the material demand points as the target layer, the disaster data and traffic data of the material demand points as the criterion layer, and each material demand point as the scheme layer; wherein the disaster data includes population density data C1, emergency material reserve data C2 of the disaster-affected points, and the traffic data includes traffic road network distribution density data C3;

[0091] S32, construct indicator comparison matrix respectively and the Program-Criteria Comparison Matrix ; Among them, the indicator comparison matrix A is a judgment matrix obtained by comparing the elements in the criterion layer with each other for the target layer, and the scheme-criterion comparison matrix B is a judgment matrix obtained by comparing the elements in the scheme layer with each other for each element in the criterion layer;

[0092] S33, performing hierarchical single sorting on the elements in the criterion layer and the scheme layer in pairs, and performing hierarchical single sorting on the elements in the target layer and the elements in the criterion layer in pairs, and calculating the maximum eigenvalue of the scheme-criterion comparison matrix B and the eigenvector And normalized , calculate the maximum eigenvalue of the index comparison matrix A and the eigenvector And normalized ;in, and is the relative weight of the compared elements for the criterion calculated by the judgement matrix;

[0093] Furthermore, the consistency test can be performed on the indicator comparison matrix A and the scheme-criteria comparison matrix B. The purpose of the consistency test is to ensure the data accuracy and logic of the judgment matrix, thereby improving the reliability and effectiveness of the method. The matrix order is n, and the consistency index is , where the closer CI is to 0, the better the consistency; to measure the size of CI, the random consistency index RI is introduced, which changes according to the matrix order; the consistency ratio is defined as ; Generally, when CR<0.1, it is considered The inconsistency is within the allowable range and passes the consistency test.

[0094] S34, perform hierarchical total sorting on the elements at different levels to obtain the final sorting result , and the final sorting result The weight in As the delivery priority corresponding to the material demand point; among them, , is the number of elements in the criterion layer.

[0095] Specifically, after completing the hierarchical ranking at each level, it is necessary to comprehensively compare the elements at different levels to determine the relative importance of each element. The hierarchical total ranking is to comprehensively arrange all factors based on the relative importance of each level to obtain the final ranking result. The transportation priority corresponding to the material demand points obtained in the end can objectively and accurately reflect the urgency of the demand for each material demand point. Distribution according to the transportation priority ensures that emergency materials can be used more effectively.

[0096] Furthermore, the transport capacity information in step S4 specifically includes:

[0097] The maximum transport capacity information is , is the maximum capacity of the transport, where e represents the type of transport, represents the transport volume of the i-th vehicle in the e-th mode of transport, where e is one of the following: road, rail, or helicopter;

[0098] The running speed information is , , , represent the transport speeds by road, rail and helicopter respectively;

[0099] Transfer information is ,in, Indicates the key nodes of materials Material capacity, is the transfer point coordinate set, ,in, Indicates that vehicle m is on the route The maximum transport volume on is the preliminary key node coordinate set;

[0100] The operating time information is that trucks can transport all day and trains have departure times. , the flight time is limited .

[0101] As a preferred implementation, in step S4, constraint conditions are set, and multiple transportation paths from the material supply point to the material demand point via the material transfer point are initialized according to the constraint conditions, and then the objective function for selecting the optimal transportation path among all transportation paths is determined, which specifically includes:

[0102] According to the constraints, multiple transportation paths are initialized from the material supply point to the material demand point via the material transfer point; wherein the flow conservation constraints are satisfied at the key material nodes, specifically:

[0103] ;

[0104] The flow conservation constraint means that the number of vehicles entering and leaving a node is balanced. l and k are nodes on the path, s is the initial node, and o is the terminal node, i.e., the destination of transportation. is the set of available transportation tools between nodes l and k, and the decision variable Used to indicate the passage of materials through transportation From key nodes k to l; decision variables It is used to indicate that at the key material node l, the type of transportation changes from m to n;

[0105] The transportation path meets the constraints of transportation tools. The same logistics demand uses no more than one transportation tool on a transportation path. This constraint ensures the continuity of transportation between nodes to exclude the situation where multiple transportation tools are used simultaneously on the same transportation path between nodes. Specifically:

[0106] ;

[0107] The transit meets the constraints of the means of transport. The transit link of goods at a node does not exceed one. This constraint ensures the continuity of the transit process to exclude multiple transits at the same node. Specifically:

[0108] ;

[0109] The path satisfies the transport capacity constraint. The transport volume on the transport route does not exceed the maximum transport volume on the route. This constraint ensures the effectiveness of transportation to exclude the situation of overloading of vehicles. Specifically:

[0110] ;

[0111] Among them, Q is the cargo transportation volume, is the maximum transport capacity of vehicle m on the path from node k to l;

[0112] The transfer satisfies the transfer node capacity constraint. The transfer volume at the transfer node does not exceed the maximum transfer volume of the node. This constraint ensures the effectiveness of the transfer to exclude the situation where the transfer node is overloaded. Specifically:

[0113] ;

[0114] in, represents the maximum transfer volume of node l;

[0115] The objective function used to calculate the optimal transportation path among all transportation paths satisfies the integer programming constraints, specifically:

[0116] ;

[0117] ;

[0118] The transportation time T includes the transportation time on the line, the transit time and the transit waiting time. Indicates using transportation m from node arrive Time taken, Indicates that it is in the transit node At , the time it takes for the transportation mode to be converted from m to n, represents the waiting time at the node;

[0119] ;

[0120] The transportation cost C includes the transportation cost on the route and the transit cost, and Q is the freight volume. To use transportation m from node arrive The unit cost required, Representation Node The unit cost required to convert from m to n;

[0121] ;

[0122] According to the formula Obtain the objective function for selecting the optimal transportation path among all transportation paths ;in, , is the weight coefficient.

[0123] Furthermore, the step S5 specifically includes the steps of:

[0124] S51, randomly select a transport path from the existing transport paths, and destroy one of the nodes except the departure and arrival nodes; S52, select the remaining passable nodes to reconnect the transport path to obtain a new transport path, and obtain the valid transportation tool information corresponding to the new transport path; S53, recalculate the objective function for selecting the optimal transport path among all new transport paths.

[0125] Furthermore, the step S6 further includes the following steps:

[0126] S61, acquiring real-time transportation data of the transportation process, and determining whether road transportation interruption occurs during the transportation process according to the transportation data;

[0127] S62, when the transportation data determines that road transportation is interrupted during the transportation process, the inaccessible material transfer points are determined according to the real-time transportation data, and the transportation paths that cannot be connected due to the inaccessible material transfer points are deleted, and then the process returns to step S1. Specifically, this embodiment continues to monitor the transportation process. If road transportation is interrupted during the transportation process, uninterrupted transportation can be achieved through other material transfer points. The current emergency material joint transportation network is damaged in an emergency situation, such as a material transfer point. , If it is damaged and cannot pass, , and delete the paths that cannot be connected due to node damage, return to step S1 to update the current emergency material joint transportation network, and complete the transportation of emergency materials according to the steps in accordance with the updated current emergency material joint transportation network. If the multimodal transport network is not damaged, according to the priority division of the disaster-stricken areas, the emergency material needs of the disaster-stricken points with high priority levels are met first. Under the capacity constraint, the emergency materials of the supply point are transported to the disaster-stricken point through the transfer point to complete the transportation of materials.

[0128] Furthermore, the step S61 further includes the following steps:

[0129] S63, when the transportation data determines that there is no road transportation interruption during the transportation process, the current state is maintained and the transportation is continued. If the current emergency material joint transportation network is not damaged, that is, the current emergency material joint transportation network is in a normal state, the transportation can be carried out according to the current multimodal transportation plan.

[0130] The present invention also provides an electronic device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the computer program, the steps of the multimodal transport method for emergency materials based on emergency scenarios as described above are implemented.

[0131] The present invention also provides a storage medium, wherein the storage medium stores a computer program, and when the computer program is executed by a processor, the steps of the multimodal transport method for emergency materials based on emergency scenarios are implemented as described above. It can be understood that when the computer program is executed by the processor, the multimodal transport method for emergency materials based on emergency scenarios is implemented, so all embodiments of the above method are applicable to the storage medium, and can achieve the same or similar beneficial effects.

[0132] In order to assist those skilled in the art to better understand the technical solution of the present application, the present application also provides the following specific embodiments:

[0133] The emergency scenario described in this embodiment is a major natural disaster, which occurs at 9 am. The emergency supplies that need to be transported are medical supplies. The transportation vehicles used are roads, railways and helicopters. Table 1 shows the coordinate information of the supply points, transfer points and demand points.

[0134] Table 1 Coordinate information of material supply points, material transfer points and material demand points

[0135]

[0136] like Figure 5 As shown, after a major natural disaster occurs, identify the key nodes of various materials, including a material supply point (represented by squares), three disaster-affected points, i.e. points of material demand (represented by diamonds) and three material transfer points (represented by a circle), the set of all nodes . Clarify the available means of transportation and the means of transportation between key material nodes ,in Trucks are represented by straight lines. A train is represented by a straight dashed line. The helicopter is represented by a dotted curve. According to the nodes and the transportation modes between nodes, the current emergency material joint transportation network is constructed as follows Figure 5 shown.

[0137] Establish a priority hierarchy model corresponding to material demand points 5, 6, and 7, combined with Figure 4 As shown, the transportation priority of the material demand point is used as the target layer, the disaster data and traffic data of the material demand point are used as the criterion layer, and the material demand points 5, 6, and 7 are used as the solution layer; wherein the disaster data includes population density data C1, emergency material reserve data C2 of the disaster-affected point, and the traffic data includes traffic road network distribution density data C3;

[0138] Determine the ratio scale:

[0139] Table 2 Ratio scale table

[0140]

[0141] (1) Starting from the target layer and the criterion layer, the indicator comparison matrix A is , calculate the maximum eigenvalue of the indicator comparison matrix A , , , which is consistent, and we continue to find the score vector .

[0142] (2) Hierarchical single sorting: the judgment matrices of the three material demand points for material demand point C1, emergency material reserve data of disaster-affected points C2, and traffic network distribution density data C3 are respectively: , , The maximum eigenvalue and the vector are , , ; , , .test , , , with consistency.

[0143] (3) Total ranking of levels: , we can get the delivery priority of the three material demand points as 7 which prioritizes 5 which prioritizes 6.

[0144] Obtain the transportation capacity information of the current emergency material joint transportation network. Table 3 is the transportation operation information table, Table 4 is the transportation fee and transportation volume information table, and Table 5 is the transfer node fee information table.

[0145] Table 3 Transportation operation information table

[0146]

[0147] Table 4 Transportation costs and volume information

[0148]

[0149] Table 5 Transfer node fee information table

[0150]

[0151] Clearly transport materials, the emergency materials transported are medical materials, and there is no special transportation demand. Table 6 shows the material demand at different disaster-affected nodes.

[0152] Table 6 Material demand at disaster-affected nodes

[0153]

[0154] Clarify transportation requirements and restrictions. Transport supplies to deliver emergency supplies to the demand point in the shortest time. At each node where transfer is possible, there are 5 trucks and 3 helicopters.

[0155] In this example, it is 9 am, and the cargo transportation volume is also taken into consideration. Therefore, the preliminary transportation route for this emergency material is:

[0156] Route 1: 1→Iron→2→Iron→7

[0157] Route 2: 1→Road→3→Air→5

[0158] Route 3: 1→railway→2→railway→4→air / road→6

[0159] Assume that transit node 4 cannot complete the transportation transfer due to a disaster interruption during the transportation process, so the path of node 4 needs to be updated and the route is reselected: 1→railway→2→road→3→road→6, which meets the transportation volume constraint, and the transportation tools to the disaster-stricken points 5 and 6 do not conflict, and the disaster-stricken point 5 has priority over 6 in obtaining emergency supplies. Therefore, the final transportation plan is:

[0160] Route 1: 1→Iron→2→Iron→7

[0161] Route 2: 1→Road→3→Air→5

[0162] Route 3: 1→railway→2→road→3→road→6

[0163] Inspect the transported goods and complete the transportation if they meet the rescue needs, otherwise replenish the goods.

[0164] The above are only preferred embodiments of the present invention, and are not intended to limit the patent scope of the present invention. Any equivalent structure or equivalent process transformation made using the contents of the present invention specification and drawings, or directly or indirectly applied in other related technical fields, are also included in the patent protection scope of the present invention.

Claims

1. A multimodal transport method for emergency materials based on emergency scenarios, characterized in that: Includes steps: S1, obtaining current emergency scenario information, and determining key material nodes and effective transportation information between each key material node according to the current emergency scenario information; wherein the key material nodes include material supply points, material transfer points and material demand points; S2, constructing a current emergency material joint transportation network according to the material key nodes and the effective transportation tool information; S3, sort all material demand points by urgency to obtain the corresponding delivery priorities of all material demand points; The step S3 specifically comprises the following steps: S31, establishing a priority hierarchy model of material demand points; wherein the priority hierarchy model includes a target layer, a criterion layer and a scheme layer, with the transportation priority of the material demand points as the target layer, the disaster data and traffic data of the material demand points as the criterion layer, and each material demand point as the scheme layer; wherein the disaster data includes population density data C1, emergency material reserve data C2 of the disaster-affected points, and the traffic data includes traffic road network distribution density data C3; S32, construct indicator comparison matrix respectively and the Program-Criteria Comparison Matrix ; Among them, the indicator comparison matrix A is a judgment matrix obtained by comparing the elements in the criterion layer with each other for the target layer, and the scheme-criterion comparison matrix B is a judgment matrix obtained by comparing the elements in the scheme layer with each other for each element in the criterion layer; S33, performing hierarchical single sorting on the elements in the criterion layer and the scheme layer in pairs, and performing hierarchical single sorting on the elements in the target layer and the elements in the criterion layer in pairs, and calculating the maximum eigenvalue of the scheme-criterion comparison matrix B and the eigenvector And normalized , calculate the maximum eigenvalue of the index comparison matrix A and the eigenvector And normalized ;in, and is the relative weight of the compared elements to the criteria calculated by the judgemental matrix; S34, perform hierarchical total sorting on elements at different levels to obtain the final sorting result , and the final sorting result The weight in As the delivery priority corresponding to the material demand point; among them, ,in, is the number of elements in the criterion layer; S4, obtaining the material demand corresponding to the material demand point and the transportation capacity information of the current emergency material joint transportation network, setting constraints, initializing multiple transportation paths from the material supply point to the material demand point via the material transfer point according to the constraints, and then determining the objective function for selecting the optimal transportation path among all transportation paths; wherein the transportation capacity information includes the operating speed information, operating time information, maximum transportation volume information and transfer information of the transportation tool, and the constraints include flow conservation constraints, capacity constraints and integer programming constraints; In step S4, constraint conditions are set, and multiple transportation paths from the material supply point to the material demand point via the material transfer point are initialized according to the constraint conditions, and then the objective function for selecting the optimal transportation path among all transportation paths is determined, which specifically includes: According to the constraints, multiple transportation paths are initialized from the material supply point to the material demand point via the material transfer point; wherein the flow conservation constraints are satisfied at the key material nodes, specifically: ； Among them, l and k are nodes on the path, s is the initial node, and o is the terminal node, i.e. the destination of transportation. is the set of available transportation tools between nodes l and k, and the decision variable Used to indicate the passage of materials through transportation From key nodes k to l; decision variables It is used to indicate that at the key material node l, the type of transportation changes from the mth type to the nth type; The transportation path meets the constraints of the transportation tools. The same logistics demand uses no more than one transportation tool on a transportation path to ensure the continuity of transportation between nodes, so as to exclude the situation where multiple transportation tools are used for transportation on the same transportation path between nodes at the same time. Specifically: ； The transit meets the constraints of the means of transport. The transit link of goods at a node does not exceed one, ensuring the continuity of the transit process to exclude multiple transits at the same node. Specifically: ； The path meets the constraints of transportation capacity. The transportation volume on the transportation line does not exceed the maximum transportation volume on the line, which ensures the effectiveness of transportation and excludes the situation of overloading of transportation vehicles. Specifically: ； Among them, Q is the cargo transportation volume, is the maximum transport capacity of vehicle m on the path from node k to l; The transfer meets the transfer node capacity constraint. The transfer volume at the transfer node does not exceed the maximum transfer volume of the node, which ensures the effectiveness of the transfer and excludes the situation where the transfer node is overloaded. Specifically: ； in, represents the maximum transfer volume of node l; The objective function used to calculate the optimal transportation path among all transportation paths satisfies the integer programming constraints, specifically: ； ； The transportation time T includes the transportation time on the line, the transit time and the transit waiting time. Indicates using transportation m from node arrive Time taken, Indicates that it is in the transit node At , the time it takes to convert the m-th mode of transportation to the n-th mode, represents the waiting time at the node; ； The transportation cost C includes the transportation cost on the route and the transit cost, and Q is the cargo transportation volume. To use transportation m from node arrive The unit cost required, Representation Node The unit cost required to convert from m to n; ； According to the formula Obtain the objective function for selecting the optimal transportation path among all transportation paths ;in, , is the weight coefficient; S5, updating the transport path by using a damage repair algorithm to obtain a new transport path, and re-determining the objective function for selecting the optimal transport path among all the new transport paths; S6, after iterating and updating step S5 for a preset number of times, reaching a preset stop condition, the final objective function is obtained; wherein the optimal transportation path corresponding to the final objective function is a multimodal transport solution that transports emergency supplies from the supply point to the demand point via the transfer point.

2. The multimodal transport method for emergency materials based on emergency scenarios according to claim 1 is characterized in that: The step S2 specifically includes the following steps: S21, obtaining the geographical coordinates corresponding to each of the material supply points, material transfer points and material demand points, and constructing a supply point coordinate set based on the geographical coordinates of all material supply points , Construct a transfer point coordinate set based on the geographic coordinates of all material transfer points , and construct a demand point coordinate set based on the geographic coordinates of all material demand points ; S22, based on the supply point coordinate set , the transfer point coordinate set And the demand point coordinate set Constructing a preliminary set of key node coordinates ; S23, acquiring traffic condition data between key material nodes according to the current emergency scenario information, eliminating inaccessible key material nodes according to the traffic condition data, and updating the preliminary key node coordinate set to obtain a valid key node coordinate set; S24, constructing a current emergency material joint transportation network according to the valid key node coordinate set and the valid transportation tool information; wherein the valid transportation tool information is , Indicates truck, Indicates train, Indicates helicopter.

3. The multimodal transport method for emergency materials based on emergency scenarios according to claim 2 is characterized in that: The transport capacity information in step S4 specifically includes: The maximum transport capacity information is , is the maximum capacity of the transport, where e represents the type of transport, represents the transport volume of the i-th vehicle in the e-th mode of transport, where e is one of the following: road, rail, or helicopter; The running speed information is , , , represent the transport speeds by road, rail and helicopter respectively; Transfer information is ,in, Indicates key nodes of materials The material capacity, is the transfer point coordinate set, ,in, Indicates that vehicle m is on the route The maximum transport volume on is the preliminary key node coordinate set; The operating time information is that trucks can transport all day and trains have departure times. , the flight time is limited .

4. The multimodal transport method for emergency materials based on emergency scenarios according to claim 1 is characterized in that: The step S5 specifically includes the following steps: S51, randomly select a transport path from the existing transport paths and destroy one of the nodes except the departure and arrival nodes; S52, selecting the remaining passable nodes to reconnect the transport path to obtain a new transport path, and obtaining valid transportation tool information corresponding to the new transport path; S53, recalculating the objective function for selecting the optimal transportation path among all new transportation paths.

5. The multimodal transport method for emergency materials based on emergency scenarios according to claim 1 is characterized in that: The step S6 further includes the following steps: S61, acquiring real-time transportation data of the transportation process, and determining whether road transportation interruption occurs during the transportation process according to the transportation data; S62, when the transportation data determines that road transportation is interrupted during the transportation process, the inaccessible material transfer points are determined according to the real-time transportation data, and the transportation paths that cannot be connected due to the inaccessible material transfer points are deleted, and then the process returns to step S1.

6. The multimodal transport method for emergency materials based on emergency scenarios according to claim 5 is characterized in that: The step S61 further includes the following steps: S63, when the transportation data determines that there is no road transportation interruption in the transportation process, maintain the current state and continue.

Images