CN113851211A - Medical consumable material distribution management method, system, terminal equipment and storage medium - Google Patents
Medical consumable material distribution management method, system, terminal equipment and storage medium Download PDFInfo
- Publication number
- CN113851211A CN113851211A CN202111437912.1A CN202111437912A CN113851211A CN 113851211 A CN113851211 A CN 113851211A CN 202111437912 A CN202111437912 A CN 202111437912A CN 113851211 A CN113851211 A CN 113851211A
- Authority
- CN
- China
- Prior art keywords
- distribution
- information
- time
- historical
- path
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
- G16H—HEALTHCARE INFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR THE HANDLING OR PROCESSING OF MEDICAL OR HEALTHCARE DATA
- G16H40/00—ICT specially adapted for the management or administration of healthcare resources or facilities; ICT specially adapted for the management or operation of medical equipment or devices
- G16H40/20—ICT specially adapted for the management or administration of healthcare resources or facilities; ICT specially adapted for the management or operation of medical equipment or devices for the management or administration of healthcare resources or facilities, e.g. managing hospital staff or surgery rooms
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/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
Abstract
The application provides a medical consumable material distribution management method, a system, terminal equipment and a storage medium, wherein the medical consumable material distribution management method comprises the following steps: obtaining information to be distributed from a database to be distributed, wherein the information to be distributed comprises information of distribution consumables and distribution positions corresponding to the information, and set starting time t0(ii) a Generating a plurality of distribution paths, wherein each distribution path consists of a plurality of node positions which are arranged in sequence; the node positions comprise a set starting position and all distribution positions; calculating the set departure time t0Starting, historical time consumption of all distribution paths; and selecting the path with the shortest historical time consumption from all the distribution paths as a target distribution path. By the method, distribution efficiency is maximized, and meanwhile, guidance on actual distribution routes is realized by relying on historical data, so that congestion routes can be avoided entering and exiting at different time periodsThe current medical consumptive material transports the untimely condition.
Description
Technical Field
The present disclosure generally relates to the technical field of medical consumable material distribution, and in particular, to a medical consumable material distribution management method, system, terminal device, and storage medium.
Background
The medical consumables generally refer to accessories for hospitals; each hospital or clinic usually reserves a certain amount of medical consumables and carries out regular replenishment along with the consumption of the medical consumables;
when a hospital or an outpatient department needs to replenish medical consumables, a consumable purchase order is usually sent to a supplier or a central repository; after a supplier or a central library terminal receives a consumable purchase order, consumable distribution is carried out according to the consumable purchase order; however, in the prior art, the efficiency of the distribution process of the medical consumables is low, the distribution time is long, and the supplies are not timely.
Disclosure of Invention
In view of the above-mentioned drawbacks and deficiencies of the prior art, it is desirable to provide a method, a system, a terminal device and a storage medium for managing distribution of medical consumables, which can solve the above-mentioned technical problems.
In a first aspect, the present application provides a method for managing distribution of medical consumables, comprising the following steps:
obtaining information to be distributed from a database to be distributed, wherein the information to be distributed comprises information of distribution consumables and distribution positions corresponding to the information, and set starting time t0;
Generating a plurality of distribution paths, wherein each distribution path consists of a plurality of node positions which are arranged in sequence; the node positions comprise a set starting position and all the distribution positions;
calculating the set departure time t0Starting, historical time consumption of all the distribution paths;
and selecting the path with the shortest historical time consumption from all the distribution paths as a target distribution path.
According to the technical scheme provided by the embodiment of the application, the set departure time t is calculated0Starting, the method for historical time consumption of all the distribution paths specifically comprises the following steps:
s 1: calculating each sub-path L according to formula (one)1~LnDeparture time t1~tn:
wherein the sub-path L1~LnN is more than or equal to 1 for the path between the adjacent node positions in the distribution path; t isnExpressed as departure time tnStarting, sub-path LnThe historical elapsed time sub-time; t represents the set unloading time;
the historical time-consuming sub-time is obtained from a historical distribution database; the historical distribution database stores historical time-consuming sub-time corresponding to the sub-road sections in different time periods; the sub-segment is formed by any two of the node positions;
s 2: calculating the historical time T of the delivery path according to a formula (II):
s 3: repeating the steps s1, s2 to calculate the historical elapsed time of all the delivery paths.
According to the technical scheme provided by the embodiment of the application, the method further comprises the following steps:
and receiving actual time-consuming data between adjacent node positions in the target distribution path, and adding the actual time-consuming data to the historical distribution database.
According to the technical scheme provided by the embodiment of the application, the method further comprises the following steps:
screening information of the persons with goods from a parking lot personnel list library; the information of the persons with goods comprises the information of the persons who stay at the same place as the delivery position;
sending the tape goods invitation information; the taking goods invitation information comprises taking goods consumable material information and taking goods time information, wherein the taking goods consumable material information is delivery consumable material information corresponding to the parking position in the information to be delivered;
and receiving information of available goods, removing the information of consumable materials of the available goods from the database to be delivered, and adding the information of consumable materials of the available goods into the database of the available goods.
In a second aspect, the present application provides a medical consumable distribution management system, including:
an acquisition module configured to: obtaining information to be distributed from a database to be distributed, wherein the information to be distributed comprises information of distribution consumables and distribution positions corresponding to the information, and set starting time t0;
A processing module configured to:
generating a plurality of distribution paths, wherein each distribution path consists of a plurality of node positions which are arranged in sequence; the node positions comprise a set starting position and all the distribution positions;
calculating the set departure time t0Starting, historical time consumption of all the distribution paths;
and selecting the path with the shortest historical time consumption from all the distribution paths as a target distribution path.
According to the technical solution provided by the embodiment of the present application, the processing module is configured to:
s 1: calculating each sub-path L according to formula (one)1~LnDeparture time t1~tn:
wherein the sub-path L1~LnN is more than or equal to 1 for the path between the adjacent node positions in the distribution path; t isnExpressed as departure time tnStarting, sub-path LnThe historical elapsed time sub-time; t represents the set unloading time;
the historical time-consuming sub-time is obtained from a historical distribution database; the historical distribution database stores historical time-consuming sub-time corresponding to the sub-road sections in different time periods; the sub-segment is formed by any two of the node positions;
s 2: calculating the historical time T of the delivery path according to a formula (II):
s 3: repeating the steps s1, s2 to calculate the historical elapsed time of all the delivery paths.
According to the technical scheme provided by the embodiment of the application, the system further comprises a first receiving module, wherein the first receiving module is configured to receive actual time-consuming data between adjacent node positions in the target delivery path;
the processing module is further configured to add the actual elapsed time data to the historical delivery database.
According to the technical scheme provided by the embodiment of the application, the system further comprises a sending module and a second receiving module;
the processing module is further configured to: screening information of the persons with goods from a parking lot personnel list library; the information of the persons with goods comprises the information of the persons who stay at the same place as the delivery position;
the sending module is further configured to: sending the tape goods invitation information; the taking goods invitation information comprises taking goods consumable material information and taking goods time information, wherein the taking goods consumable material information is delivery consumable material information corresponding to the parking position in the information to be delivered;
the second receiving module is configured to: receiving the information of available goods;
the processing module is further configured to: and removing the information of the consumable materials with goods from the database to be delivered, and adding the information of the consumable materials with goods into the database with goods.
The application provides a terminal device, which comprises a memory, a processor and a computer program stored in the memory and capable of running on the processor, wherein the processor executes the computer program to realize the steps of the medical consumable distribution management method.
In a third aspect, the present application provides a computer readable storage medium having a computer program, which when executed by a processor, implements the steps of the medical consumable delivery management method as described above.
The beneficial effect of this application lies in: the method comprises the steps of obtaining the information of the distribution consumable items and the corresponding distribution positions thereof from a database to be distributed and setting the starting time t0(ii) a Generating a plurality of distribution paths which take the set initial position as a starting point and approach all the distribution positions; by calculation to set departure time t0Starting, historical time consumption of all the distribution paths; selecting the path with the shortest historical time consumption from all the distribution paths as a target distribution path; taking the target distribution path as a consumable distribution path, so that the distribution efficiency is maximized; based on historical data, the guidance of an actual distribution route is realized, the situation that medical consumables are not conveyed timely is avoided by avoiding entering a congestion route in a maximized mode at different time periods.
Drawings
Other features, objects and advantages of the present application will become more apparent upon reading of the following detailed description of non-limiting embodiments thereof, made with reference to the accompanying drawings in which:
fig. 1 is a flowchart of a medical consumable supply distribution management method provided in the present application;
fig. 2 is a terminal device provided in the present application.
Detailed Description
The present application will be described in further detail with reference to the following drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the relevant invention and not restrictive of the invention. It should be noted that, for convenience of description, only the portions related to the present invention are shown in the drawings.
It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict. The present application will be described in detail below with reference to the embodiments with reference to the attached drawings.
Example 1
Please refer to fig. 1, which is a flowchart illustrating a method for managing distribution of medical consumables according to the present application, including the following steps:
s100: obtaining the to-be-matched from the to-be-matched databaseSending information, wherein the information to be distributed comprises information of the distribution consumables and distribution positions corresponding to the information, and set starting time t0;
Specifically, the distribution consumable information includes a distribution consumable name, a consumable quantity, a consumable weight, a consumable volume, a consumable attribute, and the like, for example, a certain database to be distributed is taken as an example, and the information to be distributed is shown in table-1:
specifically, the consumptive material attribute includes general consumptive material and hazardous articles consumptive material, and general consumptive material accessible ordinary haulage vehicle transports, and the hazardous articles consumptive material needs to transport through the special distribution car.
S200: generating a plurality of distribution paths, wherein each distribution path consists of a plurality of node positions which are arranged in sequence; the node positions comprise a set starting position and all the distribution positions; specifically, the starting position is set as a distribution starting point, and the distribution starting point is a central warehouse in this embodiment.
Specifically, as shown in table-1, the distribution locations are hospital a, hospital B, and hospital C, and the plurality of distribution routes are specifically:
1. central storehouse-hospital a-hospital B-hospital C;
2. central storehouse-hospital a-hospital C-hospital B;
3. central storehouse-hospital B-hospital a-hospital C;
4. central storehouse-hospital B-hospital C-hospital a;
5. central storehouse-hospital C-hospital a-hospital B;
6. central storehouse-hospital C-hospital B-hospital a;
s300: calculating the set departure time t0Starting, historical time consumption of all the distribution paths;
specifically, the historical time consumption can be obtained from a historical distribution database; the historical distribution database comprises historical time consumption time of different time periods and different distribution paths;
s400: and selecting the path with the shortest historical time consumption from all the distribution paths as a target distribution path.
The working principle is as follows: the method comprises the steps of obtaining the information of the distribution consumable items and the corresponding distribution positions thereof from a database to be distributed and setting the starting time t0(ii) a Generating a plurality of distribution paths which take the set initial position as a starting point and approach all the distribution positions; by calculation to set departure time t0Starting, historical time consumption of all the distribution paths; selecting the path with the shortest historical time consumption from all the distribution paths as a target distribution path; the target distribution path is used as a consumable material distribution path, so that the distribution efficiency is maximized; based on historical data, the guidance of an actual distribution route is realized, the situation that medical consumables are not conveyed timely is avoided by avoiding entering a congestion route in a maximized mode at different time periods.
In a preferred embodiment, the set departure time t is calculated0Starting, the method for historical time consumption of all the distribution paths specifically comprises the following steps:
s 1: calculating each sub-path L according to formula (one)1~LnDeparture time t1~tn:
wherein the sub-path L1~LnN is more than or equal to 1 for the path between the adjacent node positions in the distribution path; t isnExpressed as departure time tnStarting, sub-path LnThe historical elapsed time sub-time; t represents the set unloading time;
the historical time-consuming sub-time is obtained from a historical distribution database; the historical distribution database stores historical time-consuming sub-time corresponding to the sub-road sections in different time periods; the sub-segment is formed by any two of the node positions;
for ease of explanation of the working principle of the present application, with path 6: taking a central storehouse, hospital C, hospital B and hospital A as examples, the unloading time t is set to 0.5h, and the departure time t is set0Is 8: 00; meanwhile, part of data in a certain historical distribution database is shown as a table-2:
it should be further noted that the historical elapsed time corresponding to different time periods of the sub-segments is the historical average. The historical distribution database calculates and records the historical time-consuming sub-time by acquiring distribution data of each time; for example, if the sub-section (central warehouse-hospital C) and the time period (08: 00-11: 00) are delivered for 3 times, which respectively takes 1h, 0.9h and 1.1h, the central warehouse-hospital C will be delivered for the time period 08: 00-11: the historical elapsed time of 00 is 1 h.
From step s 1: the path 6 includes three sub-paths L1~L3Respectively is as follows:
sub-path L1: central warehouse-hospital C;
sub-path L2: hospital C-Hospital B;
sub-path L3: hospital B-Hospital A;
the sub-path L is calculated by the formula (one)1Departure time t1=t0=8:00;
As can be seen from Table 2, the sub-path L1At 08: 00-11: historical elapsed time sub-time T within time period of 001Is 1h, so the sub-path L2Departure time t2=t1+T1+t=9:30;
By analogy, sub-path L2At 08: 00-11: historical elapsed time sub-time T within time period of 002Is 1h, so the sub-path L3Departure time t3=11:00;
By analogy, sub-path L3At 11: 00-14: historical elapsed time sub-time T within time period of 003Is 1.5 h.
s 2: calculating the historical time T of the delivery path according to a formula (II):
the historical elapsed time T for the path 6 is:
T=T1+T2+T3=3.5h;
s 3: repeating the steps s1, s2 to calculate the historical elapsed time of all the delivery paths.
Specifically, the historical consumed time of the other distribution routes, i.e., the routes 1 to 5, can be calculated by repeating the steps s1 and s2, and then the route with the shortest historical consumed time among the routes 1 to 6 can be selected as the target distribution route.
In the above step, the distribution path is divided into a plurality of sub-paths, and the departure time of each sub-path is sequentially calculated, so that the historical time-consuming sub-time of each sub-path can be calculated according to the historical distribution database, and the historical time-consuming time of different distribution paths can be obtained. By dividing the sub-paths and combining historical distribution data, the calculation result is more accurate.
In a preferred embodiment, the method further comprises the steps of:
and receiving actual time-consuming data between adjacent node positions in the target distribution path, and adding the actual time-consuming data to the historical distribution database.
By adding the actual time-consuming data into the historical distribution database, the calculation base number of the historical time-consuming sub-time can be increased, the historical time-consuming sub-time is closer to an actual value, and the calculation accuracy is improved.
In a preferred embodiment, the method further comprises the steps of:
screening information of the persons with goods from a parking lot personnel list library; the information of the persons with goods comprises the information of the persons who stay at the same place as the delivery position;
sending the tape goods invitation information; the taking goods invitation information comprises taking goods consumable material information and taking goods time information, wherein the taking goods consumable material information is delivery consumable material information corresponding to the parking position in the information to be delivered;
and receiving information of available goods, removing the information of consumable materials of the available goods from the database to be delivered, and adding the information of consumable materials of the available goods into the database of the available goods.
Specifically, the field staff is field staff corresponding to each hospital; the field worker usually can go back and forth between the central storehouse and the field hospital, so that the delivery of medical consumables with goods can be realized through the steps to save the transportation cost.
Specifically, the invitation information with goods can be sent in various modes such as short message, WeChat, telephone, system popup and the like.
Specifically, when the information of the consumable items with the goods sent by the parking personnel is received, the information of the consumable items with the goods is moved out of the database to be delivered, and repeated delivery is avoided.
For convenience of explanation of the working principle of the present application, the present embodiment takes the example of sending the delivery invitation information to the parking personnel in the parking lot at hospital a, and the delivery invitation information is shown in table-3:
when the information of available goods sent by the parking personnel is received, the information of the consumable goods in the available goods is removed from the database to be delivered, as shown in the table-4.
Example 2
This embodiment provides a medical consumptive material delivery management system, includes:
an acquisition module configured to: obtaining information to be distributed from a database to be distributed, wherein the information to be distributed comprises information of distribution consumables and distribution positions corresponding to the information, and set starting time t0;
A processing module configured to:
generating a plurality of distribution paths, wherein each distribution path consists of a plurality of node positions which are arranged in sequence; the node positions comprise a set starting position and all the distribution positions;
calculating the set departure time t0Starting, historical time consumption of all the distribution paths;
and selecting the path with the shortest historical time consumption from all the distribution paths as a target distribution path.
Specifically, the output end of the acquisition module is connected with the input end of the processing module.
The working principle is as follows: the acquisition module acquires the information of the distribution consumables and the corresponding distribution positions and the set starting time t from the database to be distributed0(ii) a The processing module generates a plurality of distribution paths which take a set starting position as a starting point and approach all the distribution positions; calculated to set departure time t0Starting, historical time consumption of all the distribution paths; selecting a route with the shortest historical time consumption from all distribution routes as a target distribution route; according to the medical consumable material distribution management system, the target distribution path with the shortest consumed time can be obtained, and distribution efficiency maximization is achieved; based on historical data, the guidance of an actual distribution route is realized, the situation that medical consumables are not conveyed timely is avoided by avoiding entering a congestion route in a maximized mode at different time periods.
In a preferred embodiment, the processing module is configured to:
s 1: calculating each sub-path L according to formula (one)1~LnDeparture time t1~tn:
wherein the sub-path L1~LnN is more than or equal to 1 for the path between the adjacent node positions in the distribution path; t isnExpressed as departure time tnStarting, sub-path LnThe historical elapsed time sub-time; t represents the set unloading time;
the historical time-consuming sub-time is obtained from a historical distribution database; the historical distribution database stores historical time-consuming sub-time corresponding to the sub-road sections in different time periods; the sub-segment is formed by any two of the node positions;
s 2: calculating the historical time T of the delivery path according to a formula (II):
s 3: repeating the steps s1, s2 to calculate the historical elapsed time of all the delivery paths.
Specifically, the historical consumed time sub-time is obtained from a historical distribution database through the obtaining module.
In a preferred embodiment, the system further includes a first receiving module, where the first receiving module is configured to receive actual time-consuming data between adjacent node locations in the target delivery path;
the processing module is further configured to add the actual elapsed time data to the historical delivery database.
In a preferred embodiment, the system further comprises a sending module and a second receiving module;
the processing module is further configured to: screening information of the persons with goods from a parking lot personnel list library; the information of the persons with goods comprises the information of the persons who stay at the same place as the delivery position;
the sending module is further configured to: sending the tape goods invitation information; the taking goods invitation information comprises taking goods consumable material information and taking goods time information, wherein the taking goods consumable material information is delivery consumable material information corresponding to the parking position in the information to be delivered;
the second receiving module is configured to: receiving the information of available goods;
the processing module is further configured to: and removing the information of the consumable materials with goods from the database to be delivered, and adding the information of the consumable materials with goods into the database with goods.
Example 3
The present embodiment provides a terminal device 700, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the steps of the medical consumable distribution management method as described above when executing the computer program.
As shown in fig. 2, the terminal device 700 includes a Central Processing Unit (CPU)701, which can perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)702 or a program loaded from a storage section into a Random Access Memory (RAM) 703. In a Random Access Memory (RAM)703, various programs and data necessary for system operation are also stored. A Central Processing Unit (CPU)701, a Read Only Memory (ROM)702, and a Random Access Memory (RAM)703 are connected to each other by a bus 704. An input/output (I/O) interface 705 is also connected to bus 704.
The following components are connected to an input/output (I/O) interface 705: an input portion 706 including a keyboard, a mouse, and the like; an output section 707 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 708 including a hard disk and the like; and a communication section 709 including a network interface card such as a LAN card, a modem, or the like. The communication section 709 performs communication processing via a network such as the internet. The drives are also connected to input/output (I/O) interfaces 705 as needed. A removable medium 711 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 710 as necessary, so that a computer program read out therefrom is mounted into the storage section 708 as necessary.
In particular, according to an embodiment of the invention, the process described above with reference to the flowchart of fig. 1 may be implemented as a computer software program. For example, embodiment 1 of the invention comprises a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network via the communication section, and/or installed from a removable medium. The computer program executes the above-described functions defined in the system of the present application when executed by the Central Processing Unit (CPU) 701.
Example 4
The present embodiment provides a computer-readable storage medium having a computer program, which when executed by a processor, implements the steps of the medical consumable delivery management method as described above.
It should be noted that the computer readable medium shown in the present invention can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present invention, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present invention, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units described in the embodiments of the present invention may be implemented by software, or may be implemented by hardware, and the described units may also be disposed in a processor. Wherein the names of the elements do not in some way constitute a limitation on the elements themselves. The described units or modules may also be provided in a processor, and may be described as: a processor comprises an acquisition module and a processing module.
Wherein the names of such units or modules do not in some way constitute a limitation on the unit or module itself;
as another aspect, the present application also provides a computer-readable medium, which may be contained in the electronic device described in the above embodiments; or may exist separately without being assembled into the electronic device. The computer readable medium carries one or more programs, and when the one or more programs are executed by the electronic device, the electronic device is enabled to realize the medical consumable distribution management method in the embodiment;
for example, the electronic device may implement the following as shown in fig. 1:
s100: obtaining information to be distributed from a database to be distributed, wherein the information to be distributed comprises information of distribution consumables and distribution positions corresponding to the information, and set starting time t0;
S200: generating a plurality of distribution paths, wherein each distribution path consists of a plurality of node positions which are arranged in sequence; the node positions comprise a set starting position and all the distribution positions;
s300: calculating the set departure time t0Starting, historical time consumption of all the distribution paths;
s400: and selecting the path with the shortest historical time consumption from all the distribution paths as a target distribution path.
It should be noted that although in the above detailed description several modules or units of the device for action execution are mentioned, such a division is not mandatory. Indeed, the features and functionality of two or more modules or units described above may be embodied in one module or unit, according to embodiments of the present disclosure. Conversely, the features and functions of one module or unit described above may be further divided into embodiments by a plurality of modules or units.
Moreover, although the steps of the methods of the present disclosure are depicted in the drawings in a particular order, this does not require or imply that the steps must be performed in this particular order, or that all of the depicted steps must be performed, to achieve desirable results. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step execution, and/or one step broken down into multiple step executions, etc.
Through the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein may be implemented by software, or by software in combination with necessary hardware.
The above description is only a preferred embodiment of the application and is illustrative of the principles of the technology employed. It will be appreciated by a person skilled in the art that the scope of the invention as referred to in the present application is not limited to the embodiments with a specific combination of the above-mentioned features, but also covers other embodiments with any combination of the above-mentioned features or their equivalents without departing from the inventive concept. For example, the above features may be replaced with (but not limited to) features having similar functions disclosed in the present application.
Claims (10)
1. A medical consumable distribution management method is characterized by comprising the following steps:
obtaining information to be distributed from a database to be distributed, wherein the information to be distributed comprises information of distribution consumables and distribution positions corresponding to the information, and set starting time t0;
Generating a plurality of distribution paths, wherein each distribution path consists of a plurality of node positions which are arranged in sequence; the node positions comprise a set starting position and all the distribution positions;
calculating the set departure time t0Starting, historical time consumption of all the distribution paths;
and selecting the path with the shortest historical time consumption from all the distribution paths as a target distribution path.
2. The method for managing distribution of medical consumables according to claim 1, wherein the set departure time t is calculated0Starting, the method for historical time consumption of all the distribution paths specifically comprises the following steps:
s 1: calculating each sub-path L according to formula (one)1~LnDeparture time t1~tn:
wherein the sub-path L1~LnN is more than or equal to 1 for the path between the adjacent node positions in the distribution path; t isnExpressed as departure time tnStarting road, sublayDiameter LnThe historical elapsed time sub-time; t represents the set unloading time;
the historical time-consuming sub-time is obtained from a historical distribution database; the historical distribution database stores historical time-consuming sub-time corresponding to the sub-road sections in different time periods; the sub-segment is formed by any two of the node positions;
s 2: calculating the historical time T of the delivery path according to a formula (II):
s 3: repeating the steps s1, s2 to calculate the historical elapsed time of all the delivery paths.
3. The medical consumable distribution management method according to claim 2, further comprising the steps of:
and receiving actual time-consuming data between adjacent node positions in the target distribution path, and adding the actual time-consuming data to the historical distribution database.
4. The medical consumable distribution management method according to claim 1, further comprising the steps of:
screening information of the persons with goods from a parking lot personnel list library; the information of the persons with goods comprises the information of the persons who stay at the same place as the delivery position;
sending the tape goods invitation information; the taking goods invitation information comprises taking goods consumable material information and taking goods time information, wherein the taking goods consumable material information is delivery consumable material information corresponding to the parking position in the information to be delivered;
and receiving information of available goods, removing the information of consumable materials of the available goods from the database to be delivered, and adding the information of consumable materials of the available goods into the database of the available goods.
5. A medical consumable distribution management system, comprising:
an acquisition module configured to: obtaining information to be distributed from a database to be distributed, wherein the information to be distributed comprises information of distribution consumables and distribution positions corresponding to the information, and set starting time t0;
A processing module configured to:
generating a plurality of distribution paths, wherein each distribution path consists of a plurality of node positions which are arranged in sequence; the node positions comprise a set starting position and all the distribution positions;
calculating the set departure time t0Starting, historical time consumption of all the distribution paths;
and selecting the path with the shortest historical time consumption from all the distribution paths as a target distribution path.
6. The medical consumable distribution management system according to claim 5,
the processing module is configured to:
s 1: calculating each sub-path L according to formula (one)1~LnDeparture time t1~tn:
wherein the sub-path L1~LnN is more than or equal to 1 for the path between the adjacent node positions in the distribution path; t isnExpressed as departure time tnStarting, sub-path LnThe historical elapsed time sub-time; t represents the set unloading time;
the historical time-consuming sub-time is obtained from a historical distribution database; the historical distribution database stores historical time-consuming sub-time corresponding to the sub-road sections in different time periods; the sub-segment is formed by any two of the node positions;
s 2: calculating the historical time T of the delivery path according to a formula (II):
s 3: repeating the steps s1, s2 to calculate the historical elapsed time of all the delivery paths.
7. The medical consumable distribution management system of claim 6, further comprising a first receiving module;
the first receiving module is configured to receive actual time-consuming data between adjacent node positions in the target delivery path;
the processing module is further configured to add the actual elapsed time data to the historical delivery database.
8. The medical consumable distribution management system according to claim 5, further comprising a sending module and a second receiving module;
the processing module is further configured to: screening information of the persons with goods from a parking lot personnel list library; the information of the persons with goods comprises the information of the persons who stay at the same place as the delivery position;
the sending module is further configured to: sending the tape goods invitation information; the taking goods invitation information comprises taking goods consumable material information and taking goods time information, wherein the taking goods consumable material information is delivery consumable material information corresponding to the parking position in the information to be delivered;
the second receiving module is configured to: receiving the information of available goods;
the processing module is further configured to: and removing the information of the consumable materials with goods from the database to be delivered, and adding the information of the consumable materials with goods into the database with goods.
9. A terminal device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, wherein the processor implements the steps of the method for managing delivery of medical consumables as set forth in any one of claims 1 to 4 when executing the computer program.
10. A computer-readable storage medium having a computer program embodied thereon, wherein the computer program when executed by a processor implements the steps of the method for medical consumable delivery management according to any one of claims 1 to 4.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202111437912.1A CN113851211A (en) | 2021-11-30 | 2021-11-30 | Medical consumable material distribution management method, system, terminal equipment and storage medium |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202111437912.1A CN113851211A (en) | 2021-11-30 | 2021-11-30 | Medical consumable material distribution management method, system, terminal equipment and storage medium |
Publications (1)
Publication Number | Publication Date |
---|---|
CN113851211A true CN113851211A (en) | 2021-12-28 |
Family
ID=78982266
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202111437912.1A Pending CN113851211A (en) | 2021-11-30 | 2021-11-30 | Medical consumable material distribution management method, system, terminal equipment and storage medium |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN113851211A (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN115394416A (en) * | 2022-10-27 | 2022-11-25 | 山东方格医疗器械有限公司 | Medicine dispensing vehicle data monitoring and management system and method |
Citations (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN107194656A (en) * | 2017-07-04 | 2017-09-22 | 北京惠赢天下网络技术有限公司 | A kind of method and device for planning of the Distribution path based on standard container order |
CN110264123A (en) * | 2019-05-09 | 2019-09-20 | 中国平安财产保险股份有限公司 | A kind of generation method and equipment of Distribution path |
CN110414730A (en) * | 2019-07-22 | 2019-11-05 | 北京三快在线科技有限公司 | A kind of method and device of determining logistics distribution strategy |
CN111932182A (en) * | 2020-08-27 | 2020-11-13 | 广东优特云科技有限公司 | Distribution path planning method and related device |
CN112801401A (en) * | 2021-02-09 | 2021-05-14 | 北京橙心无限科技发展有限公司 | Method and device for determining time information of route |
CN113222282A (en) * | 2021-05-31 | 2021-08-06 | 北京京东乾石科技有限公司 | Method and device for determining conveying path, readable storage medium and electronic equipment |
CN113537534A (en) * | 2021-07-28 | 2021-10-22 | 北京云迹科技有限公司 | Robot distribution method and device |
-
2021
- 2021-11-30 CN CN202111437912.1A patent/CN113851211A/en active Pending
Patent Citations (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN107194656A (en) * | 2017-07-04 | 2017-09-22 | 北京惠赢天下网络技术有限公司 | A kind of method and device for planning of the Distribution path based on standard container order |
CN110264123A (en) * | 2019-05-09 | 2019-09-20 | 中国平安财产保险股份有限公司 | A kind of generation method and equipment of Distribution path |
CN110414730A (en) * | 2019-07-22 | 2019-11-05 | 北京三快在线科技有限公司 | A kind of method and device of determining logistics distribution strategy |
CN111932182A (en) * | 2020-08-27 | 2020-11-13 | 广东优特云科技有限公司 | Distribution path planning method and related device |
CN112801401A (en) * | 2021-02-09 | 2021-05-14 | 北京橙心无限科技发展有限公司 | Method and device for determining time information of route |
CN113222282A (en) * | 2021-05-31 | 2021-08-06 | 北京京东乾石科技有限公司 | Method and device for determining conveying path, readable storage medium and electronic equipment |
CN113537534A (en) * | 2021-07-28 | 2021-10-22 | 北京云迹科技有限公司 | Robot distribution method and device |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN115394416A (en) * | 2022-10-27 | 2022-11-25 | 山东方格医疗器械有限公司 | Medicine dispensing vehicle data monitoring and management system and method |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN110388921B (en) | Goods picking navigation method and device | |
US20120271740A1 (en) | Managing fresh-product inventory | |
CN111369182B (en) | Scheduling method and device for order delivery | |
CN111932161B (en) | Vehicle scheduling method and device for articles, electronic equipment and computer medium | |
CN111932189B (en) | Inventory related information display method, device, electronic equipment and computer medium | |
CN112184100A (en) | Article inventory monitoring method and device, electronic equipment and computer readable medium | |
CN109345166B (en) | Method and apparatus for generating information | |
CN111915238A (en) | Method and device for processing orders | |
CN113851211A (en) | Medical consumable material distribution management method, system, terminal equipment and storage medium | |
Emde et al. | Scheduling direct deliveries with time windows to minimise truck fleet size and customer waiting times | |
CN115392809A (en) | Power index information generation method, device, electronic device and medium | |
CN111428925B (en) | Method and device for determining distribution route | |
CN112101831A (en) | Goods delivery method, device, medium and electronic equipment | |
CN116128402A (en) | Order data processing method, device, medium and electronic equipment | |
CN110503495A (en) | For obtaining the method and device of information | |
CN112085442B (en) | Device operation method, apparatus, electronic device, and computer-readable medium | |
CN112085441A (en) | Information generation method and device, electronic equipment and computer readable medium | |
CN113919734A (en) | Order distribution method and device | |
CN113804206A (en) | Path planning method and device, electronic equipment and computer readable medium | |
US20200057972A1 (en) | System and method for management of project portfolios | |
JPH11353368A (en) | Profit management system, profit managing method, and record medium | |
CN111768065A (en) | Method and device for distributing goods sorting tasks | |
US11367031B2 (en) | Delivery plan creating device and delivery plan creating method | |
CN111767351A (en) | Method and device for determining parking spot of transfer robot | |
CN112529346A (en) | Task allocation method and device |
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 | ||
RJ01 | Rejection of invention patent application after publication |
Application publication date: 20211228 |
|
RJ01 | Rejection of invention patent application after publication |