• <tr id="yyy80"></tr>
  • <sup id="yyy80"></sup>
  • <tfoot id="yyy80"><noscript id="yyy80"></noscript></tfoot>
  • 99热精品在线国产_美女午夜性视频免费_国产精品国产高清国产av_av欧美777_自拍偷自拍亚洲精品老妇_亚洲熟女精品中文字幕_www日本黄色视频网_国产精品野战在线观看 ?

    An Optimized Framework for Surgical Team Selection

    2021-12-15 08:14:14HemantPetwalandRinkleRani
    Computers Materials&Continua 2021年11期

    Hemant Petwaland Rinkle Rani

    Department of Computer Science and Engineering,Thapar Institute of Engineering and Technology,Patiala,147004,India

    Abstract:In the healthcare system,a surgical team is a unit of experienced personnel who provide medical care to surgical patients during surgery.Selecting a surgical team is challenging for a multispecialty hospital as the performance of its members affects the efficiency and reliability of the hospital’s patient care.The effectiveness of a surgical team depends not only on its individual members but also on the coordination among them.In this paper,we addressed the challenges of surgical team selection faced by a multispecialty hospital and proposed a decision-making framework for selecting the optimal list of surgical teams for a given patient.The proposed framework focused on improving the existing surgical history management system by arranging surgery-bound patients into optimal subgroups based on similar characteristics and selecting an optimal list of surgical teams for a new surgical patient based on the patient’s subgroups.For this end,two population-based meta-heuristic algorithms for clustering of mixed datasets and multi-objective optimizationwere proposed.The proposed algorithms were tested using different datasets and benchmark functions.Furthermore,the proposed framework was validated through a case study of a real postoperative surgical dataset obtained from the orthopedic surgery department of a multispecialty hospital in India.The results revealed that the proposed framework was efficient in arranging patients in optimalgroups as well as selecting optimal surgical teams for a given patient.

    Keywords:Multi-objective optimization;artificial electric field algorithm;mixed dataset clustering;surgical team;strength Pareto

    1 Introduction

    During a preoperative procedure,surgical team members,surgical specialty and experience,and coordination among the members play essential roles.Although various factors can affect surgical procedures,positive outcomes mainly depend on the individual surgical team members.Appropriate coordination and cooperation among those can reduce unavoidable conflicts during the procedures [1].Hence,the selection of an optimal surgical team is indispensable for a rapid patient recovery,decreased complications,and more favorable surgical management.However,the selection process is a considerably time-consuming and difficult task [2].In recent years,several studies have examined the performance of surgical team members.Many vital factors,such as understanding diagnostic complications and patient characteristics,and the surgical practice environment,can result in more satisfactory outcomes.In the field of medicine,appropriate management of surgical care is a difficult task as most surgical complications occur during intra operative surgical care [3].An efficient team can help in providing effective healthcare services [4].Hospitals and physicians always focus on providing a safe environment for patients and enhancing their wellbeing [5].A study investigated human factors associated with operating rooms and analyzed the relationship between their poor performance and the surgical procedures outcomes [4].Similarly,several studies adopted approaches such as malpractice claim analysis [6],root cause analysis [7],and prospective analysis [8]to reduce intra operative surgical complications.Although these studies tried to analyze the relationship between the performance of operating room and outcomes of surgery,however,contribution of significant factors affecting the performance of operating room were not considered [3].Studies examining factors such as teamwork in the operating room [9]and intensive care [10]focused on the effect of coordination and synergy among surgical team members.These studies have indicated the necessity and significance of surgical team selection procedure.As performing surgical procedures is often a risky and uncertain task,therefore high synergy is always expected among team members possessing different levels of experience and expertise.Various factors such as availability of surgeons,limitation of resources,and time etc.affect the surgical team selection in a multispecialty hospital;thus,selection of the surgical team is a challenging task [11].In a surgical team,different responsibilities are assigned to different individuals [12].As the responsibilities and the individuals to whom responsibilities are assigned change frequently with time,thus selecting an efficient team for the desired activity,considering time and resource limitation,becomes a complicated procedure.All the aforementioned studies have focused on personnel preferences for the day,shift,and units.However,none of these studies have considered the history of the surgical team,characteristics of patients,and feedback of patients who underwent surgery in the past.In this study,an optimal framework based on the characteristics of patients,history of the surgical team,and the feedback of previous surgical patients is proposed to assist in decision-making for the selection of optimal surgical teams.An optimal list of surgical teams contains more than one suitable surgical team that can be assigned to a surgical patient according to their availability.

    The rest of the paper is organized as follows.Section 2 presents an overview of the existing literature.Section 3 describes preliminary and background algorithms.Section 4 discusses the proposed framework in detail.Section 5 presents a detailed case study of the orthopedic surgery department at a multispecialty hospital in India.Section 6 summarizes the findings of this research and provides concluding remarks.

    2 Related Work

    2.1 Literature Review

    In a modern healthcare system,the provision of high-quality surgical services typically depends on symptoms of various patients.Classifying patients on the basis of their symptoms assist the decision-makers in identifying the target patient and making corresponding remedial decisions [13].In recent years,several methods have been proposed by the authors for clustering of patients.One of the studies used k-means clustering algorithm to partition the patients based on their health status [13].Another study used a multilayer clustering approach for partitioning of Alzheimer disease patients into male and female groups [14].In addition,few studies have used agglomerative hierarchical clustering for partitioning of patients based on presence of comorbidities such as chronic pain and mental illness;obesity and mental illness;cancer;diabetes and renal disease [15,16].A Bayesian nonparametric clustering approach was applied to divide patients having cancer into sub-groups to measure their anxiety and depression scores before psychotherapy [17].Further,in a study authors proposed a hierarchical clustering algorithm incorporating genetic concept for partitioning the patients with or without depression [18].Furthermore,many intelligent nature-inspired algorithms have also been proposed for data clustering.A study proposed a hybrid algorithm combining particle swarm optimization (PSO) and artificial bee colony (ABC) algorithms for data clustering [19].Additionally,k-means [20]and k-harmonic means [21]—clustering algorithms have been-used for performing—clustering of mixed datasets.The functioning of most of these clustering algorithms is dependent on the predefined number of clusters.However,in real-life problems,for most of the datasets the number of clusters is not known beforehand.Hence,the accurate estimation of an optimal number of clusters is a challenging task,and can affect the performance of a clustering algorithm also.Therefore,several algorithms,such as the gravitational search algorithm [22],harmony search algorithm [23],and differential evolution algorithm [24],have been proposed for automatic clustering to address the aforementioned challenge.Automatic clustering algorithms require no prior information regarding the number of clusters.Instead,they evaluate the optimal number of clusters based on the dataset only.In this paper,an efficient clustering algorithm for mixed datasets based on the artificial electric field algorithm (AEFA) [25]is proposed to categorize patients based on their characteristics (symptoms).A recent study utilized k-prototypes algorithm for partitioning of patients and genetic algorithm (GA) for the selection of optimal surgical team [5].Although the study reported favorable outcomes,it focused only on the complication ratio for the surgical team selection.However,the success of a surgical procedure depends on various factors also such as a lower surgical readmission rate,lower mortality and complication rates,and higher patient satisfaction (surgical feedback) etc.Therefore,this study considered the feedback of patients who underwent surgery in the past along with complication rates to select an optimal surgical team.Further,the GA [26,27]utilized by Ebadi et al.[5]is likely to experience premature convergence and diversity loss.In addition,Srinivas et al.[28],Gu et al.[29],Hassanzadeh et al.[30],Yuan et al.[31],and Nobahari et al.[32]have proposed several meta-heuristic approaches to prevent premature convergence.These algorithms have been found efficient in finding the optimal solution in a single computation.In this paper,an improved AFEA for multi-objective optimization is proposed to select optimal surgical teams.To the best of our knowledge,no study has focused on considering surgical feedback along with complication rates for selecting optimal surgical teams by utilizing AEFA.Tab.1 summarizes the existing work related to surgical decision-making.

    Table 1:Summary of the existing work related to surgical decision making

    (Continued)

    Table 1:Continued

    (Continued)

    Table 1:Continued

    2.2 Our Contribution

    (1) A decision-making framework is proposed to assist medical practitioners while selecting optimal surgical teams for a given patient.

    (2) Two population-based meta-heuristic algorithms are proposed for clustering of mixed datasets and multi-objective optimization,which are used for the partitioning of patients and the selection of optimal surgical teams,respectively.

    (3) The proposed algorithms are validated using a real surgical dataset of a multispecialty hospital in India.

    3 Preliminary and Background

    This section briefly discusses the basic concepts of partitioning clustering,distance measure for mixed datasets,multi-objective optimization,and artificial electric field algorithm (AEFA).

    3.1 Partitioning Clustering

    In data clustering,partitioning clustering arranges data points into distinct clusters(CLCi).Let us consider a datasetD={D1,D2,D3,...,Dn} ofndatapoints each withdattributes.For example,Dj=(Dj1,Dj2,...,Djd)is a vector representing thejthdatapoint,whereDjirepresents theithattribute ofDj.The partitioning clustering algorithm should satisfy the following condition:

    where,Nkrepresents the number of clusters.

    3.2 Distance Measure for Mixed Datasets

    The closeness between a data point and clusters is measured by computing the distance between them.The distance measure confirms homogeneity among the data points of a cluster and heterogeneity between different clusters.Arranging a mixed dataset into distinct clusters is a challenging task.In this paper,the distance measure(?)[20]is used to compute the distance between theithdata point (Pi)andjthcentroid(CLCj)as follows:whererepresents the distance between thetthnumeric attribute value ofPiand the centroidrepresents the distance between thetthcategorical attribute value ofPiand centroid (),andwtimplies the significance of thetthnumeric attribute.The distance between the two values of a categorical attribute is measured by computing the co-occurrence of these values with the values of other categorical attributes.

    3.3 Multi-objective Optimization

    A multi-objective problem (MOOP) can be a minimization or a maximization problem.It involvesOdistinct target objectives that are defined as follows:

    Minimize/Maximize:Fitness(Pr)=[Fitnessi(Pr),i=1,2,...,O]

    where,Fitnessi(Pr)represents theithobjective function of thesolution,andECj(Pr)andICk(Pr)representjthequality andkthinequality constraints,respectively.In MOOP,Pareto dominance theory [31]is utilized to determine optimal solutions in global search space.

    3.4 Artificial Electric Field Algorithm(AEFA)

    AEFA,a population-based meta-heuristic algorithm,simulates Coulomb’s law of electrostatic attraction force (EAF) and the law of motion.Each candidate solution in AEFA is represented as a charged particle.The charge present on each charged particle assists in evaluating the performance of a candidate solution.Because of EAF,each charged particle attracts another charged particle,resulting in the global movement of all charged particles toward a heavier charged particle.

    4 Proposed Framework

    This section provides a detailed description of the proposed framework.The proposed framework consists of two modules:surgical history management (SHM) and surgical team selection(STS).The SHM module involves two activities:(1) clustering of existing surgical patients based on their characteristics and (2) filtering of existing surgical team details.The STS module produces an optimal list of surgical teams for a given patient.The SHM module is designed to assist the STS module in decision-making.Fig.1 presents the workflow of the proposed framework.

    4.1 Surgical History Management(SHM)Module

    Surgical history is a vital aspect of medical records and includes the social and demographic information of surgical patients,the details of surgical teams,and the outcomes of diagnostic and procedural tests.For multispecialty hospitals that provide surgical services to numerous patients,efficient management of surgical records is essential.An efficiently organized surgical history helps hospitals to enhance their patient care and resource efficiency.To utilize these surgical records,the following two activities are performed in the SHM module.

    4.1.1 Clustering of the Existing Surgical Patients

    Arranging existing surgical patients in disjoint clusters based on their characteristics can help hospitals to find a suitable subgroup for a newly referred surgical patient.In this study,an efficient data clustering algorithm for mixed datasets [33]is proposed to cluster surgical patients.The proposed clustering algorithm (Algorithm 1) based on the AEFA focuses on finding optimal clusters automatically.The steps of the proposed clustering algorithm are as follows:

    Figure 1:Workflow of the proposed framework

    A.Improved Electrostatic Force Computation and Velocity Update

    In a traditional AEFA,the total electrostatic attraction force (TEAF;Eq.(2)) onithcharged particle is computed by multiplying a random number to EAF exerted byjthcharged particles on it.This force affects acceleration and velocity,thus resulting in the global movement of all charged particles.Furthermore,the velocity (Eq.(4)) ofithcharged particle is updated by multiplying a random number to its existing velocity value.These random numbers add stochastic behavior in an algorithm’s search process,resulting in an imbalance between exploration and exploitation,thus causes the algorithm to trap in local optima.To maintain a balance between exploration and exploitation,instead of using only random number we have considered charge of a charged particle (qi)also.The charge of a charged particle controls the stochastic behavior during the computation of TEAF and velocity;this,in turn,reduces the acceleration and velocity values of the charged particle,thus balancing exploration and exploitation.The modified equations (Eqs.(3)and (5)) are shown as follows:

    where,r1andr2are two non-negative integers andr1+r2=1.Furthermore,in case ofr1=1 andr2=0,Eqs.(3) and (5),and Eqs.(2) and (4) are treated identically.

    B.Selection of Active Centroids

    For each candidate solution,active centroids are selected fromCLCmaxcentroids based on the following condition:

    where,TCOVis the cutoff value for each centroid,and is set to a random value between [0,1].TCOVdepends on the selection threshold value(THVSL)of a centroid and is computed as follows:

    where,CLCactiverepresents the number of active centroids in each candidate solution.

    Algorithm 1:Proposed algorithm for clustering surgical patients Input:A postoperative surgical dataset Output:Patients with their optimal clusters Begin Define the maximum number of iterations (MaxIT),the maximum number of clusters (CLCmax),population size (PS),selection threshold (THVSL) and cutoff threshold (TCOV)Compute the dimension and randomly initialize a population of patients (PT) as a cluster centroid from the dataset Initialize iteration counter,It=1 While It<MaxIT do for i=1 to PS do for j=1 to CLCmax do if (THVij>TCOV) then Verify and activate the centroid PTj i by using Eq.(6)else PTj i is set to inactive end if end for for each patient (PTi) in given mixed dataset A.Compute the distance between PTi and active PTj i by using Eq.(1) and assign PTi to the nearest active PTj i B.Verify and reinitialize the empty PTj i as described in Section 4.1.1 end for

    (Continued)

    end for Update the population 8) and the distanc te THVSL and TCt+1 by following the AEFA algorithm (Section 4.1.1).The fitness function in Eq.(e measures in Eq.(1) are used to direct the exploration process.UpdaOV for each PT in the updated population by using Eq.(7)It=I end while Return patients (PT) and their optimal clusters.

    C.Validation of Empty Clusters

    A centroid having less than two data points is termed as an empty cluster.In such cases,the corresponding centroid of the candidate solution is reinitialized,andm/CLCactivedata points are assigned to each nearest active centroid.

    D.Computation of Fitness

    The efficiency of a clustering algorithm depends on the cluster validation criteria.In this study,we have used silhouette index (SI) criteria for cluster validation.The fitness of the candidate solution is computed as follows:

    where,Meangrepresents the mean distance to other data points in the same cluster (mean intracluster distance),andMeanhrepresents the mean distance to other data points in different clusters(mean inter-cluster distance).A candidate solution with the minimum fitness is selected as an optimal solution.

    4.1.2 Filtration of the Existing Surgical Team

    In this section,a postoperative surgical dataset is considered as an input.Subsequently,on the basis of the required surgery type (e.g.,orthopedic surgery,neurosurgery,and pediatric surgery etc.),the details of existing surgical teams are retrieved.A surgical team involves a surgeon,a nurse circulator,and an anesthesiologist.For each retrieved surgical team,additional information such as the complication rate and patient’s surgical feedback rating-are computed and stored in a database.This stored information helps decision makers in optimizing the process of surgical team selection.

    4.2 Surgical Team Selection(STS)Module

    This module is invoked when the proposed framework receives details of a new surgical patient.Subsequently,an optimal cluster is selected for the new patient.The details of the corresponding surgical teams are then retrieved from the selected cluster and processed to obtain the optimal list of surgical teams.In this paper,an efficient meta-heuristic algorithm for multiobjective optimization based on AEFA is proposed to generate an optimal list of surgical teams.

    4.2.1 Proposed Multi-objective Optimization Algorithm for Surgical Team Selection

    The proposed multi-objective optimization (MOOA) algorithm begins with parameter initialization.Subsequently,the population of candidate solutions is generated.The proposed algorithm has two populations:search population(PSearch)and external population(PExternal).ThePSearch,which contains initial candidate solutions,computes non dominant solutions and stores them inPexternal.The surgical team retrieved in the STS module serves as an initialPSearch,and along with the surgical team extracted in the SHM module,it is used to conduct the exploration process of the proposed algorithm.The maximum size of the initial population is computed as follows:

    Finally,on the basis of the fitness value of each candidate solution,the best solution is selected.This process is iteratively performed until the convergence condition is satisfied and optimum solutions are obtained.To improve convergence,bounded exponential crossover (BEX) [34]and polynomial mutation operator (PMO) [35]are used in the proposed MOOA.Furthermore,to enhance exploration and exploitation,modifications are introduced in the electrostatic force computation and velocity update (Section 4.1.1) in the proposed MOOA.The proposed MOOA is presented in Algorithm 2.

    Algorithm 2:Proposed multi-objective optimization algorithm for surgical team selection Input:Details of the existing surgical teams (obtained from STS and SHM modules)Output:Optimal list of surgical teams Begin Define the search population size (PSSize),external population size (PESize),and the maximum number of iterations (MaxIT)Initialize the search population (PSearch) of the surgical team (ST) obtained from the STS module.Initialize the external population PExternal=? and set an iteration counter It=1.while(It<MaxIT)for each ST ∈PSearchItUPExternalIt(i).Compute the fitness (Fitness(ST)) by using Eqs.(10) and (11)(ii).Compute the additional density value (Density) by using the kth nearest neighbor algorithm.end for for each ST ∈PSearchIIUPExternalIt do if Fitness(ST)<1 then PExternalIt+1=PExternalIt+1U{ST}end if end for if (size ofimages/BZ_1091_577_2363_599_2408.pngimages/BZ_1091_587_2326_606_2372.pngPExternalIt+1images/BZ_1091_842_2326_861_2372.png<PESize),then PExternalIt+1=PExternalIt+1Uimages/BZ_1091_975_2381_993_2426.pngimages/BZ_1091_993_2381_1011_2426.pngPSearchItUPExternalItimages/BZ_1091_1400_2381_1418_2426.pngimages/BZ_1091_1424_2381_1442_2426.png1:PESize==PExternalIt+1==images/BZ_1091_1887_2380_1904_2426.pngimages/BZ_1091_1905_2380_1923_2426.pngelse Compute the additional density values for each non-dominant ST in PExternalIt+1 and delete an ST with the smallest density value.end if(i).Select surgical team (ST) into the mating pool PIt+1 from PSearchItUPExternalIt+1(ii).Compute charge,update the velocity and position of POPIt+1,and obtain the new STs(iii).Apply BEX and PMO on population PIt+1

    (Continued)

    for each ST ∈PExternalIt+1 do Compute the additional density value of each ST end for Compute the additional density value of each ST in PExternalIt+1 and perform nondominant sorting It=It+1 end while Return the optimal list of surgical teams (ST)

    4.2.2 Fitness Evaluation of the Surgical Team

    In this study,two factors are considered to evaluate the performance of a surgical team:complications associated with surgery [5]and patients’surgical feedback rating.Surgical feedback is defined as the experience of patients during the surgical period.In this study,the feedback ratings of existing surgical teams were collected in terms of a surgical team’s behavior and activity.The fitness functions are computed as follows:

    Minimize

    Maximize

    Fitness(ST)=SFt(ST)

    where,CompFt(ST)is a fitness value that represents a combination of complication ratioComptand no-complication rationoComptassociated with the surgical team (ST) at timet.SFtrepresents surgical feedback rating and is computed as follows:

    where,represents mean of the feedback rating provided byjthpatient forithteam member.SPSTiandnare the number of surgical patients treated by theithteam member and the total number of team members,respectively.Thus,the overall objective is to find surgical teams with a lower complication ratio and higher feedback rating.

    Because the definition of charge in the conventional AEFA was not found to be suitable for solving MOOPs [25],thus this study uses multi-objective function given by SPEA2 [36]as the fitness function of the AEFA.

    Fitness(STi)=Raw_Fitness(STi)+Density(STi)

    where,Fitness(STi),Density(STi),andRaw_Fitness(STi)represent the fitness value,additional density value,and raw fitness value of theithsurgical team,respectively.For each surgical team,Raw_Fitness(STi)is computed in terms of Compt(ST)andSFt(ST),and it exhibits the strength of a solution (surgical team) by computing the number of other solutions on which it dominates and assigns a rank to the solution.In a situation where multiple solutions are non-dominant and are assigned similar ranks,the additional density value (Density) is used to differentiate various solutions.In this paper,kthnearest neighbor algorithm is used to estimate the density.

    5 Experimental Results and Discussion

    Experiments were performed using a real case study of a multispecialty hospital in India.The proposed framework was implemented using a postoperative surgical dataset (POS) [33],which was obtained from the orthopedic surgery department of the hospital.Sub-section 5.1 discusses the performance of the SHM module.Subsection 5.2 discusses the performance of the STS module.Performances of the SHM and STS modules are discussed in sub-sections 5.1 and 5.2 respectively.Tab.2 lists symbols used in the proposed framework.

    Table 2:Symbols used in the proposed framework

    5.1 Performance Evaluation of the SHM Module

    The performance of the SHM module was evaluated in three steps.Firstly,the performance of the proposed clustering algorithm was measured using nine real-life datasets (Tab.3).Secondly,it was compared with six existing clustering for non-mixed dataset:(i) PSO,(ii) hybrid atom search optimization (ASO) and PSO (ASOPSO),(iii) ASO,(iv) hybrid PSO and gravitational search algorithm (PSOGSA),(v) hybrid PSO and firefly algorithm (PSOFA),(vi) hybrid ASO and sine-cosine algorithm (ASOSCA) [37].The results revealed that the proposed clustering algorithm outperformed existing algorithms (Tab.4).Subsequently,the performance of the proposed clustering algorithm was also compared with five existing clustering algorithms for mixed dataset:(i) k-means clustering algorithm,(ii) KHMCMD,(iii) k-prototypes clustering algorithm [38],(iv)Improved k-prototypes clustering algorithm [39],(v) algorithm proposed by Ji et al.[40].The comparative results are shown in Tab.5.Thirdly,the performance of the proposed clustering algorithm was evaluated using the POS dataset.The results revealed that considering all iterations,six active patient clusters with a selection frequency of 1.6,an average fitness of 0.96,and a standard deviation of 0.13 were selected as an optimal solution (Tab.6).

    Table 3:Characteristics of real-life datasets

    Table 4:Comparison of the performance of proposed and existing clustering algorithms for nonmixed dataset

    Table 5:Comparison of the performance of proposed and existing clustering algorithms for mixed dataset

    5.2 Performance Evaluation of the STS Module

    The performance of the STS module of the proposed MOOA is evaluated on the basis of parameters listed in Tab.7 using three benchmark functions,namely SCH,FON,and ZDT1 [41].Subsequently,the performance of the proposed MOOA was compared with four existing MOOAs:SPGSA [31],NSGA II [41],NSPSO [42],and BCMOA [43],on the basis of three performance parameters,namely converge metric [CM],diversity metric [DM][41],and generational distance metric (GD) [44].A minimum value of all these parameters is desired for optimal solutions.The results demonstrated that the proposed algorithm achieved a minimum value for CM,DM,and GD (in terms of the mean) for all considered benchmark functions (Tab.8).This finding indicated that the proposed algorithm outperformed existing MOOAs in terms of the convergence rate while maintaining the diversity among optimal solutions.The results shown in Tab.8 are presented as a graph in Fig.2.For better representation,results in the graphs are shown using a logarithmic scale,where higher logarithmic value represents minimum value of the mean.As shown in Fig.2,the proposed algorithm achieved a high logarithmic value of the mean (minimum value of the mean) for all metrics,indicating that the proposed algorithm is more efficient and robust in comparison to existing MOOAs.

    Table 7:Parameters used in the proposed multi-objective optimization algorithm

    Table 8:Comparison of the performance of proposed and existing multi-objective optimization algorithms

    The details related to a surgical patient (Tab.9) were submitted as input to the STS module.Then,a suitable active patient cluster was selected from the six optimal active patient clusters (obtained from the SHM module),and associated surgical teams were extracted from it.The selected cluster contained 400 orthopedic surgical records in which 15 distinct surgeons,40 anesthesiologists,and 30 nurses were involved.It resulted in 18000 possible combinations of surgical teams.Finally,135 surgical teams were generated as an initial search population,and the proposed algorithm was implemented on it.The results are shown in Figs.3 and 4.Figs.3a and 3b show the comparison between the proposed and existing algorithms in terms of the complication ratio and surgical feedback rating,respectively.From Fig.3a it is clear that the proposed algorithm converged faster to the optimal solution and obtained the lowest value of the complication ratio in comparison to existing algorithms.Similarly,Fig.3b illustrates that the proposed algorithm achieved maximum value of surgical feedback rating also.The final results presented in Fig.4 revealed that six optimal surgical teams were selected for the referred surgical patient.This can be assigned to the patient as per availability of the team members.

    Figure 2:Comparison of performance between proposed and existing MOOAs based on (a) CM,(b) DM,and (c) GD

    Table 9:Attributes of a surgical patient

    Figure 3:Comparison of performance between proposed and existing MOOAs for surgical team selection based on (a) complication ratio and (b) surgical feedback rating score

    Figure 4:Optimal Pareto list of the selected surgical team

    6 Conclusion

    High-quality surgical services are essential from the perspective of hospitals and patients both.Surgical outcomes depend on the performance of dedicated surgical teams,which in turn affects hospital’s efficiency and patients’trust towards that hospital.In multispecialty hospitals many surgical patients are treated concurrently.Therefore,arranging a suitable surgical team for achieving success of a surgical procedure is crucial and challenging.This study addresses the challenge of selection of an optimal list of surgical teams for a referred patient,so that each patient can receive high-quality surgical care.In this paper a framework is proposed to assist decision makers in selecting an optimal list of surgical teams.The proposed framework contains two modules:SHM and STS.SHM focuses on arranging existing surgical patients into optimal patient subgroups.This arrangement of patients further assists the STS module in selecting the optimal list of surgical teams.In this paper,an efficient clustering algorithm for mixed data is proposed to identify optimal subgroups of patients.Besides,a MOOA is proposed to select optimal surgical teams.The proposed framework is validated through a case study of the orthopedic surgery department at a multispecialty hospital in India.Data related to existing surgical records is obtained from the hospital.The performance of the proposed algorithms is evaluated based on different benchmark functions and datasets,and is compared with the existing algorithms also.The experimental evaluation revealed that the proposed algorithm yielded more favorable and significant results in comparison to the existing algorithms,indicating the efficient functionality of the proposed framework.

    Funding Statement:The authors received no specific funding for this study.

    Conflicts of Interest:The authors declare that they have no conflicts of interest to report regarding the present study.

    深夜a级毛片| av.在线天堂| 美女大奶头视频| 亚洲自偷自拍三级| 性插视频无遮挡在线免费观看| 99热这里只有是精品在线观看| 淫妇啪啪啪对白视频| 国产精品98久久久久久宅男小说| 国产 一区精品| 九九热线精品视视频播放| 在现免费观看毛片| 国产在视频线在精品| 人妻制服诱惑在线中文字幕| www日本黄色视频网| 亚洲熟妇熟女久久| 人妻少妇偷人精品九色| 亚洲在线观看片| 欧美日韩综合久久久久久 | 久久久久久国产a免费观看| 亚洲精品久久国产高清桃花| 国产v大片淫在线免费观看| 99精品在免费线老司机午夜| 精品人妻偷拍中文字幕| 亚洲无线在线观看| 久久久久性生活片| 看片在线看免费视频| 亚洲电影在线观看av| 国产精品久久久久久精品电影| 亚洲黑人精品在线| 亚洲avbb在线观看| .国产精品久久| 国产一区二区在线观看日韩| 亚洲黑人精品在线| 校园春色视频在线观看| 国产黄片美女视频| 国内揄拍国产精品人妻在线| 色播亚洲综合网| 亚洲国产色片| xxxwww97欧美| 色5月婷婷丁香| 国产精品久久久久久亚洲av鲁大| 我要看日韩黄色一级片| 干丝袜人妻中文字幕| 在线国产一区二区在线| 日本与韩国留学比较| 日韩强制内射视频| 最新在线观看一区二区三区| 天天一区二区日本电影三级| 欧美bdsm另类| 99国产精品一区二区蜜桃av| 日本在线视频免费播放| 日韩中文字幕欧美一区二区| 精品午夜福利在线看| 高清毛片免费观看视频网站| 最近最新中文字幕大全电影3| 在线a可以看的网站| 男女做爰动态图高潮gif福利片| 两个人视频免费观看高清| 午夜激情福利司机影院| 91在线观看av| www日本黄色视频网| 成人午夜高清在线视频| 亚洲男人的天堂狠狠| 久久久久国产精品人妻aⅴ院| 国产 一区精品| 男女之事视频高清在线观看| 九九爱精品视频在线观看| 女的被弄到高潮叫床怎么办 | 久久亚洲真实| 一本精品99久久精品77| 麻豆久久精品国产亚洲av| 国产高清视频在线观看网站| 亚洲av免费高清在线观看| 久久久久久久亚洲中文字幕| 久久热精品热| 欧美日韩乱码在线| 亚洲不卡免费看| 国产精品1区2区在线观看.| 热99在线观看视频| 日本 欧美在线| 日本三级黄在线观看| 国语自产精品视频在线第100页| 最新中文字幕久久久久| 成人无遮挡网站| 国产精品久久电影中文字幕| 精品福利观看| 亚洲自偷自拍三级| xxxwww97欧美| 黄色日韩在线| 在线免费观看的www视频| 春色校园在线视频观看| 亚洲av成人精品一区久久| 午夜福利在线观看免费完整高清在 | 亚洲av电影不卡..在线观看| 一区二区三区激情视频| 九九热线精品视视频播放| 桃色一区二区三区在线观看| 亚洲综合色惰| 免费搜索国产男女视频| 欧美另类亚洲清纯唯美| 在线a可以看的网站| 亚洲精品色激情综合| 精品一区二区三区视频在线| 在线观看舔阴道视频| 日本与韩国留学比较| 岛国在线免费视频观看| 久久久久久久久久久丰满 | 欧美一区二区亚洲| 日韩欧美在线二视频| 三级男女做爰猛烈吃奶摸视频| 一进一出好大好爽视频| 国产成人av教育| 亚洲精华国产精华液的使用体验 | 身体一侧抽搐| 有码 亚洲区| 一区二区三区四区激情视频 | 露出奶头的视频| 国产成人av教育| 国产伦一二天堂av在线观看| 亚洲综合色惰| aaaaa片日本免费| 久久精品国产亚洲av涩爱 | av在线观看视频网站免费| 一级毛片久久久久久久久女| 日本三级黄在线观看| 亚洲第一区二区三区不卡| 天堂√8在线中文| 美女 人体艺术 gogo| 亚洲无线观看免费| 欧美日韩精品成人综合77777| 免费搜索国产男女视频| 国产精品电影一区二区三区| 黄片wwwwww| 国产精品久久久久久av不卡| 国内精品久久久久精免费| 成人毛片a级毛片在线播放| 有码 亚洲区| 日本黄色片子视频| 日韩精品中文字幕看吧| АⅤ资源中文在线天堂| 性欧美人与动物交配| 国产精品一区二区三区四区免费观看 | 亚州av有码| 国产精品一区www在线观看 | 97热精品久久久久久| 久久久久久久亚洲中文字幕| 亚洲精品一区av在线观看| 欧美在线一区亚洲| 尤物成人国产欧美一区二区三区| 国产女主播在线喷水免费视频网站 | 搡老妇女老女人老熟妇| 男女那种视频在线观看| 91av网一区二区| 中亚洲国语对白在线视频| av在线老鸭窝| 国产一区二区三区av在线 | 两个人视频免费观看高清| 天堂影院成人在线观看| 成人毛片a级毛片在线播放| 色av中文字幕| 精品一区二区三区视频在线观看免费| 综合色av麻豆| 九九爱精品视频在线观看| 亚洲一区二区三区色噜噜| 久久久久久大精品| 久久久久久久久久久丰满 | www.www免费av| 成人一区二区视频在线观看| 91av网一区二区| 午夜免费激情av| 成人一区二区视频在线观看| 成人无遮挡网站| 美女被艹到高潮喷水动态| 自拍偷自拍亚洲精品老妇| 丝袜美腿在线中文| 麻豆一二三区av精品| 久久国产乱子免费精品| 可以在线观看的亚洲视频| 成人高潮视频无遮挡免费网站| 亚洲综合色惰| 夜夜夜夜夜久久久久| 亚洲精品一卡2卡三卡4卡5卡| 国产精品人妻久久久影院| 在线免费观看不下载黄p国产 | 国产亚洲av嫩草精品影院| 波多野结衣巨乳人妻| 久久精品国产自在天天线| 一本一本综合久久| 在线播放无遮挡| 国内揄拍国产精品人妻在线| 国产日本99.免费观看| 欧美最新免费一区二区三区| 乱人视频在线观看| 日本在线视频免费播放| 国产91精品成人一区二区三区| 国内精品宾馆在线| 色综合色国产| 九九热线精品视视频播放| 内地一区二区视频在线| 午夜免费成人在线视频| 欧美黑人巨大hd| 99精品在免费线老司机午夜| 无遮挡黄片免费观看| 午夜老司机福利剧场| 精品久久久久久久人妻蜜臀av| 午夜a级毛片| av女优亚洲男人天堂| 亚洲,欧美,日韩| 久久久久久久久久黄片| 性欧美人与动物交配| 日本黄色视频三级网站网址| 99久久无色码亚洲精品果冻| 欧美潮喷喷水| 国产精品久久久久久精品电影| 非洲黑人性xxxx精品又粗又长| 欧美激情久久久久久爽电影| 有码 亚洲区| 校园春色视频在线观看| 日本与韩国留学比较| 99riav亚洲国产免费| 午夜日韩欧美国产| 欧美黑人欧美精品刺激| 中出人妻视频一区二区| 久久精品人妻少妇| 亚洲四区av| 欧美绝顶高潮抽搐喷水| 久久久久久大精品| 亚洲三级黄色毛片| 久久99热这里只有精品18| 国产中年淑女户外野战色| 亚洲精品一卡2卡三卡4卡5卡| 亚洲精品国产成人久久av| 国产久久久一区二区三区| 国产乱人视频| 嫩草影院入口| 老司机深夜福利视频在线观看| 在线免费观看的www视频| 男人狂女人下面高潮的视频| 日日啪夜夜撸| 久99久视频精品免费| 亚洲av五月六月丁香网| 美女xxoo啪啪120秒动态图| 国产又黄又爽又无遮挡在线| 一a级毛片在线观看| 能在线免费观看的黄片| 999久久久精品免费观看国产| 观看美女的网站| 国产色婷婷99| 一进一出好大好爽视频| 成人二区视频| 日韩欧美国产一区二区入口| 男插女下体视频免费在线播放| 91狼人影院| 免费高清视频大片| 欧美高清性xxxxhd video| 91午夜精品亚洲一区二区三区 | 97碰自拍视频| 国产精品一区www在线观看 | 免费看日本二区| 91久久精品电影网| 久久午夜亚洲精品久久| 国产毛片a区久久久久| 色综合站精品国产| 国产综合懂色| 久久国产乱子免费精品| 麻豆精品久久久久久蜜桃| 日本黄大片高清| 亚洲av熟女| 看片在线看免费视频| 亚洲av.av天堂| 国产单亲对白刺激| 国产三级在线视频| 午夜激情欧美在线| 精品人妻偷拍中文字幕| 久久午夜亚洲精品久久| 日韩中文字幕欧美一区二区| 成人无遮挡网站| 亚洲欧美日韩东京热| 男女边吃奶边做爰视频| 99精品在免费线老司机午夜| 亚洲国产欧洲综合997久久,| 老师上课跳d突然被开到最大视频| 午夜福利在线在线| 少妇人妻精品综合一区二区 | 淫妇啪啪啪对白视频| 日本 av在线| 在线看三级毛片| 欧美日韩黄片免| 啪啪无遮挡十八禁网站| 欧美日韩瑟瑟在线播放| 免费看美女性在线毛片视频| 午夜免费男女啪啪视频观看 | 国产精品嫩草影院av在线观看 | 制服丝袜大香蕉在线| 看片在线看免费视频| 欧美黑人欧美精品刺激| 又黄又爽又刺激的免费视频.| eeuss影院久久| 很黄的视频免费| 我的老师免费观看完整版| 最近最新免费中文字幕在线| 日韩精品中文字幕看吧| 岛国在线免费视频观看| 亚洲最大成人中文| 我要搜黄色片| 欧美绝顶高潮抽搐喷水| 校园人妻丝袜中文字幕| 伊人久久精品亚洲午夜| 一夜夜www| 亚洲中文日韩欧美视频| 露出奶头的视频| 国产精品电影一区二区三区| 国产黄a三级三级三级人| 乱码一卡2卡4卡精品| 久久精品国产自在天天线| 亚洲成a人片在线一区二区| 国产高清视频在线播放一区| 成人性生交大片免费视频hd| 悠悠久久av| 国产亚洲精品久久久com| 一级黄色大片毛片| 亚洲精品久久国产高清桃花| 国产精品亚洲一级av第二区| 午夜老司机福利剧场| 国产白丝娇喘喷水9色精品| 精品免费久久久久久久清纯| 日韩国内少妇激情av| 免费看美女性在线毛片视频| 国产免费男女视频| 免费观看人在逋| 日韩在线高清观看一区二区三区 | 最近最新中文字幕大全电影3| 搡女人真爽免费视频火全软件 | 国产在线精品亚洲第一网站| 日本精品一区二区三区蜜桃| 老师上课跳d突然被开到最大视频| 欧美又色又爽又黄视频| 嫩草影院入口| 欧美成人免费av一区二区三区| 久久精品国产亚洲网站| 91狼人影院| 精品久久久久久久久av| 中文字幕免费在线视频6| 1000部很黄的大片| 久久天躁狠狠躁夜夜2o2o| 日韩在线高清观看一区二区三区 | 亚洲国产精品成人综合色| 国产精品电影一区二区三区| 一a级毛片在线观看| 日韩 亚洲 欧美在线| 国产高清不卡午夜福利| 日本爱情动作片www.在线观看 | 日本成人三级电影网站| 听说在线观看完整版免费高清| 国产成人a区在线观看| 久久精品久久久久久噜噜老黄 | 国产精品乱码一区二三区的特点| 久久精品人妻少妇| 久久久精品欧美日韩精品| 婷婷丁香在线五月| 国产老妇女一区| 久久精品综合一区二区三区| 18+在线观看网站| 日韩强制内射视频| 韩国av一区二区三区四区| 久久久久久大精品| 亚洲性久久影院| 美女xxoo啪啪120秒动态图| 韩国av一区二区三区四区| 亚洲性夜色夜夜综合| 人人妻人人看人人澡| 久久久久久国产a免费观看| 国产av麻豆久久久久久久| 国产精品三级大全| 国产精品人妻久久久久久| 男女边吃奶边做爰视频| 91在线观看av| 精品免费久久久久久久清纯| 国语自产精品视频在线第100页| 国产精品久久久久久av不卡| 国产熟女欧美一区二区| 麻豆成人午夜福利视频| 欧美又色又爽又黄视频| 亚洲精品456在线播放app | 国产色爽女视频免费观看| 91麻豆精品激情在线观看国产| 亚洲天堂国产精品一区在线| 亚洲熟妇中文字幕五十中出| 少妇的逼水好多| a级毛片免费高清观看在线播放| 国产在线男女| 国产精品女同一区二区软件 | a在线观看视频网站| 99视频精品全部免费 在线| 最后的刺客免费高清国语| 国产老妇女一区| 春色校园在线视频观看| 欧美一区二区精品小视频在线| 18禁黄网站禁片午夜丰满| 神马国产精品三级电影在线观看| 久久精品国产99精品国产亚洲性色| 少妇人妻一区二区三区视频| 亚洲国产精品久久男人天堂| 91麻豆精品激情在线观看国产| 国产高清三级在线| 国国产精品蜜臀av免费| 韩国av一区二区三区四区| 免费观看人在逋| 黄色配什么色好看| 色精品久久人妻99蜜桃| 国产极品精品免费视频能看的| 在现免费观看毛片| 日韩欧美国产一区二区入口| 99久国产av精品| 日本 av在线| 亚洲天堂国产精品一区在线| 国产黄a三级三级三级人| 日韩欧美在线乱码| 岛国在线免费视频观看| 国产精品亚洲一级av第二区| 午夜精品久久久久久毛片777| 97碰自拍视频| 99久国产av精品| 国产伦精品一区二区三区视频9| 国产aⅴ精品一区二区三区波| 99热只有精品国产| 中文字幕高清在线视频| 午夜亚洲福利在线播放| 国产乱人伦免费视频| 久久久久九九精品影院| 日韩人妻高清精品专区| 美女高潮的动态| 婷婷色综合大香蕉| 最近最新中文字幕大全电影3| 99在线人妻在线中文字幕| 午夜免费男女啪啪视频观看 | 人妻久久中文字幕网| 久久精品国产亚洲av香蕉五月| 中文在线观看免费www的网站| 国产亚洲91精品色在线| 尾随美女入室| 日韩av在线大香蕉| 在线天堂最新版资源| 久久久色成人| 男女啪啪激烈高潮av片| 国产精品伦人一区二区| 国产蜜桃级精品一区二区三区| 观看免费一级毛片| 国产精品日韩av在线免费观看| 在线播放无遮挡| 亚洲欧美日韩卡通动漫| 亚洲第一区二区三区不卡| 18禁黄网站禁片午夜丰满| 日韩欧美精品v在线| 欧美国产日韩亚洲一区| 美女被艹到高潮喷水动态| 亚洲国产欧洲综合997久久,| 91在线观看av| 天天躁日日操中文字幕| 我的老师免费观看完整版| 精品无人区乱码1区二区| 国产真实伦视频高清在线观看 | 精品久久久久久久久av| 亚洲,欧美,日韩| 色精品久久人妻99蜜桃| 日韩欧美 国产精品| 久久精品国产亚洲网站| 婷婷六月久久综合丁香| 午夜精品一区二区三区免费看| 亚洲最大成人av| 久久久久国产精品人妻aⅴ院| 亚洲va在线va天堂va国产| 日本免费一区二区三区高清不卡| 国产v大片淫在线免费观看| 日日撸夜夜添| 亚洲av中文字字幕乱码综合| 一区二区三区四区激情视频 | 国产乱人伦免费视频| 久久午夜亚洲精品久久| 国产午夜精品久久久久久一区二区三区 | 精品欧美国产一区二区三| 国产三级中文精品| 老司机福利观看| 99热只有精品国产| 日日摸夜夜添夜夜添av毛片 | 色哟哟哟哟哟哟| 夜夜夜夜夜久久久久| 国产伦精品一区二区三区视频9| 啦啦啦观看免费观看视频高清| 国产精品精品国产色婷婷| 成年版毛片免费区| 别揉我奶头~嗯~啊~动态视频| 亚洲欧美日韩无卡精品| 九色国产91popny在线| 色综合站精品国产| 精品福利观看| 人妻少妇偷人精品九色| 亚洲精品日韩av片在线观看| 国产又黄又爽又无遮挡在线| 最近视频中文字幕2019在线8| 一个人看的www免费观看视频| 日韩亚洲欧美综合| 美女大奶头视频| 又黄又爽又刺激的免费视频.| or卡值多少钱| 小说图片视频综合网站| 一级黄片播放器| 久久精品夜夜夜夜夜久久蜜豆| 成人美女网站在线观看视频| 超碰av人人做人人爽久久| 欧美最新免费一区二区三区| 无人区码免费观看不卡| avwww免费| 可以在线观看毛片的网站| 亚洲七黄色美女视频| 日本黄大片高清| 欧美中文日本在线观看视频| 欧美黑人欧美精品刺激| 久久精品国产亚洲av涩爱 | 中亚洲国语对白在线视频| ponron亚洲| 成人亚洲精品av一区二区| 天堂动漫精品| 日韩,欧美,国产一区二区三区 | 久久国产乱子免费精品| 成人美女网站在线观看视频| 午夜亚洲福利在线播放| 身体一侧抽搐| 亚洲av不卡在线观看| АⅤ资源中文在线天堂| 日韩精品中文字幕看吧| 国产精品一区www在线观看 | 日日夜夜操网爽| 亚洲av熟女| 日韩欧美 国产精品| 亚洲av电影不卡..在线观看| 有码 亚洲区| 白带黄色成豆腐渣| 国产成人av教育| 少妇丰满av| 欧美最黄视频在线播放免费| 国内毛片毛片毛片毛片毛片| 免费观看在线日韩| 成人鲁丝片一二三区免费| 亚洲av美国av| 国产精品乱码一区二三区的特点| 一本一本综合久久| www日本黄色视频网| 免费人成在线观看视频色| av.在线天堂| 免费看av在线观看网站| 亚洲精品色激情综合| 国产成人一区二区在线| 国产亚洲精品久久久com| 无遮挡黄片免费观看| 午夜精品一区二区三区免费看| 中文字幕熟女人妻在线| 在线a可以看的网站| 亚洲成a人片在线一区二区| 免费不卡的大黄色大毛片视频在线观看 | 亚洲精品一卡2卡三卡4卡5卡| 亚洲人与动物交配视频| 草草在线视频免费看| 成人精品一区二区免费| videossex国产| 免费看a级黄色片| 国产成人a区在线观看| 两个人视频免费观看高清| 久久久久久九九精品二区国产| 亚洲国产精品久久男人天堂| a级毛片a级免费在线| 亚洲,欧美,日韩| 精品欧美国产一区二区三| 一a级毛片在线观看| 少妇的逼水好多| 99riav亚洲国产免费| 日韩人妻高清精品专区| 天堂影院成人在线观看| 免费观看人在逋| 国产免费一级a男人的天堂| 亚洲一区高清亚洲精品| 久久久久久久久久黄片| 国产精品一区二区三区四区免费观看 | 国产单亲对白刺激| 九色成人免费人妻av| 亚洲色图av天堂| xxxwww97欧美| 国产欧美日韩精品亚洲av| 一个人看的www免费观看视频| 国产日本99.免费观看| 日本精品一区二区三区蜜桃| 伦理电影大哥的女人| 18禁黄网站禁片午夜丰满| 国产精品一及| 欧美日韩瑟瑟在线播放| 美女 人体艺术 gogo| 免费不卡的大黄色大毛片视频在线观看 | 免费观看在线日韩| 欧美极品一区二区三区四区| 色综合站精品国产| 夜夜看夜夜爽夜夜摸| 欧美极品一区二区三区四区| 亚洲狠狠婷婷综合久久图片| 亚洲中文字幕日韩| 国产精品久久久久久久久免| 丰满乱子伦码专区| 欧美三级亚洲精品| 婷婷丁香在线五月| 噜噜噜噜噜久久久久久91| 亚洲电影在线观看av| 99热这里只有精品一区| 欧美性感艳星| 一进一出抽搐gif免费好疼| 乱码一卡2卡4卡精品| 欧美zozozo另类|