CN110766209B - Preferential waiting method based on WeChat platform - Google Patents

Preferential waiting method based on WeChat platform Download PDF

Info

Publication number
CN110766209B
CN110766209B CN201910957901.2A CN201910957901A CN110766209B CN 110766209 B CN110766209 B CN 110766209B CN 201910957901 A CN201910957901 A CN 201910957901A CN 110766209 B CN110766209 B CN 110766209B
Authority
CN
China
Prior art keywords
patient
time
visit
treatment
waiting
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
Application number
CN201910957901.2A
Other languages
Chinese (zh)
Other versions
CN110766209A (en
Inventor
潘石
陈文豪
李洋
王佳杨
王家琪
张雨婷
朱文迪
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Changchun University of Science and Technology
Original Assignee
Changchun University of Science and Technology
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Changchun University of Science and Technology filed Critical Changchun University of Science and Technology
Priority to CN201910957901.2A priority Critical patent/CN110766209B/en
Publication of CN110766209A publication Critical patent/CN110766209A/en
Application granted granted Critical
Publication of CN110766209B publication Critical patent/CN110766209B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/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
    • 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)
  • Health & Medical Sciences (AREA)
  • Strategic Management (AREA)
  • Economics (AREA)
  • General Health & Medical Sciences (AREA)
  • Marketing (AREA)
  • Public Health (AREA)
  • Medical Informatics (AREA)
  • Development Economics (AREA)
  • Epidemiology (AREA)
  • Game Theory and Decision Science (AREA)
  • Biomedical Technology (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Primary Health Care (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Medical Treatment And Welfare Office Work (AREA)

Abstract

The invention discloses a preferential waiting method based on a WeChat platform, which relates to the technical field of Internet medical platforms and comprises the following steps: s1, the patient enters a treatment process from the WeChat platform, and a disease set possibly suffered by the patient and a department and an examination which the patient needs to treat are determined according to symptoms provided by the patient through intelligent diagnosis guide; s2, the patient makes appointment registration and payment operation according to the intelligent diagnosis guide result; s3, after the payment is finished, the preferential waiting model plans a reasonable treatment route for the patient according to the waiting requirement of the patient, and the invention has the advantages that: the invention provides a preferential waiting system based on a WeChat public platform, which saves a great deal of time for patients to see a doctor, improves the efficiency of seeing a doctor in a hospital, improves the satisfaction degree of the patients and realizes reasonable allocation of limited resources.

Description

Preferential waiting method based on WeChat platform
Technical Field
The invention relates to the technical field of internet medical platforms, in particular to a preferential waiting method based on a WeChat platform.
Background
With the rapid development of mobile internet and the emergence of intelligent devices, the service mode of the medical industry faces subversive changes. Because of the large population of China, the traditional hospitalization process restricts the overall operation of hospitals, the problem of hospitalization with three long and one short is becoming more serious, and the quality of medical service is urgently improved. Mobile medical treatment is an application technology for providing medical service and information by utilizing the Internet and the mobile communication technology, changes the traditional treatment process, and saves the time cost for treatment of people because people can make a appointment by using the network, pay fees by using WeChat and communicate with doctors to acquire illness information at any time.
The carrier of the mobile medical treatment mainly comprises a web browser, an mobile medical treatment APP and a WeChat public platform in the WeChat new function. Although the web browser is based on the mobile terminal, the web browser is complex to operate and poor in confidentiality; the mobile medical APP is medical application software, provides services such as medical finding inquiry, appointment registration and professional information inquiry, and has the problem of large memory occupation; the WeChat public platform has the advantages of convenience in operation, small occupied memory, high confidentiality and the like, and is widely applied to various fields. Thus, mobile medical services based on the WeChat public platform are being investigated herein.
Mobile medical services have been studied extensively, such as: the design and implementation of a medical treatment system based on a WeChat platform in the literature analyzes the treatment flow and the current development situation of the current hospital treatment population, and realizes the services of information inquiry, appointment treatment, independent number taking, number calling and the like based on the WeChat platform; the traditional doctor seeing process is optimized in the literature 'research based on the mobile intelligent hospital doctor seeing process', and a new mobile intelligent doctor seeing process is provided. The mobile intelligent diagnosis method is utilized in the document 'mobile intelligent application analysis facing the hospital diagnosis process', so that the diagnosis process is innovated and simplified to a great extent, and the diagnosis efficiency is improved; in the literature, "design and research of intelligent remote medical robot guidance system", a polynomial bayesian classification model is used as a basis, a database technology is utilized, and diseases possibly suffered by a patient are rapidly diagnosed according to chief complaints and symptoms of the patient, so that the medical time of the patient is shortened.
However, the existing research mainly focuses on the procedures of intelligent diagnosis guiding, appointment making, registration, payment and the like, and does not efficiently guide the sequence and route of the patient's visiting department. Patients are not familiar with hospital department distribution, so that a great deal of time and energy are wasted, the satisfaction degree of the hospitals is reduced, and meanwhile, hospital resources cannot be effectively utilized.
In the literature, "design of a preferential medical guidance assistant treatment system based on a wireless local area network", although a treatment route of a patient is planned, only a department with the minimum waiting time required for treatment at the current time is screened for a single patient, and the existing global information (such as patient information, treatment department information, treatment waiting time and the like) of the system is not fully utilized to carry out overall optimization guidance on the treatment sequence of the patient.
In order to solve the problem, the application provides a preferential waiting method of the WeChat platform.
Disclosure of Invention
The invention aims to provide a preferential waiting method based on a WeChat platform, so as to solve the problems in the background technology.
In order to achieve the purpose, the invention provides the following technical scheme:
a preferential waiting method based on a WeChat platform comprises the following steps:
s1, the patient enters a treatment process from the WeChat platform, and a disease set possibly suffered by the patient and a department and an examination which the patient needs to treat are determined according to symptoms provided by the patient through intelligent diagnosis guide;
s2, the patient makes appointment registration and payment operation according to the intelligent diagnosis guide result;
and S3, after the payment is finished, planning a reasonable treatment route for the patient by the preferred treatment model according to the treatment requirement of the patient.
As a further scheme of the invention: the establishment method of the preferential waiting model comprises the following steps:
defining the number of outpatients of a hospital to be M, wherein M corresponds to NmThe examination item, M is 1,2, …, M, the current number of patients is I, the treatment sequence of the ith patient is
Figure BDA0002227965280000031
Wherein y ispFor the p-th visit department, piThe total number of visits to patient I, I ═ 1,2, …, I;
finding the patient i in the visit sequence yiThe following total visit times were:
Figure BDA0002227965280000032
wherein,
Figure BDA0002227965280000033
in the order of visit yiThe time required for the next patient i to complete the p-th office examination,
Figure BDA0002227965280000034
and
Figure BDA0002227965280000035
respectively show the treatment sequence yiNext, the walking time, waiting time and visiting/examining time of the patient i at the p-th visit department,
Figure BDA0002227965280000036
in the order of visit yiNext, patient i waits for the examination result in the p-th office, and when yp∈{xm,0,x'm,0When the position of the movable part is changed,
Figure BDA0002227965280000037
the shortest total visit time model for all patients was found to be:
Figure BDA0002227965280000038
finally, an optimal solution Y is obtained*＝{y* 1,y* 2,…y* IMinimize the sum of the total time to visit for all patients.
As a still further scheme of the invention: when the patient requires to see the first diagnosis xm,0When the corresponding examination is carried out again later,
Figure BDA0002227965280000039
when the patient requires a return visit x'm,0When all the examinations corresponding to the out-patient m are done before,
Figure BDA00022279652800000310
in the formula, xm,nN, N is 1,2, corresponding to the outpatient mm，xm,0And x'm,0First and second visits, T, of the clinic mb(yi,xm,0)、Tb(yi,xm,n) And Tb(yi,x'm,0) Respectively for patient i in the visit sequence yiThe initial time of the first visit, examination and the second visit, X, of the outpatient clinic miSet of outpatients and examinations for patient i registration, Ni,mNumber of examinations in outpatient m for patient i, Ni,m＝0,1,…,Nm，Tg(yi,xm,n) For patient i in the visit sequence yiGet the department x of seeing a doctorm,nThe time of the examination of the results.
As a still further scheme of the invention: defining that the patient who is registered preferentially has the right to visit preferentially, the visit time for patient i is:
Figure BDA0002227965280000041
in the formula, FiIs the set of all possible visit orders for patient i.
When the patient requires to see the first diagnosis xm,0When the corresponding examination is carried out again later,
Figure BDA0002227965280000042
when the patient requires a return visit x'm,0When all the examinations corresponding to the out-patient m are done before,
Figure BDA0002227965280000043
as a still further scheme of the invention: the shortest visit time of the patient i is obtained by an enumeration method;
firstly, arranging all the consulting rooms in a stack structure;
traversing all patient treatment sequences by using the constant change of the stack length;
and finally, screening out the path with the shortest time consumption.
As a still further scheme of the invention: define patient i inDepartment of diagnosis xm,nIs available for a time interval of greater length than the average visit/examination time
Figure BDA0002227965280000044
The set of these is noted as:
Figure BDA0002227965280000045
in the formula,
Figure BDA0002227965280000046
for the ith patient in office xm,nJ is the total number of time intervals, and thus, patient i arrives at office xm,nThe waiting time before the visit is as follows:
when t is in the time interval
Figure BDA0002227965280000047
Middle time, tw(i,xm,n,t)＝0,tg(i,xm,n,j-1)＜t＜tb(i,xm,n,j)；
When t is in the time interval
Figure BDA0002227965280000048
And
Figure BDA0002227965280000049
in the middle of the time, the air conditioner,
tw(i,xm,n,t)＝tb(i,xm,n,j)-t,tb(i,xm,n,j)＜t＜tg(i,xm,n,j)；
in the formula, tb(i,xm,nJ) and tg(i,xm,nJ) patient i is in office xm,nThe jth available time interval of
Figure BDA00022279652800000410
The start and end times of the system.
As a still further scheme of the invention: the time interval of each patient visit is integral multiple of the average visit/examination time of the consulting room.
Compared with the prior art, the invention has the beneficial effects that: the invention is based on the WeChat public platform, has proposed the shortest time systematic model of seeing a doctor with priority to make the patient who registers a doctor have the right of seeing a doctor first, wherein the queue waiting time model of inserting allows the patient who registers a doctor after and can make full use of the idle time of the consulting room, guaranteed that the time of seeing a doctor is shortest overall, give consideration to the shortest time algorithm of the totality and normalize the time interval that every patient sees a doctor, has sacrificed some priority, but make the time of seeing a doctor further shorten, the preferential waiting system that offers saves a large amount of time of seeing a doctor for the patient, improve the efficiency of seeing a doctor of the hospital, while improving patient's satisfaction, have realized the rational disposition of the limited resource.
Drawings
Fig. 1 is a flow chart of a preferential waiting method based on a WeChat platform.
Fig. 2 is a time chart of a patient's visit in a visit sequence.
Figure 3 is a diagram illustrating the waiting time before a patient visit.
FIG. 4 is a flow chart of an enumeration method for optimal solution.
Fig. 5 is a graph of the average total time to visit of patients.
Fig. 6 is a graph of the total time of patient visit.
Fig. 7 shows the total working time of each department.
FIG. 8 is a graph comparing the method described in example 3 with an optimal path.
Detailed Description
Reference will now be made in detail to the exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, like numbers in different drawings represent the same or similar elements unless otherwise indicated. The implementations described in the exemplary embodiments below are not intended to represent all implementations consistent with the present disclosure. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the present disclosure, as detailed in the appended claims.
Example 1
In the embodiment of the invention, a preferential waiting method based on a WeChat platform comprises the following steps:
s1, the patient enters a treatment process from the WeChat platform, and a disease set possibly suffered by the patient and a department and an examination which the patient needs to treat are determined according to symptoms provided by the patient through intelligent diagnosis guide;
s2, the patient makes appointment registration and payment operation according to the intelligent diagnosis guide result;
and S3, after the payment is finished, planning a reasonable diagnosis route for the patient by the preferred waiting model according to the waiting requirement of the patient, and then carrying out operations such as initial diagnosis, registration payment, examination, re-diagnosis and the like on the patient according to the reasonable diagnosis route.
Specifically, the method for establishing the preferential waiting model comprises the following steps:
defining the number of outpatients of a hospital to be M, wherein M corresponds to NmItem inspection, M is 1,2, …, M, the current number of patients is I,
since the patient's treatment process may include multiple treatment departments (initial treatment, examination and re-treatment), for convenience of expression, the treatment sequence of the ith patient is defined as
Figure BDA0002227965280000061
Wherein y ispFor the p-th visit department, piThe patient I is given the total number of visits, I ═ 1,2, …, I. Because the patient can simultaneously carry out other treatment processes (walking, waiting, seeing/examining, etc.) when waiting for the examination result, the shortest treatment time is not a simple problem that the total time of each treatment process is the smallest, and the patient i is in the treatment sequence yiThe following total visit times were:
Figure BDA0002227965280000062
wherein,
Figure BDA0002227965280000063
in the order of visit yiThe time required for the next patient i to complete the p-th office examination,
Figure BDA0002227965280000064
and
Figure BDA0002227965280000065
respectively show the treatment sequence yiNext, the walking time, waiting time and visiting/examining time of the patient i at the p-th visit department (for convenience of expression and without loss of generality, the visiting time of different patients at the same visit/examination room is assumed to be a certain average value),
Figure BDA0002227965280000066
in the order of visit yiNext, patient i waits for the examination result in the p-th office, and when yp∈{xm,0,x'm,0When the position of the movable part is changed,
Figure BDA0002227965280000067
it is assumed that the examination result can be directly transmitted to the computer of the doctor, so that the queuing time for taking the result is saved. Patient i is in visit sequence yiThe following visit times are shown in fig. 2.
Thus, the shortest total visit time model for all patients is:
Figure BDA0002227965280000071
Figure BDA0002227965280000072
Figure BDA0002227965280000073
wherein x ism,nThe examination N corresponding to the clinic m is 1,2, …, Nm，xm,0And x'm,0First and second visits, respectively, of clinic m (without loss of generality, assuming that only one first and second visits are performed per clinic), Tb(yi,xm,0)、Tb(yi,xm,n) And Tb(yi,x'm,0) Respectively for patient i in the visit sequence yiThe initial time of the first visit, examination and the second visit, X, of the outpatient clinic miSet of outpatients and examinations for patient i registration, Ni,mNumber of examinations in outpatient m for patient i (if
Figure BDA0002227965280000074
Then N isi,m0, or vice versa), Ni,m＝0,1,...,Nm，Tg(yi,xm,n) For patient i in the visit sequence yiGet the department x of seeing a doctorm,nThe time of the examination of the results.
The constraint (2.1) is used for ensuring that the patient finishes the first visit xm,0Then the corresponding inspection is carried out, xm,0∈Xi；
Restraint (2.2) is used to ensure patient's return visit x'm,0All examinations x corresponding to the out-patient m are done beforem,0∈Xi。
Since the solution set of the patient's shortest total visit time model is finite, there must be an optimal solution Y*＝{y* 1,y* 2,...y* IMinimize the sum of the total time to visit for all patients.
Example 2
In the embodiment of the invention, the calculation complexity of the shortest total treatment time model (2) of the patient is increased along with the increase of the number of patients. To reduce the amount of computation and maintain fairness, it is assumed that the priority registered patient always has the priority of the registered department during the visit, in other words, the decision of the current patient is only influenced by the previous registered person. Since the decision of the previously registered patient is known in the system, the patient minimum total visit time model (2) translates into the problem of minimum visit time for patient i, expressed as:
Figure BDA0002227965280000081
Figure BDA0002227965280000082
Figure BDA0002227965280000083
wherein, FiIs the set of all possible visit orders for patient i.
Patients who are preferentially registered have the right to visit preferentially according to the priority principle described above. When a single patient needs to go to a plurality of consulting rooms for treatment, if the patient cannot arrive at the consulting rooms in time, in order to avoid the idle consulting rooms, the patient who is registered later is allowed to be inserted into the idle interval for treatment on the premise that the patient who is registered earlier is not influenced.
To ensure that the patient has sufficient time to perform the interrogation/examination after insertion into the queue, patient i is at visit department xm,nIs available for a time interval of greater length than the average visit/examination time
Figure BDA0002227965280000084
The set of these is noted as:
Figure BDA0002227965280000085
in the formula,
Figure BDA0002227965280000086
for the ith patient in office xm,nJ is the total number of time intervals. Thus, patient i arrives at office xm,nThe waiting time before the visit is as follows:
when t is in the time interval
Figure BDA0002227965280000087
Middle time, tw(i,xm,n,t)＝0,tg(i,xm,n,j-1)＜t＜tb(i,xm,n,j)；
When t is in the time interval
Figure BDA0002227965280000088
And
Figure BDA0002227965280000089
in the middle of the time, the air conditioner,
tw(i,xm,n,t)＝tb(i,xm,n,j)-t,tb(i,xm,n,j)＜t＜tg(i,xm,n,j)；
in the formula, tb(i,xm,nJ) and tg(i,xm,nJ) patient i is in office xm,nThe jth available time interval of
Figure BDA00022279652800000810
The start and end times of the system. In particular, tg(i,xm,n,0)＝0,tg(i,xm,n,J)＝Ttotal，TtotalFor the ith patient in office xm,nIs determined by the maximum time that can be waited. Fig. 3 is a diagram illustrating waiting time before a visit.
Since the formula (3) only considers the total time of the visit of a single patient at a time, the calculation amount is small. In order to improve the accuracy, the embodiment solves the optimal problem by using an enumeration method.
Firstly, arranging the diagnosis rooms in a stack structure, and then realizing the purpose of traversing the diagnosis sequence of all patients by using the constant change of the stack length (as shown in fig. 4), and finally, screening out the path with the shortest time consumption. The screening process can calculate the waiting time of each clinic when different paths are selected through the queue waiting time model.
Example 3
In the embodiment of the invention, for the method for obtaining the optimal treatment route, due to the known factors such as the waiting time of each treatment room, the average treatment time and the like, the optimal solution can be easily obtained, but the obtained treatment time can only ensure the shortest treatment time of a single patient, the solution can cause fragmentation of the free time of the treatment departments, for the subsequent patients, the resource consumed by the current patient during treatment is even far higher than that consumed by the conventional registration treatment mode, and aiming at the problem, the embodiment provides another algorithm which can not waste the treatment time of the current patient as a whole.
The algorithm is mainly characterized in that on the basis of the original algorithm, the time interval of the visit of each patient is defined to be integral multiple of the average visit/examination duration of a consulting room, and the condition that the patient is inserted into a visit queue cannot cause idle time fragmentation is guaranteed. For the initial time of the treatment in a certain treatment room, not only the waiting time and the current time are considered, but also a short period of time is added on the basis of the original initial time of the treatment to make the initial time be integral multiple of the treatment time.
Simulation verification
The shortest time algorithm with priority in the embodiment 2 and the shortest time algorithm with total consideration in the embodiment 3 are compared with a conventional registration and treatment mode, and then the effectiveness of the method is analyzed.
Because the conventional registration and treatment mode has randomness and cannot be accurately simulated, the conventional registration and treatment is assumed to be the optimal solution of a treatment simulation model obtained by an enumeration method (at this time, queue insertion and standard queue insertion are not allowed), the simulation starting time is assumed to be 0 minute, the 1 st patient is registered and treated in the 1 st minute, then 1 patient is registered every 1 minute, 48 patients are totally registered, and 3 departments, namely, a department A, a department B, a department C, a department D, a department E and a department F are assumed to be provided, and the corresponding operations are respectively executed. The registered clinics are randomized, and the average visit time and examination result waiting time for each clinic are shown in table 1. The inter-room distance is the inter-room walking distance, as shown in table 2. For the sake of calculation, it is assumed that each patient has a walking speed of 1.
TABLE 1 mean time to visit and examination waiting time for each clinic
Department A Department's office B Department C Department D Department E Department F
Mean time to visit 5min 4min 5min 3min 10min 6min
Examination result waiting time 0min 10min 0min 15min 0min 20min
TABLE 2 interventricular distances
Department's office A B C D E F
A
0 1 1 2 2 3
B 1 0 2 1 3 2
C 1 2 0 1 1 2
D 2 1 1 0 2 1
E 2 3 1 2 0 1
F 3 2 2 1 1 0
Figure 5 is a graph of the change in average total time to visit patients as the total number of patients increases. Fig. 6 is a graph of the total time of patient visit as the total number of patients increases.
As can be seen from the above figure, when the number of patients is small, the average time of the patients in the overall compromise shortest time algorithm (enumeration + queue + overall compromise is optimal) in example 3 is slightly longer than that of the shortest time algorithm (enumeration + queue) with priority in example 2, because a small number of patients are closely linked, time fragmentation rarely occurs, but all the time fragmentation is better than that of the conventional registration method. Because the method provided by the embodiment effectively utilizes the waiting time of the examination result, the total time of the treatment of all users is minimized. As the number of patients increases, the average treatment time of the patients in the overall compromise shortest time algorithm in example 3 after the total number of patients is greater than 7 is lower than that of the shortest time algorithm with priority in example 2, because the time fragmentation increases as the number of patients increases, but the time consumption of the patients is far lower than that of the conventional registration treatment mode.
Fig. 7 shows the total working time of each of the 6 departments and compares the algorithm proposed by the present invention with the conventional registration and visit algorithm and the ideal elapsed time (ideal elapsed time is the time excluding the idle time). From the figure, the total working time of the two methods provided by the invention is greatly reduced compared with the conventional method, which is beneficial to increasing the satisfaction degree of patients and also improves the working efficiency of hospitals, wherein the utilization rate of the optimal method for each consulting room is highest. Compared with the ideal time consumption, the method provided by the invention has the advantages that although the total time for visiting a doctor is slightly longer, the proportion among departments is basically consistent with the ideal time consumption method, and the reasonability of the time arrangement of the invention is demonstrated.
Fig. 8 compares the overall compromise optimization method proposed by the present invention with the path optimization method. Compared with the average diagnosis time of the path optimal solution, the method provided by the invention has the advantages that the time of walking, waiting for diagnosis/examination, diagnosis/examination and waiting for examination results is considered, and only the single factor with the shortest path is considered in the path optimal method.
It should be particularly noted that the invention is based on the WeChat public platform, and a reasonable hospital diagnosis system is designed by an enumeration method, wherein the system comprises links of intelligent diagnosis guiding, appointment registration, preferred waiting, WeChat payment and the like. And a preferential waiting model is intensively researched, the proposed shortest time to see a doctor system model with priority ensures that the first registered patient has the right to see a doctor, and the queue waiting time model also allows the later registered patient to fully utilize the idle time of a doctor room, so that the shortest overall time to see a doctor of all patients is ensured. The proposed overall compromise shortest time algorithm specifies the time interval for each patient visit, sacrifices some of the priority, but further shortens the visit time. The preferential waiting system saves a large amount of treatment time for patients, improves the treatment efficiency of hospitals, and realizes reasonable allocation of limited resources while improving the satisfaction degree of the patients.
Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure herein. This application is intended to cover any variations, uses, or adaptations of the disclosure following, in general, the principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.
It will be understood that the present disclosure is not limited to the precise arrangements described above and shown in the drawings and that various modifications and changes may be made without departing from the scope thereof. The scope of the present disclosure is limited only by the appended claims.

Claims (5)

1. A preferential waiting method based on a WeChat platform is characterized by comprising the following steps:
s1, the patient enters a treatment process from the WeChat platform, and a disease set possibly suffered by the patient and a department and an examination which the patient needs to treat are determined according to symptoms provided by the patient through intelligent diagnosis guide;
s2, the patient makes appointment registration and payment operation according to the intelligent diagnosis guide result;
s3, after the payment is finished, planning a reasonable treatment route for the patient according to the patient waiting requirement by the preferred waiting model;
the establishment method of the preferential waiting model comprises the following steps:
defining the number of outpatients of a hospital to be M, wherein M corresponds to NmThe examination item, M is 1,2, M, the current number of patients is I, the treatment sequence of the ith patient is I
Figure FDA0003477764690000011
Wherein y ispFor the p-th visit department, piThe total number of visits to the department, I1, 2., I, for patient I;
finding the patient i in the visit sequence yiThe following total visit times were:
Figure FDA0003477764690000012
wherein,
Figure FDA0003477764690000013
in the order of visit yiThe time required for the next patient i to complete the p-th office examination,
Figure FDA0003477764690000014
and
Figure FDA0003477764690000015
respectively show the treatment sequence yiNext, the walking time, waiting time and visiting/examining time of the patient i at the p-th visit department,
Figure FDA0003477764690000016
in the order of visit yiNext, patient i waits for the examination result in the p-th office, and when yp∈{xm,0,x'm,0When the position of the movable part is changed,
Figure FDA0003477764690000017
xm,0and x'm,0The first and second visits of clinic m are respectively;
the shortest total visit time model for all patients was found to be:
Figure FDA0003477764690000018
finally, an optimal solution Y is obtained*＝{y* 1,y* 2,...y* IMinimizing the sum of the total time of visit for all patients;
when the patient requires to see the first diagnosis xm,0When the corresponding examination is carried out again later,
Figure FDA0003477764690000019
when the patient requires a return visit x'm,0When all the examinations corresponding to the out-patient m are done before,
Figure FDA0003477764690000021
in the formula, xm,nN, N is 1,2, corresponding to the outpatient mm，xm,0And x'm,0First and second visits, T, mb(yi,xm,0)、Tb(yi,xm,n) And Tb(yi,x'm,0) Respectively for patient i in the visit sequence yiThe initial time of the first visit, examination and the second visit, X, of the outpatient clinic miSet of outpatients and examinations for patient i registration, Ni,mNumber of examinations in outpatient m for patient i, Ni,m＝0,1,...,Nm，Tg(yi,xm,n) For patient i in the visit sequence yiGet the department x of seeing a doctorm,nThe time of the examination of the results.
2. The preferential treatment waiting method based on the WeChat platform as claimed in claim 1, wherein the patient who defines the preferential registration has the right to visit preferentially, and the visit time of patient i is as follows:
Figure FDA0003477764690000022
in the formula, FiA set of all possible visit orders for patient i;
when the patient requires to see the first diagnosis xm,0When the corresponding examination is carried out again later,
Figure FDA0003477764690000023
when the patient requires to enter"xing Do Chou'm,0When all the examinations corresponding to the out-patient m are done before,
Figure FDA0003477764690000024
3. the preferential treatment waiting method based on the WeChat platform as claimed in claim 2, wherein the shortest treatment time of the patient i is determined by an enumeration method;
firstly, arranging all the consulting rooms in a stack structure;
traversing all patient treatment sequences by using the constant change of the stack length;
and finally, screening out the path with the shortest time consumption.
4. The preferential treatment method based on the WeChat platform as claimed in claim 2, wherein the patient i is defined in the clinic xm,nIs available for a time interval of greater length than the average visit/examination time
Figure FDA0003477764690000031
The set of these is noted as:
Figure FDA0003477764690000032
in the formula,
Figure FDA0003477764690000033
for the ith patient in office xm,nJ is the total number of time intervals, and thus, patient i arrives at office xm,nThe waiting time before the visit is as follows:
when t is in the time interval
Figure FDA0003477764690000034
Middle time, tw(i,xm,n,t)＝0,tg(i,xm,n,j-1)＜t＜tb(i,xm,n,j)；
When t is in the time interval
Figure FDA0003477764690000035
And
Figure FDA0003477764690000036
in the middle of the time, the air conditioner,
tw(i,xm,n,t)＝tb(i,xm,n,j)-t,tb(i,xm,n,j)＜t＜tg(i,xm,n,j)；
in the formula, tb(i,xm,nJ) and tg(i,xm,nJ) patient i is in office xm,nThe jth available time interval of
Figure FDA0003477764690000037
The start and end times of the system.
5. The preferential treatment waiting method based on the WeChat platform as claimed in claim 4, wherein the time interval of each patient visit is integral multiple of the average visit/examination time of the consulting room.
CN201910957901.2A 2019-10-10 2019-10-10 Preferential waiting method based on WeChat platform Active CN110766209B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910957901.2A CN110766209B (en) 2019-10-10 2019-10-10 Preferential waiting method based on WeChat platform

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910957901.2A CN110766209B (en) 2019-10-10 2019-10-10 Preferential waiting method based on WeChat platform

Publications (2)

Publication Number Publication Date
CN110766209A CN110766209A (en) 2020-02-07
CN110766209B true CN110766209B (en) 2022-05-13

Family

ID=69331623

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910957901.2A Active CN110766209B (en) 2019-10-10 2019-10-10 Preferential waiting method based on WeChat platform

Country Status (1)

Country Link
CN (1) CN110766209B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111582525B (en) * 2020-05-12 2023-07-14 昆明医科大学第一附属医院 Centralized automatic reservation system and method for clinical examination and inspection of hospital
CN115376673B (en) * 2022-10-26 2023-01-10 江苏健康无忧网络科技有限公司 Medical examination path planning method and system
CN116895371B (en) * 2023-09-08 2024-03-26 中国人民解放军空军特色医学中心 Patient guiding method, system, terminal and storage medium based on general surgery

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108074313A (en) * 2016-11-10 2018-05-25 睿传数据股份有限公司 It waits to see the doctor program system
CN109524092A (en) * 2018-09-28 2019-03-26 宁波鑫义信息科技有限公司 A kind of hospital admission queuing strategy
CN109545300A (en) * 2018-11-15 2019-03-29 安徽信果网络科技有限公司 A kind of electronic medical record system based on wechat small routine

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8015127B2 (en) * 2006-09-12 2011-09-06 New York University System, method, and computer-accessible medium for providing a multi-objective evolutionary optimization of agent-based models

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108074313A (en) * 2016-11-10 2018-05-25 睿传数据股份有限公司 It waits to see the doctor program system
CN109524092A (en) * 2018-09-28 2019-03-26 宁波鑫义信息科技有限公司 A kind of hospital admission queuing strategy
CN109545300A (en) * 2018-11-15 2019-03-29 安徽信果网络科技有限公司 A kind of electronic medical record system based on wechat small routine

Also Published As

Publication number Publication date
CN110766209A (en) 2020-02-07

Similar Documents

Publication Publication Date Title
CN110766209B (en) Preferential waiting method based on WeChat platform
Kuo et al. Improving the efficiency of a hospital emergency department: a simulation study with indirectly imputed service-time distributions
Molenbruch et al. Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation
Woodall et al. Improving patient access to chemotherapy treatment at Duke Cancer Institute
Chen et al. Fair task assignment in spatial crowdsourcing
McCulloch Joint modelling of mixed outcome types using latent variables
Bernstein et al. Emergency department crowding: old problem, new solutions
CN103455886B (en) Dicision of diagnosis and treatment based on workflow supports system
Fialho et al. Using discrete event simulation to compare the performance of family health unit and primary health care centre organizational models in Portugal
Wang et al. Adaptive dynamic programming algorithms for sequential appointment scheduling with patient preferences
Gai et al. Toward smart treatment management for personalized healthcare
Liu et al. Dynamic and static job allocation for multi-server systems
CN102012961A (en) Prescription data transmission and processing system
CN109166632A (en) A kind of medical service method Internet-based
Zhu et al. Admission scheduling of inpatients by considering two inter-related resources: Beds and operating rooms
Zayas-Caban et al. Optimal control of an emergency room triage and treatment process
Masters et al. Ensuring diversity in clinical trials: the role of clinical pharmacology
Bouras et al. A three-stage appointment scheduling for an outpatient chemotherapy unit using integer programming
US10983982B2 (en) Method and system for approving a submission of information
Ortiz-Barrios et al. An AI-based multiphase framework for improving the mechanical ventilation availability in emergency departments during respiratory disease seasons: a case study
Jung et al. Advanced verification on WBAN and cloud computing for u-health environment
Wang et al. Optimization and approximation methods for dynamic appointment scheduling with patient choices
Su et al. Online scheduling for outpatient services with heterogeneous patients and physicians
Bouras et al. Multi-stage appointment scheduling for outpatient chemotherapy unit: a case study
Han et al. A multi-appointment patient scheduling system with machine learning and optimization

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