CN110148457A - A kind of doctor's inspection paths planning method based on Iterated Local Search - Google Patents

A kind of doctor's inspection paths planning method based on Iterated Local Search Download PDF

Info

Publication number
CN110148457A
CN110148457A CN201810728995.1A CN201810728995A CN110148457A CN 110148457 A CN110148457 A CN 110148457A CN 201810728995 A CN201810728995 A CN 201810728995A CN 110148457 A CN110148457 A CN 110148457A
Authority
CN
China
Prior art keywords
doctor
inspection
time
optimal case
patient
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
Application number
CN201810728995.1A
Other languages
Chinese (zh)
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.)
Shandong Industrial Technology Research Institute of ZJU
Original Assignee
Shandong Industrial Technology Research Institute of ZJU
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 Shandong Industrial Technology Research Institute of ZJU filed Critical Shandong Industrial Technology Research Institute of ZJU
Priority to CN201810728995.1A priority Critical patent/CN110148457A/en
Publication of CN110148457A publication Critical patent/CN110148457A/en
Pending legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06QDATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/04Forecasting or optimisation, e.g. linear programming, "travelling salesman problem" or "cutting stock problem"
    • G06Q10/047Optimisation of routes, e.g. "travelling salesman problem"
    • GPHYSICS
    • G16INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
    • G16HHEALTHCARE INFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR THE HANDLING OR PROCESSING OF MEDICAL OR HEALTHCARE DATA
    • G16H40/00ICT 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/20ICT 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

Abstract

The present invention provides a kind of doctor's inspection paths planning method based on Iterated Local Search, comprising: acquisition doctor's inspection parameter;Settling time tiIntersection;Establish prioritization scheme model P;Obtain optimal case P0;By optimal case P0It is pushed to each doctor and examines patient.This method, which utilizes, is based on Monte Carlo simulation and Iterated Local Search, recommends optimal doctor to examine path for doctor inspection patient, can be improved the efficiency of doctor's inspection, be conducive to the maintenance of doctor's inspection order.

Description

A kind of doctor's inspection paths planning method based on Iterated Local Search
Technical field
The invention belongs to field of medical service more particularly to a kind of medical inspection is advised using local search algorithm The method drawn and pushed to doctor inspection patient.
Background technique
With the raising of modern standard of living, the following health problem is at modern's increasingly focus of attention Problem.Today's society, the main force that youth group increases as the GDP output value, the phenomenon that staying up late for work be also it is commonplace, thus Bring consequence is exactly sub-health state.Meanwhile the continuous attention with the continuous development of medical technology and people to health, Physical examination is no longer the exclusive label of the middle-aged and the old, and all becomes a more universal social phenomenon gradually in each age level. Meanwhile not only physical examination, patient will also tend to design the inspection of various projects during going to hospital to see a doctor, these inspections Great challenge is brought with the physical examination implementation efficiency mixed in together in terms of hospital.Although various big hospital suffers from oneself Yi Jian department, Partial Hospitals have even specially set up physical examination branch, but due to professional attending doctor and independent Yi Jian department Scarcity, disordering, resource utilization be low in face of the doctor inspection crowd in continuous growth trend, such as in inspection, high labor cost Doctor's specimen that the problems such as equal have all seriously affected patient, which is tested, examines efficiency with the doctor of hospital.Therefore, how to guarantee hospital doctor inspection effect Under conditions of doctor's specimen of rate and patient are tested, each Yi Jian department and doctor's inspection equipment are most effectively made good use of, while allowing trouble Person spends the least time, completes doctor's inspection into current urgent problem to be solved with most fast speed.
But doctor's inspection path planning is a complex problem, because doctor's inspection project is numerous, needed for each project Time be also it is different in size, do not considering individual time-consuming difference and some patientss of the every patient when undergoing each project It has been the complete problem of a NP, therefore not in the case that the case where may being considered based on individual convenience breaks rule Preferably use optimization algorithm.
The major advantage of local search algorithm is that it is a kind of more common optimization algorithm, can more easily answer For specific optimization problem.But there is also some obvious shortcomings for traditional local search algorithm, most important is exactly to pass The local search algorithm of system is easily trapped into local optimum in optimization process.Although some local search algorithms use some spies Different strategy avoids falling into local optimum, but works as problem scale, these algorithms are not still in the case that complexity is bigger Avoidable earth subsidence enters local optimum.Moreover, guaranteeing in the most of the time before doctor's inspection terminates in doctor's inspection path planning problem Each Yi Jian department is the lowest tolerated limit for acquiring this problem suboptimal solution all in busy state.Meet this lowest tolerated Limit, many simple local search algorithms can meet demands, such as climbing method etc..Certainly this is based on simple feelings Condition, the i.e. same day all patients are all to reach hospital simultaneously, and each patient is identical in the time-consuming for doing identical doctor's inspection project, simultaneously Assuming that each patient can strictly obey hospital in terms of scheduling (just can not occur certain Yi Jian departments in this case has trouble The phenomenon that person's number of mistake).But reality is, the time point that the patient for first engaging in doctor's inspection reaches hospital has successively, even if to the The patient elder generation perfecting program of one bulk arrivl hospital, during successive patients reach successively, efficiency highest has also been made by hospital Path planning, it is preferential to select but it is possible that being based partially on current each department is lined up situation in the patient of subsequent arrival Yi Jian department that is less or completing fast speed is lined up to realize the optimal situation of individual.Once there is this patient The case where not carrying out doctor's inspection by advance planning, entire algorithm just will appear many uncertainties.Therefore existing office how is improved Portion's searching algorithm is the pain spot for solving doctor's inspection path planning problem come the application scenarios for preferably agreeing with doctor's inspection.
Summary of the invention
Technical problem to be solved by the invention is to provide a kind of, and the doctor based on Iterated Local Search examines paths planning method, This method, which utilizes, is based on Monte Carlo simulation and Iterated Local Search, recommends optimal doctor to examine path for doctor inspection patient, can be improved The efficiency for curing inspection is conducive to the maintenance of doctor's inspection order.
The technical proposal adopted by the invention to solve the above technical problems is that: a kind of road Yi Jian based on Iterated Local Search Diameter planing method, comprising the following steps:
(1) acquisition doctor inspection parameter, including doctor inspection patient populations n, Yi Jian department sum h and everyone in each Yi Jian department The time t spent needed for being checkedi(i=1,2,3 ... ..., h);
(2) settling time tiIntersection, and from the intersection access time longest preceding j time as most complicated doctor Examine the time;
(3) assume that all Yi Jian departments are in operating state and time tiIn it is other other than the preceding j time when Between it is all identical, establish prioritization scheme model P;
(4) prioritization scheme model is solved, obtains optimal case P0
(5) by optimal case P0It is pushed to each doctor and examines patient.
Further, this method further includes to time tiIntersection update, every certain time interval x, to time ti It is counted again respectively, and the intersection after counting again is updated to again in prioritization scheme model P, after solution obtains update Optimal case P0’。
Further, this method further includes to the new statistics again that doctor inspection patient is added, every y pairs of certain time interval Doctor's inspection patient populations n is counted again, and the doctor after counting again is examined patient populations n and is updated to prioritization scheme model again In P, solution obtains updated optimal case P0”。
Further, this method further includes the statistics to push programme delivery rate, records the optimal case of each patient simultaneously Bound with corresponding receiving end, be spaced z at regular intervals, to optimal case with whether the path of receiving end consistent carries out It verifies, the consistent quantity of optimal case is compared with optimal case sum, obtains optimal case implementation rate P1
Further, according to optimal case implementation rate P1Setting is to optimal case P0、P0' and P0" disturbance.
The beneficial effects of the present invention are: the present invention initially sets up a Utopian optimal models, and pushed to patient, On the basis of optimal models, according to the disturbance factor that may occur, constantly this optimal models is monitored and is updated, thus Reach constantly improve with modified purpose, method of the invention, strong antijamming capability, renewal speed is fast, take into account Patient Experience and Hospital executes, and is conducive to the raising of doctor's inspection efficiency and the stabilization of doctor's inspection order.
Detailed description of the invention
Fig. 1 is system framework figure of the invention.
Specific embodiment
Implementation of the invention includes two parts, and first part is the foundation of initial model, initial model be with Consider based on Utopian state, the foundation of initial model mainly includes following aspect:
(1) acquisition doctor inspection parameter.
Doctor's inspection parameter is the parameter established Optimized model and must include, and it is total to specifically include doctor's inspection patient populations n, Yi Jian department The time t that number h is spent needed for being checked with everyone in each Yi Jian departmenti(i=1,2,3 ... ..., h).
(2) time spent needed for is an important consideration factor, settling time tiIntersection, and chosen from the intersection The time longest preceding j time examines the time as most complicated doctor;
(3) assume that all Yi Jian departments are in operating state and time tiIn it is other other than the preceding j time when Between it is all identical, establish prioritization scheme model P;
(4) prioritization scheme model is solved, obtains optimal case P0
(5) by optimal case P0It is pushed to each doctor and examines patient.
Idealized model is setting basis of the invention, and on the basis of idealized model, the present invention provides one Series is according in practice it can happen that the scheme being modified to idealized model.
For example, the present invention includes to time tiIntersection update because in idealized model, in addition to most complicated several Except department, it is believed that it is all the same that the doctor of other common departments examines the time, but obviously can not actually accomplish this reason The state for wanting, therefore be modified firstly the need of to the time, then by each doctor of each department examine patient wherein into Practise medicine inspection time statistics, it is available actually carry out doctor inspection time, every certain time interval x, to time tiPoint It is not counted again, and the intersection after counting again is updated to again in prioritization scheme model P, solution obtains updated Optimal case P0', updated scheme is pushed to each doctor again and examines patient.
In addition, not every patient can reach doctor's inspection scene on time in actual conditions, and therefore, after doctor's inspection starts, In method operational process namely of the invention, it is also possible to which the case where will appear is exactly that might have new doctor at any time and examine to suffer from Person is added in system, at this time a major parameter in influence model-doctor inspection patient populations n, therefore the invention also includes To the new statistics again that doctor inspection patient is added, that is, doctor's inspection patient populations n is counted again every certain time interval y, And the doctor after counting again is examined into patient populations n and is updated in prioritization scheme model P again, solution obtains updated optimal side Case P0", updated scheme is pushed to each doctor again and examines patient.
There are also some special situations, such as doctor inspection patient not to carry out doctor's inspection according to the scheme of push, then this In the case of, it is possible to interference can be generated to the data counted in model, for this purpose, the invention also includes to push programme delivery rate Statistics, records the optimal case of each patient and binds with corresponding receiving end, z is spaced at regular intervals, to optimal Scheme with whether the path of receiving end consistent is verified, the consistent quantity of optimal case and optimal case sum are carried out pair Than obtaining optimal case implementation rate P1
Another part of implementation of the invention is, on the basis of initial model, by local iterative algorithm according to Possible disturbance optimizes, and finally obtains a prioritization scheme, and the process of this optimization is as follows:
(1) the intersection S of initial solution s is obtained from prioritization scheme model P.
(2) local search is carried out in S, finds a locally optimal solution s1.
(3) disturbance s1 is set up, is brought into prioritization scheme model P, obtains new disaggregation s2.
(4) local search is carried out from new explanation s2, finds a locally optimal solution s3 again.
(5) it is based on determination strategy: for example, whether being higher than certain threshold according to the total time-consuming that s3 completes all patient's physical examination projects Value, judges s3 quality.
(6) when s3 is an ideal optimization solution in judging result, select to receive s3 as new explanation;When in judging result When s3 is ideal not enough or rollback s2.
(7) after retracting s2, step 4-5, the optimal solution until finding the condition of satisfaction are repeated.
If in step (7), certain time or under the conditions of, can not find suitable optimal solution, then return to Step 2, initial local search is re-started.
In this scheme, possible disturbance is foregoing, and s1 may be considered the disturbance that new patient is added, in addition New disturbance, such as s1 ' can also be set, this new disturbance s1 ' may be that patient does not carry out doctor's inspection according to schedule and produces Raw disturbance, disturbance can be specifically embodied in, and the queue number of some Yi Jian department increases, and the doctor of some Yi Jian department examines the time It lengthens.

Claims (5)

1. a kind of doctor based on Iterated Local Search examines paths planning method, characterized in that the following steps are included:
(1) acquisition doctor inspection parameter, including doctor inspection patient populations n, Yi Jian department sum h and each Yi Jian department complete a patient Inspection needed for spend average time ti(i=1,2,3 ... ..., h);
(2) settling time tiIntersection, and when the access time longest preceding j time is as most complicated doctor's inspection from the intersection Between;
(3) assume that all Yi Jian departments are in operating state and time tiIn other than the preceding j time all phases of other times Together, prioritization scheme model P is established;The model is for distributing current time all trouble Person is in the specific location in which Yi Jian department queue;
(4) prioritization scheme model is solved, obtains optimal case P0
(5) by optimal case P0It is pushed to each doctor and examines patient.
2. a kind of doctor based on Iterated Local Search according to claim 1 examines paths planning method, characterized in that the party Method further includes to time tiIntersection update, every certain time interval x, to time tiIt is counted again respectively, and will Again the intersection after counting is updated to again in prioritization scheme model P, and solution obtains updated optimal case P0’。
3. a kind of doctor based on Iterated Local Search according to claim 1 examines paths planning method, characterized in that the party Method further includes carrying out again every certain time interval y to doctor's inspection patient populations n to the new statistics again that doctor inspection patient is added Statistics, and the doctor after counting again is examined into patient populations n and is updated in prioritization scheme model P again, solution obtains updated Optimal case P0”。
4. a kind of doctor based on Iterated Local Search according to claim 1 examines paths planning method, characterized in that the party Method further includes the statistics to push programme delivery rate, records the optimal case of each patient and ties up with corresponding receiving end It is fixed, be spaced z at regular intervals, to optimal case with whether the path of receiving end consistent verifies, optimal case is consistent Quantity compared with optimal case sum, obtain optimal case implementation rate P1
5. a kind of doctor based on Iterated Local Search according to claim 4 examines paths planning method, characterized in that according to Optimal case implementation rate P1Setting is to optimal case P0、P0' and P0" disturbance.
CN201810728995.1A 2018-07-05 2018-07-05 A kind of doctor's inspection paths planning method based on Iterated Local Search Pending CN110148457A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810728995.1A CN110148457A (en) 2018-07-05 2018-07-05 A kind of doctor's inspection paths planning method based on Iterated Local Search

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810728995.1A CN110148457A (en) 2018-07-05 2018-07-05 A kind of doctor's inspection paths planning method based on Iterated Local Search

Publications (1)

Publication Number Publication Date
CN110148457A true CN110148457A (en) 2019-08-20

Family

ID=67589254

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810728995.1A Pending CN110148457A (en) 2018-07-05 2018-07-05 A kind of doctor's inspection paths planning method based on Iterated Local Search

Country Status (1)

Country Link
CN (1) CN110148457A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112035921A (en) * 2020-08-25 2020-12-04 中船文化科技(北京)有限公司 Shelter moving line planning method and device, electronic equipment and storage medium

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110106559A1 (en) * 2009-11-04 2011-05-05 Cerner Innovation, Inc. Optimization of a clinical experience
CN103246811A (en) * 2013-04-25 2013-08-14 中山大学 Medical system admission scheduling method based on ant colony optimization
CN106934476A (en) * 2015-12-29 2017-07-07 山东环球软件科技有限公司 A kind of method for being applied to the Waiting time optimization of health care region
CN107992955A (en) * 2017-12-26 2018-05-04 运城学院 Child massage reservation system based on APP
CN108039197A (en) * 2017-12-01 2018-05-15 首都医科大学附属北京天坛医院 Medical technologies auxiliary examination project scheduling bootstrap technique and system
CN108090597A (en) * 2017-12-29 2018-05-29 珠海国芯云科技有限公司 Medical appointment and queuing optimization method and device

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110106559A1 (en) * 2009-11-04 2011-05-05 Cerner Innovation, Inc. Optimization of a clinical experience
CN103246811A (en) * 2013-04-25 2013-08-14 中山大学 Medical system admission scheduling method based on ant colony optimization
CN106934476A (en) * 2015-12-29 2017-07-07 山东环球软件科技有限公司 A kind of method for being applied to the Waiting time optimization of health care region
CN108039197A (en) * 2017-12-01 2018-05-15 首都医科大学附属北京天坛医院 Medical technologies auxiliary examination project scheduling bootstrap technique and system
CN107992955A (en) * 2017-12-26 2018-05-04 运城学院 Child massage reservation system based on APP
CN108090597A (en) * 2017-12-29 2018-05-29 珠海国芯云科技有限公司 Medical appointment and queuing optimization method and device

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112035921A (en) * 2020-08-25 2020-12-04 中船文化科技(北京)有限公司 Shelter moving line planning method and device, electronic equipment and storage medium
CN112035921B (en) * 2020-08-25 2021-06-29 中船文化科技(北京)有限公司 Shelter moving line planning method and device, electronic equipment and storage medium

Similar Documents

Publication Publication Date Title
Zacharias et al. Appointment scheduling with no‐shows and overbooking
Fujimoto Distributed simulation systems
Schmidt et al. Decision support for hospital bed management using adaptable individual length of stay estimations and shared resources
Molina-Pariente et al. A stochastic approach for solving the operating room scheduling problem
Adriansyah et al. Controlling break-the-glass through alignment
CN107679818A (en) Software project management method, terminal and computer-readable recording medium
CN104410511B (en) A kind of server management method and system
CN110148457A (en) A kind of doctor's inspection paths planning method based on Iterated Local Search
CN107909310B (en) Scheduling method and device
Gul A stochastic programming approach for appointment scheduling under limited availability of surgery turnover teams
Burke et al. An integer linear programming model for the radiotherapy treatment scheduling problem
CN110717620A (en) Order meal delivery time prediction method and device, electronic equipment and storage medium
CN110008694A (en) A kind of application security control method, device, equipment and readable storage medium storing program for executing
Sangkla et al. Information integration of heterogeneous medical database systems using metadata
Yampaka et al. An application of process mining for queueing system in health service
CN108920724A (en) Data check method, apparatus and system
CN108111578A (en) The method of distribution terminal data acquisition platform access terminal equipment based on NIO
Li et al. A Petri net based model for a cloud healthcare system
Bauza et al. An automated scheduling system for radiotherapy physicist on-call using Monte Carlo simulation
CN112860951A (en) Method and system for identifying target account
Kumar et al. Simulating staffing needs for surgical instrument distribution in hospitals
CN109189784A (en) A kind of method of distributed electronic medical record data integration
CN109995547A (en) A kind of method for diagnosing faults and equipment
CN113035370A (en) Remote consultation queuing system optimization method
Guinet et al. A Multi-objective Patient Admission Planning Improving Resources Utilisation Under Bed Capacity Constraints

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
RJ01 Rejection of invention patent application after publication

Application publication date: 20190820