CN103971514B - Routing resource is sent behind a kind of emergency tender - Google Patents
Routing resource is sent behind a kind of emergency tender Download PDFInfo
- Publication number
- CN103971514B CN103971514B CN201410055542.9A CN201410055542A CN103971514B CN 103971514 B CN103971514 B CN 103971514B CN 201410055542 A CN201410055542 A CN 201410055542A CN 103971514 B CN103971514 B CN 103971514B
- Authority
- CN
- China
- Prior art keywords
- aid centre
- aid
- patient
- emergency tender
- centre
- 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
- 238000000034 method Methods 0.000 claims description 19
- 230000037361 pathway Effects 0.000 claims description 3
- 230000001225 therapeutic effect Effects 0.000 description 5
- 238000007405 data analysis Methods 0.000 description 2
- 238000011156 evaluation Methods 0.000 description 2
- 238000004891 communication Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000013075 data extraction Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 239000013589 supplement Substances 0.000 description 1
- 230000004083 survival effect Effects 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Landscapes
- Traffic Control Systems (AREA)
Abstract
Send routing resource after the invention discloses a kind of emergency tender, it comprises the following steps: S001, acquisition GIS geography information, road network information and real time traffic data; The initial value of S002, setting variables L EssT.LTssT.LTi>i</iGreatT.Gre aT.GT is 1; S003, calculating emergency tender are from patient location to the shortest working time of a <i>i</iGreatT.Gr eaT.GT first-aid centre; S004, calculating patient are sent to a <i>i</iGreatT.Gr eaT.GT first-aid centre later average latency; S005, <i>i</iGreatT.Gr eaT.GT increases 1, repeats step S003 and step S004, until travel through all first-aid centres; S006, select the shortest working time and the minimum first-aid centre of average latency sum to be best first-aid centre, patient is transported to best first-aid centre according to the path that the shortest working time is corresponding by emergency tender.This programme solves traditional emergency tender routing algorithm to the deadness of medical treatment, realizes the maximization of first-aid room resource utilization.The present invention is applicable to the situation that the more wounded and first-aid centre need to carry out coordinated scheduling.
Description
Technical field
The present invention relates to a kind of medical aid field, especially relate to a kind of occur fairly large accident, the wounded more time to the method sending routing behind emergency tender.
Background technology
Along with Chinese Urbanization degree improves constantly, urban population is on the increase, and medical services particularly emergency medical services ability are more and more challenged.And in emergency medical services, emergency tender is emergency medical services important carrier, bears transporting medical personnel and to reach the spot and by the function of patient transportation to suitable first-aid centre.Traffic conditions particularly complicated in big city in city and increasing emergency ward crowded state all propose higher demand to emergency tender routing.
Existing technical method is all be concerned about how to allow emergency tender transfer to another place shortest path or the most unobstructed algorithm research from the three unities, how this allows a vehicle rapidly move to the problem of B point from A point if only solving physically, do not solve emergency tender as transporting the problem from " door is to needle tubing " realized required for patient.The terminal of medical services before a kind of vehicles Ye Shi institute is not only on emergency tender, also comprise the ability of medical resource load in adjustment certain limit simultaneously, if the first-selected destination on emergency tender can not effective admitted patient, even if so patient just must be transferred to other first-aid centres, even if use path, existing emergency tender Algorithms of Selecting still can cause the delay on Case treatment opportunity like this, reduce emergency medical quality.
State Intellectual Property Office of the People's Republic of China discloses on October 02nd, 2013 patent documentation that application publication number is CN103337162A, title is that city emergency rescue passage is planned and dynamic scheduling system in real time, when after generation accident, this system can according to event type and grade, dynamic dispatching emergency management and rescue unit, the escape truck dynamic programming module of simultaneity factor cooks up the escape truck based on real-time road condition information in time, guarantees that the emergency management and rescue unit shortest time arrives incident point.Control Room host computer carries out data communication with short message mode and caution light sign, reaches Dynamic Establishing and to meet an urgent need the object of designated lane.But this scheme still only considered the cooperation control between a single point to a single point, when occurring that the wounded are more, when needing to be sent to different first-aid centres respectively, just suitable allotment arrangement cannot be carried out.
Summary of the invention
The present invention mainly solves and is not suitable for the technical matters coordinating, distribute best transport path to the more wounded and multiple first-aid centre existing for prior art, provide a kind of based on First Aid Ability prediction, consider first-aid centre's situation and road conditions simultaneously, the more wounded can be reasonably allocated to the emergency tender of different first-aid centre after send routing resource.
The present invention is directed to that above-mentioned technical matters mainly solved by following technical proposals: send routing resource behind a kind of emergency tender, comprise the following steps:
S001, acquisition GIS geography information, road network information and real time traffic data;
The initial value of S002, setting variable i is 1;
S003, calculating emergency tender are from patient location to the shortest running time T of i-th first-aid centre
travel_to_i;
S004, calculating patient are sent to the later average latency W of i-th first-aid centre
qi;
S005, i increase 1, repeat step S003 and step S004, until travel through all first-aid centres;
S006, select the shortest working time and the minimum first-aid centre of average latency sum to be best first-aid centre, patient is transported to best first-aid centre according to the path that the shortest working time is corresponding by emergency tender.
As preferably, in described step S004, the average latency is determined by following formula: W
qi=L
qi/ λ; L
qifor average queuing when patient arrives i-th first-aid centre is long, λ is the patient's number arriving i-th first-aid centre in the unit time.
As preferably, average queuing when described patient arrives i-th first-aid centre is long to be determined by following formula:
L
qi=P
i·ρ
s/(1-ρ
s)
ρ
s=ρ
i/S
i=λ/S
i·μ
i
P
ifor needing the probability waited for when patient arrives i-th first-aid centre, S
ibe the service group quantity of i-th first-aid centre, ρ
ibe the first aid load of i-th first-aid centre, μ
iit is patient's number that i-th first-aid centre processes within the unit interval.ρ
sfor intermediate quantity, can be understood as the load of single service group in first-aid centre.
As preferably, when patient arrives i-th first-aid centre, need the probability P waited for
idetermined by following formula:
N is number of patients.
As preferably, service group quantity S
iit is the smaller value of seeing and treating patients in doctor's quantity and berth quantity two values of i-th first-aid centre; Patient's number μ that i-th first-aid centre processes within the unit interval
idetermined by following formula:
μ is patient's number of process in each doctor's unit interval of seeing and treating patients.
As preferably, the shortest running time T
travel_to_idetermined by following formula
V
kfor the current capacity in kth section path, c
kfor the traffic capacity in kth section path, t
kfor the time of vehicle during kth section free pathway by needing, N is the path hop count of process required for from patient location to i-th first-aid centre, α and β is empirical parameter.Current capacity and the traffic capacity are all obtained from traffic department by step S001.The transit time needed time unimpeded obtains according to the length computation in average speed and this section of path.N is obtained by the map in system.
As preferably, α is 4.0, β is 0.15.
This method can directly be used on existing emergency tender commander's administrating system, also can be run by the system that the server construction of wireless network, master server and each first-aid centre is new.System is by carrying out data extraction from region Nei Ge first-aid centre, obtain the True Data of first-aid centre admitted patient, and according to the evaluation index of patient's number λ of arrival in history first aid data analysis first-aid centre's unit interval and patient's number μ of process in each doctor's unit interval of seeing and treating patients as first-aid centre's emergency capability.And regular repetition said process upgrade each evaluation index, ensure the real-time grasp to first-aid centre's emergency capability.The berth quantity of each first-aid centre is generally fixed value, and registration also is regularly carried out upgrading in systems in which.Doctor's quantity of seeing and treating patients of each first-aid centre is determined by watch bill and Time Attendance Device, the participation having emergency personnel under emergency case also real-time update in system.
When there is first aid event, emergency tender goes to first aid place, the patient utilizing algorithm of the present invention to calculate different first-aid centre before sending after first aid place is by patient expects therapeutic time, and reach the shortest path of different first-aid centre, then directly provide patient and expect that the shortest Hou Song path, emergency tender of therapeutic time is selected for emergency tender human pilot.
The substantial effect that the present invention brings is, medical first aid history first aid data are utilized to predict its First Aid Ability, adopt patient's queuing time for consultation as target of prediction, and send the time to combine after being expected with emergency tender by patient's queuing time for consultation, as the therapeutic time of patient's expection, and choose the path on emergency tender according to the number of therapeutic time, thus solve traditional emergency tender routing algorithm in itself to the deadness of medical treatment; And utilize queuing theory can be optimized routing algorithm, thus realize the maximization of first-aid room resource utilization.
Accompanying drawing explanation
Fig. 1 is a kind of process flow diagram of the present invention.
Embodiment
Below by embodiment, and by reference to the accompanying drawings, technical scheme of the present invention is described in further detail.
Embodiment: send routing resource behind a kind of emergency tender of the present embodiment, operate in emergency tender command deployment system, as shown in Figure 1, method comprises the following steps:
S001, acquisition GIS geography information, road network information and real time traffic data;
The initial value of S002, setting variable i is 1;
S003, calculating emergency tender are from patient location to the shortest running time T of i-th first-aid centre
travel_to_i;
S004, calculating patient are sent to the later average latency W of i-th first-aid centre
qi;
S005, i increase 1, repeat step S003 and step S004, until travel through all first-aid centres;
S006, select the shortest working time and the minimum first-aid centre of average latency sum to be best first-aid centre, patient is transported to best first-aid centre according to the path that the shortest working time is corresponding by emergency tender.
In step S004, the average latency is determined by following formula: W
qi=L
qi/ λ; L
qifor average queuing when patient arrives i-th first-aid centre is long, λ is the patient's number arriving i-th first-aid centre in the unit time.
Average queuing when patient arrives i-th first-aid centre is long to be determined by following formula:
L
qi=P
i·ρ
s/(1-ρ
s)
ρ
s=ρ
i/S
i=λ/S
i·μ
i
P
ifor needing the probability waited for when patient arrives i-th first-aid centre, S
ibe the service group quantity of i-th first-aid centre, ρ
ibe the first aid load of i-th first-aid centre, μ
iit is patient's number that i-th first-aid centre processes within the unit interval.ρ
sfor intermediate quantity, can be understood as the load of single service group in first-aid centre.
Patient needs the probability P waited for when arriving i-th first-aid centre
idetermined by following formula:
N is number of patients.
Service group quantity S
iit is the smaller value of seeing and treating patients in doctor's quantity and berth quantity two values of i-th first-aid centre; Patient's number μ that i-th first-aid centre processes within the unit interval
idetermined by following formula:
μ is patient's number of process in each doctor's unit interval of seeing and treating patients.
The shortest running time T
travel_to_idetermined by following formula
V
kfor the current capacity in kth section path, c
kfor the traffic capacity in kth section path, t
kfor the time of vehicle during kth section free pathway by needing, N is the path hop count of process required for from patient location to i-th first-aid centre, α and β is empirical parameter, and generally to get α be 4.0, β is 0.15.
The present invention proposes first-aid patients to expect that therapeutic time send the foundation of routing behind emergency tender, more press close to real patient's first aid needs, the emergency tender that effective minimizing causes because first-aid centre's Emergency medical resources is not enough changes its course, thus shorten the time that first-aid patients really gets emergency medical services, improve the survival rate of patient.
The technological means such as first aid data analysis, GIS geography information, optimal route selection organically combine by the present invention, utilize the First Aid Ability of the different first-aid centre of history first aid data prediction, and First Aid Ability is obtained emergency medical services with patient be associated, send routing after realizing the emergency tender more optimized.
Specific embodiment described herein is only to the explanation for example of the present invention's spirit.Those skilled in the art can make various amendment or supplement or adopt similar mode to substitute to described specific embodiment, but can't depart from spirit of the present invention or surmount the scope that appended claims defines.
Although more employ the terms such as working time, stand-by period, first aid load herein, do not get rid of the possibility using other term.These terms are used to be only used to describe and explain essence of the present invention more easily; The restriction that they are construed to any one additional is all contrary with spirit of the present invention.
Claims (5)
1. send a routing resource behind emergency tender, it is characterized in that, comprise the following steps:
S001, acquisition GIS geography information, road network information and real time traffic data;
The initial value of S002, setting variable i is 1;
S003, calculating emergency tender are from patient location to the shortest running time T of i-th first-aid centre
travel_to_i;
S004, calculating patient are sent to the later average latency W of i-th first-aid centre
qi;
S005, i increase 1, repeat step S003 and step S004, until travel through all first-aid centres;
S006, select the shortest working time and the minimum first-aid centre of average latency sum to be best first-aid centre, patient is transported to best first-aid centre according to the path that the shortest working time is corresponding by emergency tender;
In described step S004, the average latency is determined by following formula: W
qi=L
qi/ λ; L
qifor average queuing when patient arrives i-th first-aid centre is long, λ is the patient's number arriving i-th first-aid centre in the unit time;
Average queuing when described patient arrives i-th first-aid centre is long to be determined by following formula:
L
qi＝P
i·ρ
s/(1-ρ
s)
ρ
s＝ρ
i/S
i＝λ/S
i·μ
i
P
ifor needing the probability waited for when patient arrives i-th first-aid centre, S
ibe the service group quantity of i-th first-aid centre, ρ
ibe the first aid load of i-th first-aid centre, μ
ibe patient's number that i-th first-aid centre processes within the unit interval, ρ
sfor the load of service group single in first-aid centre.
2. send routing resource behind a kind of emergency tender according to claim 1, it is characterized in that, when patient arrives i-th first-aid centre, need the probability P waited for
idetermined by following formula:
N is number of patients.
3. send routing resource behind a kind of emergency tender according to claim 2, it is characterized in that, service group quantity S
iit is the smaller value of seeing and treating patients in doctor's quantity and berth quantity two values of i-th first-aid centre; Patient's number μ that i-th first-aid centre processes within the unit interval
idetermined by following formula:
μ is patient's number of process in each doctor's unit interval of seeing and treating patients.
4. send routing resource behind a kind of emergency tender as claimed in any of claims 1 to 3, it is characterized in that, the shortest running time T
travel_to_idetermined by following formula
V
kfor the current capacity in kth section path, c
kfor the traffic capacity in kth section path, t
kfor the time of vehicle during kth section free pathway by needing, N is the path hop count of process required for from patient location to i-th first-aid centre, α and β is empirical parameter.
5. send routing resource behind a kind of emergency tender according to claim 4, it is characterized in that, α is 4.0, β is 0.15.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410055542.9A CN103971514B (en) | 2014-02-19 | 2014-02-19 | Routing resource is sent behind a kind of emergency tender |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410055542.9A CN103971514B (en) | 2014-02-19 | 2014-02-19 | Routing resource is sent behind a kind of emergency tender |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103971514A CN103971514A (en) | 2014-08-06 |
| CN103971514B true CN103971514B (en) | 2016-01-27 |
Family
ID=51240947
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410055542.9A Active CN103971514B (en) | 2014-02-19 | 2014-02-19 | Routing resource is sent behind a kind of emergency tender |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103971514B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106485355B (en) * | 2016-10-12 | 2019-11-26 | 创业软件股份有限公司 | A kind of medical treatment route optimization method based on outpatient service big data analysis |
| CN107316475B (en) * | 2017-07-14 | 2022-04-12 | 广州大正新材料科技有限公司 | Traffic safety scheduling method and system based on shared information |
| CN111325469B (en) * | 2020-02-21 | 2023-04-28 | 东南大学 | Intelligent scheduling method and integrated system for ambulance and personnel |
| CN114626836B (en) * | 2022-05-17 | 2022-08-05 | 浙江大学 | Multi-agent reinforcement learning-based emergency post-delivery decision-making system and method |
| CN117928592B (en) * | 2024-03-21 | 2024-06-07 | 四川省医学科学院·四川省人民医院 | Emergency ambulance route planning and arrival time estimating method and system |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103312782A (en) * | 2013-05-15 | 2013-09-18 | 晁彦公 | Remote intelligent first-acid system and remote intelligent first-acid method |
| CN103337162A (en) * | 2013-07-16 | 2013-10-02 | 四川大学 | Real-time planning and dynamic scheduling system for urban emergency rescue channel |
| CN103353959A (en) * | 2013-06-29 | 2013-10-16 | 上海交通大学医学院附属新华医院 | Mobile terminal, system and method for emergency treatment pre-checkup triage |
| CN103514356A (en) * | 2012-11-22 | 2014-01-15 | Tcl集团股份有限公司 | Vehicle-mounted family medical system and data processing method thereof |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| TWI399707B (en) * | 2009-10-30 | 2013-06-21 | Quanta Comp Inc | Traffic control system and method using positioned data |
-
2014
- 2014-02-19 CN CN201410055542.9A patent/CN103971514B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103514356A (en) * | 2012-11-22 | 2014-01-15 | Tcl集团股份有限公司 | Vehicle-mounted family medical system and data processing method thereof |
| CN103312782A (en) * | 2013-05-15 | 2013-09-18 | 晁彦公 | Remote intelligent first-acid system and remote intelligent first-acid method |
| CN103353959A (en) * | 2013-06-29 | 2013-10-16 | 上海交通大学医学院附属新华医院 | Mobile terminal, system and method for emergency treatment pre-checkup triage |
| CN103337162A (en) * | 2013-07-16 | 2013-10-02 | 四川大学 | Real-time planning and dynamic scheduling system for urban emergency rescue channel |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103971514A (en) | 2014-08-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103971514B (en) | Routing resource is sent behind a kind of emergency tender | |
| Luo et al. | A new framework of intelligent public transportation system based on the internet of things | |
| Cao et al. | Estimation method for a skip-stop operation strategy for urban rail transit in China | |
| CN109635980B (en) | Method and system for allocating order of vehicle | |
| CN108694844A (en) | Automatic driving vehicle control method, device and storage medium | |
| JP2019028527A5 (en) | ||
| CN108281027A (en) | A kind of interactive intelligent arrival reminding method and device | |
| CN108460484A (en) | A kind of broadly-orbit traffic concocting method and system | |
| CN103824447A (en) | Reservation transfer method and apparatus for public transport means | |
| Bhaskar et al. | An investigation of timed transfer coordination using event-based multi agent simulation | |
| CN105022778A (en) | Intelligent traffic management big data analysis system | |
| CN113849989B (en) | Bus network simulation system | |
| DE102011077882A1 (en) | Mobile ad hoc network | |
| CN113935595B (en) | Urban rail transit road network peak large passenger flow dredging system | |
| CN102024328B (en) | Bus signal priority method based on headway time equilibrium | |
| Ren et al. | Two-step optimization of urban rail transit marshalling and real-time station control at a comprehensive transportation hub | |
| Xu et al. | When automated vehicles meet non-signalized intersections: A collision-free scheduling solution | |
| CN104754753A (en) | Air interface resource control method in cluster system and base station equipment | |
| Hafezi et al. | Study behaviour of passengers on transit operation | |
| Zhu et al. | Transfer problem in a cloud-based public vehicle system with sustainable discomfort | |
| CN107067708A (en) | A kind of travel route method of real-time adjustment of non-peak bus based on big data | |
| CN114331231B (en) | Method and system for scheduling public transport | |
| CN102493377B (en) | Centralized traffic control mechanism for crossroad | |
| CN103945004A (en) | Dispatching method and system for data between data centers | |
| Ding et al. | The Analysis and Calculation Method of Urban Rail Transit Carrying Capacity Based on Express‐Slow Mode |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |