CN110175799A - A kind of emergency materials Distribution path branch current limliting scheme generation method - Google Patents

A kind of emergency materials Distribution path branch current limliting scheme generation method Download PDF

Info

Publication number
CN110175799A
CN110175799A CN201910368875.XA CN201910368875A CN110175799A CN 110175799 A CN110175799 A CN 110175799A CN 201910368875 A CN201910368875 A CN 201910368875A CN 110175799 A CN110175799 A CN 110175799A
Authority
CN
China
Prior art keywords
current limliting
time
distribution path
section
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.)
Granted
Application number
CN201910368875.XA
Other languages
Chinese (zh)
Other versions
CN110175799B (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.)
Wuhan University of Technology WUT
Original Assignee
Wuhan University of Technology WUT
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 Wuhan University of Technology WUT filed Critical Wuhan University of Technology WUT
Priority to CN201910368875.XA priority Critical patent/CN110175799B/en
Publication of CN110175799A publication Critical patent/CN110175799A/en
Application granted granted Critical
Publication of CN110175799B publication Critical patent/CN110175799B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06NCOMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00Computing arrangements based on biological models
    • G06N3/12Computing arrangements based on biological models using genetic models
    • G06N3/126Evolutionary algorithms, e.g. genetic algorithms or genetic programming
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/08Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083Shipping
    • G06Q10/0835Relationships between shipper or supplier and carriers
    • G06Q10/08355Routing methods

Abstract

The invention discloses a kind of emergency materials Distribution path branch current limliting scheme generation method, including node and section coding are carried out to Distribution path, obtain each intermediate node and section encoded on Distribution path traffic behavior and flow information, obtain encoded each section attribute information on Distribution path, solve the current limliting time of each coding intermediate node and the haulage time in each coding section, calculate on the basis of dispensing initial time each coding intermediate node current limliting initial time, generate the branch current limliting scheme of Distribution path;The a set of traffic collaborative guarantee scheme of energy rapid development of the present invention, it scientifically and rationally selects the branch of current limliting and controls the time of current limliting, utmostly meet the time requirement of materials measurement, while the traffic impact for generating current limliting is minimum, emergency decision commanding personnel are worth with important references.

Description

A kind of emergency materials Distribution path branch current limliting scheme generation method
Technical field
The present invention relates to computer application technology and traffic science technical field more particularly to a kind of emergency management and rescue objects Provide the branch current limliting traffic cooperative approach rapid generation of Distribution path in transportational process.
Background technique
The unconventional emergency event Shi Youfa such as our each department earthquake, flood, mud-rock flow, hailstorm, accidents in recent years It is raw, serious influence is produced on the normal life of people and causes great casualties, economic loss.In order to maximum The casualties of reduction accident reduces public property loss, and disaster-stricken point is within the short time after disaster generation to emergency materials Can demand, which obtain meeting, becomes a vital ring, how to be dispensed into emergency materials in defined time window disaster-stricken Point meets the needs of disaster-stricken point, is the key that emergency management and rescue and disaster relief mitigation after calamity.
The haulage time of emergency materials Distribution path is significant by traffic flow Effects of Density, and traffic current density is bigger, when transport Between it is longer, reduce Distribution path traffic current density be shorten haulage time effective way.And the traffic flow of Distribution path is close Degree will receive significantly affecting for branch traffic flow remittance again, and branch remittance flow is bigger, and the traffic current density of Distribution path also can It is bigger, therefore, in order to which the traffic current density of Distribution path is effectively reduced so as to shorten dispatching haulage time, rapid development is needed to have The branch traffic flow of effect imports restricted version.Distribution path branch traffic current limliting scheme according to the present invention, refers to current Under road traffic condition, the scheme for carrying out time restriction is imported to the branch traffic flow of Distribution path, makes the transport of Distribution path Time is short as far as possible, while keeping the restricted branch volume of traffic few as far as possible.
Currently, the time window based on disaster-stricken emergency materials is about in the research of emergency materials distribution vehicle routing problem Beam can be obtained theoretically most by carrying out the modes founding mathematical models such as soft or hard time window punishment to haulage time and solving Excellent Distribution path scheme;However, the passage situation of Distribution path is complicated and changeable, traffic in actual traffic road network after calamity Amount will appear excessive situation, cause practical distribution time that may be unable to reach the theoretical optimal effectiveness solved, thus can not Meet the time target of emergency management and rescue;Therefore, a set of traffic collaborative guarantee scheme of rapid development scientifically and rationally selects current limliting The traffic impact for branch and the time for controlling current limliting, utmostly meeting the time requirement of materials measurement, while generating current limliting Minimum is worth emergency decision commanding personnel with important references.
Summary of the invention
The object of the present invention is to provide a kind of emergency materials Distribution path branch current limliting scheme generation methods, in minimum limit Under conditions of influencing urban transportation, the time restriction scheme that each branch on emergency materials Distribution path imports wagon flow is provided, to answer Anxious management or commanding provide decision references.
The technical scheme adopted by the invention is that: a kind of emergency materials Distribution path branch current limliting scheme generation method, packet Include following specific steps: a kind of emergency materials Distribution path branch current limliting scheme generation method, which is characterized in that including following step It is rapid:
Step 1: node being carried out to Distribution path and section encodes;
Using Distribution path starting point as start node, using Distribution path terminal as endpoint node, since start node, edge is matched Path terminad node searching is sent, successively retrieval intersects with Distribution path and in the crossing for having wagon flow to import or the conduct of ring road entrance Intermediate node, nodes encoding Pi, i=1,2,3 ..., end, node PiAnd Pi+1Between road be encoded to RS as sectioni, i= 1,2,3,…,end-1;Wherein, i=1 represents start node, and i=end represents endpoint node;
Step 2: obtaining the traffic behavior and flow information of each intermediate node and section encoded on Distribution path;
By traffic real-time monitoring and statistics, current each intermediate node P is obtainediImport the vehicle flowrate on Distribution path main line CFi, i=2,3 ..., end-1;Obtain current each section RSiThe vehicle flowrate RF of itselfiWith traffic behavior Si, i=1,2,3 ..., end-1;Si∈ [0,1], Si=1 indicates high density wagon flow state, Si=0 indicates low-density wagon flow state;Wherein, when wagon flow is close Degree is low-density wagon flow state when being no more than 35/km/lane, is highly dense when vehicle density is more than 35/km/lane Spend wagon flow state.
Step 3: obtaining and respectively encode section RS on Distribution pathiLength information Li, number of track-lines NiWith speed limit VFi
Step 4: solving the current limliting time of each coding intermediate node and the haulage time in each coding section;
Step 5: on the basis of dispensing initial time, calculating the current limliting initial time of each coding intermediate node;
Step 6: generating the branch current limliting scheme of Distribution path.
The a set of traffic collaborative guarantee scheme of energy rapid development of the present invention scientifically and rationally selects the branch of current limliting and controls limit The time of stream, utmostly meet the time requirement of materials measurement, while the traffic impact for generating current limliting is minimum, determines to emergency Plan commanding is worth with important references.
Compared with the existing technology, the beneficial effects of the present invention are: can provide theoretical path scheme from level of practice can The traffic collaborative guarantee scheme of operability can reduce existing theoretical method to the maximum extent and run shape to practical Dynamic Traffic Flow State assessment is insufficient and the distribution time deviation that causes to meet an urgent need, while scheme proposed by the present invention can guarantee taking branch current limliting side It, can be significant to emergency response after calamity to the Coherent traffic noise minimum of non-emergency dispatching route when case.
Detailed description of the invention
Fig. 1 is the flow chart of the embodiment of the present invention;
Fig. 2 is the node and section coding schematic diagram of the embodiment of the present invention.
Specific embodiment
Understand for the ease of those of ordinary skill in the art and implement the present invention, with reference to the accompanying drawings and embodiments to this hair It is bright to be described in further detail, it should be understood that implementation example described herein is merely to illustrate and explain the present invention, not For limiting the present invention.
Referring to Fig.1, a kind of emergency materials Distribution path branch current limliting scheme generation method provided by the invention, including it is following Step:
Step 1: node being carried out to Distribution path and section encodes;
In the present embodiment, using Distribution path starting point as start node, using Distribution path terminal as endpoint node, from starting section Point starts, and along Distribution path terminad node searching, successively retrieval intersects with Distribution path and has crossing or the circle of wagon flow remittance Road entrance is as intermediate node, nodes encoding Pi, i=1,2,3 ..., 11, node PiAnd Pi+1Between road as section compile Code is RSi, i=1,2,3 ..., 10;Specific coding is as shown in Figure 2.
Step 2: obtaining the traffic behavior and flow information of each intermediate node and section encoded on Distribution path;
By traffic real-time monitoring and statistics, current each intermediate node P is obtainediImport the vehicle flowrate on Distribution path main line CFi, i=2,3 ..., end-1;Obtain current each section RSiThe vehicle flowrate RF of itselfiWith traffic behavior Si, i=1,2,3 ..., end-1;Si∈ [0,1], Si=1 indicates high density wagon flow state, Si=0 indicates low-density wagon flow state;Wherein, when wagon flow is close Degree is low-density wagon flow state when being no more than 35/km/lane, is highly dense when vehicle density is more than 35/km/lane Spend wagon flow state.
In the present embodiment, by traffic real-time monitoring and statistics, current each intermediate node P is obtainedi(i=2,3 ..., 9) it converges Enter the vehicle flowrate CF on Distribution path main linei(i=2,3 ..., 10) obtain current each section RSi(i=1,2 ..., 10) vehicle itself Flow RFi(i=1,2,3 ..., 10) and traffic behavior Si(i=1,2,3 ..., 10).The specific value of acquisition is 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]
Step 3: obtaining and respectively encode section RS on Distribution pathiLength information Li, number of track-lines NiWith speed limit VFi
In the present embodiment, obtains and respectively encode section RS on Distribution pathiThe length information L of (i=1,2,3 ..., 10)i(i= 1,2,3 ..., 10), number of track-lines Ni(i=1,2,3 ..., 10) and speed limit VFi(i=1,2,3 ..., 10).Obtain specific value such as Under:
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]
Step 4: solving the current limliting time of each coding intermediate node and the haulage time in each coding section;
In the present embodiment, by solving branch current limliting mathematical programming model, the current limliting time of each coding intermediate node is obtained With the haulage time in each coding section.
Genetic algorithm is called, following mathematical programming model is solved:
Decision variable: τi
Objective function:
About fast condition:
Indicate Distribution path transport total time no more than the requirement of defined distribution time.
Indicate that the current limliting time of intermediate node is no more than distribution vehicle and travels to the total time of the node.
In formula,
Ti=Li/vi
ρi,m=0.12Ni
In formula, CFi(i=2 ..., 10) presentation code intermediate node imports Distribution path main line flow, unit :/second; τi(i=2,3 ..., 10) indicate it is each coding intermediate node the current limliting time, unit: second;RFi(i=1,2 ..., 10) indicate each Encode the vehicle flowrate in section, unit :/second;Ti(i=1,2 ..., 10) indicate it is each coding section haulage time, unit: Second;TwSeeking time is wanted in dispatching as defined in indicating, unit: second;Li(10) i=1,2 ..., indicates the length in each coding section, single Position: rice;vi(i=1,2 ..., 10) indicate it is each coding section speed, unit: meter per second;VFi(i=1,2 ..., 10) it indicates The speed limit in each coding section, unit: meter per second;Ni(i=1,2 ..., 10) indicate each lane quantity for encoding section.
The current limliting time for obtaining each coding intermediate node and each coding section haulage time are solved, table 1 is as a result expressed as follows With table 2:
The current limliting time of each intermediate node of table 1
Coding nodes P2 P3 P4 P5 P6 P7 P8 P9 P10
Current limliting duration/second 10 6 31 30 103 16 223 89 746
Table 2 respectively encodes the haulage time in section
Encode section RS1 RS2 RS3 RS4 RS5 RS6 RS7 RS8 RS9 RS10
Haulage time/second 14 6 133 106 225 306 385 1036 1184 87
Step 5: on the basis of dispensing initial time, calculating the current limliting initial time of each coding intermediate node;
In the present embodiment, definition dispatching initial time is benchmark time to=9:00AM, if coding intermediate node Pi≠0(i =2,3 ..., end-1), then intermediate node PiCurrent limliting initial time be
Step 6: generating the branch current limliting scheme of Distribution path;
In the present embodiment, scheme includes the initial time and current limliting duration of each coding intermediate node current limliting, such as the following table 3 institute Show, the mode of specific current limliting can take signal lamp to adjust the mode that control is intercepted with public security stuck point vehicle and carry out.
3 Distribution path branch current limliting scheme (fiducial time t of tableo=9:00AM)
It should be understood that the part that this specification does not elaborate belongs to the prior art.
It should be understood that the above-mentioned description for preferred embodiment is more detailed, can not therefore be considered to this The limitation of invention patent protection range, those skilled in the art under the inspiration of the present invention, are not departing from power of the present invention Benefit requires to make replacement or deformation under protected ambit, fall within the scope of protection of the present invention, this hair It is bright range is claimed to be determined by the appended claims.

Claims (4)

1. a kind of emergency materials Distribution path branch current limliting scheme generation method, which comprises the following steps:
Step 1: node being carried out to Distribution path and section encodes;
Using Distribution path starting point as start node, using Distribution path terminal as endpoint node, since start node, along dispatching road Radial extremity node searching, successively retrieval is intersected with Distribution path and the crossing for having wagon flow to import or ring road entrance are as middle node Point, nodes encoding Pi, i=1,2,3 ..., end, node PiAnd Pi+1Between road be encoded to RS as sectioni, i=1,2, 3,…,end-1;Wherein, i=1 represents start node, and i=end represents endpoint node;
Step 2: obtaining the traffic behavior and flow information of each intermediate node and section encoded on Distribution path;
By traffic real-time monitoring and statistics, current each intermediate node P is obtainediImport the vehicle flowrate CF on Distribution path main linei, i= 2,3,…,end-1;Obtain current each section RSiThe vehicle flowrate RF of itselfiWith traffic behavior Si, i=1,2,3 ..., end-1;Si ∈ [0,1], Si=1 indicates high density wagon flow state, Si=0 indicates low-density wagon flow state;Wherein when vehicle density is no more than in advance It is high density wagon flow state when vehicle density is more than preset value when value if being low-density wagon flow state;
Step 3: obtaining and respectively encode section RS on Distribution pathiLength information Li, number of track-lines NiWith speed limit VFi
Step 4: solving the current limliting time of each coding intermediate node and the haulage time in each coding section;
Step 5: on the basis of dispensing initial time, calculating the current limliting initial time of each coding intermediate node;
Step 6: generating the branch current limliting scheme of Distribution path.
2. emergency materials Distribution path branch current limliting scheme generation method according to claim 1, it is characterised in that: step 4 specific implementation process is to construct branch current limliting mathematical programming model, solves each current limliting time for encoding intermediate node and each volume The haulage time in code section;
Wherein, the mathematical programming model of the branch current limliting are as follows:
Indicate Distribution path transport total time no more than the requirement of defined distribution time;
Indicate that the current limliting time of intermediate node is no more than distribution vehicle and travels to the total time of the node;
Ti=Li/vi
ρi,m=0.12Ni
In formula, CFiPresentation code intermediate node imports Distribution path main line flow, unit :/second, i=2,3 ..., end-1;τi Indicate the current limliting time of each coding intermediate node, unit: second, i=2,3 ..., end-1;RFiIndicate the wagon flow in each coding section Amount, unit :/second, i=1,2,3 ..., end-1;TiIndicate the haulage time in each coding section, unit: the second, i=1,2, 3,…,end-1;TwSeeking time is wanted in dispatching as defined in indicating, unit: second;LiIndicate the length in each coding section, unit: rice, i= 1,2,3,…,end-1;viIndicate the speed in each coding section, unit: meter per second, i=1,2,3 ..., end-1;VFiIndicate each volume The speed limit in code section, unit: meter per second, i=1,2,3 ..., end-1;NiIndicate it is each coding section lane quantity, i=1,2, 3,…,end-1;
It calls genetic algorithm to solve branch current limliting mathematical programming model, obtains each current limliting time for encoding intermediate node and each coding Section haulage time, wherein each intermediate node P2、P3、…、Pend-1The current limliting time be respectively τ2、τ3、…、τend-1, unit: Meter per second;Each coding section RS1、RS2、…、RSend-1Haulage time T1、T2、…、Tend-1, unit: meter per second.
3. emergency materials Distribution path branch current limliting scheme generation method according to claim 2, it is characterised in that: step 5 specific implementation process is that definition dispatching initial time is benchmark time toIf encoding intermediate node Pi≠ 0, i=1,2, 3 ..., end-1, then intermediate node PiCurrent limliting initial time be
4. emergency materials Distribution path branch current limliting scheme generation method according to claim 2, it is characterised in that: step 5 specific implementation process is that scheme includes each coding intermediate node P2、P3、…、Pend-1The initial time t of current limlitingo+T12、to+ T1+T23、…、With current limliting duration τ2、τ3、…、τend-1, unit: meter per second.
CN201910368875.XA 2019-05-05 2019-05-05 Emergency material distribution path branch current limiting scheme generation method Active CN110175799B (en)

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 true CN110175799A (en) 2019-08-27
CN110175799B 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 (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130294702A1 (en) * 2011-01-11 2013-11-07 Sven Baselau Efficient location referencing method
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

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130294702A1 (en) * 2011-01-11 2013-11-07 Sven Baselau Efficient location referencing method
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)

* Cited by examiner, † Cited by third party
Title
于悦: "重大灾害条件下城市应急交通诱导系统关键技术研究", 《工程科技Ⅱ辑》, 31 August 2010 (2010-08-31) *
宋厚冰: "有时间窗约束的车辆路径问题的改进遗传算法", 《交通与计算机》, vol. 21, no. 4, 31 August 2003 (2003-08-31) *
王挺: "震后救援物质资源配送路径规划研究", 《计算机仿真》, vol. 35, no. 1, 31 January 2018 (2018-01-31) *

Also Published As

Publication number Publication date
CN110175799B (en) 2022-06-07

Similar Documents

Publication Publication Date Title
Zhu et al. Short‐term traffic flow prediction with linear conditional Gaussian Bayesian network
CN103854072B (en) Processing method and system for path selection
CN106557855A (en) A kind of smart travel passenger flow total management system
CN108520353B (en) Method for identifying safety risk points of integrated transportation network
CN109035765B (en) Traffic flow disposal event decision method
Madireddy et al. An agent based model for evacuation traffic management
Zhao et al. Evacuation network optimization model with lane-based reversal and routing
Wang et al. Modeling and optimization of collaborative passenger control in urban rail stations under mass passenger flow
CN106384022B (en) Travel behaviour prediction technique and device
CN105809960B (en) A kind of urban transportation emergency resources layout method and device
CN111080016B (en) Subway station passenger flow management and control method and device based on node control
CN106503832A (en) Unmanned someone's cooperative information distribution transmission optimization method and system
Shen et al. Timetable design for minimizing passenger travel time and congestion for a single metro line
CN110175799A (en) A kind of emergency materials Distribution path branch current limliting scheme generation method
CN106448134A (en) Emergency period ground temporary traffic control scheme optimization method and system
Islam et al. Incorporating fairness in large-scale evacuation planning
CN111985067A (en) Multi-strategy combined evacuation network planning method
CN103426294B (en) A kind of division methods based on the other multi-layer Fuzzy of emergency traffic flow priority
CN113867391B (en) Unmanned aerial vehicle low-altitude safety early warning and monitoring method and system based on digital twinning
Limongelli et al. The value of visual inspections for emergency management of bridges under seismic hazard
CN110232237B (en) Traffic basic diagram-based evacuation traffic flow distribution method
Zeng et al. A multistage multiobjective model for emergency evacuation considering ATIS
CN106803148B (en) A kind of data safety management system applied to smart city
Sen et al. Optimized road network emergency restoration scheduling for relief distribution
Chen et al. Post-earthquake road unblocked reliability estimation based on an analysis of randomicity of traffic demands and road capacities

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