CN116341853A - Fire truck scheduling method, device and storage medium based on multi-service system - Google Patents
Fire truck scheduling method, device and storage medium based on multi-service system Download PDFInfo
- Publication number
- CN116341853A CN116341853A CN202310307983.2A CN202310307983A CN116341853A CN 116341853 A CN116341853 A CN 116341853A CN 202310307983 A CN202310307983 A CN 202310307983A CN 116341853 A CN116341853 A CN 116341853A
- Authority
- CN
- China
- Prior art keywords
- volunteer
- fire
- fire truck
- service
- target
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 37
- 230000004044 response Effects 0.000 claims abstract description 25
- 238000009472 formulation Methods 0.000 claims description 9
- 239000000203 mixture Substances 0.000 claims description 9
- 230000007704 transition Effects 0.000 claims description 4
- 230000015572 biosynthetic process Effects 0.000 claims description 3
- 238000006243 chemical reaction Methods 0.000 claims description 3
- 238000010586 diagram Methods 0.000 description 11
- 230000006378 damage Effects 0.000 description 4
- 208000027418 Wounds and injury Diseases 0.000 description 3
- 230000000694 effects Effects 0.000 description 3
- 238000005265 energy consumption Methods 0.000 description 3
- 208000014674 injury Diseases 0.000 description 3
- 201000010099 disease Diseases 0.000 description 2
- 208000037265 diseases, disorders, signs and symptoms Diseases 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 230000035945 sensitivity Effects 0.000 description 2
- 206010000369 Accident Diseases 0.000 description 1
- 241001652065 Trigonopeltastes delta Species 0.000 description 1
- 230000006978 adaptation Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 238000004880 explosion Methods 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 229920006395 saturated elastomer Polymers 0.000 description 1
- 238000010206 sensitivity analysis Methods 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Images
Classifications
-
- 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/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/06311—Scheduling, planning or task assignment for a person or group
-
- 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
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
- G06Q50/26—Government or public services
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02T—CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
- Y02T10/00—Road transport of goods or passengers
- Y02T10/10—Internal combustion engine [ICE] based vehicles
- Y02T10/40—Engine management systems
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Tourism & Hospitality (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Marketing (AREA)
- Development Economics (AREA)
- General Business, Economics & Management (AREA)
- Educational Administration (AREA)
- Physics & Mathematics (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Game Theory and Decision Science (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application discloses a fire truck dispatching method, device and storage medium based on a multi-service system, and relates to the technical field of fire control command dispatching. The multi-service system comprises an advanced professional fire engine, a low-grade professional fire engine and a volunteer fire engine, and the method comprises the following steps: acquiring service requirements; determining a target fire engine according to state information of the high-level professional fire engine, the low-level professional fire engine and the volunteer fire engine; and responding to the service requirement according to the target fire truck. According to the embodiment of the application, the target fire engine is determined to respond to the service demand according to the state information of the high-grade professional fire engine, the low-grade professional fire engine and the volunteer fire engine, so that scientific and efficient adjustment of the response strategy of the multi-period volunteer fire fighter dispatching system is realized. According to the embodiment of the application, scientific scheduling and efficient response of firefighters can be realized, the operation efficiency of the multi-period volunteer firefighting response system is improved, the system loss cost is reduced, and the potential unreliability of the professional firefighting response system is made up.
Description
Technical Field
The application relates to the technical field of fire control dispatching, in particular to a fire truck dispatching method, device and storage medium based on a multi-service system.
Background
Due to the frequency and diversity of emergency calls, professional firefighters are becoming increasingly challenging to deal with natural disasters and human accidents. In 2018, the Chinese fire department has more than 100 thousands of rescue teams, the number of fire rescue workers is more than 1200 ten thousands of people, and the number of fire vehicles is more than 200 ten thousands. To alleviate the increasing pressure on professional firefighters and increase the operational efficiency of fire emergency response systems, many countries have incorporated volunteer firefighters into emergency response services. In the united states, the volunteer fire department protects 39% of the population each year and saves the community on tax in the neighborhood of $ 372 billions.
The availability of volunteer firefighter resources is often affected by disease, physical insufficiency, and injury. However, there is currently no effective scheduling method that ensures reliable and efficient execution of vehicle response and scheduling under the above-mentioned factor disturbances.
Disclosure of Invention
The application provides a fire truck scheduling method, device and storage medium based on a multi-service system. The technical scheme of the application is as follows:
according to a first aspect of embodiments of the present application, there is provided a fire truck scheduling method based on a multi-service system, including:
acquiring service requirements;
determining a target fire engine according to the state information of the high-level professional fire engine, the low-level professional fire engine and the volunteer fire engine;
and responding to the service requirement according to the target fire truck.
Optionally, the state information of the advanced professional fire truck, the low-grade professional fire truck and the volunteer fire truck includes a busy state and an idle state, and the determining the target fire truck according to the state information of the advanced professional fire truck, the low-grade professional fire truck and the volunteer fire truck includes:
when the high-level professional fire truck or the low-level professional fire truck is in an idle state, determining the high-level professional fire truck or the low-level professional fire truck in the idle state as the target fire truck;
when the high-level professional fire truck or the low-level professional fire truck is in a busy state, determining the target fire truck according to the state information of the volunteer fire truck;
when the volunteer fire engine is in an idle state, determining that the volunteer fire engine is the target fire engine;
and when the volunteer fire engine is in a busy state, the current service requirement is discharged into a waiting queue.
Optionally, after the determining the target fire truck, the method further includes:
acquiring disaster data corresponding to the service demand, wherein the disaster data comprises disaster grades, and the disaster grades comprise high grades and low grades;
collecting parameter data of volunteer firefighters;
determining the total number of target volunteer firefighters distributed to the target firefighter truck according to the parameter data of the volunteer firefighters and a pre-established user model aiming at the disaster data;
responding to the service demand according to the total number of the target fire truck and the target volunteer firefighters.
Optionally, determining the total number of the target volunteer firefighters allocated to the target firefighter truck according to the parameter data of the volunteer firefighters and a pre-established user model includes:
obtaining constraint conditions;
and solving the user model according to the constraint condition to obtain the total number of the target volunteer firefighters.
Optionally, the constraint condition includes:
a first constraint, the formulation of the first constraint expressed as:
wherein alpha is q,t Reliability probability of responding to the q-th service demand for the volunteer fire department within a period t;
the queuing balance equation of the multi-service system is as follows:
(λ 1,t +λ 2,t )P 00,t ＝μ 2 P 01,t +μ 1 P 10,t +μ v P 00vb,t +μ v P 00va,t (1)
(λ 1,t +λ 2,t +μ 2 )P 01,t ＝μ 1 P 11,t +λ 2 P 00,t +μ v P 01vb,t +μ v P 01va,t (2)
(λ 1,t +λ 2,t +μ 1 )P 10,t ＝μ v P 10va,t +μ v P 10vb,t +λ 1,t P 00,t +μ 2 P 11,t (4)
(λ 1,t +λ 2,t +μ v )P 00va,t ＝μ 2 P 01va,t +μ 1 P 10va,t (5)
(λ 1,t +λ 2,t +μ v )P 00vb,t ＝μ 2 P 01vb,t +μ 1 P 10vb,t (6)
(λ 1,t +λ 2,t +μ 2 +μ v )P 01va,t ＝λ 2,t P 00va,t +μ 1 P 11va,t (7)
(λ 1，t +λ 2，t +μ 2 +μ v )P 01vb，t ＝λ 2，t P 00vb，t +μ 1 P 11vb，t (8)
(λ 1，t +λ 2，t +μ 1 +μ v )P 10va，t ＝λ 1，t P 00va，t +μ 2 P 11va，t (9)
(λ 1，t +λ 2，t +μ 1 +μ v )P 10vb，t ＝λ 1，t P 00vb，t +μ 2 P 11vb，t (10)
(μ 1 +μ 2 +μ v )P 11va，A，t ＝λ 2，t P 11va，t +(λ 2，t ·α 2，t )P 11a，t (13)
(μ 1 + μ 2+μ v )P 11va，B，t ＝λ 1，t P 11va，t +(λ 2，t ·α 2，t )P 11b，t +(λ 1，t ·α 2，t ) P11a，t (14)
(μ 1 +μ 2 +μ v )P 11vb，A，t ＝λ 2，t P 11vb，t (15)
(μ 1 +μ 2 +μ v )P 11vb，B，t ＝λ 1，t P 11vb，t +(λ 1 ·α 2，t )P 11b，t (16)
wherein, the service rate of the advanced professional fire truck is mu 1 The service rate of the low-grade professional fire truck is mu 2 The service rate of the volunteer fire engine is mu v The method comprises the steps of carrying out a first treatment on the surface of the Within period t, the arrival rate of the high-level service demand is lambda 1，t The arrival rate of low-level service demands is lambda 2，t P is the state transition probability;
a second constraint, the formulation of the second constraint expressed as:
W t forming a working probability for the volunteer within a period t;
a third constraint, formulated as:
wherein X is q，t Is an integer variable representing the number of volunteer firefighters dispatched in response to the q-th arriving service demand during period t, delta is a conversion parameter from individual volunteer firefighter job probability to number consumption, X total Total number available for volunteer firefighters;
a fourth constraint, formulated as:
a fifth constraint, formulated as:
wherein M is q Cost of service for arranging volunteer firefighters to service the q-th arriving service demand, M total Dispatching the total budget of volunteer firefighters for all periods, where M 1 ≥M 2 ≥M 3 …≥M q-1 ≥M q ；
A sixth constraint, formulated as:
a seventh constraint, formulated as:
optionally, the formulation of the user model is expressed as:
wherein,,
to loss of queued call loss due to disruption of the volunteer fire truck during the t time interval.
Optionally, the responding to the service demand according to the total number of the target fire truck and the target volunteer firefighter includes:
acquisition of alpha 2，t And alpha 1，t According to the sixth constraint condition, find the number X of the firefighters of the volunteers dispatched in the period t q，t As a total number of said target volunteer firefighters, in a target volunteer firefighting vehicle formation dispatched in a period tWith said X q，t Equal number of recommended solutions to volunteer firefighters.
According to a second aspect of embodiments of the present application, there is provided a fire truck dispatching apparatus based on a multi-service system, including:
the acquisition module is used for acquiring the service requirement;
the determining module is used for determining a target fire engine according to the state information of the high-grade professional fire engine, the low-grade professional fire engine and the volunteer fire engine;
and the response module is used for responding to the service requirement according to the target fire truck.
According to a third aspect of embodiments of the present application, there is provided a fire truck scheduling device based on a multi-service system, including:
a processor;
a memory for storing the processor-executable instructions;
wherein the processor is configured to execute the instructions to implement the multi-service system based fire truck scheduling method of any one of the above first aspects.
According to a fourth aspect of embodiments of the present application, there is provided a non-transitory computer readable storage medium, which when executed by a processor of a multi-service system based fire truck scheduling apparatus, enables the multi-service system based fire truck scheduling apparatus to perform the multi-service system based fire truck scheduling method as set forth in any one of the first aspects above.
The technical scheme provided by the embodiment of the application at least brings the following beneficial effects:
by establishing a fire truck scheduling model based on a multi-service system, the response strategy of the multi-period volunteer fire fighter scheduling system is adjusted, so that resource waste caused by unreasonable volunteer fire fighter scheduling planning is avoided, scientific scheduling and efficient response of fire fighters can be realized, and the operation efficiency of the volunteer fire fighter scheduling system is improved.
And the constraint is established to constrain the cost, so that the loss cost of the multi-period volunteer firefighter scheduling system is reduced, the running benefit is improved, and the unreliability of the professional firefighting response system is compensated.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the application.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the application and together with the description, serve to explain the principles of the application and do not constitute an undue limitation on the application.
Fig. 1 is a flowchart illustrating a fire truck scheduling method based on a multi-service system according to an exemplary embodiment.
Fig. 2 is a block diagram illustrating a fire truck scheduler based on a multi-service system according to an exemplary embodiment.
Fig. 3 is a hypercube state equilibrium diagram in a classical model.
Fig. 4 is a fire service status balancing diagram shown according to an exemplary embodiment.
FIG. 5 is a schematic diagram showing sensitivity of system cost to volunteer fire service reliability probabilities, according to an example embodiment.
Fig. 6 is a block diagram of an apparatus according to an example embodiment.
Detailed Description
In order to enable those skilled in the art to better understand the technical solutions of the present application, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings.
It should be noted that the terms "first," "second," and the like in the description and claims of the present application and the above figures are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged where appropriate such that embodiments of the present application described herein may be implemented in sequences other than those illustrated or otherwise described herein. The implementations described in the following exemplary examples are not representative of all implementations consistent with the present application. Rather, they are merely examples of apparatus and methods consistent with some aspects of the present application as detailed in the accompanying claims.
Due to the frequency and diversity of emergency calls, professional firefighters are becoming increasingly challenging to deal with natural disasters and human accidents. In 2018, the Chinese fire department has more than 100 thousands of rescue teams, the number of fire rescue workers is more than 1200 ten thousands of times, and the number of fire vehicles is more than 200 ten thousands (the fire rescue workers of the emergency management department, 2019). To alleviate the increasing pressure on professional firefighters and increase the operational efficiency of fire emergency response systems, many countries (e.g., united states, germany, australia, and china) have incorporated volunteer firefighters into emergency response services. Taking the united states as an example, the volunteer fire department protects an average 39% of the local population each year and saves the community on a total tax of 372 billions of dollars.
However, factors such as insufficient personnel, low physical skill level, etc., in volunteer firefighter systems present serious challenges for the elevation of their service levels. First, it is difficult to recruit volunteer firefighters in many countries, especially where some young people have a low enthusiasm to register volunteer firefighters, resulting in a limited number of volunteer firefighters available. In addition, since the volunteer firefighters have less experience, a lower skill level is more likely to suffer from injury and physical insufficiency, requiring more time to recover physical strength after participating in multiple services. Finally, volunteer service with insufficient hands is more susceptible to interference from unreliable factors than service provided by professional firefighters. For example, a large fire accident typically requires more than 5 firefighters to hold a heavy hose with a large recoil force. However, if not enough firefighters are available, this service may be discontinued, or even suspended. These characteristics of volunteer firefighters lead to a unique endogenous relationship between emergency response service performance and volunteer resource planning decisions, and fig. 3 is a schematic diagram of the interaction between emergency response system performance and volunteer firefighting resource planning. As shown in fig. 3, the dynamic scheduling problem determines the number of volunteer firefighters to dispatch and determines the reliability of the volunteer service, as well as the overall performance of the emergency response service system. Meanwhile, the hypercube queuing balancing problem determines the impact of workload on the availability of volunteer firefighters, which is often reduced by the impact of disease, physical insufficiency and injury. Therefore, procedures need to be made to ensure that there are enough people to perform the volunteer fire task.
A great deal of research has solved the emergency vehicle deployment problem through models. Considering the geographical and time complexity of demand distribution, larson developed a hypercube queuing model and designed a dynamic facility redeployment model with time-varying demand based on approximation. In recent years, many extensions of the basic hypercube model have been applied to multi-scenario emergency services systems. Iannoni and Morabito propose a multi-schedule and partial backup hypercube queue model under a specific scheduling policy. Moondra originally developed the idea of implicit shift planning to optimize staff size for each period.
The et al studied the problem of labor planning and scheduling with a two-day holiday for each shift. Beojone and Souza propose a shift scheduling algorithm to improve the service quality and efficiency of police areas. In the related art, no combination of volunteer firefighter shift arrangement, probabilistic disruption of volunteer resources, and queuing balancing has been performed yet. Irrespective of the effects of physical energy consumption, insufficient funds and volunteer availability may lead to overestimation of system performance. It is difficult to provide an effective and reliable emergency response service if the effects of physical energy consumption, insufficient funds and optimal volunteer arrangements of volunteers in a time-varying environment are not considered.
In the embodiment of the application, a single-cycle reliable hypercube queuing model is first proposed to capture the priority queuing mechanism of an emergency response service system with professional and volunteer subsystems. Subsequently, a rational and applicable tool is provided to evaluate the performance of the volunteer service under probabilistic disruption. Then, a two-stage volunteer firefighter planning model was proposed for multiple periods, including budget constraints and the impact of volunteer energy consumption over time. The validated numerical results indicate that reliability factors improve the performance of the emergency response service system, and that ignoring these factors may lead to erroneous decisions. Sensitivity analysis was performed on several key parameters to explore decision schemes for multi-period volunteer planning in practice.
Based on the above problems, the present application proposes a fire truck scheduling method based on a multi-service system, and fig. 1 is a flowchart of a fire truck scheduling method based on a multi-service system according to an exemplary embodiment, and as shown in fig. 1, the fire truck scheduling method based on a multi-service system includes the following steps:
in this embodiment of the application, in order to cope with the situation that the professional fire-fighting system is unavailable, a multi-service system is firstly established, wherein the multi-service system comprises a professional fire-fighting system and a volunteer fire-fighting system, the professional fire-fighting system comprises a high-grade professional fire-fighting vehicle and a low-grade professional fire-fighting vehicle, and the volunteer fire-fighting system comprises a volunteer fire-fighting vehicle. The time is divided into a plurality of time periods, and the time periods are used as units to respond to the service demands. The service requirements comprise the handling of emergency situations such as fire extinguishment, disaster relief, rescue and the like.
And 102, determining a target fire engine according to the state information of the high-grade professional fire engine, the low-grade professional fire engine and the volunteer fire engine.
Optionally, the state information of the advanced professional fire truck, the low-grade professional fire truck and the volunteer fire truck includes a busy state and an idle state, and the determining the target fire truck according to the state information of the advanced professional fire truck, the low-grade professional fire truck and the volunteer fire truck includes:
when the high-level professional fire truck or the low-level professional fire truck is in an idle state, determining the high-level professional fire truck or the low-level professional fire truck in the idle state as the target fire truck;
when the high-level professional fire truck or the low-level professional fire truck is in a busy state, determining the target fire truck according to the state information of the volunteer fire truck;
when the volunteer fire engine is in an idle state, determining that the volunteer fire engine is the target fire engine;
and when the volunteer fire engine is in a busy state, the current service requirement is discharged into a waiting queue.
And step 103, responding to the service requirement according to the target fire truck.
In this embodiment, after determining the target fire truck, the multi-service system may send a notification to the target fire truck, informing the specific content and destination of the service requirement to be processed by the target fire truck, and the firefighter needs to drive the target fire truck to the destination to process the service requirement.
Optionally, after the determining the target fire truck, the method further includes:
acquiring disaster data corresponding to the service requirements;
collecting parameter data of volunteer firefighters;
in this embodiment, the response sequence of each type of fire-fighting vehicle to the service requirement is shown in Table 1
TABLE 1
N in Table 1 1 Is an advanced fire engine, n 2 Is a low-grade fire engine, and v is a volunteer fire engine. The disaster grades of the service demands comprise two grades, the grade a is high grade, the grade b is low grade, the severity of the grade a disaster is higher than that of the grade b disaster, so that the grade a disaster is preferentially sent out to be processed by the high-grade fire truck, the grade b disaster is preferentially sent out to be processed by the low-grade fire truck, and the volunteer fire truck is sent out only if the high-grade fire truck and the low-grade fire truck are in busy state. Professional firefighting service systems are more efficient and reliable than volunteer systems, but busy or interrupted conditions exist in professional firefighting service. In case of busy or interrupted job fire service systems, the later fire alarm call will be transferred to the volunteer fire service system. The vehicle failure time caused by the interruption follows an exponential distribution.
The parameter data of the volunteer firefighter comprises data such as the number of volunteers.
Determining the total number of target volunteer firefighters distributed to the target firefighter truck according to the parameter data of the volunteer firefighters and a pre-established user model aiming at the disaster data;
responding to the service demand according to the total number of the target fire truck and the target volunteer firefighters.
The service demand comes from a set of demand points J e J, J being a set of demand points within the spatial region, and the call arrival follows an independent poisson process. In one possible embodiment, the service requirements are generally classified as high-grade lambda, based on potential casualties or related economic losses 1 And a low level lambda 2 . For example, severe earthquakes, explosions in densely populated areas, or fires in large commercial areas are all classified as service demands that may require advanced fire engine priority. Lawn fires and the like are generally considered service demands that can be serviced by low-grade fire engines in a preferential manner. The total arrival rate of the demands of the multi-service system is as follows
L is a disaster grade set; />
The service demand arrival rate L e { a, b } of the demand point j representing the disaster level L.
Optionally, determining the total number of the target volunteer firefighters allocated to the target firefighter truck according to the parameter data of the volunteer firefighters and a pre-established user model includes:
obtaining constraint conditions;
and solving the user model according to the constraint condition to obtain the total number of the target volunteer firefighters.
Optionally, the constraint condition includes:
a first constraint, the formulation of the first constraint expressed as:
wherein alpha is q，t For the reliability probability of the volunteer fire department responding to the q-th service demand in the period t, q represents the serial number of the demand queuing in this embodiment, when two fire disasters occur and two professional fire vehicles are busy, the system is saturated, if the 3 rd demand coming again at this time is queued at the first place of the queue, i.e. q=1, and the volunteer fire vehicle starts responding to the service demand at this time.
Fig. 3 is a hypercube state equilibrium diagram in a classical model. As shown in fig. 3, each node in the system represents three states of the fire truck, 1 being busy, 0 being idle, for a total of 8 states. For example, the 010 state represents that the advanced professional fire truck and the volunteer fire truck are in an idle state and the low professional fire truck is in a busy state.
Fig. 4 is a fire service status balancing diagram shown according to an exemplary embodiment. The service reliability and queuing priority of volunteer firefighters are considered by the multi-service system-based firefighter truck scheduling system in this embodiment, and the queuing system is significantly complicated compared with fig. 1.
In the fire service state balance shown in fig. 4, the queuing balance equation of the multi-service system is as follows:
(λ 1，t +λ 2，t )P 00，t ＝μ 2 P 01，t +μ 1 P 10，t +μ v P 00vb，t +μ v P 01va，t (1)
(λ 1，t +λ 2，t +μ 2 )P 01，t ＝μ 1 P 11，t +λ 2 P 00，t +μ v P 01vb，t +μ v P 01va，t (2)
(λ 1，t +λ 2，t +μ 1 )P 10，t ＝μ v P 10va，t +μ vP10vb，t +λ 1，t P 00，t +μ 2 P 11，t (4)
(λ 1，t +λ 2，t +μ v )P 00va，t ＝μ 2 P 01va，t +μ 1 P 10va，t (5)
(λ 1，t +λ 2，t +μ v )P 00vb，t ＝μ 2 P 01vb，t +μ 1 P 10vb，t (6)
(λ 1，t +λ 2，t +μ 2 +μ v )P 01va，t ＝λ 2，t P 00va，t +μ 1 P 11va，t (7)
(λ 1，t +λ 2，t +μ 2 +μ v )P 01vb，t ＝λ 2，t P 00vb，t +μ 1 P 11vb，t (8)
(λ 1，t +λ 2，t +μ 1 +μ v )P 10va，t ＝λ 1，t P 00va，t +μ 2 P 11va，t (9)
(λ 1，t +λ 2，t +μ 1 +μ v )P 10vb，t ＝λ 1，t P 00vb，t +μ 2 P 11vb，t (10)
(μ 1 +μ 2 +μ v )P 11va，A，t ＝λ 2，t P 11va，t +(λ 2，t ·α 2，t )P 11a，t (13)
(μ 1 +μ 2 +μ v )P 11va，B，t ＝λ 1，t P 11va，t +(λ 2，t ·α 2，t )P 11b，t +(λ 1，t ·α 2，t )P 11a，t (14)
(μ 1 +μ 2 +μ v )P 11vb，A，t ＝λ 2，t P 11vb，t (15)
(μ 1 +μ 2 +μ v )P 11vb，B，t ＝λ 1，t P 11vb，t +(λ 1 ·α 2，t )P 11b，t (16)
wherein, the service rate of the advanced professional fire truck is mu 1 The service rate of the low-grade professional fire truck is mu 2 The service rate of the volunteer fire engine is mu v The method comprises the steps of carrying out a first treatment on the surface of the Within period t, the arrival rate of the high-level service demand is lambda 1，t The arrival rate of low-level service demands is lambda 2，t ，；
P is the state transition probability, namely the probability that the system is in a certain state in the time period t, wherein the front item in the subscript is the state, and the rear item is the time period. 0 represents an idle state and 1 represents a busy state. For example, P 00，t For the probability of the system being in the 00 state in the t time period, the high-level professional fire truck and the low-level professional fire truck are in an idle state in the 00 state, and the volunteer fire truck is also in the idle state. P (P) 10，t The high-grade professional fire truck is in a busy state, the low-grade professional fire truck is in an idle state, and the volunteer fire truck is in an idle state; p (P) 01，t Indicating that the high-grade professional fire truck is in an idle state and the low-grade professional fire truck is busyIn an idle state, and the volunteer fire truck is in the idle state; p (P) 11，t The high-grade professional fire truck and the low-grade professional fire truck are busy, and the volunteer fire truck is in an idle state.
Subscript va indicates that the volunteer fire engine is servicing a service demand with a disaster level a; vb indicates that the volunteer fire engine is servicing a service demand of disaster class b.
For example, P 00va，t The va in the (a) represents a disaster of which the volunteer fire truck is in a busy state and the disaster level of the service requirement is treated is a, the high-grade professional fire truck is in an idle state, and the low-grade professional fire truck is in an idle state; p (P) 10va，t Representing that the high-grade professional fire truck is in a busy state, the low-grade professional fire truck is in an idle state, the volunteer fire truck is in a busy state, and the disaster grade of the service requirement is a disaster; p (P) 01va，t Representing that the high-grade professional fire truck is in an idle state, the low-grade professional fire truck is in a busy state, the volunteer fire truck is in a busy state, and the disaster grade of the service requirement is a disaster; p (P) 11va，t Representing that the high-grade professional fire truck is in a busy state, the low-grade professional fire truck is in a busy state, the volunteer fire truck is in a busy state, and the disaster grade of the service requirement is a disaster.
P 00vb，t The system is characterized in that the system represents that a high-grade professional fire engine is in an idle state, a low-grade professional fire engine is in an idle state, a volunteer fire engine is in a busy state, and the volunteer fire engine is used for processing the service requirement with the disaster grade of b, wherein vb represents that the volunteer fire engine is in the busy state, and the volunteer fire engine is used for processing the service requirement with the disaster grade of b. P (P) 10vb，t Representing that the high-grade professional fire truck is in a busy state, the low-grade professional fire truck is in an idle state, the volunteer fire truck is in a busy state, and the volunteer fire truck is processing the service requirement with the disaster grade of b. P (P) 01vb，t The system is characterized in that the system represents that an advanced professional fire truck is in an idle state, a low-grade professional fire truck is in a busy state, a volunteer fire truck is in the busy state, and the volunteer fire truck is used for processing the service requirement with the disaster grade of b. P (P) 11vb，t Representing that the high-grade professional fire truck is in a busy state, the low-grade professional fire truck is in a busy state, and volunteersThe fire engine is in a busy state and the volunteer fire engine is handling the service demand with disaster level b.
P 11va，A，t The high-grade professional fire truck and the low-grade professional fire truck are busy, the volunteer fire truck is also busy, the disaster grade of the service requirement of the volunteer fire truck in treatment is a, the service requirement with the disaster grade of a is in a queue, and the fire truck waiting for being free is treated. P (P) 11va，B，t The high-grade professional fire truck and the low-grade professional fire truck are busy, the volunteer fire truck is also busy, the disaster grade of the service requirement of the volunteer fire truck in treatment is a, the service requirement with the disaster grade of b is in a queue, and the idle fire truck is waited for treatment.
P 11vb，B，t The high-grade professional fire truck and the low-grade professional fire truck are busy, the volunteer fire truck is busy, the service requirement with the disaster grade of b is processed, and the service requirement with the disaster grade of b is in a queue, and the idle fire truck is waited for processing. P (P) 11vb，A，t The high-grade professional fire truck and the low-grade professional fire truck are busy, the volunteer fire truck is busy, the service requirement with the disaster grade of b is processed, and the service requirement with the disaster grade of a is in a queue, and the idle fire truck is waited for processing.
P 11a，t The high-grade professional fire truck and the low-grade professional fire truck are busy, the volunteer fire truck is in an unreliable state, so that a disaster grade with one service requirement is a in a queue, and the idle fire truck is waited for processing.
P 11b，t The high-grade professional fire truck and the low-grade professional fire truck are busy, the volunteer fire truck is in an unreliable state, so that a disaster level with a service requirement is b in a queue, and the idle fire truck is waited for processing.
In each of the above-described queuing balance equations, the left side of the equation represents the probability of a change in the current state, and the right side of the equation represents the probability of a transition from the current state to the state on the left side of the equation. Wherein, the arrival rate and the service rate are fixed values, and P is a variable.
A second constraint, the formulation of the second constraint expressed as:
wherein W is t The volunteers were queued for working probabilities over the t period.
A third constraint, formulated as:
wherein X is q，t Is an integer variable representing the number of volunteer firefighters dispatched in response to the q-th arriving demand during period t. Delta is the conversion parameter from the working probability of a single volunteer firefighter to the consumption of people, x total The total number available to volunteer firefighters. The third constraint reflects the consumption of volunteer firefighters from one period to the next, i.e., the number of available volunteer firefighters in the next period is less than or equal to the total number of available volunteer firefighters remaining after the end of the current period.
A fourth constraint, formulated as:
a fifth constraint, formulated as:
wherein M is q Cost of service for arranging volunteer firefighters to service the q-th arriving service demand, M total Dispatching the total budget of volunteer firefighters for all periods, where M 1 ≥M 2 ≥M 3 …≥M q-1 ≥M q The total cost available for service needs is gradually reduced as each time a volunteer firefighter is dispatched to handle the service need is at a cost.
A sixth constraint, formulated as:
a seventh constraint, formulated as:
optionally, the formulation of the user model is expressed as:
wherein,,
to loss of queued call loss due to disruption of the volunteer fire truck during the t time interval. In the case of a large number of queued fires, call loss may result, including loss of property damage at the point of demand during queuing.
Optionally, the responding to the service demand according to the total number of the target fire truck and the target volunteer firefighter includes:
acquisition of alpha 2，t And alpha 1，t According to alpha 2，t And alpha 1，t Constructing a queuing balance equation, and solving the number X of the dispatched volunteer firefighters in the period t according to the sixth constraint condition q，t And as a total number of said target volunteer firefighters, in a target volunteer firefighting vehicle formation dispatched in a period t, to allocate said X q，t Equal number of recommended solutions to volunteer firefighters.
In the embodiment of the application, according to the constraint, the following is adopted
Optimizing the minimum target to obtain the recommended solution of the user model, namely alpha 2，t And alpha 1，t Can be based on alpha 2，t And alpha 1，t According to the sixth constraint condition, find the number X of the volunteer firefighters dispatched in the period t q，t Is arranged to dispatch a corresponding number of volunteer firefighters over each period.
FIG. 5 is a schematic diagram showing sensitivity of system cost to volunteer fire service reliability probabilities, according to an example embodiment. The results show that the reliability probability under different queuing states has different effects on the system cost. In particular, the reliability probability pair for the second queue state
The influence of (2) is greater than the influence of the state of the first queue, but for +.>
The first queue state reliability probability is more important. In summary, the reliability probability of the second queue state plays a more important role in the overall cost.
Fig. 2 is a block diagram illustrating a fire truck scheduler based on a multi-service system according to an exemplary embodiment. Referring to fig. 2, the apparatus includes:
an obtaining module 210, configured to obtain a service requirement;
a determining module 220, configured to determine a target fire engine according to status information of the advanced professional fire engine, the low-grade professional fire engine and the volunteer fire engine;
and a response module 230, configured to respond to the service requirement according to the target fire truck.
The specific manner in which the various modules perform the operations in the apparatus of the above embodiments have been described in detail in connection with the embodiments of the method, and will not be described in detail herein.
Fig. 6 is a block diagram illustrating an apparatus 800 for implementing the multi-service system-based fire truck scheduling method according to an exemplary embodiment.
In an exemplary embodiment, a storage medium is also provided, such as a memory 810 including instructions, an interface 830, the instructions being executable by the processor 820 of the apparatus 800 to perform the above-described method. Alternatively, the storage medium may be a non-transitory computer readable storage medium, which may be, for example, ROM, random Access Memory (RAM), CD-ROM, magnetic tape, floppy disk, optical data storage device, and the like.
Other embodiments of the present application will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. This application is intended to cover any variations, uses, or adaptations of the application following, in general, the principles of the application and including such departures from the present disclosure as come within known or customary practice within the art to which the application pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the application being indicated by the following claims.
It is to be understood that the present application is not limited to the precise arrangements and instrumentalities shown in the drawings, which have been described above, and that various modifications and changes may be effected without departing from the scope thereof. The scope of the application is limited only by the appended claims.
Claims (10)
1. A fire truck scheduling method based on a multi-service system, wherein the multi-service system comprises an advanced professional fire truck, a low-grade professional fire truck and a volunteer fire truck, the method comprising:
acquiring service requirements;
determining a target fire engine according to the state information of the high-level professional fire engine, the low-level professional fire engine and the volunteer fire engine;
and responding to the service requirement according to the target fire truck.
2. The method of claim 1, wherein the status information of the advanced, low, and volunteer fire engines includes a busy status and an idle status, and wherein determining the target fire engine based on the status information of the advanced, low, and volunteer fire engines comprises:
when the high-level professional fire truck or the low-level professional fire truck is in an idle state, determining the high-level professional fire truck or the low-level professional fire truck in the idle state as the target fire truck;
when the high-level professional fire truck or the low-level professional fire truck is in a busy state, determining the target fire truck according to the state information of the volunteer fire truck;
when the volunteer fire engine is in an idle state, determining that the volunteer fire engine is the target fire engine;
and when the volunteer fire engine is in a busy state, the current service requirement is discharged into a waiting queue.
3. The method of claim 1 or 2, wherein after the determining the target fire truck, the method further comprises:
acquiring disaster data corresponding to the service demand, wherein the disaster data comprises disaster grades, and the disaster grades comprise high grades and low grades;
collecting parameter data of volunteer firefighters;
determining the total number of target volunteer firefighters distributed to the target firefighter truck according to the parameter data of the volunteer firefighters and a pre-established user model aiming at the disaster data;
responding to the service demand according to the total number of the target fire truck and the target volunteer firefighters.
4. A method according to claim 3, wherein determining the total number of target volunteer firefighters allocated to the target fire truck based on the parameter data of the volunteer firefighters and a pre-established user model comprises:
obtaining constraint conditions;
and solving the user model according to the constraint condition to obtain the total number of the target volunteer firefighters.
5. The method of claim 4, wherein the constraints comprise:
a first constraint, the formulation of the first constraint expressed as:
wherein alpha is q,t The reliability probability for the volunteer fire department to respond to the q-th service demand within period t,
the queuing balance equation of the multi-service system is as follows:
(λ 1,t +λ 2,t )P 00,t ＝μ 2 P 01,t +μ 1 P 10,t +μ v P 00vb,t +μ v P 00va,t (1)
(λ 1,t +λ 2,t +μ 2 )P 01,t ＝μ 1 P 11,t +λ 2 P 00,t +μ v P 01vb,t +μ v P 01va,t (2)
(λ 1,t +λ 2,t +μ 1 )P 10,t ＝μ v P 10va,t +μ v P 10vb,t +λ 1,t P 00,t +μ 2 P 11,t (4)
(λ 1,t +λ 2,t +μ v )P 00va,t ＝μ 2 P 01va,t +μ 1 P 10va,t (5)
(λ 1,t +λ 2,t +μ v )P 00vb,t ＝μ 2 P 01vb,t +μ 1 P 10vb,t (6)
(λ 1,t +λ 2,t +μ 2 +μ v )P 01va,t ＝λ 2,t P 00va,t +μ 1 P 11va,t (7)
(λ 1,t +λ 2,t +μ 2 +μ v )P 01vb,t ＝λ 2,t P 00vb,t +μ 1 P 11vb,t (8)
(λ 1,t +λ 2,t +μ 1 +μ v )P 10va,t ＝λ 1,t P 00va,t +μ 2 P 11va,t (9)
(λ 1,t +λ 2,t +μ 1 +μ v )P 10vb,t ＝λ 1,t P 00vb,t +μ 2 P 11vb,t (10)
(μ 1 +μ 2 +μ v )P 11va，A，t ＝λ 2，t P 11va，t +(λ 2，t ·α 2，t )P 11a，t (13)
(μ 1 +μ 2 +μ v )P 11va,B,t ＝λ 1,t P 11va,t +(λ 2,t ·α 2,t )P 11b,t +(λ 1,t ·α 2,t )P 11a,t (14)
(μ 1 +μ 2 +μ v )P 11vb,A,t ＝λ 2,t P 11vb,t (15)
(μ 1 +μ 2 +μ v )P 11vb,B,t ＝λ 1,t P 11vb,t +(λ 1 ·α 2,t )P 11b,t (16)
wherein, the service rate of the advanced professional fire truck is mu 1 The service rate of the low-grade professional fire truck is mu 2 The service rate of the volunteer fire engine is mu v The method comprises the steps of carrying out a first treatment on the surface of the Within period t, the arrival rate of the high-level service demand is lambda 1,t The arrival rate of low-level service demands is lambda 2,t P is the state transition probability; b (B) i,t P { B ] for the ith possible state in time period t queuing equalization i,t -is the steady state hypercube state probability for the ith state during period t;
a second constraint, the formulation of the second constraint expressed as:
W t forming a working probability for the volunteer within a period t;
a third constraint, formulated as:
wherein X is q,t Is an integer variable representing the number of volunteer firefighters dispatched in response to the q-th arriving service demand during period t, delta is a conversion parameter from individual volunteer firefighter job probability to number consumption, X total Total number available for volunteer firefighters;
a fourth constraint, formulated as:
a fifth constraint, formulated as:
wherein M is q Cost of service for arranging volunteer firefighters to service the q-th arriving service demand, M total Dispatching the total budget of volunteer firefighters for all periods, where M 1 ≥M 2 ≥M 3 ...≥M q-1 ≥M q ；
A sixth constraint, formulated as:
a seventh constraint, formulated as:
6. the method of claim 5, wherein the formulation of the user model is expressed as:
wherein,,
to loss of queued call loss due to disruption of the volunteer fire truck during the t time interval.
7. The method of claim 6, wherein said responding to said service demand according to a total number of said target fire truck and said target volunteer firefighters comprises:
acquisition of alpha 2,t And alpha 1,t According to the sixth constraint condition, find the number X of the firefighters of the volunteers dispatched in the period t q,t And as a total number of said target volunteer firefighters, in a target volunteer firefighting vehicle formation dispatched in a period t, to allocate said X q,t Equal number of recommended solutions to volunteer firefighters.
8. A fire truck scheduling device based on a multi-service system, comprising:
the acquisition module is used for acquiring the service requirement;
the determining module is used for determining a target fire engine according to the state information of the high-grade professional fire engine, the low-grade professional fire engine and the volunteer fire engine;
and the response module is used for responding to the service requirement according to the target fire truck.
9. A fire truck scheduling device based on a multi-service system, comprising:
a processor;
a memory for storing the processor-executable instructions;
wherein the processor is configured to execute the instructions to implement the multi-service system based fire truck scheduling method of any one of claims 1 to 7.
10. A non-transitory computer readable storage medium, wherein instructions in the storage medium, when executed by a processor of a multi-service system based fire truck scheduling apparatus, enable the multi-service system based fire truck scheduling apparatus to perform the multi-service system based fire truck scheduling method of any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310307983.2A CN116341853B (en) | 2023-03-27 | 2023-03-27 | Fire truck scheduling method, device and storage medium based on multi-service system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310307983.2A CN116341853B (en) | 2023-03-27 | 2023-03-27 | Fire truck scheduling method, device and storage medium based on multi-service system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116341853A true CN116341853A (en) | 2023-06-27 |
| CN116341853B CN116341853B (en) | 2023-11-21 |
Family
ID=86881914
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310307983.2A Active CN116341853B (en) | 2023-03-27 | 2023-03-27 | Fire truck scheduling method, device and storage medium based on multi-service system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116341853B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104464268A (en) * | 2013-09-22 | 2015-03-25 | 西安扩力机电科技有限公司 | Fire fighting truck dispatching system |
| CN109447353A (en) * | 2018-10-31 | 2019-03-08 | 苏州大学 | The subway breakdown lorry planing method being lined up based on joint |
| CN109816914A (en) * | 2019-02-12 | 2019-05-28 | 旷卓(上海)智能科技有限公司 | Wisdom fire-fighting emergency management system and management method |
| CN110197303A (en) * | 2019-05-30 | 2019-09-03 | 浙江树人学院（浙江树人大学） | A kind of fireman's rescue dispatch method adapting to fire dynamic change |
| CN113935108A (en) * | 2021-09-30 | 2022-01-14 | 煤炭科学研究总院 | Multi-type emergency vehicle combined addressing and configuration method, device and storage medium |
| KR102367869B1 (en) * | 2020-11-26 | 2022-02-25 | 주식회사 시큐웨어 | System for responding disaster situations |
| CN114792465A (en) * | 2022-04-14 | 2022-07-26 | 广东永耀消防机电工程有限公司 | Fire safety monitoring system based on regional alarm model |
-
2023
- 2023-03-27 CN CN202310307983.2A patent/CN116341853B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104464268A (en) * | 2013-09-22 | 2015-03-25 | 西安扩力机电科技有限公司 | Fire fighting truck dispatching system |
| CN109447353A (en) * | 2018-10-31 | 2019-03-08 | 苏州大学 | The subway breakdown lorry planing method being lined up based on joint |
| CN109816914A (en) * | 2019-02-12 | 2019-05-28 | 旷卓(上海)智能科技有限公司 | Wisdom fire-fighting emergency management system and management method |
| CN110197303A (en) * | 2019-05-30 | 2019-09-03 | 浙江树人学院（浙江树人大学） | A kind of fireman's rescue dispatch method adapting to fire dynamic change |
| KR102367869B1 (en) * | 2020-11-26 | 2022-02-25 | 주식회사 시큐웨어 | System for responding disaster situations |
| CN113935108A (en) * | 2021-09-30 | 2022-01-14 | 煤炭科学研究总院 | Multi-type emergency vehicle combined addressing and configuration method, device and storage medium |
| CN114792465A (en) * | 2022-04-14 | 2022-07-26 | 广东永耀消防机电工程有限公司 | Fire safety monitoring system based on regional alarm model |
Non-Patent Citations (2)
| Title |
|---|
| HAN LIU ET AL.: "Planning for time-varying volunteer firefighter systems under probabilistic service disruptions", 《TRANSPORTATION RESEARCH PART E: LOGISTICS AND TRANSPORTATION REVIEW》, pages 1 - 18 * |
| 刘晗;王健;安实;崔娜;: "超立方体排队均衡的卫星消防站选址调度优化", 交通运输系统工程与信息, no. 02 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116341853B (en) | 2023-11-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100385895C (en) | Computer telephone integration using automatic calling distribution system characteristic | |
| CN109471705B (en) | Task scheduling method, device and system, and computer device | |
| CN107948095A (en) | A kind of resource control method, device and bus system server | |
| CN104102548B (en) | task resource scheduling processing method and system | |
| CN109298990A (en) | Log storing method, device, computer equipment and storage medium | |
| van Buuren et al. | EMS call center models with and without function differentiation: A comparison | |
| CN111967785A (en) | Optimization processing method and device for business handling of bank outlets | |
| CN115576534B (en) | Method and device for arranging atomic service, electronic equipment and storage medium | |
| CN112148454A (en) | Edge computing method supporting serial and parallel and electronic equipment | |
| CN113364697A (en) | Flow control method, device, equipment and computer readable storage medium | |
| CN116341853B (en) | Fire truck scheduling method, device and storage medium based on multi-service system | |
| JP2012105129A (en) | Disaster response supporting system, disaster response supporting server, disaster response supporting method, and disaster response supporting program | |
| CN109191135A (en) | Transaction based on block chain retries method, apparatus, equipment and readable storage medium storing program for executing | |
| CN108985556A (en) | Method, apparatus, equipment and the computer storage medium of flow scheduling | |
| JP2008009496A (en) | Maintenance service operation system and maintenance service operation method | |
| CN107220114A (en) | Distributed resource scheduling method based on resource United Dispatching | |
| CN107426450B (en) | A kind of method and device calculating the busy degree in call center | |
| CN113610407B (en) | Law enforcement dispatching method and system based on 5G communication technology | |
| CN114356515A (en) | Scheduling method of data conversion task | |
| CN113344421A (en) | Personnel dynamic allocation method, system, electronic equipment and storage medium | |
| CN110349388A (en) | A kind of alarm emergency scheduling processing method from procedure | |
| CN110683442A (en) | Method, system and storage medium for processing elevator maintenance information | |
| Green et al. | On the validity and utility of queueing models of human service systems | |
| CN116915915B (en) | Scheduling method, device and equipment for call center access terminal agents | |
| CN115907405B (en) | Airport intelligent alarm receiving treatment method and device, electronic equipment and medium |
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 |