13,757 research outputs found
Screening of energy efficient technologies for industrial buildings' retrofit
This chapter discusses screening of energy efficient technologies for industrial buildings' retrofit
Multi-objective Operating Room Planning and Scheduling
abstract: Surgery is one of the most important functions in a hospital with respect to operational cost, patient flow, and resource utilization. Planning and scheduling the Operating Room (OR) is important for hospitals to improve efficiency and achieve high quality of service. At the same time, it is a complex task due to the conflicting objectives and the uncertain nature of surgeries. In this dissertation, three different methodologies are developed to address OR planning and scheduling problem. First, a simulation-based framework is constructed to analyze the factors that affect the utilization of a catheterization lab and provide decision support for improving the efficiency of operations in a hospital with different priorities of patients. Both operational costs and patient satisfaction metrics are considered. Detailed parametric analysis is performed to provide generic recommendations. Overall it is found the 75th percentile of process duration is always on the efficient frontier and is a good compromise of both objectives. Next, the general OR planning and scheduling problem is formulated with a mixed integer program. The objectives include reducing staff overtime, OR idle time and patient waiting time, as well as satisfying surgeon preferences and regulating patient flow from OR to the Post Anesthesia Care Unit (PACU). Exact solutions are obtained using real data. Heuristics and a random keys genetic algorithm (RKGA) are used in the scheduling phase and compared with the optimal solutions. Interacting effects between planning and scheduling are also investigated. Lastly, a multi-objective simulation optimization approach is developed, which relaxes the deterministic assumption in the second study by integrating an optimization module of a RKGA implementation of the Non-dominated Sorting Genetic Algorithm II (NSGA-II) to search for Pareto optimal solutions, and a simulation module to evaluate the performance of a given schedule. It is experimentally shown to be an effective technique for finding Pareto optimal solutions.Dissertation/ThesisPh.D. Industrial Engineering 201
An Optimisation-based Framework for Complex Business Process: Healthcare Application
The Irish healthcare system is currently facing major pressures due to rising demand, caused by population growth, ageing and high expectations of service quality. This pressure on the Irish healthcare system creates a need for support from research institutions in dealing with decision areas such as resource allocation and performance measurement. While approaches such as modelling, simulation, multi-criteria decision analysis, performance management, and optimisation can – when applied skilfully – improve healthcare performance, they represent just one part of the solution. Accordingly, to achieve significant and sustainable performance, this research aims to develop a practical, yet effective, optimisation-based framework for managing complex processes in the healthcare domain. Through an extensive review of the literature on the aforementioned solution techniques, limitations of using each technique on its own are identified in order to define a practical integrated approach toward developing the proposed framework. During the framework validation phase, real-time strategies have to be optimised to solve Emergency Department performance issues in a major hospital. Results show a potential of significant reduction in patients average length of stay (i.e. 48% of average patient throughput time) whilst reducing the over-reliance on overstretched nursing resources, that resulted in an increase of staff utilisation between 7% and 10%. Given the high uncertainty in healthcare service demand, using the integrated framework allows decision makers to find optimal staff schedules that improve emergency department performance. The proposed optimum staff schedule reduces the average waiting time of patients by 57% and also contributes to reduce number of patients left without treatment to 8% instead of 17%. The developed framework has been implemented by the hospital partner with a high level of success
Optimization techniques in respiratory control system models
One of the most complex physiological systems whose modeling is still an open study is the respiratory control system where different models have been proposed based on the criterion of minimizing the work of breathing (WOB). The aim of this study is twofold: to compare two known models of the respiratory control system which set the breathing pattern based on quantifying the respiratory work; and to assess the influence of using direct-search or evolutionary optimization algorithms on adjustment of model parameters. This study was carried out using experimental data from a group of healthy volunteers under CO2 incremental inhalation, which were used to adjust the model parameters and to evaluate how much the equations of WOB follow a real breathing pattern. This breathing pattern was characterized by the following variables: tidal volume, inspiratory and expiratory time duration and total minute ventilation. Different optimization algorithms were considered to determine the most appropriate model from physiological viewpoint. Algorithms were used for a double optimization: firstly, to minimize the WOB and secondly to adjust model parameters. The performance of optimization algorithms was also evaluated in terms of convergence rate, solution accuracy and precision. Results showed strong differences in the performance of optimization algorithms according to constraints and topological features of the function to be optimized. In breathing pattern optimization, the sequential quadratic programming technique (SQP) showed the best performance and convergence speed when respiratory work was low. In addition, SQP allowed to implement multiple non-linear constraints through mathematical expressions in the easiest way. Regarding parameter adjustment of the model to experimental data, the evolutionary strategy with covariance matrix and adaptation (CMA-ES) provided the best quality solutions with fast convergence and the best accuracy and precision in both models. CMAES reached the best adjustment because of its good performance on noise and multi-peaked fitness functions. Although one of the studied models has been much more commonly used to simulate respiratory response to CO2 inhalation, results showed that an alternative model has a more appropriate cost function to minimize WOB from a physiological viewpoint according to experimental data.Postprint (author's final draft
Solving Combinatorial Optimization Problems Using Genetic Algorithms and Ant Colony Optimization
This dissertation presents metaheuristic approaches in the areas of genetic algorithms and ant colony optimization to combinatorial optimization problems.
Ant colony optimization for the split delivery vehicle routing problem
An Ant Colony Optimization (ACO) based approach is presented to solve the Split Delivery Vehicle Routing Problem (SDVRP). SDVRP is a relaxation of the Capacitated Vehicle Routing Problem (CVRP) wherein a customer can be visited by more than one vehicle. The proposed ACO based algorithm is tested on benchmark problems previously published in the literature. The results indicate that the ACO based approach is competitive in both solution quality and solution time. In some instances, the ACO method achieves the best known results to date for the benchmark problems.
Hybrid genetic algorithm for the split delivery vehicle routing problem (SDVRP)
The Vehicle Routing Problem (VRP) is a combinatory optimization problem in the field of transportation and logistics. There are various variants of VRP which have been developed of the years; one of which is the Split Delivery Vehicle Routing Problem (SDVRP). The SDVRP allows customers to be assigned to multiple routes. A hybrid genetic algorithm comprising a combination of ant colony optimization, genetic algorithm, and heuristics is proposed and tested on benchmark SDVRP test problems.
Genetic algorithm approach to solve the hospital physician scheduling problem
Emergency departments have repeating 24-hour cycles of non-stationary Poisson arrivals and high levels of service time variation. The problem is to find a shift schedule that considers queuing effects and minimizes average patient waiting time and maximizes physicians’ shift preference subject to constraints on shift start times, shift durations and total physician hours available per day. An approach that utilizes a genetic algorithm and discrete event simulation to solve the physician scheduling problem in a hospital is proposed. The approach is tested on real world datasets for physician schedules
Improvement of Work Process Performance with Task Assignments and Mental Workload Balancing
The outcome of a work process depends heavily on which tasks assigned to which employees. However, sometimes-optimized assignments based on employees’ qualifications may result in an uneven and ineffective workload distribution among them. Likewise, an even workload distribution without considering the employee\u27s qualifications may cause unproductive employee-task matching that results in low performance of employees. This trade-off is even more noticeable for work processes during critical time junctions, such as in military command centers and emergency rooms that require being fast and effective without making errors.
This study proposes that optimizing task-employee assignments according to their capabilities while also keeping them under a workload threshold, results in better performance for work processes, especially during critical time junctions. The goal is to select the employee-task assignments in order to minimize the average duration of a work process while keeping the employees under a workload threshold to prevent errors caused by overload. Due to uncertainties inherent in the problem related with the inter-arrival time of work orders, task durations and employees\u27 instantaneous workload, a utilized simulation-optimization approach solves this problem. More specifically, a discrete event human performance simulation model evaluates the objective function of the problem coupled with a genetic algorithm based meta-heuristic optimization approach to search the solution space.
This approach proved to be useful in determining the right task-agent assignments by taking into consideration the employees\u27 qualifications and mental workload in order to minimize the average duration of a work process. Use of a sample work process shows the effectiveness of the developed simulation-optimization approach. Numerical tests indicate that the proposed approach finds better solutions than common practices and other simulation-optimization methods. Accordingly, by using this method, organizations can increase performance, manage excess-level workloads, and generate higher satisfactory environments for employees, without modifying the structure of the process itself
Recommended from our members
Searching for improvement
Engineering design can be thought of as a search for the best solutions to engineering problems. To perform an effective search, one must distinguish between competing designs and establish a measure of design quality, or fitness. To compare different designs, their features must be adequately described in a well-defined framework, which can mean separating the creative and analytical parts of the design process. By this we mean that a distinction is drawn between coming up with novel design concepts, or architectures, and the process of detailing or refining existing design architecture. In the case of a given design architecture, one can consider the set of all possible designs that could be created by varying its features. If it were possible to measure the fitness of all designs in this set, then one could identify a fitness landscape and search for the best possible solution for this design architecture. In this Chapter, the significance of the interactions between design features in defining the metaphorical fitness landscape is described. This highlights that the efficiency of a search algorithm is inextricably linked to the problem structure (and hence the landscape). Two approaches, namely, Genetic Algorithms (GA) and Robust Engineering Design (RED) are considered in some detail with reference to a case study on improving the design of cardiovascular stents
A permutation flowshop model with time-lags and waiting time preferences of the patients
The permutation flowshop is a widely applied scheduling model. In many real-world applications of this model, a minimum and maximum time-lag must be considered between consecutive
operations. We can apply this model to healthcare systems in which the minimum time-lag could
be the transfer times, while the maximum time-lag could refer to the number of hours patients
must wait. We have modeled a MILP and a constraint programming model and solved them using CPLEX to find exact solutions. Solution times for both methods are presented. We proposed
two metaheuristic algorithms based on genetic algorithm and solved and compared them with each
other. A sensitivity of analysis of how a change in minimum and maximum time-lags can impact
waiting time and Cmax of the patients is performed. Results suggest that constraint programming is
a more efficient method to find exact solutions and changes in the values of minimum and maximum
time-lags can impact waiting times of the patients and Cmax significantly
The LifeV library: engineering mathematics beyond the proof of concept
LifeV is a library for the finite element (FE) solution of partial
differential equations in one, two, and three dimensions. It is written in C++
and designed to run on diverse parallel architectures, including cloud and high
performance computing facilities. In spite of its academic research nature,
meaning a library for the development and testing of new methods, one
distinguishing feature of LifeV is its use on real world problems and it is
intended to provide a tool for many engineering applications. It has been
actually used in computational hemodynamics, including cardiac mechanics and
fluid-structure interaction problems, in porous media, ice sheets dynamics for
both forward and inverse problems. In this paper we give a short overview of
the features of LifeV and its coding paradigms on simple problems. The main
focus is on the parallel environment which is mainly driven by domain
decomposition methods and based on external libraries such as MPI, the Trilinos
project, HDF5 and ParMetis.
Dedicated to the memory of Fausto Saleri.Comment: Review of the LifeV Finite Element librar
- …