CN110175799B - Emergency material distribution path branch current limiting scheme generation method - Google Patents
Emergency material distribution path branch current limiting scheme generation method Download PDFInfo
- Publication number
- CN110175799B CN110175799B CN201910368875.XA CN201910368875A CN110175799B CN 110175799 B CN110175799 B CN 110175799B CN 201910368875 A CN201910368875 A CN 201910368875A CN 110175799 B CN110175799 B CN 110175799B
- Authority
- CN
- China
- Prior art keywords
- time
- distribution path
- current limiting
- node
- intermediate node
- 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
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/12—Computing arrangements based on biological models using genetic models
- G06N3/126—Evolutionary algorithms, e.g. genetic algorithms or genetic programming
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR 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/0835—Relationships between shipper or supplier and carriers
- G06Q10/08355—Routing methods
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Health & Medical Sciences (AREA)
- Life Sciences & Earth Sciences (AREA)
- Biophysics (AREA)
- Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- Bioinformatics & Cheminformatics (AREA)
- Bioinformatics & Computational Biology (AREA)
- Evolutionary Biology (AREA)
- Economics (AREA)
- General Physics & Mathematics (AREA)
- Molecular Biology (AREA)
- Genetics & Genomics (AREA)
- Evolutionary Computation (AREA)
- General Health & Medical Sciences (AREA)
- Computational Linguistics (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Biomedical Technology (AREA)
- Mathematical Physics (AREA)
- Software Systems (AREA)
- Artificial Intelligence (AREA)
- Data Mining & Analysis (AREA)
- Development Economics (AREA)
- Physiology (AREA)
- Entrepreneurship & Innovation (AREA)
- Human Resources & Organizations (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- General Business, Economics & Management (AREA)
- Traffic Control Systems (AREA)
Abstract
The invention discloses a method for generating a branch current limiting scheme of an emergency material distribution path, which comprises the steps of coding nodes and road sections of the distribution path, acquiring traffic state and flow information of each coded intermediate node and road section on the distribution path, acquiring attribute information of each coded road section on the distribution path, solving the current limiting time of each coded intermediate node and the transportation time of each coded road section, calculating the current limiting starting time of each coded intermediate node by taking the distribution starting time as a reference, generating the branch current limiting scheme of the distribution path and the like; the invention can rapidly make a set of traffic cooperative guarantee scheme, scientifically and reasonably select the branch for limiting the flow and control the flow limiting time, meets the time requirement of material distribution to the maximum extent, simultaneously minimizes the traffic influence generated by flow limiting, and has important reference value for emergency decision commanders.
Description
Technical Field
The invention relates to the technical field of computer application and the technical field of traffic science, in particular to a method for quickly generating a branch flow-limiting traffic coordination scheme of a distribution path in an emergency rescue material transportation process.
Background
In recent years, irregular emergencies such as earthquakes, floods, debris flows, hails, accident disasters and the like occur frequently in various regions, so that the normal life of people is seriously influenced, and serious casualties and economic losses are caused. In order to reduce casualties of accidents to the maximum extent and reduce public property loss, it is a crucial ring to determine whether the demand of emergency supplies at a disaster site in a short time after a disaster is met, how to distribute the emergency supplies to the disaster site within a specified time window to meet the demand of the disaster site is a key for emergency rescue and disaster relief after the disaster.
The transportation time of the emergency material distribution path is obviously influenced by the traffic flow density, the larger the traffic flow density is, the longer the transportation time is, and the effective way for shortening the transportation time is to reduce the traffic flow density of the distribution path. The traffic flow density of the distribution path is significantly affected by branch traffic flow merging, and the larger the branch merging flow is, the larger the traffic flow density of the distribution path is, so that in order to effectively reduce the traffic flow density of the distribution path and thus shorten the distribution transportation time, an effective branch traffic flow merging limiting scheme needs to be rapidly formulated. The invention relates to a distribution path branch traffic flow limiting scheme, which is a scheme for limiting time for converging branch traffic flow of a distribution path under the current road traffic condition, so that the transportation time of the distribution path is as short as possible, and the limited branch traffic volume is as small as possible.
At present, in the research of the path problem of emergency material distribution vehicles, a mathematical model is established and solved by carrying out soft and hard time window punishment on transportation time and the like based on time window constraint of emergency materials at a disaster-affected point, so that a theoretically optimal distribution path scheme can be obtained; however, in an actual traffic network after disaster, the traffic conditions of distribution paths are complex and changeable, and the traffic volume is too large, so that the actual distribution time may not reach the optimal effect obtained by theoretical solution, and the time target of emergency rescue cannot be met; therefore, a set of traffic cooperative guarantee scheme is rapidly formulated, the branch for limiting the flow is scientifically and reasonably selected, the flow limiting time is controlled, the time requirement of material distribution is met to the maximum degree, the traffic influence caused by flow limiting is minimized, and the traffic cooperative guarantee scheme has an important reference value for emergency decision-making commanders.
Disclosure of Invention
The invention aims to provide a method for generating a branch flow limiting scheme of an emergency material distribution path, which provides a time limiting scheme of converging each branch into a traffic flow on the emergency material distribution path under the condition of minimally influencing urban traffic and provides decision reference for emergency management or commanders.
The technical scheme adopted by the invention is as follows: a method for generating a branch current limiting scheme of an emergency material distribution path comprises the following specific steps: a method for generating a branch flow limiting scheme of an emergency material distribution path is characterized by comprising the following steps of:
step 1: carrying out node and road section coding on the distribution path;
using the starting point of the distribution path as the starting node, using the end point of the distribution path as the end node, searching from the starting node to the end node along the distribution path, sequentially searching the intersection or ramp entrance which intersects with the distribution path and has the vehicle flow converged in as the intermediate node, and coding the node as PiI is 1,2,3, …, end, node PiAnd Pi+1The road between is coded as RSiI ═ 1,2,3, …, end-1; wherein, i ═ 1 represents the start node, i ═ end represents the end node;
step 2: acquiring the traffic state and flow information of each encoded intermediate node and road section on the distribution path;
obtaining current intermediate nodes P through traffic real-time monitoring and statisticsiVehicle flow CF merged into main road of distribution pathiI ═ 2,3, …, end-1; obtaining the RS of each current road sectioniOwn traffic RFiAnd traffic state Si，i＝1,2,3,…,end-1；Si∈[0,1]，Si1 represents a high density traffic state, Si0 represents a low density traffic state; the low-density traffic state is set when the traffic density does not exceed 35 vehicles/kilometer/lane, and the high-density traffic state is set when the traffic density exceeds 35 vehicles/kilometer/lane.
And step 3: obtaining each coding section RS on distribution pathiLength information L ofiNumber of lanes NiAnd rate limit VFi；
And 4, step 4: solving the current limiting time of each coding intermediate node and the transportation time of each coding section;
and 5: calculating the current limiting initial time of each coding intermediate node by taking the distribution initial time as a reference;
step 6: and generating a branch current limiting scheme of the distribution path.
The invention can rapidly make a set of traffic cooperative guarantee scheme, scientifically and reasonably select the branch for limiting the flow and control the flow limiting time, meets the time requirement of material distribution to the maximum extent, simultaneously minimizes the traffic influence generated by flow limiting, and has important reference value for emergency decision commanders.
Compared with the prior art, the invention has the beneficial effects that: the scheme provided by the invention can ensure that the traffic interference on non-emergency distribution lines is minimum when a branch current limiting scheme is adopted, and has great significance on post-disaster emergency response.
Drawings
FIG. 1 is a flow chart of an embodiment of the present invention;
fig. 2 is a schematic diagram of node and link coding according to an embodiment of the present invention.
Detailed Description
In order to facilitate understanding and implementation of the present invention for persons of ordinary skill in the art, the present invention is further described in detail with reference to the drawings and examples, it is to be understood that the implementation examples described herein are only for illustration and explanation of the present invention and are not to be construed as limiting the present invention.
Referring to fig. 1, the method for generating a branch flow limiting scheme of an emergency material distribution path provided by the invention includes the following steps:
step 1: carrying out node and road section coding on the distribution path;
in this embodiment, a starting point of a distribution route is used as a starting node, an end point of the distribution route is used as an end node, searching is performed from the starting node to the end node along the distribution route, intersections or ramp entrances intersecting the distribution route and into which traffic flows merge are sequentially retrieved as intermediate nodes, and the node code is PiI-1, 2,3, …,11, node PiAnd Pi+1Between the roadsAs a link code RSiI ═ 1,2,3, …, 10; the specific encoding is shown in fig. 2.
Step 2: acquiring the traffic state and flow information of each encoded intermediate node and road section on the distribution path;
obtaining current intermediate nodes P through traffic real-time monitoring and statisticsiVehicle flow CF merged into main road of distribution pathiI ═ 2,3, …, end-1; obtaining the RS of each current road sectioniOwn traffic RFiAnd traffic state Si，i＝1,2,3,…,end-1；Si∈[0,1]，Si1 represents a high density traffic state, Si0 represents a low density traffic state; the low-density traffic state is set when the traffic density does not exceed 35 vehicles/kilometer/lane, and the high-density traffic state is set when the traffic density exceeds 35 vehicles/kilometer/lane.
In this embodiment, the current intermediate nodes P are obtained through traffic real-time monitoring and statisticsi(i 2,3, …,9) traffic flow CF merging into the trunk of the distribution routei(i 2,3, …,10) obtaining current each road section RSi(i ═ 1,2, …,10) traffic RF of its owni(i ═ 1,2,3, …,10), and traffic state Si(i ═ 1,2,3, …, 10). The specific values obtained are as follows:
CF＝[0.3,0.3,0.3,0.3,0.6,0.6,0.3,0.6,0.3]
RF＝[0.58,0.42,1.30,1.32,1.15,1.53,0.81,1.49,0.77,0.58]
S＝[1,0,1,1,0,1,0,1,1,0]
and step 3: obtaining each coding section RS on distribution pathiLength information L ofiNumber of lanes NiAnd rate limit VFi；
In this embodiment, the RS of each encoded road segment on the distribution route is obtainediLength information L of (i ═ 1,2,3, …,10)i(i ═ 1,2,3, …,10), number of lanes Ni(i-1, 2,3, …,10) and a speed limit VFi(i ═ 1,2,3, …, 10). Specific values were obtained as follows:
L＝[39,131,605,493,4140,1760,6960,5700,4640,1320]
N＝[2,2,3,3,3,3,2,3,2,1]
VF＝[22.22,22.22,22.22,22.22,22.22,22.22,22.22,22.22,22.22,22.22]
and 4, step 4: solving the current limiting time of each coding intermediate node and the transportation time of each coding road section;
in this embodiment, the current limiting time of each coding intermediate node and the transportation time of each coding section are obtained by solving the branch current limiting mathematical programming model.
Calling a genetic algorithm to solve the following mathematical programming model:
decision variables: tau isi
An objective function:
and (3) about speed conditions:
In the formula (I), the compound is shown in the specification,
Ti＝Li/vi
ρi,m＝0.12Ni
in the formula, CFi(i ═ 2., 10) denotes the flow rate of the coded intermediate node merging into the distribution path trunk, unit: vehicle/second; tau isi(i ═ 2, 3.., 10) denotes the current limit time of each coded intermediate node, in units: second; RF (radio frequency)i(i ═ 1, 2.., 10) denotes the traffic flow rate of each coded link, in units: vehicle/second; t isi(i ═ 1, 2.., 10) denotes the transport of each coded sectionTime, unit: second; t iswUnit representing a predetermined delivery request time: second; l isi(i ═ 1, 2.., 10) denotes the length of each coded link, in units: rice; v. ofi(i ═ 1, 2.., 10) denotes the vehicle speed of each encoded link, in units: m/s; VF (variable frequency)i(i ═ 1, 2., 10) denotes the speed limit for each coded road segment, in units: m/s; n is a radical ofi(i ═ 1, 2.., 10) denotes the number of lanes of each coded link.
Solving to obtain the current limiting time of each coding intermediate node and the transportation time of each coding road section, wherein the results are shown in the following tables 1 and 2:
TABLE 1 Current limiting time of intermediate nodes
| Coding node | P2 | P3 | P4 | P5 | P6 | P7 | P8 | P9 | P10 |
| Current limiting duration-Second of | 10 | 6 | 31 | 30 | 103 | 16 | 223 | 89 | 746 |
TABLE 2 transit times for each coded section
| Coded road section | RS1 | RS2 | RS3 | RS4 | RS5 | RS6 | RS7 | RS8 | RS9 | RS10 |
| Transport time/second | 14 | 6 | 133 | 106 | 225 | 306 | 385 | 1036 | 1184 | 87 |
And 5: calculating the current limiting initial time of each coding intermediate node by taking the distribution initial time as a reference;
in this embodiment, the distribution start time is defined as the reference time toIf intermediate node P is encoded, 9:00AMiNot equal to 0(i ═ 2, 3.., end-1), then the intermediate node P isiThe current limiting start time of
Step 6: generating a branch current limiting scheme of the distribution path;
in this embodiment, the scheme includes the start time and the current limiting duration of the current limiting of each coded intermediate node, as shown in table 3 below, the specific current limiting mode may be performed by signal lamp adjustment control and public security checkpoint vehicle interception.
Table 3 delivery path branch current limiting scheme (reference time t)o＝9:00AM)
It should be understood that parts of the specification not set forth in detail are well within the prior art.
It should be understood that the above description of the preferred embodiments is given for clarity and not for any purpose of limitation, and that various changes, substitutions and alterations can be made herein without departing from the spirit and scope of the invention as defined by the appended claims.
Claims (3)
1. A method for generating a branch current limiting scheme of an emergency material distribution path is characterized by comprising the following steps:
step 1: carrying out node and road section coding on the distribution path;
using the starting point of the distribution path as the starting node, using the end point of the distribution path as the end node, searching from the starting node to the end node along the distribution path, sequentially searching the intersection or ramp entrance which intersects with the distribution path and has the vehicle flow converged in as the intermediate node, and coding the node as PiI is 1,2,3, …, end, node PiAnd Pi+1The road between is coded as RSiI ═ 1,2,3, …, end-1; wherein, i ═ 1 represents the start node, i ═ end represents the end node;
step 2: acquiring the traffic state and flow information of each encoded intermediate node and road section on the distribution path;
obtaining current intermediate nodes P through traffic real-time monitoring and statisticsiVehicle flow CF merged into main road of distribution pathiI ═ 2,3, …, end-1; obtaining the RS of each current road sectioniOwn traffic RFiAnd traffic state Si，i＝1,2,3,…,end-1；Si∈[0,1]，Si1 represents a high density traffic state, Si0 represents a low density traffic state; when the traffic density does not exceed a preset value, the low-density traffic state is set, and when the traffic density exceeds the preset value, the high-density traffic state is set;
and step 3: obtaining each coding road section on distribution pathRSiLength information L ofiNumber of lanes NiAnd rate limit VFi；
And 4, step 4: solving the current limiting time of each coding intermediate node and the transportation time of each coding section;
constructing a branch current limiting mathematical programming model, and solving the current limiting time of each coding intermediate node and the transportation time of each coding road section;
wherein, the mathematical programming model of the branch current limiting is as follows:
Ti＝Li/vi
ρi,m＝0.12Ni
in the formula, CFiAnd (3) expressing the flow of the code intermediate node converging into the trunk of the distribution path, the unit is: vehicle/second, i ═ 2,3, …, end-1; tau isiThe current limiting time of each coding intermediate node is represented by the unit: second, i ═ 2,3, …, end-1; RF (radio frequency)iThe unit of the traffic flow representing each coded link: vehicle/second, i ═ 1,2,3, …, end-1; t isiThe transport time, unit, representing each coded section: second, i ═ 1,2,3, …, end-1; t iswUnit representing a predetermined delivery request time: second; l isiLength of each encoded link, unit: rice, i ═ 1,2,3, …, end-1; v. ofiVehicle speed, unit, representing each encoded link: m/s, i ═ 1,2,3, …, end-1; VF (variable frequency)iSpeed limit, unit, representing each coded link: m/s, i ═ 1,2,3, …, end-1; n is a radical ofiIndicates the number of lanes of each coded link, i is 1,2,3, …, end-1;
calling a genetic algorithm to solve a branch current limiting mathematical programming model to obtain the current limiting time of each coding intermediate node and the transportation time of each coding section, wherein each intermediate node P2、P3、…、Pend-1Respectively, is tau2、τ3、…、τend-1The unit: m/s; each coded section RS1、RS2、…、RSend-1Transport time T1、T2、…、Tend-1The unit: m/s;
and 5: calculating the current limiting initial time of each coding intermediate node by taking the distribution initial time as a reference;
step 6: and generating a branch current limiting scheme of the distribution path.
2. The emergency material distribution path branch flow limiting scheme generating method of claim 1, wherein: the specific implementation process of step 5 is to define the distribution starting time as the reference time toIf the intermediate node P is codediNot equal to 0, i ═ 1,2,3, …, end-1, then the intermediate node PiThe current limiting start time of
3. The emergency material distribution path branch flow limiting scheme generating method of claim 1, wherein: the concrete realization process of the step 5 is that the scheme comprises each coding intermediate node P2、P3、…、Pend-1Starting time t of current limitingo+T1-τ2、to+T1+T2-τ3、…、
And duration of current limit τ2、τ3、…、τend-1The unit: m/s.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910368875.XA CN110175799B (en) | 2019-05-05 | 2019-05-05 | Emergency material distribution path branch current limiting scheme generation method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910368875.XA CN110175799B (en) | 2019-05-05 | 2019-05-05 | Emergency material distribution path branch current limiting scheme generation method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110175799A CN110175799A (en) | 2019-08-27 |
| CN110175799B true CN110175799B (en) | 2022-06-07 |
Family
ID=67690564
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910368875.XA Active CN110175799B (en) | 2019-05-05 | 2019-05-05 | Emergency material distribution path branch current limiting scheme generation method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110175799B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103854072A (en) * | 2014-03-17 | 2014-06-11 | 湖南工学院 | Processing method and system for path selection |
| CN106919998A (en) * | 2015-12-28 | 2017-07-04 | 航天信息股份有限公司 | A kind of physical distribution model and method based on AOE networks |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB201100403D0 (en) * | 2011-01-11 | 2011-02-23 | Totom Dev Germany Gmbh | An efficient location referencing method |
-
2019
- 2019-05-05 CN CN201910368875.XA patent/CN110175799B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103854072A (en) * | 2014-03-17 | 2014-06-11 | 湖南工学院 | Processing method and system for path selection |
| CN106919998A (en) * | 2015-12-28 | 2017-07-04 | 航天信息股份有限公司 | A kind of physical distribution model and method based on AOE networks |
Non-Patent Citations (3)
| Title |
|---|
| 于悦.重大灾害条件下城市应急交通诱导系统关键技术研究.《工程科技Ⅱ辑》.2010,C034-12. * |
| 宋厚冰.有时间窗约束的车辆路径问题的改进遗传算法.《交通与计算机》.2003,第21卷(第4期),第25-27页. * |
| 王挺.震后救援物质资源配送路径规划研究.《计算机仿真》.2018,第35卷(第1期),第321-326页. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110175799A (en) | 2019-08-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Nikoo et al. | Emergency transportation network design problem: Identification and evaluation of disaster response routes | |
| CN106910018A (en) | One kind rescue resource regulating method and system | |
| CN102402720A (en) | Method for quickly generating emergency plan of sudden highway traffic accident | |
| CN112309119B (en) | Urban traffic system capacity analysis optimization method | |
| Zhao et al. | Evacuation Network Optimization Model with Lane‐Based Reversal and Routing | |
| CN110175799B (en) | Emergency material distribution path branch current limiting scheme generation method | |
| CN111985067A (en) | Multi-strategy combined evacuation network planning method | |
| CN106897791B (en) | Method for constructing public transport subway composite network model | |
| CN105654186A (en) | Indoor and outdoor integrated planning method used for emergency rescue optimal path calculation | |
| Ng et al. | Sharp probability inequalities for reliable evacuation planning | |
| CN106448134B (en) | The optimization method and system of ground temporary traffic control program during a kind of emergency | |
| Haghpanah et al. | Optimal shelter location-allocation during evacuation with uncertainties: a scenario-based approach | |
| Hoong et al. | Road traffic prediction using Bayesian networks | |
| Cernicky et al. | The application of telematic technologies in Slovakia–the possibility of improving road safety in the Slovak Republic | |
| CN114897398B (en) | Quick formulation method of vehicle rescue scheme under disaster | |
| CN103077312A (en) | Automatic judgment method of construction time sequence of urban rail transit line | |
| Chen et al. | Post-earthquake road unblocked reliability estimation based on an analysis of randomicity of traffic demands and road capacities | |
| Li et al. | Routing optimization of the emergency supplies distribution vehicles using NSGA-II algorithm: a case study | |
| Azimi et al. | Multi-agent simulation of allocating and routing ambulances under condition of street blockage after natural disaster | |
| CN107368919A (en) | Paths planning method is evacuated in public transport based on reversible track and intersection conflict resolving | |
| CN110443403A (en) | A kind of optimization system and method for solving of urban transportation Microcirculatory failure | |
| Wang et al. | Shuttle Bus Line Planning in Response to Unexpected Disruption in Urban Rail Transit Networks | |
| CN113759959B (en) | Unmanned aerial vehicle path planning method and device for emergency material distribution | |
| Marbukh | Loss circuit switched communication network-performance analysis and dynamic routing | |
| Islam et al. | Simulation-assisted optimization for large-scale evacuation planning with congestion-dependent delays |
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 |