CN116307332B - Real-time medicine distribution method and device - Google Patents
Real-time medicine distribution method and device Download PDFInfo
- Publication number
- CN116307332B CN116307332B CN202310547041.1A CN202310547041A CN116307332B CN 116307332 B CN116307332 B CN 116307332B CN 202310547041 A CN202310547041 A CN 202310547041A CN 116307332 B CN116307332 B CN 116307332B
- Authority
- CN
- China
- Prior art keywords
- delivery
- road
- road section
- drug delivery
- relation
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 39
- 239000003814 drug Substances 0.000 title claims description 135
- 238000012384 transportation and delivery Methods 0.000 claims abstract description 322
- 238000012377 drug delivery Methods 0.000 claims abstract description 243
- 238000013439 planning Methods 0.000 claims abstract description 73
- 238000004458 analytical method Methods 0.000 claims abstract description 28
- 230000008859 change Effects 0.000 claims abstract description 8
- 229940079593 drug Drugs 0.000 claims description 60
- 230000009467 reduction Effects 0.000 claims description 24
- 238000010276 construction Methods 0.000 claims description 3
- 239000000825 pharmaceutical preparation Substances 0.000 claims 2
- 229940127557 pharmaceutical product Drugs 0.000 claims 2
- 239000004973 liquid crystal related substance Substances 0.000 description 10
- 230000006870 function Effects 0.000 description 7
- 238000007726 management method Methods 0.000 description 6
- 238000004590 computer program Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 4
- 201000010099 disease Diseases 0.000 description 3
- 208000037265 diseases, disorders, signs and symptoms Diseases 0.000 description 3
- 230000033001 locomotion Effects 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 238000002716 delivery method Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000002093 peripheral effect Effects 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 241000700605 Viruses Species 0.000 description 1
- 230000032683 aging Effects 0.000 description 1
- 238000004378 air conditioning Methods 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 238000009513 drug distribution Methods 0.000 description 1
- 235000006694 eating habits Nutrition 0.000 description 1
- 238000000802 evaporation-induced self-assembly 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
- 230000002035 prolonged effect Effects 0.000 description 1
- 238000013068 supply chain management Methods 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
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/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/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
- G06Q10/0835—Relationships between shipper or supplier and carriers
- G06Q10/08355—Routing methods
-
- 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
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- General Business, Economics & Management (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Health & Medical Sciences (AREA)
- Development Economics (AREA)
- General Physics & Mathematics (AREA)
- Entrepreneurship & Innovation (AREA)
- Game Theory and Decision Science (AREA)
- Biomedical Technology (AREA)
- Epidemiology (AREA)
- General Health & Medical Sciences (AREA)
- Medical Informatics (AREA)
- Primary Health Care (AREA)
- Public Health (AREA)
- Traffic Control Systems (AREA)
Abstract
The invention relates to a method and a device for real-time drug delivery, comprising the following steps: the method comprises the steps of obtaining order information of a delivery order, judging whether the delivery order is an emergency order, constructing a shortest relation of delivery time by utilizing a road section and an intersection meeting path planning based on a shortest preset delivery time principle, constructing a lowest relation of delivery cost based on a lowest preset delivery cost principle, confirming a drug delivery vehicle according to whether the order is the emergency order, determining a delivery path and obtaining real-time road conditions by a delivery end point and a delivery starting point, planning the delivery path to obtain an analysis path, judging whether the road conditions of the delivery path change, and adjusting the delivery path according to a judgment result.
Description
Technical Field
The present invention relates to the field of path planning technologies, and in particular, to a method and apparatus for real-time drug delivery, an electronic device, and a computer readable storage medium.
Background
The real-time drug delivery is a delivery method which depends on path planning to realize drug delivery. With the continued growth of the population and the increasing degree of aging of the population, the impact of the disease on the elderly population is becoming deeper and deeper. The real-time delivery of the medicines provides convenience for the elderly population with inconvenient movement on the premise of known diseases.
At present, some drug delivery methods employ a single delivery vehicle, and no suitable delivery vehicle is selected according to the drug delivery volume and the drug urgency. In the delivery principle, only the delivery principle with the lowest delivery cost is considered, and the specificity of the medicine is not considered. In the actual delivery process, the delivery path is not planned in real time by combining with the real-time road condition, and delivery is often carried out according to the established path. Therefore, the current real-time drug delivery has the problems of single delivery vehicle category and poor real-time planning of delivery paths.
Disclosure of Invention
The invention provides a method and a device for real-time drug delivery and a computer readable storage medium, and mainly aims to solve the problems that the type of a delivery vehicle is single and the real-time planning of a delivery path is poor in the current real-time drug delivery.
In order to achieve the above object, the present invention provides a method for real-time delivery of medicines, comprising:
acquiring order information of a delivery order, and confirming a delivery center according to the order information, wherein the order information comprises: z medicines, the quantity of each medicine, the distribution terminal point and remark information for judging whether a distribution order is an emergency order, wherein Z is an integer greater than or equal to one, and the distribution center contains various medicines meeting the order requirement and various vehicles meeting the distribution requirement;
Obtaining a road network of a distribution area, wherein a plurality of roads meeting the path planning are arranged in the distribution area, the distribution area comprises a distribution starting point and a distribution ending point, the roads in the distribution area are divided into intersections and road sections, n road sections meeting the path planning and m road sections are obtained, n is an integer greater than or equal to one, m is an integer greater than or equal to zero, and the intersections are of different types;
constructing a shortest relation of the delivery time by utilizing road sections and intersections meeting the path planning based on a preset shortest delivery time principle, and constructing a lowest relation of the delivery cost based on a preset lowest delivery cost principle;
the method for constructing the shortest relation of the delivery time by utilizing the road sections and the intersections meeting the path planning based on the shortest delivery time principle comprises the following steps:
acquiring theoretical traffic capacity of one lane in a road section i, and constructing a road section traffic relation by utilizing the theoretical traffic capacity, wherein the road section i is a road section meeting the path planning;
acquiring an ideal delivery speed of a drug delivery vehicle running on a road section i, and constructing a road section congestion relation by using the ideal delivery speed;
obtaining the average speed of a drug delivery vehicle passing through an intersection p, obtaining the intersection running speed, and constructing an intersection passing relation by using the intersection running speed;
Constructing a shortest distribution time relation based on the road section traffic relation and the road section congestion relation and the intersection traffic relation;
the road section traffic relation is as follows:
wherein (1)>For road section traffic relation->For the theoretical traffic capacity of the j-th lane in road section i,/th lane>For road section->Length of->Whether or not the vehicle is passing through the road section->If the road section is passed +.>Then->Taking 1, otherwise taking 0,>for the lane reduction factor +.>For the crossing reduction factor, < >>For the lane width reduction factor, +.>An average travel speed of the drug delivery vehicle on road section i;
the road section congestion relation is as follows:
wherein (1)>Representing road congestion relations->For the actual vehicle flow of the drug delivery vehicle through section i,/->For the daily congestion factor of road section i, +.>Is an ideal dispensing speed;
the intersection passing relation is as follows:
wherein (1)>Is crossing traffic relation->Indicating crossing->Coefficient of passage of->For the vehicle flow in the road section i to reach the next road section through the intersection pAverage arrival rate at time,/>For the distance traveled by a drug delivery vehicle from road section i through intersection p to the next road section, +.>Crossing for drug delivery vehicle>Average speed of >Judging parameters for judging whether the drug delivery vehicle passes through the intersection p, if so, the drug delivery vehicle is +.>Taking 1, otherwise taking 0;
the shortest relation of the delivery time is as follows:
wherein (1)>For the shortest distribution time, +.>Judging parameters of the traffic control for the road section i, if the road section i is under the traffic control, the road section i is under the traffic control +.>Get->Otherwise, taking 0;
the lowest relation of the distribution cost is as follows:
wherein (1)>Representing the lowest relation of distribution cost->Representing drug delivery vehicle fixed delegation costs, +.>Representing cost per unit distance of drug delivery vehicle, < >>The distance to be travelled for the drug delivery vehicle to complete the drug delivery is +.>Representing cost per unit time of drug delivery vehicle, < >>The time required to complete the drug delivery for the drug delivery vehicle;
calculating the medicine dispensing volume of the medicine required in the dispensing order by using a preset volume formula, wherein the volume formula is as follows:
wherein (1)>Representing the volume of drug dispensed, +.>Is a medicine->Is a medicine box length->Is a medicine->Is a medicine box width->Is used as a medicineArticle->Is a medicine box height->Is a medicine->Is the number of (3);
judging whether the distribution order is an emergency order or not according to the remark information;
if the delivery order is an emergency order, confirming a drug delivery vehicle from various vehicles meeting the delivery requirement according to the drug delivery volume, wherein the delivery time of the drug delivery vehicle meets the shortest delivery time relation;
If the delivery order is not an emergency order, confirming a drug delivery vehicle from various vehicles meeting delivery requirements according to the drug delivery volume, wherein the delivery cost of the drug delivery vehicle meets the lowest delivery cost relation;
determining a delivery path according to the delivery end point and the delivery start point, acquiring real-time road conditions of the delivery path, obtaining initial road conditions, and planning the delivery path by utilizing the initial road conditions to obtain the initial path;
driving a drug delivery vehicle to go to a delivery end point according to the initial path, detecting the position information of the drug delivery vehicle in real time, acquiring real-time road conditions based on the position information of the drug delivery vehicle, obtaining analysis road conditions, and judging whether the road conditions of the delivery path change or not according to the analysis road conditions and the initial road conditions;
if the road condition of the distribution path is not changed, prompting the vehicle to distribute according to the initial path;
if the road condition of the delivery path changes, planning the delivery path by utilizing the analysis road condition to obtain a target path, and prompting the drug delivery vehicle to deliver the drug according to the target path.
Optionally, the road network for obtaining a preset distribution area, where there are multiple roads meeting the path plan in the distribution area, the distribution area includes a distribution start point and a distribution end point, the roads in the distribution area are divided into intersections and road segments, and n road segments and m intersections meeting the path plan are obtained, including:
Dividing roads in a distribution area into intersections and road sections, and judging whether a distribution starting point and a distribution terminal point are positioned on the same road section or not;
if the distribution starting point and the distribution ending point are positioned on the same road section, the minimum road section number meeting the path planning is one, the minimum road junction number is zero, wherein x lanes are arranged in the road section, x is an integer greater than or equal to one, and the divided road section is also marked as a road section when the divided road section is not a complete road section;
and if the distribution starting point and the distribution ending point are positioned on different road sections, obtaining n road sections and m intersections meeting the path planning.
Optionally, the acquiring the real-time road condition based on the position information of the drug delivery vehicle to obtain the analysis road condition includes:
detecting the position of the drug delivery vehicle to obtain position information, and acquiring real-time road conditions by utilizing preset ITS based on the position information to obtain analysis road conditions.
In order to solve the above problems, the present invention also provides a real-time drug delivery device, the device comprising:
the drug order receiving module is used for acquiring order information of a delivery order and confirming a delivery center according to the order information, wherein the order information comprises: z medicines, the quantity of each medicine, the distribution terminal point and remark information for judging whether a distribution order is an emergency order, wherein Z is an integer greater than or equal to one, and the distribution center contains various medicines meeting the order requirement and various vehicles meeting the distribution requirement;
The drug delivery standard construction module is used for acquiring a road network of a delivery area, wherein a plurality of roads meeting the path planning are arranged in the delivery area, the delivery area comprises a delivery starting point and a delivery ending point, the roads in the delivery area are divided into intersections and road sections, n road sections and m intersections meeting the path planning are obtained, n is an integer greater than or equal to one, m is an integer greater than or equal to zero, and the intersections are of different types; constructing a shortest relation of the delivery time by utilizing road sections and intersections meeting the path planning based on a preset shortest delivery time principle, and constructing a lowest relation of the delivery cost based on a preset lowest delivery cost principle;
the method for constructing the shortest relation of the delivery time by utilizing the road sections and the intersections meeting the path planning based on the shortest delivery time principle comprises the following steps:
acquiring theoretical traffic capacity of one lane in a road section i, and constructing a road section traffic relation by utilizing the theoretical traffic capacity, wherein the road section i is a road section meeting the path planning;
acquiring an ideal delivery speed of a drug delivery vehicle running on a road section i, and constructing a road section congestion relation by using the ideal delivery speed;
obtaining the average speed of a drug delivery vehicle passing through an intersection p, obtaining the intersection running speed, and constructing an intersection passing relation by using the intersection running speed;
Constructing a shortest distribution time relation based on the road section traffic relation and the road section congestion relation and the intersection traffic relation;
the road section traffic relation is as follows:
wherein (1)>For road section traffic relation->For the theoretical traffic capacity of the j-th lane in road section i,/th lane>For road section->Length of->Whether or not the vehicle is passing through the road section->If the road section is passed +.>Then->Taking 1, otherwise taking 0,>for the lane reduction factor +.>For the crossing reduction factor, < >>For the lane width reduction factor, +.>An average travel speed of the drug delivery vehicle on road section i;
the road section congestion relation is as follows:
wherein (1)>Representing road congestion relations->For the actual vehicle flow of the drug delivery vehicle through section i,/->For the daily congestion factor of road section i, +.>Is an ideal dispensing speed;
the intersection passing relation is as follows:
wherein (1)>Is crossing traffic relation->Indicating crossing->Coefficient of passage of->For the average arrival rate of the vehicle flow in road section i when it reaches the next road section through intersection p,/>For the distance traveled by a drug delivery vehicle from road section i through intersection p to the next road section, +.>Crossing for drug delivery vehicle>Average speed of >Judging parameters for judging whether the drug delivery vehicle passes through the intersection p, if so, the drug delivery vehicle is +.>Taking 1, otherwise taking 0;
the shortest relation of the delivery time is as follows:
wherein (1)>For the shortest distribution time, +.>Judging parameters of traffic control for road section i, if the road sectioni traffic control, then->Get->Otherwise, taking 0;
the lowest relation of the distribution cost is as follows:
wherein (1)>Representing the lowest relation of distribution cost->Representing drug delivery vehicle fixed delegation costs, +.>Representing cost per unit distance of drug delivery vehicle, < >>The distance to be travelled for the drug delivery vehicle to complete the drug delivery is +.>Representing cost per unit time of drug delivery vehicle, < >>The time required to complete the drug delivery for the drug delivery vehicle;
the medicine order processing module is used for calculating the medicine delivery volume of the medicine required in the delivery order by using a preset volume formula, and the volume formula is as follows:
wherein (1)>Representing the volume of drug dispensed, +.>Is a medicine->Is a medicine box length->Is a medicine->Is a medicine box width->Is a medicine->Is a medicine box height->Is a medicine->Is the number of (3); judging whether the distribution order is an emergency order or not according to the remark information; if the delivery order is an emergency order, confirming a drug delivery vehicle from various vehicles meeting the delivery requirement according to the drug delivery volume, wherein the delivery time of the drug delivery vehicle meets the shortest delivery time relation; if the delivery order is not an emergency order, confirming a drug delivery vehicle from various vehicles meeting delivery requirements according to the drug delivery volume, wherein the delivery cost of the drug delivery vehicle meets the lowest delivery cost relation;
The drug order delivery module is used for determining a delivery path according to the delivery end point and the delivery start point, acquiring real-time road conditions of the delivery path, obtaining initial road conditions, and planning the delivery path by utilizing the initial road conditions to obtain the initial path; driving a drug delivery vehicle to go to a delivery end point according to the initial path, detecting the position information of the drug delivery vehicle in real time, acquiring real-time road conditions based on the position information of the drug delivery vehicle, obtaining analysis road conditions, and judging whether the road conditions of the delivery path change or not according to the analysis road conditions and the initial road conditions; if the road condition of the distribution path is not changed, prompting the vehicle to distribute according to the initial path; if the road condition of the delivery path changes, planning the delivery path by utilizing the analysis road condition to obtain a target path, and prompting the drug delivery vehicle to deliver the drug according to the target path.
In order to solve the above-mentioned problems, the present invention also provides an electronic apparatus including:
a memory storing at least one instruction; a kind of electronic device with high-pressure air-conditioning system
And the processor executes the instructions stored in the memory to realize the medicine real-time distribution method based on the big data combined with the Internet of things.
In order to solve the above problems, the present invention further provides a computer readable storage medium, where at least one instruction is stored, where the at least one instruction is executed by a processor in an electronic device to implement the above-mentioned real-time drug delivery method based on big data combined with internet of things.
To solve the problems described in the background art. The embodiment of the invention obtains the order information of the delivery order, and confirms the delivery center according to the order information, wherein the order information comprises the following steps: z medicines, the quantity of each medicine, a delivery terminal and remark information for judging whether the delivery order is an emergency order, the delivery center contains various medicines meeting the order requirement and various vehicles meeting the delivery requirement, and the medicine delivery volume of the medicines required in the delivery order is calculated by utilizing a preset volume formula. Therefore, the medicine real-time distribution method, the device, the electronic equipment and the computer readable storage medium based on the big data combined Internet of things can solve the problems that the current medicine real-time distribution has single distribution vehicle category and poor real-time planning performance on distribution paths.
Drawings
Fig. 1 is a flow chart of a real-time drug delivery method based on big data combined with internet of things according to an embodiment of the present invention;
FIG. 2 is a functional block diagram of a real-time drug delivery device based on big data combined with Internet of things according to an embodiment of the present invention;
fig. 3 is a schematic structural diagram of an electronic device for implementing the real-time drug delivery method based on big data combined with internet of things according to an embodiment of the present invention.
The achievement of the objects, functional features and advantages of the present invention will be further described with reference to the accompanying drawings, in conjunction with the embodiments.
Detailed Description
It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the invention.
The embodiment of the application provides a real-time drug delivery method based on big data combined with the Internet of things. The execution main body of the medicine real-time distribution method based on big data combined with the Internet of things comprises at least one of electronic equipment, such as a server side, a terminal and the like, which can be configured to execute the method provided by the embodiment of the application. In other words, the big data combined internet of things-based medicine real-time delivery method can be executed by software or hardware installed in a terminal device or a server device, and the software can be a blockchain platform. The service end includes but is not limited to: a single server, a server cluster, a cloud server or a cloud server cluster, and the like.
Referring to fig. 1, a flow chart of a real-time drug delivery method based on big data combined with internet of things according to an embodiment of the present invention is shown. In this embodiment, the method for real-time drug delivery based on big data combined with internet of things includes:
s1, acquiring order information of a delivery order, and confirming a delivery center according to the order information, wherein the order information comprises: z medicines, the quantity of each medicine, the distribution terminal point and remark information for judging whether a distribution order is an emergency order, wherein Z is an integer greater than or equal to one, and the distribution center contains various medicines meeting the order requirement and various vehicles meeting the distribution requirement.
It should be explained that the order information of the delivery order is generally obtained from the e-commerce platform. In addition, the distribution center is used as a starting point of drug distribution, all distribution vehicles meeting the distribution requirement need to return to the distribution center after completing order distribution, and diseases are predicted and timely updated or replaced according to the geographic position of the distribution center and the combination of local environment, climate, eating habits, epidemic virus high-incidence period and the like.
Further, various vehicles meeting the delivery requirements are provided with the function of storing and transporting medicines, and in addition, the only criterion for measuring the medicine loading capacity is the medicine delivery volume, the maximum speed of different types of vehicles meeting the delivery requirements is generally different, and the various vehicles meeting the delivery requirements are all provided with GPS (global positioning system) for acquiring the positions of the vehicles.
It will be appreciated that the dispensing endpoint is a medication dispensing address reserved by the customer at the time of purchase of the medication.
The method comprises the steps of taking a box of medicine A from an electronic commerce platform, remarking that the order is an emergency delivery order, and requiring the medicine A to be delivered to a Z region, wherein the medicine A needs to be stored at a low temperature, calculating the volume of the box of medicine A, optimizing according to the shortest delivery time principle according to the volume and the order as the emergency order, and returning a medicine delivery vehicle to a delivery center after the medicine A is delivered to the Z region.
S2, obtaining a road network of a distribution area, wherein a plurality of roads meeting the path planning are arranged in the distribution area, the distribution area comprises a distribution starting point and a distribution end point, the roads in the distribution area are divided into intersections and road sections, n road sections and m intersections meeting the path planning are obtained, n is an integer greater than or equal to one, m is an integer greater than or equal to zero, and the intersections are of different types.
Further, the road network is a road which is formed by various roads and is mutually connected and interweaved into a net distribution in a certain area.
It is understood that the delivery area is an area including a delivery start point and a delivery end point, and the delivery path is not unique.
It is to be explained that the roads in the distribution area are divided into intersections and road sections, and whether the distribution start point and the distribution end point are positioned on the same road section is judged;
if the distribution starting point and the distribution ending point are positioned on the same road section, the minimum road section number meeting the path planning is one, the minimum road junction number is zero, wherein x lanes are arranged in the road section, x is an integer greater than or equal to one, and the divided road section is also marked as a road section when the divided road section is not a complete road section;
and if the distribution starting point and the distribution ending point are positioned on different road sections, obtaining n road sections and m intersections meeting the path planning.
Further, intersections can be geometrically divided into: cross-shaped intersections, circular intersections, X-shaped intersections, T-shaped intersections, Y-shaped intersections, staggered intersections and multi-way intersections.
And S3, constructing a shortest relation of the delivery time by utilizing a road section and an intersection meeting the path planning based on a preset shortest delivery time principle, and constructing a lowest relation of the delivery cost based on a preset lowest delivery cost principle.
It will be appreciated that the meaning of constructing the shortest relationship for delivery time cannot be measured in terms of money when the customer specifies the medication required for his or her condition.
Further, the theoretical traffic capacity of one lane in the road section i is obtained, a road section traffic relation is built by utilizing the theoretical traffic capacity, wherein the road section i is a road section meeting the path planning, the ideal delivery speed of the drug delivery vehicle on the road section i is obtained, the road section congestion relation is built by utilizing the ideal delivery speed, the average speed of the drug delivery vehicle passing through the road junction p is obtained, the road junction running speed is obtained, the road junction traffic relation is built by utilizing the road junction running speed, and the shortest delivery time relation is built on the basis of the road section traffic relation, the road section congestion relation and the road junction traffic relation.
It can be understood that the road section traffic relation is:
wherein (1)>For road section traffic relation->For the theoretical traffic capacity of the j-th lane in road section i,/th lane>For road section->Length of->Whether or not the vehicle is passing through the road section->If the road section is passed +.>Then->Taking 1, otherwise taking 0,>for the lane reduction factor +.>For the crossing reduction factor, < >>For the lane width reduction factor, +.>The average travel speed of the drug delivery vehicle over road segment i.
Further, the road section congestion relation is:
wherein, the liquid crystal display device comprises a liquid crystal display device,representing road congestion relations- >For the actual vehicle flow of the drug delivery vehicle through section i,/->For the daily congestion factor of road section i, +.>Is the ideal dispensing speed.
It can be understood that the road congestion relation establishes that the road is subjected to factors such as weather, traffic light waiting time, traffic flow and the like, so that the running time of the drug delivery vehicle is prolonged.
It is understood that drug delivery vehicles are also unable to avoid encountering road congestion based on the time-minimization principle. Illustratively, based on the shortest delivery time principle, delivery of the drug may be accomplished when the drug delivery vehicle passes through the congested road segment I. At this time, the delivery path I is planned to obtain the delivery path I, and the time required for driving the drug delivery vehicle according to the delivery path I is much longer than the time required for the drug delivery vehicle to pass through the congestion section I. Therefore, the drug delivery vehicle cannot avoid traveling through the congested road segment based on the shortest delivery time principle.
It should be explained that the intersection traffic relation is:
wherein (1)>Is crossing traffic relation->Indicating crossing->Coefficient of passage of->For the average arrival rate of the vehicle flow in road section i when it reaches the next road section through intersection p,/>For the distance traveled by a drug delivery vehicle from road section i through intersection p to the next road section, +. >Crossing for drug delivery vehicle>Average speed of>Judging parameters for judging whether the drug delivery vehicle passes through the intersection p, if so, the drug delivery vehicle is +.>Taking 1, otherwise taking 0.
It should be explained that the intersection passing relation establishes that the average arrival rate of the vehicles at different types of road intersections, intersection lengths and vehicle flows can influence the intersection passing time of the vehicles when the drug delivery vehicles pass through different types of intersection relations. Therefore, the traffic at the intersection cannot simply construct a relation according to the traffic at the road section. Further, the shortest relation of the delivery time is:
wherein (1)>For the shortest distribution time, +.>Judging parameters of the traffic control for the road section i, if the road section i is under the traffic control, the road section i is under the traffic control +.>Get->Otherwise, take 0.
It is understood that traffic control is a control measure for the passage of vehicles and people over part or all of a traffic segment for some safety reason.
It should be explained that the lowest relation of the distribution cost is:
wherein (1)>Representing the lowest relation of distribution cost->Representing drug delivery vehicle fixed delegation costs, +.>Representing cost per unit distance of drug delivery vehicle, < >>The distance to be travelled for the drug delivery vehicle to complete the drug delivery is +. >Representing cost per unit time of drug delivery vehicle, < >>The time required to complete the drug delivery for the drug delivery vehicle.
Furthermore, the cost per unit time of the drug delivery vehicle is introduced when the lowest delivery cost relation is constructed, so that the drug delivery vehicle has certain timeliness while meeting the lowest delivery cost.
S4, calculating the medicine dispensing volume of the medicine required in the dispensing order by using a preset volume formula.
Further, the volume formula is:
wherein, the liquid crystal display device comprises a liquid crystal display device,representing the volume of drug dispensed, +.>Is a medicine->Is a medicine box length->Is a medicine->Is a medicine box width->Is a medicine->Is a medicine box height->Is a medicine->Is a number of (3).
It will be appreciated that the two major factors that measure the dispensing criteria are mass and volume, and that considering that the volume of a typical drug has a much greater effect on dispensing than mass, the drug dispensing volume is selected as the primary factor for identifying the drug dispensing vehicle.
S5, judging whether the delivery order is an emergency order or not according to the remark information.
In detail, if the delivery order is an emergency order, S6 is executed to confirm the drug delivery vehicle from among various vehicles satisfying the delivery demand according to the drug delivery volume, wherein the drug delivery vehicle satisfies the delivery time minimum principle.
If the delivery order is not an emergency order, S7 is executed, and the drug delivery vehicle is confirmed from various vehicles meeting the delivery requirement according to the drug delivery volume, wherein the drug delivery vehicle meets the delivery cost minimum principle.
And S8, determining a delivery path according to the delivery end point and the delivery start point, acquiring real-time road conditions of the delivery path, obtaining initial road conditions, and planning the delivery path by utilizing the initial road conditions to obtain the initial path.
It should be explained that path planning is one of the main study contents of motion planning. The motion planning consists of path planning and track planning, the sequence points or curves connecting the start position and the end position are called paths, and the strategy for forming the paths is called path planning.
The method includes the steps of determining a delivery path A according to a delivery end point and a delivery start point, obtaining real-time road conditions of the delivery path A, obtaining initial road conditions, and finding that a road segment B in the path A cannot pass through due to traffic control. And planning the delivery path A by using the initial road condition to obtain a delivery path C, wherein the delivery path C avoids that the road section B cannot pass due to traffic control.
And S9, driving the drug delivery vehicle to go to a delivery end point according to the initial path, detecting the position information of the drug delivery vehicle in real time, and acquiring real-time road conditions based on the position information of the drug delivery vehicle to obtain analysis road conditions.
In detail, the position of the drug delivery vehicle is detected to obtain position information, real-time road conditions are obtained by utilizing preset ITS based on the position information, and analysis road conditions are obtained.
It is understood that ITS is an intelligent transportation system that can be used to obtain real-time traffic road information. Actuation of the drug delivery vehicle is typically initiated by a drug delivery person.
And S10, judging whether the road condition of the distribution path changes or not according to the analysis road condition and the initial road condition.
In detail, if the road condition of the delivery path is not changed, executing S11 to prompt the vehicle to deliver according to the initial path.
And if the road condition of the delivery path changes, executing S12, planning the delivery path by using the analyzed road condition to obtain a target path, and prompting the drug delivery vehicle to deliver the drug according to the target path.
Further, the judging standard of whether the road condition of the delivery path changes or not includes a delivery time shortest relation established based on a delivery time shortest principle and a delivery cost lowest relation established based on a delivery cost lowest principle.
To solve the problems described in the background art. The embodiment of the invention obtains the order information of the delivery order, and confirms the delivery center according to the order information, wherein the order information comprises the following steps: z medicines, the quantity of each medicine, a delivery terminal and remark information for judging whether the delivery order is an emergency order, the delivery center contains various medicines meeting the order requirement and various vehicles meeting the delivery requirement, and the medicine delivery volume of the medicines required in the delivery order is calculated by utilizing a preset volume formula. Therefore, the medicine real-time distribution method, the device, the electronic equipment and the computer readable storage medium based on the big data combined Internet of things can solve the problems that the current medicine real-time distribution has single distribution vehicle category and poor real-time planning performance on distribution paths.
Fig. 2 is a functional block diagram of a real-time drug delivery device based on big data combined with internet of things according to an embodiment of the present invention.
The medicine real-time distribution device 100 based on big data combined with the Internet of things can be installed in electronic equipment. Depending on the functions implemented, the big data combined internet of things based drug real-time delivery device 100 may include a drug order receiving module 101, a drug delivery standard building module 102, a drug order processing module 103, and a drug order delivery module 104. The module of the invention, which may also be referred to as a unit, refers to a series of computer program segments, which are stored in the memory of the electronic device, capable of being executed by the processor of the electronic device and of performing a fixed function.
The drug order receiving module 101 is configured to obtain order information of a delivery order, and confirm a delivery center according to the order information, where the order information includes: z medicines, the quantity of each medicine, the distribution terminal point and remark information for judging whether a distribution order is an emergency order, wherein Z is an integer greater than or equal to one, and the distribution center contains various medicines meeting the order requirement and various vehicles meeting the distribution requirement;
The drug delivery standard construction module 102 is configured to obtain a road network of a delivery area, where the delivery area has a plurality of roads meeting a path plan, the delivery area includes a delivery start point and a delivery end point, the roads in the delivery area are divided into intersections and road segments, n road segments and m intersections meeting the path plan are obtained, n is an integer greater than or equal to one, m is an integer greater than or equal to zero, and the intersections are of different types; constructing a shortest relation of the delivery time by utilizing road sections and intersections meeting the path planning based on a preset shortest delivery time principle, and constructing a lowest relation of the delivery cost based on a preset lowest delivery cost principle;
the method for constructing the shortest relation of the delivery time by utilizing the road sections and the intersections meeting the path planning based on the shortest delivery time principle comprises the following steps:
acquiring theoretical traffic capacity of one lane in a road section i, and constructing a road section traffic relation by utilizing the theoretical traffic capacity, wherein the road section i is a road section meeting the path planning;
acquiring an ideal delivery speed of a drug delivery vehicle running on a road section i, and constructing a road section congestion relation by using the ideal delivery speed;
obtaining the average speed of a drug delivery vehicle passing through an intersection p, obtaining the intersection running speed, and constructing an intersection passing relation by using the intersection running speed;
Constructing a shortest distribution time relation based on the road section traffic relation and the road section congestion relation and the intersection traffic relation;
the road section traffic relation is as follows:
wherein (1)>For road section traffic relation->For the theoretical traffic capacity of the j-th lane in road section i,/th lane>For road section->Length of->Whether or not the vehicle is passing through the road section->If the road section is passed +.>Then->Taking 1, otherwise taking 0,>for the lane reduction factor +.>For the crossing reduction factor, < >>For the lane width reduction factor, +.>An average travel speed of the drug delivery vehicle on road section i;
the road section congestion relation is as follows:
wherein (1)>Representing road congestion relations->For the actual vehicle flow of the drug delivery vehicle through section i,/->For the daily congestion factor of road section i, +.>Is an ideal dispensing speed;
the intersection passing relation is as follows:
wherein (1)>Is crossing traffic relation->Indicating crossing->Coefficient of passage of->For the average arrival rate of the vehicle flow in road section i when it reaches the next road section through intersection p,/>For the distance traveled by a drug delivery vehicle from road section i through intersection p to the next road section, +.>Crossing for drug delivery vehicle>Average speed of >Judging parameters for judging whether the drug delivery vehicle passes through the intersection p, if so, the drug delivery vehicle is +.>Taking 1, otherwise taking 0;
the shortest relation of the delivery time is as follows:
wherein (1)>For the shortest distribution time, +.>Judging parameters of traffic control for road section i, ifRoad section i is traffic-controlled, then->Get->Otherwise, taking 0;
the lowest relation of the distribution cost is as follows:
wherein (1)>Representing the lowest relation of distribution cost->Representing drug delivery vehicle fixed delegation costs, +.>Representing cost per unit distance of drug delivery vehicle, < >>The distance to be travelled for the drug delivery vehicle to complete the drug delivery is +.>Representing cost per unit time of drug delivery vehicle, < >>The time required to complete the drug delivery for the drug delivery vehicle;
the medicine order processing module 103 is configured to calculate a medicine dispensing volume of a medicine required in a dispensing order by using a preset volume formula, where the volume formula is:
wherein (1)>Representing drug deliveryVolume (I)>Is a medicine->Is a medicine box length->Is a medicine->Is a medicine box width->Is a medicine->Is a medicine box height->Is a medicine->Is the number of (3); judging whether the distribution order is an emergency order or not according to the remark information; if the delivery order is an emergency order, confirming a drug delivery vehicle from various vehicles meeting the delivery requirement according to the drug delivery volume, wherein the delivery time of the drug delivery vehicle meets the shortest delivery time relation; if the delivery order is not an emergency order, confirming a drug delivery vehicle from various vehicles meeting delivery requirements according to the drug delivery volume, wherein the delivery cost of the drug delivery vehicle meets the lowest delivery cost relation;
The drug order delivery module 104 is configured to determine a delivery path according to the delivery end point and the delivery start point, obtain a real-time road condition of the delivery path, obtain an initial road condition, and plan the delivery path by using the initial road condition to obtain the initial path; driving a drug delivery vehicle to go to a delivery end point according to the initial path, detecting the position information of the drug delivery vehicle in real time, acquiring real-time road conditions based on the position information of the drug delivery vehicle, obtaining analysis road conditions, and judging whether the road conditions of the delivery path change or not according to the analysis road conditions and the initial road conditions; if the road condition of the distribution path is not changed, prompting the vehicle to distribute according to the initial path; if the road condition of the delivery path changes, planning the delivery path by utilizing the analysis road condition to obtain a target path, and prompting the drug delivery vehicle to deliver the drug according to the target path.
In detail, the modules in the hospital information management device 100 based on the internet of things in the embodiment of the present invention use the same technical means as the above-mentioned product supply chain management method based on the blockchain in fig. 1, and can produce the same technical effects, which are not described herein.
Fig. 3 is a schematic structural diagram of an electronic device for implementing a method for real-time drug delivery based on big data combined with internet of things according to an embodiment of the present invention.
The electronic device 1 may comprise a processor 10, a memory 11 and a bus, and may further comprise a computer program stored in the memory 11 and executable on the processor 10, such as a real-time drug delivery method program 12 based on big data combined with the internet of things.
The memory 11 includes at least one type of readable storage medium, including flash memory, a mobile hard disk, a multimedia card, a card memory (e.g., SD or DX memory, etc.), a magnetic memory, a magnetic disk, an optical disk, etc. The memory 11 may in some embodiments be an internal storage unit of the electronic device 1, such as a removable hard disk of the electronic device 1. The memory 11 may in other embodiments also be an external storage device of the electronic device 1, such as a plug-in mobile hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card) or the like, which are provided on the electronic device 1. Further, the memory 11 may also include both an internal storage unit and an external storage device of the electronic device 1. The memory 11 may be used to store not only application software installed in the electronic device 1 and various data, such as codes of the real-time drug delivery method program 12 based on big data combined with internet of things, but also temporarily store data that has been output or is to be output.
The processor 10 may be comprised of integrated circuits in some embodiments, for example, a single packaged integrated circuit, or may be comprised of multiple integrated circuits packaged with the same or different functions, including one or more central processing units (Central Processing unit, CPU), microprocessors, digital processing chips, graphics processors, combinations of various control chips, and the like. The processor 10 is a Control Unit (Control Unit) of the electronic device, connects various components of the entire electronic device using various interfaces and lines, executes or executes programs or modules (e.g., a medicine real-time delivery method program based on big data combined with the internet of things, etc.) stored in the memory 11, and invokes data stored in the memory 11 to perform various functions of the electronic device 1 and process the data.
The bus may be a peripheral component interconnect standard (peripheral component interconnect, PCI) bus or an extended industry standard architecture (extended industry standard architecture, EISA) bus, among others. The bus may be classified as an address bus, a data bus, a control bus, etc. The bus is arranged to enable a connection communication between the memory 11 and at least one processor 10 etc.
Fig. 3 shows only an electronic device with components, it being understood by a person skilled in the art that the structure shown in fig. 3 does not constitute a limitation of the electronic device 1, and may comprise fewer or more components than shown, or may combine certain components, or may be arranged in different components.
For example, although not shown, the electronic device 1 may further include a power source (such as a battery) for supplying power to each component, and preferably, the power source may be logically connected to the at least one processor 10 through a power management device, so that functions of charge management, discharge management, power consumption management, and the like are implemented through the power management device. The power supply may also include one or more of any of a direct current or alternating current power supply, recharging device, power failure detection circuit, power converter or inverter, power status indicator, etc. The electronic device 1 may further include various sensors, bluetooth modules, wi-Fi modules, etc., which will not be described herein.
Further, the electronic device 1 may also comprise a network interface, optionally the network interface may comprise a wired interface and/or a wireless interface (e.g. WI-FI interface, bluetooth interface, etc.), typically used for establishing a communication connection between the electronic device 1 and other electronic devices.
The electronic device 1 may optionally further comprise a user interface, which may be a Display, an input unit, such as a Keyboard (Keyboard), or a standard wired interface, a wireless interface. Alternatively, in some embodiments, the display may be an LED display, a liquid crystal display, a touch-sensitive liquid crystal display, an OLED (Organic Light-Emitting Diode) touch, or the like. The display may also be referred to as a display screen or display unit, as appropriate, for displaying information processed in the electronic device 1 and for displaying a visual user interface.
It should be understood that the embodiments described are for illustrative purposes only and are not limited to this configuration in the scope of the patent application.
The real-time drug delivery method program 12 stored in the memory 11 of the electronic device 1 and based on big data and internet of things is a combination of a plurality of instructions, and when running in the processor 10, it can be implemented:
acquiring order information of a delivery order, and confirming a delivery center according to the order information, wherein the order information comprises: z medicines, the quantity of each medicine, the distribution terminal point and remark information for judging whether a distribution order is an emergency order, wherein Z is an integer greater than or equal to one, and the distribution center contains various medicines meeting the order requirement and various vehicles meeting the distribution requirement;
Obtaining a road network of a distribution area, wherein a plurality of roads meeting the path planning are arranged in the distribution area, the distribution area comprises a distribution starting point and a distribution ending point, the roads in the distribution area are divided into intersections and road sections, n road sections meeting the path planning and m road sections are obtained, n is an integer greater than or equal to one, m is an integer greater than or equal to zero, and the intersections are of different types;
constructing a shortest relation of the delivery time by utilizing road sections and intersections meeting the path planning based on a preset shortest delivery time principle, and constructing a lowest relation of the delivery cost based on a preset lowest delivery cost principle;
the method for constructing the shortest relation of the delivery time by utilizing the road sections and the intersections meeting the path planning based on the shortest delivery time principle comprises the following steps:
acquiring theoretical traffic capacity of one lane in a road section i, and constructing a road section traffic relation by utilizing the theoretical traffic capacity, wherein the road section i is a road section meeting the path planning;
acquiring an ideal delivery speed of a drug delivery vehicle running on a road section i, and constructing a road section congestion relation by using the ideal delivery speed;
obtaining the average speed of a drug delivery vehicle passing through an intersection p, obtaining the intersection running speed, and constructing an intersection passing relation by using the intersection running speed;
Constructing a shortest distribution time relation based on the road section traffic relation and the road section congestion relation and the intersection traffic relation;
the road section traffic relation is as follows:
wherein (1)>For road section traffic relation->For the theoretical traffic capacity of the j-th lane in road section i,/th lane>For road section->Length of->Whether or not the vehicle is passing through the road section->If the road section is passed +.>Then->Taking 1, otherwise taking 0,>for the lane reduction factor +.>For the crossing reduction factor, < >>For the lane width reduction factor, +.>An average travel speed of the drug delivery vehicle on road section i;
the road section congestion relation is as follows:
wherein (1)>Representing road congestion relations->For the actual vehicle flow of the drug delivery vehicle through section i,/->For the daily congestion factor of road section i, +.>Is an ideal dispensing speed;
the intersection passing relation is as follows:
wherein (1)>Is crossing traffic relation->Indicating crossing->Coefficient of passage of->For the average arrival rate of the vehicle flow in road section i when it reaches the next road section through intersection p,/>For the distance traveled by a drug delivery vehicle from road section i through intersection p to the next road section, +.>Crossing for drug delivery vehicle>Average speed of >Judging parameters for judging whether the drug delivery vehicle passes through the intersection p, if so, the drug delivery vehicle is +.>Taking 1, otherwise taking 0;
the shortest relation of the delivery time is as follows:
wherein (1)>For the shortest distribution time, +.>Judging parameters of the traffic control for the road section i, if the road section i is under the traffic control, the road section i is under the traffic control +.>Get->Otherwise, taking 0;
the lowest relation of the distribution cost is as follows:
wherein (1)>Representing the lowest relation of distribution cost->Representing drug delivery vehicle fixed delegation costs, +.>Representing cost per unit distance of drug delivery vehicle, < >>The distance to be travelled for the drug delivery vehicle to complete the drug delivery is +.>Representing cost per unit time of drug delivery vehicle, < >>The time required to complete the drug delivery for the drug delivery vehicle;
calculating the medicine dispensing volume of the medicine required in the dispensing order by using a preset volume formula, wherein the volume formula is as follows:
wherein (1)>Representing the volume of drug dispensed, +.>Is a medicine->Is a medicine box length->Is a medicine->Is a medicine box width->Is a medicine->Is a medicine box height->Is a medicine->Is the number of (3);
judging whether the distribution order is an emergency order or not according to the remark information;
if the delivery order is an emergency order, confirming a drug delivery vehicle from various vehicles meeting the delivery requirement according to the drug delivery volume, wherein the delivery time of the drug delivery vehicle meets the shortest delivery time relation;
If the delivery order is not an emergency order, confirming a drug delivery vehicle from various vehicles meeting delivery requirements according to the drug delivery volume, wherein the delivery cost of the drug delivery vehicle meets the lowest delivery cost relation;
determining a delivery path according to the delivery end point and the delivery start point, acquiring real-time road conditions of the delivery path, obtaining initial road conditions, and planning the delivery path by utilizing the initial road conditions to obtain the initial path;
driving a drug delivery vehicle to go to a delivery end point according to the initial path, detecting the position information of the drug delivery vehicle in real time, acquiring real-time road conditions based on the position information of the drug delivery vehicle, obtaining analysis road conditions, and judging whether the road conditions of the delivery path change or not according to the analysis road conditions and the initial road conditions;
if the road condition of the distribution path is not changed, prompting the vehicle to distribute according to the initial path;
if the road condition of the delivery path changes, planning the delivery path by utilizing the analysis road condition to obtain a target path, and prompting the drug delivery vehicle to deliver the drug according to the target path.
Specifically, the specific implementation method of the above instructions by the processor 10 may refer to descriptions of related steps in the corresponding embodiments of fig. 1 to 3, which are not repeated herein.
Further, the modules/units integrated in the electronic device 1 may be stored in a computer readable storage medium if implemented in the form of software functional units and sold or used as separate products. The computer readable storage medium may be volatile or nonvolatile. For example, the computer readable medium may include: any entity or device capable of carrying the computer program code, a recording medium, a U disk, a removable hard disk, a magnetic disk, an optical disk, a computer Memory, a Read-Only Memory (ROM).
The present invention also provides a computer readable storage medium storing a computer program which, when executed by a processor of an electronic device, can implement:
acquiring order information of a delivery order, and confirming a delivery center according to the order information, wherein the order information comprises: z medicines, the quantity of each medicine, the distribution terminal point and remark information for judging whether a distribution order is an emergency order, wherein Z is an integer greater than or equal to one, and the distribution center contains various medicines meeting the order requirement and various vehicles meeting the distribution requirement;
Obtaining a road network of a distribution area, wherein a plurality of roads meeting the path planning are arranged in the distribution area, the distribution area comprises a distribution starting point and a distribution ending point, the roads in the distribution area are divided into intersections and road sections, n road sections meeting the path planning and m road sections are obtained, n is an integer greater than or equal to one, m is an integer greater than or equal to zero, and the intersections are of different types;
constructing a shortest relation of the delivery time by utilizing road sections and intersections meeting the path planning based on a preset shortest delivery time principle, and constructing a lowest relation of the delivery cost based on a preset lowest delivery cost principle;
the method for constructing the shortest relation of the delivery time by utilizing the road sections and the intersections meeting the path planning based on the shortest delivery time principle comprises the following steps:
acquiring theoretical traffic capacity of one lane in a road section i, and constructing a road section traffic relation by utilizing the theoretical traffic capacity, wherein the road section i is a road section meeting the path planning;
acquiring an ideal delivery speed of a drug delivery vehicle running on a road section i, and constructing a road section congestion relation by using the ideal delivery speed;
obtaining the average speed of a drug delivery vehicle passing through an intersection p, obtaining the intersection running speed, and constructing an intersection passing relation by using the intersection running speed;
Constructing a shortest distribution time relation based on the road section traffic relation and the road section congestion relation and the intersection traffic relation;
the road section traffic relation is as follows:
wherein (1)>For road section traffic relation->For the theoretical traffic capacity of the j-th lane in road section i,/th lane>For road section->Length of->Whether or not the vehicle is passing through the road section->If the road section is passed +.>Then->Taking 1, otherwise taking 0,>for the lane reduction factor +.>For the crossing reduction factor, < >>For the lane width reduction factor, +.>An average travel speed of the drug delivery vehicle on road section i;
the road section congestion relation is as follows:
wherein (1)>Representing road congestion relations->For the actual vehicle flow of the drug delivery vehicle through section i,/->For the daily congestion factor of road section i, +.>Is an ideal dispensing speed;
the intersection passing relation is as follows:
wherein (1)>Is crossing traffic relation->Indicating crossing->Coefficient of passage of->For the average arrival rate of the vehicle flow in road section i when it reaches the next road section through intersection p,/>For the distance traveled by a drug delivery vehicle from road section i through intersection p to the next road section, +.>Crossing for drug delivery vehicle>Average speed of >Judging parameters for judging whether the drug delivery vehicle passes through the intersection p, if so, the drug delivery vehicle is +.>Taking 1, otherwise taking 0;
the shortest relation of the delivery time is as follows:
wherein, the liquid crystal display device comprises a liquid crystal display device,for the shortest distribution time, +.>Judging parameters of the traffic control for the road section i, if the road section i is under the traffic control, the road section i is under the traffic control +.>Get->Otherwise, taking 0;
the lowest relation of the distribution cost is as follows:
wherein, the liquid crystal display device comprises a liquid crystal display device,representing the lowest relation of distribution cost->Representing drug delivery vehicle fixed delegation costs, +.>Representing cost per unit distance of drug delivery vehicle, < >>The distance to be travelled for the drug delivery vehicle to complete the drug delivery is +.>Representing cost per unit time of drug delivery vehicle, < >>The time required to complete the drug delivery for the drug delivery vehicle;
calculating the medicine dispensing volume of the medicine required in the dispensing order by using a preset volume formula, wherein the volume formula is as follows:
wherein (1)>Representing the volume of drug dispensed, +.>Is a medicine->Is a medicine box length->Is a medicine->Is a medicine box width->Is a medicine->Is a medicine box height->Is a medicine->Is the number of (3);
judging whether the distribution order is an emergency order or not according to the remark information;
if the delivery order is an emergency order, confirming a drug delivery vehicle from various vehicles meeting the delivery requirement according to the drug delivery volume, wherein the delivery time of the drug delivery vehicle meets the shortest delivery time relation;
If the delivery order is not an emergency order, confirming a drug delivery vehicle from various vehicles meeting delivery requirements according to the drug delivery volume, wherein the delivery cost of the drug delivery vehicle meets the lowest delivery cost relation;
determining a delivery path according to the delivery end point and the delivery start point, acquiring real-time road conditions of the delivery path, obtaining initial road conditions, and planning the delivery path by utilizing the initial road conditions to obtain the initial path;
driving a drug delivery vehicle to go to a delivery end point according to the initial path, detecting the position information of the drug delivery vehicle in real time, acquiring real-time road conditions based on the position information of the drug delivery vehicle, obtaining analysis road conditions, and judging whether the road conditions of the delivery path change or not according to the analysis road conditions and the initial road conditions;
if the road condition of the distribution path is not changed, prompting the vehicle to distribute according to the initial path;
if the road condition of the delivery path changes, planning the delivery path by utilizing the analysis road condition to obtain a target path, and prompting the drug delivery vehicle to deliver the drug according to the target path.
In the several embodiments provided in the present invention, it should be understood that the disclosed apparatus, device and method may be implemented in other manners. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the modules is merely a logical function division, and there may be other manners of division when actually implemented.
The modules described as separate components may or may not be physically separate, and components shown as modules may or may not be physical units, may be located in one place, or may be distributed over multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional module in the embodiments of the present invention may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units can be realized in a form of hardware or a form of hardware and a form of software functional modules.
It will be evident to those skilled in the art that the invention is not limited to the details of the foregoing illustrative embodiments, and that the present invention may be embodied in other specific forms without departing from the spirit or essential characteristics thereof.
The present embodiments are, therefore, to be considered in all respects as illustrative and not restrictive, the scope of the invention being indicated by the appended claims rather than by the foregoing description, and all changes which come within the meaning and range of equivalency of the claims are therefore intended to be embraced therein. Any reference signs in the claims shall not be construed as limiting the claim concerned.
The blockchain is a novel application mode of computer technologies such as distributed data storage, point-to-point transmission, consensus mechanism, encryption algorithm and the like. The Blockchain (Blockchain), which is essentially a decentralised database, is a string of data blocks that are generated by cryptographic means in association, each data block containing a batch of information of network transactions for verifying the validity of the information (anti-counterfeiting) and generating the next block. The blockchain may include a blockchain underlying platform, a platform product services layer, an application services layer, and the like.
Furthermore, it is evident that the word "comprising" does not exclude other elements or steps, and that the singular does not exclude a plurality. A plurality of units or means recited in the system claims can also be implemented by means of software or hardware by means of one unit or means. The terms second, etc. are used to denote a name, but not any particular order.
Finally, it should be noted that the above-mentioned embodiments are merely for illustrating the technical solution of the present invention and not for limiting the same, and although the present invention has been described in detail with reference to the preferred embodiments, it should be understood by those skilled in the art that modifications and equivalents may be made to the technical solution of the present invention without departing from the spirit and scope of the technical solution of the present invention.
Claims (4)
1. A method for real-time delivery of a pharmaceutical product, the method comprising:
acquiring order information of a delivery order, and confirming a delivery center according to the order information, wherein the order information comprises: z medicines, the quantity of each medicine, the distribution terminal point and remark information for judging whether a distribution order is an emergency order, wherein Z is an integer greater than or equal to one, and the distribution center contains various medicines meeting the order requirement and various vehicles meeting the distribution requirement;
obtaining a road network of a distribution area, wherein a plurality of roads meeting the path planning are arranged in the distribution area, the distribution area comprises a distribution starting point and a distribution ending point, the roads in the distribution area are divided into intersections and road sections, n road sections meeting the path planning and m road sections are obtained, n is an integer greater than or equal to one, m is an integer greater than or equal to zero, and the intersections are of different types;
constructing a shortest relation of the delivery time by utilizing road sections and intersections meeting the path planning based on a preset shortest delivery time principle, and constructing a lowest relation of the delivery cost based on a preset lowest delivery cost principle;
the method for constructing the shortest relation of the delivery time by utilizing the road sections and the intersections meeting the path planning based on the shortest delivery time principle comprises the following steps:
Acquiring theoretical traffic capacity of one lane in a road section i, and constructing a road section traffic relation by utilizing the theoretical traffic capacity, wherein the road section i is a road section meeting the path planning;
acquiring an ideal delivery speed of a drug delivery vehicle running on a road section i, and constructing a road section congestion relation by using the ideal delivery speed;
obtaining the average speed of a drug delivery vehicle passing through an intersection p, obtaining the intersection running speed, and constructing an intersection passing relation by using the intersection running speed;
constructing a shortest distribution time relation based on the road section traffic relation and the road section congestion relation and the intersection traffic relation;
the road section traffic relation is as follows:
wherein (1)>For road section traffic relation->For the theoretical traffic capacity of the j-th lane in road section i,/th lane>For road section->Length of->Whether or not the vehicle is passing through the road section->If the road section is passed +.>Then->Taking 1, otherwise taking 0,>for the lane reduction factor +.>For the crossing reduction factor, < >>For the lane width reduction factor, +.>An average travel speed of the drug delivery vehicle on road section i;
the road section congestion relation is as follows:
wherein (1)>Representing road congestion relations->For the actual vehicle flow of the drug delivery vehicle through section i,/- >For the daily congestion factor of road section i, +.>Is an ideal dispensing speed;
the intersection passing relation is as follows:
wherein (1)>Is crossing traffic relation->Indicating crossing->Coefficient of passage of->For the average arrival rate of the vehicle flow in road section i when it reaches the next road section through intersection p,/>For drug delivery vehicles to reach from road section i through intersection pThe distance traveled in the next road segment>Crossing for drug delivery vehicle>Average speed of>Judging parameters for judging whether the drug delivery vehicle passes through the intersection p, if so, the drug delivery vehicle is +.>Taking 1, otherwise taking 0;
the shortest relation of the delivery time is as follows:
wherein (1)>For the shortest distribution time, +.>Judging parameters of the traffic control for the road section i, if the road section i is under the traffic control, the road section i is under the traffic control +.>Get->Otherwise, taking 0;
the lowest relation of the distribution cost is as follows:
wherein (1)>Representation ofDistribution cost minimum relation->Representing drug delivery vehicle fixed delegation costs, +.>Representing cost per unit distance of drug delivery vehicle, < >>The distance to be travelled for the drug delivery vehicle to complete the drug delivery is +.>Representing cost per unit time of drug delivery vehicle, < >>The time required to complete the drug delivery for the drug delivery vehicle;
Calculating the medicine dispensing volume of the medicine required in the dispensing order by using a preset volume formula, wherein the volume formula is as follows:
wherein (1)>Representing the volume of drug dispensed, +.>Is a medicine->Is a medicine box length->Is a medicine->Is a medicine box width->Is a medicine->Is a medicine box height->Is a medicine->Is the number of (3);
judging whether the distribution order is an emergency order or not according to the remark information;
if the delivery order is an emergency order, confirming a drug delivery vehicle from various vehicles meeting the delivery requirement according to the drug delivery volume, wherein the delivery time of the drug delivery vehicle meets the shortest delivery time relation;
if the delivery order is not an emergency order, confirming a drug delivery vehicle from various vehicles meeting delivery requirements according to the drug delivery volume, wherein the delivery cost of the drug delivery vehicle meets the lowest delivery cost relation;
determining a delivery path according to the delivery end point and the delivery start point, acquiring real-time road conditions of the delivery path, obtaining initial road conditions, and planning the delivery path by utilizing the initial road conditions to obtain the initial path;
driving a drug delivery vehicle to go to a delivery end point according to the initial path, detecting the position information of the drug delivery vehicle in real time, acquiring real-time road conditions based on the position information of the drug delivery vehicle, obtaining analysis road conditions, and judging whether the road conditions of the delivery path change or not according to the analysis road conditions and the initial road conditions;
If the road condition of the distribution path is not changed, prompting the vehicle to distribute according to the initial path;
if the road condition of the delivery path changes, planning the delivery path by utilizing the analysis road condition to obtain a target path, and prompting the drug delivery vehicle to deliver the drug according to the target path.
2. The method for real-time delivery of drugs according to claim 1, wherein the obtaining a road network of a preset delivery area, wherein the delivery area has a plurality of roads satisfying a path plan, the delivery area includes a delivery start point and a delivery end point, the roads in the delivery area are divided into intersections and road segments, and n road segments and m intersections satisfying the path plan are obtained, and the method comprises:
dividing roads in a distribution area into intersections and road sections, and judging whether a distribution starting point and a distribution terminal point are positioned on the same road section or not;
if the distribution starting point and the distribution ending point are positioned on the same road section, the minimum road section number meeting the path planning is one, the minimum road junction number is zero, wherein x lanes are arranged in the road section, x is an integer greater than or equal to one, and the divided road section is also marked as a road section when the divided road section is not a complete road section;
and if the distribution starting point and the distribution ending point are positioned on different road sections, obtaining n road sections and m intersections meeting the path planning.
3. The method for real-time delivery of a pharmaceutical product according to claim 1, wherein the step of obtaining real-time road conditions based on the position information of the pharmaceutical delivery vehicle to obtain analyzed road conditions comprises:
detecting the position of the drug delivery vehicle to obtain position information, and acquiring real-time road conditions by utilizing preset ITS based on the position information to obtain analysis road conditions.
4. A real time drug delivery device according to any one of claims 1 to 3, wherein the device comprises:
the drug order receiving module is used for acquiring order information of a delivery order and confirming a delivery center according to the order information, wherein the order information comprises: z medicines, the quantity of each medicine, the distribution terminal point and remark information for judging whether a distribution order is an emergency order, wherein Z is an integer greater than or equal to one, and the distribution center contains various medicines meeting the order requirement and various vehicles meeting the distribution requirement;
the drug delivery standard construction module is used for acquiring a road network of a delivery area, wherein a plurality of roads meeting the path planning are arranged in the delivery area, the delivery area comprises a delivery starting point and a delivery ending point, the roads in the delivery area are divided into intersections and road sections, n road sections and m intersections meeting the path planning are obtained, n is an integer greater than or equal to one, m is an integer greater than or equal to zero, and the intersections are of different types; constructing a shortest relation of the delivery time by utilizing road sections and intersections meeting the path planning based on a preset shortest delivery time principle, and constructing a lowest relation of the delivery cost based on a preset lowest delivery cost principle;
The method for constructing the shortest relation of the delivery time by utilizing the road sections and the intersections meeting the path planning based on the shortest delivery time principle comprises the following steps:
acquiring theoretical traffic capacity of one lane in a road section i, and constructing a road section traffic relation by utilizing the theoretical traffic capacity, wherein the road section i is a road section meeting the path planning;
acquiring an ideal delivery speed of a drug delivery vehicle running on a road section i, and constructing a road section congestion relation by using the ideal delivery speed;
obtaining the average speed of a drug delivery vehicle passing through an intersection p, obtaining the intersection running speed, and constructing an intersection passing relation by using the intersection running speed;
constructing a shortest distribution time relation based on the road section traffic relation and the road section congestion relation and the intersection traffic relation;
the road section traffic relation is as follows:
wherein (1)>For road section traffic relation->For the theoretical traffic capacity of the j-th lane in road section i,/th lane>For road section->Length of->Whether or not the vehicle is passing through the road section->If the road section is passed +.>Then->Taking 1, otherwise taking 0,>for the lane reduction factor +.>For the crossing reduction factor, < >>For the lane width reduction factor, +.>An average travel speed of the drug delivery vehicle on road section i;
The road section congestion relation is as follows:
wherein (1)>Representing road congestion relations->For the actual vehicle flow of the drug delivery vehicle through section i,/->For the daily congestion factor of road section i, +.>Is an ideal dispensing speed;
the intersection passing relation is as follows:
wherein (1)>Is crossing traffic relation->Indicating crossing->Coefficient of passage of->For the average arrival rate of the vehicle flow in road section i when it reaches the next road section through intersection p,/>For the distance traveled by a drug delivery vehicle from road section i through intersection p to the next road section, +.>Crossing for drug delivery vehicle>Average speed of>Judging parameters for judging whether the drug delivery vehicle passes through the intersection p, if so, the drug delivery vehicle is +.>Taking 1, otherwise taking 0;
the shortest relation of the delivery time is as follows:
wherein (1)>For the shortest distribution time, +.>Judging parameters of the traffic control for the road section i, if the road section i is under the traffic control, the road section i is under the traffic control +.>Get->Otherwise, taking 0;
the lowest relation of the distribution cost is as follows:
in (I)>Representing the lowest relation of distribution cost->Representing drug delivery vehicle fixed delegation costs, +.>Representing cost per unit distance of drug delivery vehicle, < >>The distance the drug delivery vehicle needs to travel to complete the drug delivery, Representing cost per unit time of drug delivery vehicle, < >>The time required to complete the drug delivery for the drug delivery vehicle;
the medicine order processing module is used for calculating the medicine delivery volume of the medicine required in the delivery order by using a preset volume formula, and the volume formula is as follows:
wherein (1)>Representing the volume of drug dispensed, +.>Is a medicine->Is a medicine box length->Is a medicine->Is a medicine box width->Is a medicine->Is a medicine box height->Is a medicine->Is the number of (3); judging whether the distribution order is an emergency order or not according to the remark information; if the delivery order is an emergency order, confirming a drug delivery vehicle from various vehicles meeting the delivery requirement according to the drug delivery volume, wherein the delivery time of the drug delivery vehicle meets the shortest delivery time relation; if the delivery order is not an emergency order, confirming a drug delivery vehicle from various vehicles meeting delivery requirements according to the drug delivery volume, wherein the delivery cost of the drug delivery vehicle meets the lowest delivery cost relation;
the drug order delivery module is used for determining a delivery path according to the delivery end point and the delivery start point, acquiring real-time road conditions of the delivery path, obtaining initial road conditions, and planning the delivery path by utilizing the initial road conditions to obtain the initial path; driving a drug delivery vehicle to go to a delivery end point according to the initial path, detecting the position information of the drug delivery vehicle in real time, acquiring real-time road conditions based on the position information of the drug delivery vehicle, obtaining analysis road conditions, and judging whether the road conditions of the delivery path change or not according to the analysis road conditions and the initial road conditions; if the road condition of the distribution path is not changed, prompting the vehicle to distribute according to the initial path; if the road condition of the delivery path changes, planning the delivery path by utilizing the analysis road condition to obtain a target path, and prompting the drug delivery vehicle to deliver the drug according to the target path.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310547041.1A CN116307332B (en) | 2023-05-16 | 2023-05-16 | Real-time medicine distribution method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310547041.1A CN116307332B (en) | 2023-05-16 | 2023-05-16 | Real-time medicine distribution method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116307332A CN116307332A (en) | 2023-06-23 |
| CN116307332B true CN116307332B (en) | 2023-08-04 |
Family
ID=86801627
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310547041.1A Active CN116307332B (en) | 2023-05-16 | 2023-05-16 | Real-time medicine distribution method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116307332B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116523167B (en) * | 2023-07-03 | 2023-09-15 | 武汉大学人民医院（湖北省人民医院） | Intelligent medicine management method and system |
| CN117078150B (en) * | 2023-10-17 | 2024-02-09 | 深圳市中农易讯信息技术有限公司 | Agricultural product conveying path optimization method |
| CN117893116B (en) * | 2024-03-14 | 2024-05-28 | 宁波蓝犀信息科技有限公司 | Data processing method, device and system |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9786187B1 (en) * | 2015-06-09 | 2017-10-10 | Amazon Technologies, Inc. | Transportation network utilizing autonomous vehicles for transporting items |
| CN114399095A (en) * | 2021-12-29 | 2022-04-26 | 湖南科技大学 | Cloud-side-cooperation-based dynamic vehicle distribution path optimization method and device |
| CN115206512A (en) * | 2022-09-15 | 2022-10-18 | 武汉大学人民医院（湖北省人民医院） | Hospital information management method and device based on Internet of things |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2001253510A (en) * | 2000-03-09 | 2001-09-18 | Sega Logistics Service Ltd | Physical distribution system, mail-order system and recording medium |
| CN110009275A (en) * | 2019-03-19 | 2019-07-12 | 深圳市宏大供应链服务有限公司 | Logistics distribution paths planning method and system based on geographical location |
| CN111950950A (en) * | 2019-05-17 | 2020-11-17 | 北京京东尚科信息技术有限公司 | Order distribution path planning method and device, computer medium and electronic equipment |
| CN111932182A (en) * | 2020-08-27 | 2020-11-13 | 广东优特云科技有限公司 | Distribution path planning method and related device |
| CN113762697B (en) * | 2021-01-21 | 2024-01-16 | 北京京东振世信息技术有限公司 | Material conveying method, equipment, system and storage medium |
| CN113850550A (en) * | 2021-09-24 | 2021-12-28 | 北京我来文化传媒有限公司 | Intelligent catering order dispatching method, storage medium and computer for college park |
-
2023
- 2023-05-16 CN CN202310547041.1A patent/CN116307332B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9786187B1 (en) * | 2015-06-09 | 2017-10-10 | Amazon Technologies, Inc. | Transportation network utilizing autonomous vehicles for transporting items |
| CN114399095A (en) * | 2021-12-29 | 2022-04-26 | 湖南科技大学 | Cloud-side-cooperation-based dynamic vehicle distribution path optimization method and device |
| CN115206512A (en) * | 2022-09-15 | 2022-10-18 | 武汉大学人民医院（湖北省人民医院） | Hospital information management method and device based on Internet of things |
Non-Patent Citations (3)
| Title |
|---|
| AMAS模型在药事管理学课程中的应用与评估——以药品知识产权教学为例;沈秉正;《临床医药实践》;全文 * |
| Optimizing time and cost using goal programming and FMS scheduling;Sabilla;《2018 International Conference on Information and Communications Technology》;全文 * |
| 基于"动态电子围栏"的即时配送路径优化研究;刘娇;《商场现代化》;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116307332A (en) | 2023-06-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN116307332B (en) | Real-time medicine distribution method and device | |
| US20140074757A1 (en) | Estimating taxi fare | |
| US11620592B2 (en) | Systems and methods for planning transportation routes | |
| US11150098B2 (en) | Dynamically determining origin and destination locations for a network system | |
| US20200173808A1 (en) | Methods and systems for providing recommendations for parking of vehicles | |
| US11449927B2 (en) | Device and method for implementing a vehicle sharing reward program | |
| Yiannakoulias et al. | Estimating the effect of turn penalties and traffic congestion on measuring spatial accessibility to primary health care | |
| US20120197690A1 (en) | Method of Operating a Navigation System to Provide Advertisements | |
| US10332391B2 (en) | Split lane traffic jam detection and remediation | |
| US20130124279A1 (en) | Location of Available Passenger Seats in a Dynamic Transporting Pool | |
| US20130144831A1 (en) | Predicting Taxi Utilization Information | |
| US20030195694A1 (en) | Driving profile method and system | |
| Burris et al. | Willingness to pay for high-occupancy toll lanes: empirical analysis from i-15 and i-394 | |
| US20200286372A1 (en) | Method, apparatus, and computer program product for determining lane level vehicle speed profiles | |
| US11393334B2 (en) | Method, apparatus, and computer program product for detecting changes in road traffic condition | |
| US20200160712A1 (en) | Methods and systems for providing parking assistance for vehicles | |
| US10982969B2 (en) | Method, apparatus, and computer program product for lane-level route guidance | |
| US11282394B2 (en) | Methods and systems for spatial clustering based on mobility data | |
| BR112020023532A2 (en) | systems and methods for providing transportation service with cost sharing | |
| EP3821388A1 (en) | Method, apparatus, and computer program product for evaluating public transportation use | |
| JP7078357B2 (en) | Distribution device, distribution method and distribution program | |
| US20190205992A1 (en) | Remote system and method for vehicle route guidance | |
| Ordóñez et al. | Dynamic ridesharing | |
| US20170146355A1 (en) | Method and apparatus for selectively qualifying trajectories in regards to a determination of travel time for a maneuver | |
| Ni et al. | An agent-based simulation model for parking variable message sign location problem |
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 | ||
| EE01 | Entry into force of recordation of patent licensing contract | ||
| EE01 | Entry into force of recordation of patent licensing contract |
Application publication date: 20230623 Assignee: Wuhan Ruixin Zetai Technology Co.,Ltd. Assignor: RENMIN HOSPITAL OF WUHAN University (HUBEI GENERAL Hospital) Contract record no.: X2024980000807 Denomination of invention: A real-time drug delivery method and device Granted publication date: 20230804 License type: Common License Record date: 20240118 Application publication date: 20230623 Assignee: Wuhan Hengtai Bainian Trading Co.,Ltd. Assignor: RENMIN HOSPITAL OF WUHAN University (HUBEI GENERAL Hospital) Contract record no.: X2024980000806 Denomination of invention: A real-time drug delivery method and device Granted publication date: 20230804 License type: Common License Record date: 20240118 |