[go: up one dir, main page]

CN118586816B - A multimodal transport method for emergency supplies based on emergency scenarios - Google Patents

A multimodal transport method for emergency supplies based on emergency scenarios Download PDF

Info

Publication number
CN118586816B
CN118586816B CN202411086330.7A CN202411086330A CN118586816B CN 118586816 B CN118586816 B CN 118586816B CN 202411086330 A CN202411086330 A CN 202411086330A CN 118586816 B CN118586816 B CN 118586816B
Authority
CN
China
Prior art keywords
transportation
emergency
node
transport
points
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202411086330.7A
Other languages
Chinese (zh)
Other versions
CN118586816A (en
Inventor
雷洪涛
郭春显
朱承
周鋆
潘阳
江波
李子洋
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
National University of Defense Technology
Original Assignee
National University of Defense Technology
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by National University of Defense Technology filed Critical National University of Defense Technology
Priority to CN202411086330.7A priority Critical patent/CN118586816B/en
Publication of CN118586816A publication Critical patent/CN118586816A/en
Application granted granted Critical
Publication of CN118586816B publication Critical patent/CN118586816B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083—Shipping
    • G06Q10/08355—Routing methods
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06315—Needs-based resource requirements planning or analysis
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06316—Sequencing of tasks or work

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Quality & Reliability (AREA)
  • Development Economics (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Game Theory and Decision Science (AREA)
  • Educational Administration (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The application provides an emergency material multi-mode intermodal method based on sudden situations, which comprises the steps of determining material key nodes and effective transportation means information according to current sudden situation information, constructing a current emergency material intermodal network, determining transport priority corresponding to material demand points, obtaining material demand corresponding to the material demand points and transport capacity information of the current emergency material intermodal network, setting constraint conditions, initializing a plurality of transport paths according to the constraint conditions, determining an objective function, updating the transport paths by adopting a damage repair algorithm to obtain a new transport path, re-determining the objective function, iteratively updating preset times to reach preset stop conditions to obtain a final objective function, and enabling the optimal transport path corresponding to the final objective function to be a multi-mode intermodal scheme for transporting emergency materials from material supply points to material demand points through material turning points. The application can realize the combined transportation of emergency materials in a short time and at a low cost.

Description

Emergency material multi-mode intermodal method based on sudden situation
Technical Field
The invention relates to the technical field of emergency material transportation management, in particular to an emergency material multi-mode intermodal method based on sudden situations.
Background
When facing the sudden situation, the disaster-affected point demand and traffic conditions have higher uncertainty, the demand is often large and urgent, the traffic network faces the possibility of interruption, and a single vehicle can hardly meet various transportation requirements in the sudden situation. Compared with a single transport means, the multi-mode intermodal has better robustness to emergency situations, needs of demand points, including material types and material quantity, are quickly responded when the emergency situations are aimed at, emergency materials are transported to the demand points through joint transport such as trucks, trains and helicopters by reasonably planning routes, the multi-mode intermodal can meet complex transport environments and different transport demands, dependence on the single transport means is avoided, even last kilometer transport of the emergency materials can be realized, and transport efficiency is improved.
The conventional method for multi-mode intermodal transportation is to convert an emergency material transportation problem into a special VRP problem and solve the problem by adopting an optimization method. For example, for small-scale emergency material transportation problems, a mathematical programming method, such as mixed integer programming, can be used for modeling and solving by using an accurate solving algorithm, such as a branch-and-bound algorithm. Aiming at the path planning problem of larger scale, heuristic algorithms such as genetic algorithm, simulated annealing algorithm and the like are constructed for solving.
However, all of these solutions solve the requirement as deterministic, and do not highlight the uncertainty characteristic of emergency situations and the urgency of emergency material requirements. Therefore, how to efficiently complete emergency material transportation in as short a time and at low cost as possible according to emergency situations and accompanying uncertain material requirements has become a significant problem to be solved by multi-mode intermodal transportation of emergency materials.
In view of this, there is a need to propose an emergency materials multi-modal method based on sudden situations to solve or at least alleviate the above drawbacks.
Disclosure of Invention
The invention mainly aims to provide an emergency material multi-mode intermodal method based on an emergency situation, so as to solve the problems that the optimal solving method of the multi-mode intermodal scheme in the prior art does not highlight the uncertainty characteristic of the emergency situation and the urgency of the emergency material requirement, and the transportation efficiency is low and the cost is high.
In order to achieve the above purpose, the invention provides an emergency material multi-mode intermodal method based on sudden situations, comprising the following steps:
s1, acquiring current burst situation information, and determining material key nodes and effective vehicle information among all material key nodes according to the current burst situation information, wherein the material key nodes comprise material supply points, material medium-temperature points and material demand points;
S2, constructing a current emergency material joint transportation network according to the material key nodes and the effective transportation means information;
s3, carrying out urgent sorting on all the material demand points to obtain the corresponding transportation priorities of all the material demand points;
S4, acquiring the material demand corresponding to the material demand point and the transportation capability information of the current emergency material joint transportation network, setting constraint conditions, initializing a plurality of transportation paths from a material supply point to the material demand point through a material medium-point according to the constraint conditions, and determining an objective function for screening the optimal transportation paths in all the transportation paths, wherein the transportation capability information comprises the running speed information, the running time information, the maximum transportation capability information and the transit information of a vehicle, and the constraint conditions comprise flow conservation constraint, capacity constraint and integer programming constraint;
S5, updating the transportation path by adopting a damage repair algorithm to obtain a new transportation path, and redetermining an objective function for screening the optimal transportation path in all the new transportation paths;
And S6, iteratively updating the preset stop condition in the step S5 to obtain a final objective function, wherein the optimal transportation path corresponding to the final objective function is a multi-mode intermodal transportation scheme for transporting the emergency materials from the material supply point to the material demand point through the material middle point.
Preferably, the step S2 specifically includes the steps of:
s21, obtaining geographic coordinates corresponding to each material supply point, each material medium-temperature point and each material demand point, and constructing a supply point coordinate set according to the geographic coordinates of all material supply points Building a set of medium-point coordinates from the geographical coordinates of all the material medium-point pointsConstructing a demand point coordinate set according to the geographic coordinates of all the material demand points;
S22, according to the supply point coordinate setThe set of medium point coordinatesThe set of demand point coordinatesConstructing a preliminary key node coordinate set;
S23, acquiring traffic road condition data among all material key nodes according to the current sudden situation information, removing the material key nodes which cannot pass through according to the traffic road condition data, and updating the preliminary key node coordinate set to obtain an effective key node coordinate set;
s24, constructing a current emergency material joint transportation network according to the effective key node coordinate set and the effective vehicle information, wherein the effective vehicle information is that ,Representing a truck,Representing a train,Representing a helicopter.
Preferably, the step S3 specifically includes the steps of:
S31, establishing a priority hierarchical structure model of material demand points, wherein the priority hierarchical structure model comprises a target layer, a criterion layer and a scheme layer, the transport priority of the material demand points is used as the target layer, disaster data and traffic data of the material demand points are used as the criterion layer, and each material demand point is used as the scheme layer, and the disaster data comprises population density data C1 and disaster-stricken point emergency material reserve data C2, and the traffic data comprises traffic network distribution density data C3;
S32, respectively constructing index contrast matrixes Sum scheme-criterion contrast matrixWherein the index contrast matrix A is a judgment matrix obtained by comparing elements in the rule layer with each other in pairs aiming at the target layer, and the scheme-rule contrast matrix B is a judgment matrix obtained by comparing elements in the scheme layer with each other in pairs aiming at each element in the rule layer;
s33, aligning the element pairwise comparison in the rule layer and the scheme layer to perform hierarchical single sequencing, and performing hierarchical single sequencing on the element pairwise comparison in the target layer and the element pairwise comparison in the criterion layer, and calculating the maximum characteristic root of the scheme-criterion comparison matrix B Feature vectorAnd normalizeCalculating the maximum characteristic root of the index contrast matrix AFeature vectorAnd normalizeWherein, the method comprises the steps of,AndRelative weights for the compared elements calculated from the judgment matrix for the criterion;
s34, performing hierarchical total sorting on the elements on different layers to obtain a final sorting result And sort the final resultWeights in (3)As the delivery priority corresponding to the material demand point, wherein,Wherein, the method comprises the steps of, wherein,Is the number of elements in the criterion layer.
Preferably, the transportation capability information in step S4 specifically includes:
The maximum traffic information is ,Is the maximum traffic volume of the vehicle, where e represents the vehicle category,Representing the traffic volume of an ith vehicle in an e-th vehicle, wherein e is one of a highway, a railway and a helicopter;
The running speed information is ,、、Respectively representing the transportation speeds of the highway, the railway and the helicopter;
the transfer information is Wherein, the method comprises the steps of, wherein,Representing material critical nodesThe material containing amount is calculated by the weight of the material,For the set of medium-point coordinates,Wherein, the method comprises the steps of, wherein,Representing a line of a vehicle mThe maximum amount of transport on the road surface,A coordinate set of the preliminary key nodes is obtained;
The running time information is that the truck can be transported all day, and the train has departure time Limited flight time of aircraft。
Preferably, in the step S4, a constraint condition is set, a plurality of transportation paths from the material supply point to the material demand point through the material medium point are initialized according to the constraint condition, and the objective function for screening the optimal transportation paths in all the transportation paths is determined specifically including:
Initializing a plurality of transportation paths from a material supply point to a material demand point through a material medium point according to the constraint condition, wherein the material key node meets the flow conservation constraint, specifically:
;
wherein l and k are nodes on the path, s is an initial node, o is a termination node, namely the transmission end point, Decision variables for a set of vehicles available between nodes l, kFor representing the passage of material through a vehicleFrom key node k to l, decision variableFor representing that at the material key node l, the vehicle type is changed from m to n;
the transportation route satisfies the constraint condition of transportation means, the transportation means that same commodity circulation demand adopted on a transportation route is not more than 1, and this constraint guarantees the continuity of transportation between the node to get rid of the condition that multiple transportation means of same transportation route between the node transported simultaneously, specifically:
;
The transfer meets the constraint of a transport means, the cargo transfer link carried out on one node is not more than 1 time, the constraint ensures the continuity of the transfer process so as to exclude the condition of multiple transfers of the same node, and the method specifically comprises the following steps:
;
the route satisfies the constraint of the transportation capacity, the transportation capacity on the transportation line does not exceed the maximum transportation capacity on the line, the constraint ensures the transportation effectiveness, so as to eliminate the overload condition of the transportation means, and the method specifically comprises the following steps:
;
Wherein Q is the cargo transportation quantity, Maximum traffic for vehicle m on the node k to l path;
The transfer meets the capacity constraint of the transfer node, the transfer quantity at the transfer node does not exceed the maximum transfer quantity of the node, the constraint ensures the effectiveness of the transfer so as to eliminate the overload working condition of the transfer node, and the method specifically comprises the following steps:
;
Wherein, Representing the maximum transport volume of node l;
The objective function for screening the optimal transportation path among all transportation paths is calculated to meet the integer programming constraint, specifically:
;
;
wherein the transportation time T comprises on-line transportation time, transit time and transit waiting time, wherein, Representing use of a vehicle m slave nodeTo the point ofThe time taken for the time to elapse,Indicated at the transit nodeWhere, the time taken for the vehicle to switch from m to n,Representing latency at a node;
;
Wherein the transportation cost C comprises on-line transportation cost and transfer cost, wherein Q is freight volume, To use the vehicle m slave nodeTo the point ofThe required unit cost per unit of the product,Representing nodesThe unit cost required for converting m into n is changed;
;
According to the formula Obtaining an objective function for screening an optimal transport path among all transport pathsWherein, the method comprises the steps of,、Is a weight coefficient.
Preferably, the step S5 specifically includes the steps of:
S51, randomly selecting one of the existing transport paths, and destroying one of nodes except the departure node and the arrival node;
s52, selecting other passable nodes to reconnect the transportation path to obtain a new transportation path, and acquiring effective transportation means information corresponding to the new transportation path;
s53, recalculating an objective function for screening the optimal transportation path in all the new transportation paths.
Preferably, the step S6 further includes the step of:
S61, acquiring real-time transportation data of a transportation process, and judging whether road transportation interruption occurs in the transportation process according to the transportation data;
and S62, when the transportation data judges that the road transportation is interrupted in the transportation process, determining the non-passing material transit points according to the real-time transportation data, deleting the transportation paths which are not communicated due to the non-passing material transit points, and returning to the step S1.
Preferably, the step S61 further includes the step of:
And S63, when the transportation data judges that the road transportation is not interrupted in the transportation process, maintaining the current state and continuing.
The 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 the steps of the emergency material multi-mode intermodal method based on the sudden situation are realized when the processor executes the computer program.
The present invention also provides a storage medium storing a computer program which when executed by a processor implements the steps of the emergency materials multi-modal method based on burst scenarios as described above.
Compared with the prior art, the invention has the following beneficial effects:
The application fully considers the uncertainty characteristic of the sudden situation and the urgency of different disaster points to the emergency material demand, and can realize the combined transportation of the emergency material in a short time and at a low cost. Specifically, the multi-type intermodal scheme of the application selects the most economical transport means according to the transport material information and the transport capacity information of the current emergency material intermodal network by setting constraint conditions, so that the transport cost can be effectively reduced, the high cost of a single transport means is avoided, and the transport cost of the whole transport scheme is reduced. In addition, the application can select different transport tools according to specific conditions, flexibly cope with different transport requirements and transport conditions, improve the adaptability of a transport scheme, disperse transport risks, avoid the problem that a single transport tool possibly faces process interruption, and improve the reliability and safety in the transport process.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings that are required in the embodiments or the description of the prior art will be briefly described, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and other drawings may be obtained according to the structures shown in these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a flow chart of an embodiment of the present invention;
FIG. 2 is a flowchart illustrating steps included in step S2 according to an embodiment of the present invention;
FIG. 3 is a flowchart illustrating steps included in step S5 according to an embodiment of the present invention;
FIG. 4 is a schematic diagram of a priority hierarchy model according to an embodiment of the present invention;
FIG. 5 is a schematic diagram of an emergency materials intermodal network in accordance with one embodiment of the present invention.
The achievement of the objects, functional features and advantages of the present invention will be further described with reference to the accompanying drawings, in conjunction with the embodiments.
Detailed Description
It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the invention.
The following description of the embodiments of the present invention will be made clearly and fully with reference to the accompanying drawings, in which it is evident that the embodiments described are only some, but not all embodiments of the invention. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
It should be noted that all directional indicators (such as up, down, left, right, front, and rear are used in the embodiments of the present invention) are merely for explaining the relative positional relationship, movement conditions, and the like between the components in a certain specific posture (as shown in the drawings), and if the specific posture is changed, the directional indicators are changed accordingly.
Furthermore, the description of "first," "second," etc. in this disclosure is for descriptive purposes only and is not to be construed as indicating or implying a relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defining "a first" or "a second" may explicitly or implicitly include at least one such feature. In addition, the technical solutions of the embodiments may be combined with each other, but it is necessary to base that the technical solutions can be realized by those skilled in the art, and when the technical solutions are contradictory or cannot be realized, the combination of the technical solutions should be considered to be absent and not within the scope of protection claimed in the present invention.
It should be appreciated by those skilled in the art that with technological advancement and technological development, the comprehensive transportation network is basically perfect, and provides good guarantee for the transportation of emergency materials. The multi-type intermodal transportation means is a joint transportation means which is formed by mutually matching two or more transportation modes and connecting the two or more transportation modes at nodes, and is used for jointly completing transportation, and mainly comprises five transportation means, namely road transportation, railway transportation, waterway transportation, aviation transportation and pipeline transportation.
Due to the increasingly diversified material demands, the lifting transportation cost and the complex transportation environment, the limitation of a single transportation tool is increasingly remarkable, the railway transportation has the limitations of large transportation quantity, high safety and suitability for long-distance transportation of bulk cargos, but also has the limitations of poor flexibility and high infrastructure requirements, the road transportation has the advantages of good flexibility, convenience and rapidness, small single transportation quantity and unsuitability for large-scale transportation, the waterway transportation cost is low, the transportation quantity is large, the regional limitation is serious, the loading and unloading are inconvenient, the air transportation speed is high, but the cost is high, the transportation quantity is small, and the pipeline transportation is basically used in oil-gas transportation.
Referring to fig. 1 to 5, in an embodiment of the present invention, an emergency material multi-mode intermodal method based on a sudden situation includes the steps of:
s1, acquiring current burst situation information, and determining material key nodes and effective vehicle information among all material key nodes according to the current burst situation information, wherein the material key nodes comprise material supply points, material medium-temperature points and material demand points;
S2, constructing a current emergency material joint transportation network according to the material key nodes and the effective transportation means information;
s3, carrying out urgent sorting on all the material demand points to obtain the corresponding transportation priorities of all the material demand points;
And S4, acquiring the material demand corresponding to the material demand point and the transportation capability information of the current emergency material joint transportation network, setting constraint conditions, initializing a plurality of transportation paths from a material supply point to the material demand point through a material middle point according to the constraint conditions, and determining an objective function for screening the optimal transportation paths in all the transportation paths, wherein the transportation capability information comprises the running speed information, the running time information, the maximum transportation amount information and the transfer information of a vehicle, the constraint conditions comprise flow conservation constraint, capacity constraint and integer planning constraint, and the transfer information is the maximum transfer amount of a transfer node.
S5, updating the transportation path by adopting a damage repair algorithm to obtain a new transportation path, and redetermining an objective function for screening the optimal transportation path in all the new transportation paths;
And S6, iteratively updating the preset stop condition in the step S5 to obtain a final objective function, wherein the optimal transportation path corresponding to the final objective function is a multi-mode intermodal transportation scheme for transporting the emergency materials from the material supply point to the material demand point through the material middle point.
As a preferred embodiment, the step S2 specifically includes the steps of:
s21, obtaining geographic coordinates corresponding to each material supply point, each material medium-temperature point and each material demand point, and constructing a supply point coordinate set according to the geographic coordinates of all material supply points Building a set of medium-point coordinates from the geographical coordinates of all the material medium-point pointsConstructing a demand point coordinate set according to the geographic coordinates of all the material demand points;
S22, according to the supply point coordinate setThe set of medium point coordinatesThe set of demand point coordinatesConstructing a preliminary key node coordinate set;
S23, acquiring traffic road condition data among all material key nodes according to the current sudden situation information, removing the material key nodes which cannot pass through according to the traffic road condition data, and updating the preliminary key node coordinate set to obtain an effective key node coordinate set;
s24, constructing a current emergency material joint transportation network according to the effective key node coordinate set and the effective vehicle information, wherein the effective vehicle information is that ,Representing a truck,Representing a train,Representing a helicopter.
As a preferred embodiment, the step S3 specifically includes the steps of:
S31, establishing a priority hierarchical structure model of material demand points, wherein the priority hierarchical structure model comprises a target layer, a criterion layer and a scheme layer, the transport priority of the material demand points is used as the target layer, disaster data and traffic data of the material demand points are used as the criterion layer, and each material demand point is used as the scheme layer, and the disaster data comprises population density data C1 and disaster-stricken point emergency material reserve data C2, and the traffic data comprises traffic network distribution density data C3;
S32, respectively constructing index contrast matrixes Sum scheme-criterion contrast matrixWherein the index contrast matrix A is a judgment matrix obtained by comparing elements in the rule layer with each other in pairs aiming at the target layer, and the scheme-rule contrast matrix B is a judgment matrix obtained by comparing elements in the scheme layer with each other in pairs aiming at each element in the rule layer;
s33, aligning the element pairwise comparison in the rule layer and the scheme layer to perform hierarchical single sequencing, and performing hierarchical single sequencing on the element pairwise comparison in the target layer and the element pairwise comparison in the criterion layer, and calculating the maximum characteristic root of the scheme-criterion comparison matrix B Feature vectorAnd normalizeCalculating the maximum characteristic root of the index contrast matrix AFeature vectorAnd normalizeWherein, the method comprises the steps of,AndRelative weights for the compared elements calculated from the judgment matrix for the criterion;
Furthermore, consistency check can be performed on the index comparison matrix A and the scheme-criterion comparison matrix B, and the purpose of the consistency check is to ensure the data accuracy and logic of the judgment matrix, so that the reliability and effectiveness of the method are improved. Matrix order n, uniformity index Wherein the closer CI is to 0, the better the consistency, introducing a random consistency index RI, which varies according to the matrix order, for measuring the CI size, defining a consistency ratio,When CR is generally less than 0.1, the composition is considered to beThe degree of inconsistency of (c) is within an allowable range, passing the consistency check.
S34, performing hierarchical total sorting on the elements on different layers to obtain a final sorting resultAnd sort the final resultWeights in (3)As the delivery priority corresponding to the material demand point, wherein,,Is the number of elements in the criterion layer.
Specifically, after the ordering of the hierarchical sheets on each hierarchy is completed, elements on different hierarchies need to be comprehensively compared to determine the relative importance among the elements. The total ranking of the layers is to comprehensively rank all the factors on the basis of considering the relative importance of each layer, so as to obtain the final ranking result.The final delivery priority corresponding to the material demand points can reflect the demand urgency of each material demand point objectively and accurately. Delivery is performed according to the delivery priority, so that emergency materials can be used more effectively.
Further, the transportation capability information in step S4 specifically includes:
The maximum traffic information is ,Is the maximum traffic volume of the vehicle, where e represents the vehicle category,Representing the traffic volume of an ith vehicle in an e-th vehicle, wherein e is one of a highway, a railway and a helicopter;
The running speed information is ,、、Respectively representing the transportation speeds of the highway, the railway and the helicopter;
the transfer information is Wherein, the method comprises the steps of, wherein,Representing material critical nodesThe material containing amount is calculated by the weight of the material,For the set of medium-point coordinates,Wherein, the method comprises the steps of, wherein,Representing a line of a vehicle mThe maximum amount of transport on the road surface,A coordinate set of the preliminary key nodes is obtained;
The running time information is that the truck can be transported all day, and the train has departure time Limited flight time of aircraft。
As a preferred embodiment, the step S4 sets a constraint condition, and initializing a plurality of transportation paths from the material supply point to the material demand point through the material medium point according to the constraint condition, and determining an objective function for screening the optimal transportation paths among all the transportation paths specifically includes:
Initializing a plurality of transportation paths from a material supply point to a material demand point through a material medium point according to the constraint condition, wherein the material key node meets the flow conservation constraint, specifically:
;
The traffic conservation constraint means that the quantity of vehicles entering and exiting at a certain node is balanced, l and k are nodes on a path, s is an initial node, o is a termination node, namely a transportation end point, Decision variables for a set of vehicles available between nodes l, kFor representing the passage of material through a vehicleFrom key node k to l, decision variableFor representing that at the material key node l, the vehicle type is changed from m to n;
the transportation route satisfies the constraint condition of transportation means, the transportation means that same commodity circulation demand adopted on a transportation route is not more than 1, and this constraint guarantees the continuity of transportation between the node to get rid of the condition that multiple transportation means of same transportation route between the node transported simultaneously, specifically:
;
The transfer meets the constraint of a transport means, the cargo transfer link carried out on one node is not more than 1 time, the constraint ensures the continuity of the transfer process so as to exclude the condition of multiple transfers of the same node, and the method specifically comprises the following steps:
;
the route satisfies the constraint of the transportation capacity, the transportation capacity on the transportation line does not exceed the maximum transportation capacity on the line, the constraint ensures the transportation effectiveness, so as to eliminate the overload condition of the transportation means, and the method specifically comprises the following steps:
;
Wherein Q is the cargo transportation quantity, Maximum traffic for vehicle m on the node k to l path;
The transfer meets the capacity constraint of the transfer node, the transfer quantity at the transfer node does not exceed the maximum transfer quantity of the node, the constraint ensures the effectiveness of the transfer so as to eliminate the overload working condition of the transfer node, and the method specifically comprises the following steps:
;
Wherein, Representing the maximum transport volume of node l;
The objective function for screening the optimal transportation path among all transportation paths is calculated to meet the integer programming constraint, specifically:
;
;
wherein the transportation time T comprises on-line transportation time, transit time and transit waiting time, wherein, Representing use of a vehicle m slave nodeTo the point ofThe time taken for the time to elapse,Indicated at the transit nodeWhere, the time taken for the vehicle to switch from m to n,Representing latency at a node;
;
Wherein the transportation cost C comprises on-line transportation cost and transfer cost, wherein Q is freight volume, To use the vehicle m slave nodeTo the point ofThe required unit cost per unit of the product,Representing nodesThe unit cost required for converting m into n is changed;
;
According to the formula Obtaining an objective function for screening an optimal transport path among all transport pathsWherein, the method comprises the steps of,、Is a weight coefficient.
Further, the step S5 specifically includes the steps of:
s51, randomly selecting one of the existing transportation paths to destroy one of nodes except the departure and arrival, S52, selecting other passable nodes to reconnect the transportation paths to obtain new transportation paths, acquiring effective transportation means information corresponding to the new transportation paths, and S53, recalculating an objective function for screening the optimal transportation paths in all the new transportation paths.
Further, the step S6 further includes the steps of:
S61, acquiring real-time transportation data of a transportation process, and judging whether road transportation interruption occurs in the transportation process according to the transportation data;
And S62, when the transportation data judges that the road transportation is interrupted in the transportation process, determining the non-passing material transit points according to the real-time transportation data, deleting the transportation paths which are not communicated due to the non-passing material transit points, and returning to the step S1. Specifically, the embodiment continues to monitor the transportation process, and if the problem of road transportation interruption occurs in the transportation process, uninterrupted transportation can be realized through the turning points of other materials. Current emergency material intermodal networks suffer from damage in sudden situations, such as material turning points 、When the damage cannot pass, thenAnd deleting the path which cannot be communicated due to node damage, returning to the step S1 to update the current emergency material joint transportation network, and completing the transportation of the emergency materials according to the step according to the updated current emergency material joint transportation network. If the multi-mode intermodal network is not damaged, the emergency material demands of disaster points with high priority levels are preferentially met according to the priority levels of disaster areas. And under the condition of capacity constraint, the emergency materials at the supply point are transported to the disaster-affected point through the intermediate point, and the transportation of the materials is completed.
Further, the step S61 further includes the steps of:
and S63, when the transportation data judges that the road transportation is not interrupted in the transportation process, maintaining the current state and continuing. If the current emergency material intermodal network is not damaged, namely the current emergency material intermodal network is in a normal state, carrying out transportation according to the current multi-type intermodal scheme.
The 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 the steps of the emergency material multi-mode intermodal method based on the sudden situation are realized when the processor executes the computer program.
The present invention also provides a storage medium storing a computer program which when executed by a processor implements the steps of the emergency materials multi-modal method based on burst scenarios as described above. It will be appreciated that the emergency materials multi-modal approach based on burst scenarios described above is implemented when executed by a processor, and therefore all embodiments of the approach described above are applicable to this storage medium and achieve the same or similar benefits.
In order to assist those skilled in the art in better understanding the technical scheme of the application, the application also provides the following specific embodiments:
The burst scenario described in this embodiment is a natural disaster, when the occurrence time is 9 am, the emergency materials to be transported are medical materials, the transportation vehicles adopted are three transportation vehicles including a highway, a railway and a helicopter, and table 1 is the coordinate information of the material supply point, the material middle point and the material demand point.
TABLE 1 coordinate information of Material supply Point, material center Point, and Material demand Point
As shown in FIG. 5, after occurrence of a major natural disaster, each material key node is defined, including a material supply point(Represented by squares), three disaster points, namely material demand points(Represented by diamond) and three material center points(Represented by circles), all node sets. Definitely selectable vehicles and vehicles among key nodes of various materialsWhereinRepresenting the truck, represented by straight lines,Is shown by a straight line dashed line,The representation of the helicopter is indicated by a curved dashed line. The current emergency material joint transportation network is constructed according to the traffic mode between nodes as shown in fig. 5.
Establishing a priority hierarchical structure model corresponding to the material demand points 5, 6 and 7, combining the model shown in fig. 4, taking the delivery priority of the material demand points as a target layer, taking disaster data and traffic data of the material demand points as a criterion layer and taking each material demand point 5, 6 and 7 as a scheme layer, wherein the disaster data comprises population density data C1 and disaster point emergency material reserve data C2, and the traffic data comprises traffic network distribution density data C3;
Determining a proportion scale table:
Table 2 scale table
(1) Starting with a target layer and a criterion layer, the index contrast matrix A isCalculating to obtain the maximum characteristic value of the index contrast matrix A,,Has consistency, and continuously obtains the component。
(2) The three material demand points are respectively corresponding to the material demand point C1, the disaster point emergency material reserve data C2 and the judgment matrix of the traffic road network distribution density data C3 by the hierarchical single sequencing、、. The maximum eigenvalue and the component are respectively,,;,,. Inspection of,,Has consistency.
(3) Hierarchical total ordering: Delivery priority of 7 over 5 over 6 for three material demand points may be obtained.
And acquiring the transportation capability information of the current emergency material joint transportation network. Table 3 is a vehicle operation information table, table 4 is a vehicle cost and traffic volume information table, and table 5 is a transit node cost information table.
TABLE 3 vehicle operation information Table
Table 4 vehicle cost and volume information table
Table 5 transfer node cost information table
And the materials are clearly transported, the transported emergency materials are medical materials, and no special transportation requirement exists. Table 6 shows the material demands of different disaster-stricken nodes.
Table 6 disaster recovery node material demand
Clear transportation requirements and restrictions. The emergency materials are transported to the demand point in the shortest time, and 5 trucks and 3 helicopters are arranged at each node capable of being transferred.
In this example 9 am, the cargo traffic is considered. Therefore, the primary transportation route of the emergency materials is as follows:
Route 1:1→iron 2-iron 7
Route 2:1→public 3-navigation 5
Route 3:1→iron→2→ iron → 4 → aviation/public → 6
Assuming that the transit node 4 cannot finish transit due to disaster interruption in the transportation process, the route of the node 4 needs to be updated, the route is reselected from 1 to iron to 2 to public to 3 to public to 6, the traffic constraint is met, transportation tools do not collide to disaster points 5 and 6, and emergency materials are obtained at the disaster point 5 in preference to 6. The final transport scheme is therefore:
Route 1:1→iron 2-iron 7
Route 2:1→public 3-navigation 5
Route 3:1→iron→2→ 3-6
And checking the transported goods, completing transportation if the need of rescue is met, and otherwise, supplementing the goods.
The foregoing description is only of the preferred embodiments of the present invention, and is not intended to limit the scope of the invention, but rather is intended to cover any equivalents of the structures or equivalent processes disclosed herein or in the alternative, which may be employed directly or indirectly in other related arts.

Claims (6)

1.一种基于突发情景下的应急物资多式联运方法，其特征在于，包括步骤：1. A multimodal transport method for emergency materials based on emergency scenarios, characterized by comprising the steps of: S1，获取当前突发情景信息，并根据所述当前突发情景信息确定物资关键节点以及各个物资关键节点之间的有效交通工具信息；其中，所述物资关键节点包括物资供应点、物资中转点以及物资需求点；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，根据所述物资关键节点和所述有效交通工具信息构建当前应急物资联合运输网络；S2, constructing a current emergency material joint transportation network according to the material key nodes and the effective transportation tool information; S3，对所有物资需求点进行紧迫性排序得到所有物资需求点对应的运送优先级；S3, sort all material demand points by urgency to obtain the corresponding delivery priorities of all material demand points; 所述步骤S3具体包括步骤：The step S3 specifically comprises the following steps: S31，建立物资需求点的优先级层次结构模型；其中，所述优先级层次结构模型包括目标层、准则层以及方案层，以物资需求点的运送优先级作为目标层，以物资需求点的灾害数据和交通数据作为准则层，以各物资需求点作为方案层；其中，所述灾害数据包括人口密度数据C1、受灾点应急物资储备量数据C2，所述交通数据包括交通路网分布密度数据C3；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，分别构建指标对比矩阵和方案-准则对比矩阵；其中，指标对比矩阵A为准则层内元素针对目标层两两比较得出的判断性矩阵，方案-准则对比矩阵B为方案层内元素分别针对准则层中每个元素两两比较得出的判断性矩阵；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，对准则层和方案层中元素两两比较进行层次单排序，以及对目标层中元素和准则层中元素两两比较进行层次单排序，并计算方案-准则对比矩阵B的最大特征根及特征向量并归一化，计算指标对比矩阵A的最大特征根及特征向量并归一化；其中，和为由判断性矩阵计算的被比较元素对于准则的相对权重；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，对不同层次上的元素进行层次总排序得到最终排序结果，并将最终排序结果中的权重作为物资需求点对应的运送优先级；其中，，其中，为准则层中元素个数；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; S4，获取所述物资需求点对应的物资需求量和所述当前应急物资联合运输网络的运输能力信息，设置约束条件，根据所述约束条件初始化多条从物资供应点经物资中转点运送至物资需求点的运输路径，再确定用于在所有运输路径中筛选最优运输路径的目标函数；其中，所述运输能力信息包括交通工具的运行速度信息、运行时间信息、最大运量信息以及中转信息，所述约束条件包括流量守恒约束、容量约束以及整数规划约束；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; 所述步骤S4中设置约束条件，根据所述约束条件初始化多条从物资供应点经物资中转点运送至物资需求点的运输路径，再确定用于在所有运输路径中筛选最优运输路径的目标函数具体包括：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: ； ; 其中，l、k为路径上的节点，s为初始节点，o为终止节点，即运输终点，为节点l、k间可使用的交通工具集合，决策变量用来表示从物资通过交通工具从关键节点k到l；决策变量用来表示在物资关键节点l处，交通工具种类由第m种变为第n种；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; 运输路径满足运输工具的约束条件，同一物流需求在一条运输路径上采用的运输工具不超过1种，保证节点间运输的连续性，以排除节点间同一运输路径多种交通工具同时运输的情况，具体为：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: ； ; 中转满足运输工具的约束，在一个节点上进行的货物中转环节不超过1次，保证中转过程的连续性，以排除同一节点多次中转的情况，具体为：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: ； ; 其中，Q为货物运输量，为节点k到l路径上交通工具m的最大运输量；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: ； ; 其中，表示节点l的最大转运量；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: ； ; ； ; 其中，运输时间T包括线路上运输时间，中转时间以及中转等待时间，其中，表示使用交通工具m从节点到所用时间，表示在中转节点处，交通工具由第m种转换为第n种所用时间，表示节点处的等待时间；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; ； ; 其中，运输成本C包括线路上运输成本和中转成本，其中Q为货物运输量，为使用交通工具m从节点到所需要的单位成本，表示节点处由m转为n所需的单位成本；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，对运输路径采用破坏修复算法进行更新得到新运输路径，并重新确定用于在所有新运输路径中筛选最优运输路径的目标函数；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，迭代更新步骤S5预设次数后达到预设停止条件，得到最终目标函数；其中，最终目标函数对应的最优运输路径为将应急物资从物资供应点经物资中转点运送至物资需求点的多式联运方案。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.根据权利要求1所述的基于突发情景下的应急物资多式联运方法，其特征在于，所述步骤S2具体包括步骤：2. The multimodal transport method for emergency materials based on emergency scenarios according to claim 1 is characterized in that the step S2 specifically comprises the steps of: S21，获取每个所述物资供应点、物资中转点以及物资需求点对应的地理坐标，并根据所有物资供应点的地理坐标构建供应点坐标集、根据所有物资中转点的地理坐标构建中转点坐标集、以及根据所有物资需求点的地理坐标构建需求点坐标集；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，根据所述供应点坐标集、所述中转点坐标集以及所述需求点坐标集构建初步关键节点坐标集；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，根据所述当前突发情景信息获取各个物资关键节点之间交通路况数据，并根据所述交通路况数据剔除无法通行的物资关键节点，更新所述初步关键节点坐标集得到有效关键节点坐标集；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，根据所述有效关键节点坐标集和所述有效交通工具信息构建当前应急物资联合运输网络；其中，有效交通工具信息为，表示货车、表示火车、表示直升机。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.根据权利要求2所述的基于突发情景下的应急物资多式联运方法，其特征在于，所述步骤S4中的运输能力信息具体包括：3. The multimodal transport method for emergency materials based on emergency scenarios according to claim 2, characterized in that the transport capacity information in step S4 specifically includes: 最大运量信息为，为交通工具的最大运量，其中，e表示交通工具种类，表示第e种交通工具中的第i辆的运量，e为公路、铁路、直升机中的一种；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; 中转信息为，其中，表示物资关键节点的物资容纳量，为所述中转点坐标集，，其中，表示交通工具m在线路上的最大运输量，为所述初步关键节点坐标集；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.根据权利要求1所述的基于突发情景下的应急物资多式联运方法，其特征在于，所述步骤S5具体包括步骤：4. The multimodal transport method for emergency materials based on emergency scenarios according to claim 1, characterized in that step S5 specifically comprises the following steps: S51，随机选择已有运输路径中的一条运输路径，破坏除出发和到达外的其中一个节点；S51, randomly select a transport path from the existing transport paths and destroy one of the nodes except the departure and arrival nodes; S52，选择其余可通行节点将运输路径重新连接得到新运输路径，并获取所述新运输路径对应的有效交通工具信息；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，重新计算用于在所有新运输路径中筛选最优运输路径的目标函数。S53, recalculating the objective function for selecting the optimal transportation path among all new transportation paths. 5.根据权利要求1所述的基于突发情景下的应急物资多式联运方法，其特征在于，所述步骤S6之后还包括步骤：5. The multimodal transport method for emergency materials based on emergency situations according to claim 1, characterized in that the step S6 further comprises the following steps: S61，获取运输过程的实时运输数据，并根据所述运输数据判断运输过程是否出现道路运输中断；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，在所述运输数据判断运输过程出现道路运输中断时，根据所述实时运输数据确定无法通行的物资中转点，并将由于无法通行的物资中转点无法连通的运输路径删除，再返回步骤S1。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.根据权利要求5所述的基于突发情景下的应急物资多式联运方法，其特征在于，所述步骤S61之后还包括步骤：6. The multimodal transport method for emergency materials based on emergency situations according to claim 5, characterized in that the step S61 further comprises the following steps: S63，在所述运输数据判断运输过程未出现道路运输中断时，维持当前状态继续进行。S63, when the transportation data determines that there is no road transportation interruption in the transportation process, maintain the current state and continue.
CN202411086330.7A 2024-08-08 2024-08-08 A multimodal transport method for emergency supplies based on emergency scenarios Active CN118586816B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202411086330.7A CN118586816B (en) 2024-08-08 2024-08-08 A multimodal transport method for emergency supplies based on emergency scenarios

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202411086330.7A CN118586816B (en) 2024-08-08 2024-08-08 A multimodal transport method for emergency supplies based on emergency scenarios

Publications (2)

Publication Number Publication Date
CN118586816A CN118586816A (en) 2024-09-03
CN118586816B true CN118586816B (en) 2025-01-03

Family

ID=92533749

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202411086330.7A Active CN118586816B (en) 2024-08-08 2024-08-08 A multimodal transport method for emergency supplies based on emergency scenarios

Country Status (1)

Country Link
CN (1) CN118586816B (en)

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107808213A (en) * 2017-10-19 2018-03-16 中国人民解放军国防科技大学 Dynamically-adjusted emergency transportation scheduling plan generation method
CN110705901A (en) * 2019-10-14 2020-01-17 西南交通大学 Railway empty wagon allocation method based on timeliness and emergency disaster material priority

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9792575B2 (en) * 2016-03-11 2017-10-17 Route4Me, Inc. Complex dynamic route sequencing for multi-vehicle fleets using traffic and real-world constraints
CN115796418A (en) * 2022-12-05 2023-03-14 青岛日日顺物流有限公司 Emergency material scheduling method considering road traffic constraint
CN117151482A (en) * 2023-08-03 2023-12-01 国网河南省电力公司郑州供电公司 Emergency material scheduling and path planning method based on multi-objective optimization

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107808213A (en) * 2017-10-19 2018-03-16 中国人民解放军国防科技大学 Dynamically-adjusted emergency transportation scheduling plan generation method
CN110705901A (en) * 2019-10-14 2020-01-17 西南交通大学 Railway empty wagon allocation method based on timeliness and emergency disaster material priority

Also Published As

Publication number Publication date
CN118586816A (en) 2024-09-03

Similar Documents

Publication Publication Date Title
Cokyasar Optimization of battery swapping infrastructure for e-commerce drone delivery
Rui et al. Optimum transit operations during the emergency evacuations
US8768614B2 (en) Increasing throughput for carpool assignment matching
WO2019120159A1 (en) Method for determining logistics route and related device
US6496774B1 (en) Automatic vehicle routing and recommendation system
Awad-Núñez et al. How should the sustainability of the location of dry ports be measured? A proposed methodology using Bayesian networks and multi-criteria decision analysis
CN103426139B (en) System and method for matching and pairing co-passengers
CN118863729B (en) A vaccine cold chain distribution method and system based on big data analysis
KR102228106B1 (en) Method and System for Dynamic Task Distribution of Multi Unmanned Ground Vehicle
Guo et al. Global synchromodal shipment matching problem with dynamic and stochastic travel times: A reinforcement learning approach
CN109948918B (en) Comprehensive distribution method of territorial emergency public storage materials
CN108830433A (en) A kind of O&M route planning method based on LBS, system
Uddin et al. Freight traffic assignment methodology for large-scale road–rail intermodal networks
CN113743860A (en) Vehicle material loading method, system, electronic device and storage medium
Xiong et al. Research on the model and algorithm for multimodal distribution of emergency supplies after earthquake in the perspective of fairness
Wang et al. Reliability modeling in spatially distributed logistics systems
TWI435224B (en) System reliability evaluation method for routing policy
CN110619424B (en) Transportation and distribution optimizing system
Chen et al. Schedule coordination, delay propagation, and disruption resilience in intermodal logistics networks
CN118586816B (en) A multimodal transport method for emergency supplies based on emergency scenarios
CN113516424B (en) Line generation method and device, electronic equipment and storage medium
Cao Mathematical Model and Algorithm of Multi‐Index Transportation Problem in the Background of Artificial Intelligence
Pagès et al. Real-time mass passenger transport network optimization problems
Yousaf et al. Ride-sharing: A multi source-destination path planning approach
Huynh et al. A new planning model to support logistics service providers in selecting mode, route, and terminal location

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant