CN116364256A - Emergency medical rescue command dispatching method and dispatching system - Google Patents
Emergency medical rescue command dispatching method and dispatching system Download PDFInfo
- Publication number
- CN116364256A CN116364256A CN202310302619.7A CN202310302619A CN116364256A CN 116364256 A CN116364256 A CN 116364256A CN 202310302619 A CN202310302619 A CN 202310302619A CN 116364256 A CN116364256 A CN 116364256A
- Authority
- CN
- China
- Prior art keywords
- demand
- delivery
- distribution
- time
- shortest
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 26
- 239000000463 material Substances 0.000 claims abstract description 44
- 238000004364 calculation method Methods 0.000 claims abstract description 32
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 18
- 238000003780 insertion Methods 0.000 claims description 6
- 230000037431 insertion Effects 0.000 claims description 6
- 238000004590 computer program Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 239000000446 fuel Substances 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 238000012804 iterative process Methods 0.000 description 1
- 239000011159 matrix material Substances 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 230000008054 signal transmission Effects 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
- G16H—HEALTHCARE INFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR THE HANDLING OR PROCESSING OF MEDICAL OR HEALTHCARE DATA
- G16H40/00—ICT specially adapted for the management or administration of healthcare resources or facilities; ICT specially adapted for the management or operation of medical equipment or devices
- G16H40/20—ICT specially adapted for the management or administration of healthcare resources or facilities; ICT specially adapted for the management or operation of medical equipment or devices for the management or administration of healthcare resources or facilities, e.g. managing hospital staff or surgery rooms
-
- 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/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- G—PHYSICS
- G06—COMPUTING; 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/06315—Needs-based resource requirements planning or analysis
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- General Business, Economics & Management (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- Quality & Reliability (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Development Economics (AREA)
- Tourism & Hospitality (AREA)
- Game Theory and Decision Science (AREA)
- Health & Medical Sciences (AREA)
- Operations Research (AREA)
- Marketing (AREA)
- Biomedical Technology (AREA)
- Epidemiology (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Medical Informatics (AREA)
- Public Health (AREA)
- Educational Administration (AREA)
- Medical Treatment And Welfare Office Work (AREA)
Abstract
The invention provides an emergency medical rescue command and dispatch method and a dispatch system, which relate to the technical field of medical emergency command and dispatch, and are used for counting the material demand of demand points and the material capacity of a distribution center and calculating a overtime loss function; determining the priority of each demand point according to the timeout loss function value obtained by the timeout loss function calculation; obtaining shortest distribution paths reaching all the demand points in sequence by using an iterative algorithm according to the order of the priority of the demand points from high to low; and determining the delivery time and the delivery cost corresponding to the shortest delivery path of the emergency resource delivery center according to the shortest delivery path, and calculating a path decision objective function.
Description
Technical Field
The invention relates to the technical field of medical emergency command and dispatch, in particular to a command and dispatch method and a dispatch system for emergency medical rescue.
Background
The emergency material scheduling is an important component of emergency logistics decision of emergency, is a key link of emergency rescue work, is used for researching the problem of emergency material scheduling aiming at time minimization, and has important practical significance for improving the quick response capability of emergency material demands and improving the emergency rescue effect.
The most remarkable characteristic of emergency resource scheduling is represented by time urgency, and resource scheduling personnel and decision-making personnel need to complete a scheduling scheme of emergency resources required by an emergency point in the shortest possible time so as to timely schedule the emergency resources to a disaster area.
In general, emergency materials are collected from various levels of material reserves to a distribution center near a disaster site, and then distributed and sent to the disaster site by the distribution center. How to select the address established by the distribution center and how to scientifically plan the emergency material distribution path becomes two very important research subjects in the emergency logistics system.
Disclosure of Invention
In order to solve the technical problems, the invention provides a command and dispatch method for emergency medical rescue, which comprises the following steps:
s1, counting the material demand of demand points and the material capacity of a distribution center, and calculating a time-out loss function;
s2, determining the priority of each demand point according to the overtime loss function value obtained by calculating the overtime loss function;
s3, obtaining shortest distribution paths which sequentially reach all the demand points by using an iterative algorithm according to the order of the priority of the demand points from high to low;
and S4, determining the delivery time and the delivery cost corresponding to the shortest delivery path of the emergency resource delivery center according to the shortest delivery path, and calculating a path decision objective function.
Further, the timeout loss function is d j (t)：
Wherein k is j For the demand point B j T is a time parameter, and the demand point B j Requiring that the supplies must be at time ET j Internally arriving, the material arriving at the demand point B j Is T j J=1, 2, …, m, m is the number of demand points.
Further, the delivery path decision objective function minZ is:
minZ＝f 1 +f 2 ；
wherein the delivery time minimizes the objective function f 1 The method comprises the following steps:
minimizing the objective function f for delivery cost 2 The method comprises the following steps:
wherein n represents the number of distribution centers, h is the set of distribution vehicles in the distribution process, h= (1, 2 … … a), a is the total number of distribution vehicles, t hi Representing the time taken for the deployment vehicle h to return to the original delivery center after traversing the demand point from the delivery center i; alpha is a time-limited coefficient, p j The probability of overtime loss of the demand point j is represented; t is t j The emergency materials are transported to the time of the required point j for all the dispatching vehicles; LT (LT) j A lower limit of waiting time for the corresponding materials is set for the demand point j; c 1 Representing the fixed cost of starting a single vehicle c 2 Is the running cost of the vehicle.
Further, with d IJ Representing a distribution center node v I To the demand node v J Is the actual path length of r IJ Representing a distribution center node v I With the demand node v J The insertion demand points in between, i=1, 2, …, n; j=1, 2, …, m;
the iterative algorithm comprises the following steps:
s31, initializing: let d IJ ＝w IJ And another r IJK Number k=1;
s32, if d IK +d KJ ＜d IJ Let d IJ ＝d IK +d KJ Let k=2;
s33, if k=m, terminating the algorithm; otherwise, k=k+1, go to step S32;
d of output IJ Then it is the distribution center node v I To the demand node v J And the shortest delivery path thereof passes through a plurality of insertion demand points r IJK 。
The invention also provides an emergency medical rescue command and dispatch system for realizing the emergency medical rescue command and dispatch method, which comprises the following steps: the device comprises a statistics unit, a timeout calculation unit, a priority determination unit, a decision objective function calculation unit and a shortest path forming unit;
the statistics unit is used for counting the material demand of the demand points and the material capacity of the distribution center;
the overtime calculation unit is used for calculating an overtime loss function according to the material demand of the counted demand points and the material capacity of the distribution center;
the priority determining unit is used for determining the priority of each demand point according to the overtime loss function value obtained by the overtime loss function calculation;
the shortest path forming unit is used for obtaining shortest distribution paths which sequentially reach all the demand points by using an iterative algorithm according to the sequence of the priority of the demand points from high to low;
the decision objective function calculation unit is used for determining the delivery time and the delivery cost corresponding to the shortest delivery path of the emergency resource delivery center according to the shortest delivery path, and calculating a decision objective function.
Further, the decision objective function calculation unit comprises a delivery time calculation module and a delivery cost calculation module;
the distribution time calculation module is used for calculating a distribution time minimization target function, and the distribution cost calculation module is used for calculating a distribution cost minimization target function.
Compared with the prior art, the invention has the following beneficial technical effects:
counting the material demand of the demand points and the material capacity of the distribution center, and calculating a time-out loss function; determining the priority of each demand point according to the timeout loss function value obtained by the timeout loss function calculation; obtaining shortest distribution paths reaching all the demand points in sequence by using an iterative algorithm according to the order of the priority of the demand points from high to low; and determining the delivery time and the delivery cost corresponding to the shortest delivery path of the emergency resource delivery center according to the shortest delivery path, and calculating a path decision objective function. Rescue command scheduling of emergency medical treatment is reasonably performed, and the distribution sequence of the distribution center is planned, so that materials are distributed as required.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings that are needed in the description of the embodiments will be briefly described below, it being obvious that the drawings in the following description are only some embodiments of the present invention, and that other drawings may be obtained according to these drawings without inventive effort to a person skilled in the art.
FIG. 1 is a flow chart of a command and dispatch method for emergency medical rescue of an emergency;
fig. 2 is a schematic structural diagram of the emergency medical rescue command and dispatch system of the invention.
Detailed Description
For the purposes of making the objects, technical solutions and advantages of the embodiments of the present application more clear, the technical solutions of the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is apparent that the described embodiments are some embodiments of the present application, but not all embodiments. All other embodiments, which can be made by one of ordinary skill in the art without undue burden from the present disclosure, are within the scope of the present disclosure.
In the drawings of the specific embodiments of the present invention, in order to better and more clearly describe the working principle of each element in the system, the connection relationship of each part in the device is represented, but only the relative positional relationship between each element is clearly distinguished, and the limitations on the signal transmission direction, connection sequence and the structure size, dimension and shape of each part in the element or structure cannot be constructed.
Fig. 1 is a flow chart of a command and dispatch method for emergency medical rescue in the invention, and the dispatch method comprises the following steps:
s1, counting the material demand of the demand points and the material capacity of the distribution center, and calculating a time-out loss function.
Let A 1 ，A 2 ，…，A i ，…，A n For n distribution centers, B 1 ，B 2 ，…，B j ，…，B m M demand points; the vehicle is arranged from a distribution center A i To the point of demand B j The required time is t ij The method comprises the steps of carrying out a first treatment on the surface of the Each distribution center A i The material capacity of (2) is x i (i=1, 2, …, n); each demand point B j The material demand of (2) is y j (j=1, 2, …, m). Distribution center A i To the point of demand B j Is of the path length D ij 。
Distribution center A i Assigned to the demand point B j The material quantity of (2) is x ij The method comprises the steps of carrying out a first treatment on the surface of the The transport cost per unit transport per unit length is c; demand point B j Requiring that the supplies must be at time ET j Arrival, otherwise, the shortage of materials occurs, and the overtime loss function of the shortage judgment is d j (t); the material reaches the demand point B j Is T j ，j＝1，2，…，m；
Time-out loss function d j (t) is:
wherein k is j For the demand point B j And t is a time parameter.
S2, according to the overtime loss function d j And (t) determining the priority of each demand point by calculating the timeout loss function value.
The most remarkable characteristic of emergency resource scheduling is represented by time urgency, and resource scheduling personnel and decision-making personnel need to finish the requirement point in the shortest time possibleAnd (3) scheduling the emergency resources to the demand points in time. This step is based on the time-out loss function d j And (t) determining the priority of each demand point by the loss function value obtained by calculation, and scheduling the multiple demand points by the multiple distribution centers.
And (3) calculating the overtime loss function value of each demand point according to the overtime loss function of the step (S1), taking the demand point with the largest overtime loss function value as the demand point with the highest priority, and taking the demand point with the loss function value of zero as the demand point with the lowest priority.
S3, obtaining the shortest distribution path which sequentially reaches each demand point by using an iterative algorithm according to the order of the priority of the demand points from high to low.
After the emergency occurs, the dispatcher rapidly collects information and determines the position of a demand point and the demand condition of materials; and determining addresses for alternatively establishing the distribution center according to the geographical position, the material reserve condition and the like, and establishing a topological graph.
In the topological graph for determining the demand points and the distribution centers as nodes: and obtaining the mutually communicated paths between two adjacent nodes by taking the quotient of the path length between the adjacent nodes and the average running speed of the current vehicle in the path as elements, and obtaining the shortest delivery path communicated by each node by using an iterative algorithm.
The iterative algorithm is an important method for calculating the shortest distance between any two nodes, and in the first iteration of the iterative algorithm, the shortest distance between any two nodes is allowed to pass through a node v 1 And updating the distance between any two nodes; in the second iteration, the shortest distance between any two nodes is allowed to pass through node v 2 (already contains v 1 ) And updating the distance between any two nodes. And repeating the iterative process for a plurality of times, and finally obtaining the shortest delivery path accessed by each node.
By d IJ Representing a distribution center node v I To the demand node v J Is the actual path length of r IJ Representing a distribution center node v I With the demand node v J The insertion demand points in between, i=1, 2, …, n; j=1, 2, …, m, forming a weighted adjacency matrix w=(w IJ ) n×m 。
The iterative algorithm steps are as follows:
(1) Initializing: let d IJ ＝w IJ And another r IJK Number k=1;
(2) If d IK +d KJ ＜d IJ Let d IJ ＝d IK +d KJ Let k=2,
(3) If k=m, terminating the algorithm; otherwise, k=k+1, go to step (2).
D outputted by the algorithm IJ Namely, the distribution center node v I To the demand node v J And the shortest delivery path thereof passes through a plurality of insertion demand points r IJK 。
And S4, determining the delivery time and the delivery cost corresponding to the shortest delivery path of the emergency resource delivery center according to the shortest delivery path output in the step S3, and calculating a path decision objective function.
The targets involved in the vehicle path decision objective function considered in the present embodiment include both time and cost targets.
Representing a time target by a delivery time minimization objective function, the delivery time minimization objective function f 1 The method comprises the following steps:
in the above formula, n represents the number of distribution centers, h is the set of distribution vehicles in the distribution process, h= (1, 2 … … a), a is the total number of distribution vehicles, t hi Representing the time taken for the deployment vehicle h to return to the original delivery center after traversing the demand point from the delivery center i; alpha is a time-limited coefficient, the value of which is given; p is p j The probability of overtime loss of the demand point j is represented; t is t j The emergency materials are transported to the time of the required point j for all the dispatching vehicles; LT (LT) j The lower limit of the waiting time of the corresponding materials is set for the demand point j.
Representing cost targets with a cost-minimizing objective function for delivery, the cost of delivery being the mostMinimizing the objective function f 2 The method comprises the following steps:
in the above, c 1 Representing the fixed cost of starting a single vehicle, a being the total number of deployment vehicles; c 2 For running cost of vehicle, related to fuel consumption, vehicle loss, etc., t hi The time taken for the deployment vehicle h to return to the original delivery center after traversing the point of demand from the delivery center i is indicated.
Determining a delivery path decision objective function minZ corresponding to the shortest delivery path output in the step S3 according to the shortest delivery path output in the step S3 of each emergency resource:
minZ＝f 1 +f 2 。
fig. 3 is a schematic structural diagram of the emergency medical rescue command and dispatch system according to the present invention.
The system comprises: the device comprises a statistics unit, a timeout calculation unit, a priority determination unit, a decision objective function calculation unit and a shortest path forming unit.
And the statistics unit is used for counting the material demand of the demand points and the material capacity of the distribution center.
And the overtime calculation unit is used for calculating an overtime loss function according to the material demand of the counted demand points and the material capacity of the distribution center.
And the priority determining unit is used for determining the priority of each demand point according to the overtime loss function value obtained by calculating the overtime loss function.
And the shortest path forming unit is used for obtaining the shortest distribution path which sequentially reaches each demand point by using an iterative algorithm according to the order of the priority of the demand points from high to low.
And the decision objective function calculation unit is used for determining the delivery time and the delivery cost corresponding to the shortest delivery path of the emergency resource delivery center according to the shortest delivery path and calculating a decision objective function.
The decision objective function calculation unit comprises a delivery time calculation module and a delivery cost calculation module.
The distribution time calculation module is used for calculating a distribution time minimization target function, and the distribution cost calculation module is used for calculating a distribution cost minimization target function.
In the above embodiments, it may be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When loaded and executed on a computer, produces a flow or function in accordance with embodiments of the present application, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a computer network, or other programmable apparatus. The computer instructions may be stored in or transmitted across a computer-readable storage medium. The computer readable storage medium may be any available medium that can be accessed by a computer or a data storage device such as a server, data center, etc. that contains an integration of one or more available media. The usable medium may be a magnetic medium (e.g., a floppy disk, a hard disk, a magnetic tape), an optical medium (e.g., a DVD), or a semiconductor medium (e.g., a Solid State Disk (SSD)), or the like.
While the invention has been described with reference to certain preferred embodiments, it will be understood by those skilled in the art that various changes and substitutions of equivalents may be made and equivalents will be apparent to those skilled in the art without departing from the scope of the invention. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (6)
1. The emergency medical rescue command and dispatch method is characterized by comprising the following steps:
s1, counting the material demand of demand points and the material capacity of a distribution center, and calculating a time-out loss function;
s2, determining the priority of each demand point according to the overtime loss function value obtained by calculating the overtime loss function;
s3, obtaining shortest distribution paths which sequentially reach all the demand points by using an iterative algorithm according to the order of the priority of the demand points from high to low;
and S4, determining the delivery time and the delivery cost corresponding to the shortest delivery path of the emergency resource delivery center according to the shortest delivery path, and calculating a path decision objective function.
2. The emergency medical rescue command and dispatch method of claim 1, wherein the timeout loss function is d j (t)：
Wherein k is j For the demand point B j T is a time parameter, and the demand point B j Requiring that the supplies must be at time ET j Internally arriving, the material arriving at the demand point B j Is T j J=1, 2, …, m, m is the number of demand points.
3. The emergency medical rescue command and dispatch method according to claim 1, wherein the delivery path decision objective function minZ is:
minZ＝f 1 +f 2 ；
wherein the delivery time minimizes the objective function f 1 The method comprises the following steps:
minimizing the objective function f for delivery cost 2 The method comprises the following steps:
wherein n represents the number of distribution centers, h is the set of distribution vehicles in the distribution process, h= (1, 2 … … a), a is the total number of distribution vehicles, t hi Representing the time taken for the deployment vehicle h to return to the original delivery center after traversing the demand point from the delivery center i; alpha is a time-limited coefficient, p j The probability of overtime loss of the demand point j is represented; t is t j The emergency materials are transported to the time of the required point j for all the dispatching vehicles; LT (LT) j A lower limit of waiting time for the corresponding materials is set for the demand point j; c 1 Representing the fixed cost of starting a single vehicle c 2 Is the running cost of the vehicle.
4. The emergency medical rescue command and dispatch method of claim 1, wherein,
by d IJ Representing a distribution center node v I To the demand node v J Is the actual path length of r IJ Representing a distribution center node v I With the demand node v J The insertion demand points in between, i=1, 2, …, n; j=1, 2, …, m;
the iterative algorithm comprises the following steps:
s31, initializing: let d IJ ＝w IJ And another r IJK Number k=1;
s32, if d IK +d KJ ＜d IJ Let d IJ ＝d IK +d KJ Let k=2;
s33, if k=m, terminating the algorithm; otherwise, k=k+i, go to step S32;
d of output IJ Then it is the distribution center node v I To the demand node v J And the shortest delivery path thereof passes through a plurality of insertion demand points r IJK 。
5. The emergency medical rescue command and dispatch system is characterized by being used for realizing the emergency medical rescue command and dispatch method according to any one of claims 1-4, and comprising the following steps: the device comprises a statistics unit, a timeout calculation unit, a priority determination unit, a decision objective function calculation unit and a shortest path forming unit;
the statistics unit is used for counting the material demand of the demand points and the material capacity of the distribution center;
the overtime calculation unit is used for calculating an overtime loss function according to the material demand of the counted demand points and the material capacity of the distribution center;
the priority determining unit is used for determining the priority of each demand point according to the overtime loss function value obtained by the overtime loss function calculation;
the shortest path forming unit is used for obtaining shortest distribution paths which sequentially reach all the demand points by using an iterative algorithm according to the sequence of the priority of the demand points from high to low;
the decision objective function calculation unit is used for determining the delivery time and the delivery cost corresponding to the shortest delivery path of the emergency resource delivery center according to the shortest delivery path, and calculating a decision objective function.
6. The emergency medical rescue command and dispatch system according to claim 5, wherein the decision objective function calculation unit comprises a delivery time calculation module and a delivery cost calculation module;
the distribution time calculation module is used for calculating a distribution time minimization target function, and the distribution cost calculation module is used for calculating a distribution cost minimization target function.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310302619.7A CN116364256A (en) | 2023-03-21 | 2023-03-21 | Emergency medical rescue command dispatching method and dispatching system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310302619.7A CN116364256A (en) | 2023-03-21 | 2023-03-21 | Emergency medical rescue command dispatching method and dispatching system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116364256A true CN116364256A (en) | 2023-06-30 |
Family
ID=86906569
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310302619.7A Pending CN116364256A (en) | 2023-03-21 | 2023-03-21 | Emergency medical rescue command dispatching method and dispatching system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116364256A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117789955A (en) * | 2024-02-28 | 2024-03-29 | 济南大学 | Medical service distribution and path planning method, system, equipment and medium |
-
2023
- 2023-03-21 CN CN202310302619.7A patent/CN116364256A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117789955A (en) * | 2024-02-28 | 2024-03-29 | 济南大学 | Medical service distribution and path planning method, system, equipment and medium |
| CN117789955B (en) * | 2024-02-28 | 2024-05-03 | 济南大学 | Medical service distribution and path planning method, system, equipment and medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8768614B2 (en) | Increasing throughput for carpool assignment matching | |
| US8504295B2 (en) | Preserving assigned carpools after a cancellation | |
| Dey et al. | On-line scheduling policies for a class of IRIS (increasing reward with increasing service) real-time tasks | |
| CN116364256A (en) | Emergency medical rescue command dispatching method and dispatching system | |
| Van Der Gaast et al. | Capacity analysis of sequential zone picking systems | |
| CN113762594B (en) | Route planning method and device for vehicle-machine collaborative distribution post-disaster rescue materials | |
| CN115062868B (en) | Pre-polymerization type vehicle distribution path planning method and device | |
| Siebert et al. | Lot targeting and lot dispatching decision policies for semiconductor manufacturing: optimisation under uncertainty with simulation validation | |
| TWI435224B (en) | System reliability evaluation method for routing policy | |
| CN112418475B (en) | Logistics path planning method and device, electronic equipment and storage medium | |
| Hao et al. | Introduction to the dynamic pickup and delivery problem benchmark--ICAPS 2021 competition | |
| CN112884180B (en) | Logistics distributed point location method and device, electronic equipment and storage medium | |
| CN117114525A (en) | Internet of things-based cross-border logistics big data intelligent management system and method | |
| CN115936379A (en) | Shared vehicle scheduling method, device, equipment and storage medium | |
| CN116679636A (en) | Logistics transfer robot task scheduling system and method | |
| US20220245579A1 (en) | Method and apparatus for predicting the daily available capacity of a parcel pick-up station and computerized locker banks | |
| TWI637330B (en) | Project management method and system thereof | |
| CN110234167B (en) | Channel allocation method, channel allocation device and electronic equipment | |
| CN108011735A (en) | Community discovery method and device | |
| CN113283830A (en) | Waybill information sequence generation method, waybill information sequence generation device, waybill information sequence generation equipment and computer readable medium | |
| CN111858051A (en) | Real-time dynamic scheduling method, system and medium suitable for edge computing environment | |
| CN111245906A (en) | Service request distribution method | |
| Chaudhry et al. | On exact computational analysis of distributions of numbers in systems for M/G/1/N+ 1 and GI/M/1/N+ 1 queues using roots | |
| Shen et al. | Dynamic and Pareto-Improving Swapping of Vehicles to Enhance Shared Mobility Services | |
| Bhuvaneshwari | Finite source inventory system with negative customers |
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 |