Total knee replacement is the gold standard treatment for restoring mobility and relieving pain associated with osteoarthritis when other medical therapy has failed. Revision surgery is necessary when the replaced knee fails, which is often a result of implant damage (such as wear) or poor kinematics. Design optimization is a method for finding the best shape for a component using an optimization approach considering one or multiple performance metrics. The shape of a parametric candidate design can be manipulated by an optimization algorithm, which seeks to minimize an objective function subject to performance constraints and design space limitations. During multiobjective design optimization, multiple performance measures are minimized simultaneously, the relative importance of each determined using a weighted sum. This approach can also be used to derive a Pareto curve or frontier which graphically describes the relationships (or trade-offs) between the performance measures. It was hypothesized that a trade-off exists between wear and kinematics performance in total knee replacements. The objective of this research was to test this hypothesis by using multiobjective design optimization to describe this relationship with a Pareto curve. It was first necessary to develop and validate numerical frameworks for wear and kinematics simulations, using models constructed using a parametric modeller. The Pareto curve was then generated using a combination of single objective and multiobjective design optimizations considering these two performance measures. Single objective optimization for wear yielded a theoretical design with superior wear resistance when compared to a typical commercially available knee design. Single objective optimization for kinematics yielded a theoretical design capable of higher flexion, as well as more natural laxity characteristics. After performing multiobjective design optimization, the resulting Pareto curve showed that there is, in fact, a trade-off between wear and kinematics performance. When considering optimum designs, in order to improve the wear performance it was necessary to sacrifice kinematics performance, and vice-versa. This previously suspected but never verified nor quantified relationship can be used to improve total knee replacement designs, as well as help healthcare providers select the best implants for their patients. / Thesis (Ph.D, Mechanical and Materials Engineering) -- Queen's University, 2010-04-14 13:43:42.639

No description available.

In the last two decades, the western world witnessed a continuous rise in the health expenditure. Meanwhile, complaints from patients on excessive waiting times are also increasing. In the past, many researchers have tried to devise appointment scheduling rules to provide trade-offs between maximizing patients’ satisfaction and minimizing the costs of the health providers. For instance, this challenge appears appointment scheduling problems (ASP). Commonly used methods in ASP include analytical methods, simulation studies, and combination of simulation with heuristic approaches. Analytical methods (e.g., queuing theory and mathematical programming) face challenges of fully capturing the complexities of systems and usually make strong assumptions for tractability of problems. These methods simplify the whole system to a single-stage unit and ignore the actual system factors such as the presence of multiple stages and/or resource constraints. Simulation studies, conversely, are able to model most complexities of the actual system, but they typically lack an optimization strategy to deliver optimal appointment schedules. Also, heuristic approaches normally are based on intuitive rules and do not perform well as standalone methods. In order to reach an optimal schedule while considering complexities in actual health care systems, this thesis proposes efficient and effective methods that yield (near) optimal appointment schedules by integrating mathematical programming, a tabu search optimization algorithm and discrete event simulation. The proposed methodologies address the challenges and complexities of scheduling in real world multistage healthcare units in the presence of stochastic service durations, a mix of patient types, patients with heterogeneous service sequence, and resource constraints. Moreover, the proposed methodology is capable of finding the optimum considering simultaneously multiple performance criteria. A Pareto front (a set of optimal solutions) for the performance criteria can be obtained using the proposed methods. Healthcare management can use the Pareto front to choose the appropriate policy based on different conditions and priorities. In addition, the proposed method has been applied to two case studies of Operating Rooms departments in two major Canadian hospitals. The comparison of actual schedules and the ones yielded by the proposed method indicates that proposed method can improve the appointment scheduling in realistic clinical settings.

In the last two decades, the western world witnessed a continuous rise in the health expenditure. Meanwhile, complaints from patients on excessive waiting times are also increasing. In the past, many researchers have tried to devise appointment scheduling rules to provide trade-offs between maximizing patients’ satisfaction and minimizing the costs of the health providers. For instance, this challenge appears appointment scheduling problems (ASP). Commonly used methods in ASP include analytical methods, simulation studies, and combination of simulation with heuristic approaches. Analytical methods (e.g., queuing theory and mathematical programming) face challenges of fully capturing the complexities of systems and usually make strong assumptions for tractability of problems. These methods simplify the whole system to a single-stage unit and ignore the actual system factors such as the presence of multiple stages and/or resource constraints. Simulation studies, conversely, are able to model most complexities of the actual system, but they typically lack an optimization strategy to deliver optimal appointment schedules. Also, heuristic approaches normally are based on intuitive rules and do not perform well as standalone methods. In order to reach an optimal schedule while considering complexities in actual health care systems, this thesis proposes efficient and effective methods that yield (near) optimal appointment schedules by integrating mathematical programming, a tabu search optimization algorithm and discrete event simulation. The proposed methodologies address the challenges and complexities of scheduling in real world multistage healthcare units in the presence of stochastic service durations, a mix of patient types, patients with heterogeneous service sequence, and resource constraints. Moreover, the proposed methodology is capable of finding the optimum considering simultaneously multiple performance criteria. A Pareto front (a set of optimal solutions) for the performance criteria can be obtained using the proposed methods. Healthcare management can use the Pareto front to choose the appropriate policy based on different conditions and priorities. In addition, the proposed method has been applied to two case studies of Operating Rooms departments in two major Canadian hospitals. The comparison of actual schedules and the ones yielded by the proposed method indicates that proposed method can improve the appointment scheduling in realistic clinical settings.

This thesis aims at Multi-Objective Optimization under Uncertainty in structural design. We investigate Polynomial Chaos Expansion (PCE) surrogates which require extensive training sets. We then face two issues: high computational costs of an individual Finite Element simulation and its limited precision. From numerical point of view and in order to limit the computational expense of the PCE construction we particularly focus on sparse PCE schemes. We also develop a custom Latin Hypercube Sampling scheme taking into account the finite precision of the simulation. From the modeling point of view,we propose a multifidelity approach involving a hierarchy of models ranging from full scale simulations through reduced order physics up to response surfaces. Finally, we investigate multiobjective optimization of structures under uncertainty. We extend the PCE model of design objectives by taking into account the design variables. We illustrate our work with examples in sheet metal forming and optimal design of truss structures.

Multi-objective optimization metaheuristics (MOMs) are powerful methods for solving complex optimization problems but can require a large number of function evaluations to find optimal solutions. Thus, an efficient multi-objective optimization method should generate accurate and diverse solutions in a timely manner. Improving MOMs convergence speed is an important and challenging research problem which is the scope of this thesis. This thesis conducted the most comprehensive comparative study ever in MOMs. Based on the results, multi-objective (MO) versions of particle swarm optimization (PSO) and differential evolution (DE) algorithms achieved the highest performances; therefore, these two MOMs have been selected as bases for further acceleration in this thesis. To accelerate the selected MOMs, this work focuses on the incorporation of leadership concept to MO variants of DE and PSO algorithms. Two complex case studies of MO design of renewable energy systems are proposed to demonstrate the efficiency of the proposed MOMs. This thesis proposes three new MOMs, namely, leader and speed constraint multi-objective PSO (LSMPSO), opposition-based third evolution step of generalized DE (OGDE3), and multi-objective DE with leadership enhancement (MODEL) which are compared with seven state-of-the-art MOMS using various benchmark problems. LSMPSO was found to be the fastest MOM for the problem undertaken. Further, LSMPSO achieved the highest solutions accuracy for optimal design of a photovoltaic farm in Toronto area. OGDE3 is the first successful application of OBL to a MOM with single population (no-coevolution) using leadership and self-adaptive concepts; the convergence speed of OGDE3 outperformed the other MOMs for the problems solved. MODEL embodies leadership concept into mutation operator of GDE3 algorithm. MODEL achieved the highest accuracy for the 30 studied benchmark problems. Furthermore, MODEL achieved the highest solution accuracy for a MO optimization problem of hydrogen infrastructures design across the province Ontario between 2008 and 2025 considering electricity infrastructure constraints.

In this study, we consider two bi-objective bin packing problems that assign a number of weighted items to bins having identical capacities. Firstly, we aim to minimize total deviation over bin capacity and minimize number of bins. We show that these two objectives are conflicting. Secondly, we study the problem of minimizing maximum overdeviation and minimizing the number of bins. We show the similarities of these two problems to parallel machine scheduling problems and benefit from the results while developing our solution approaches. For both problems, we propose exact procedures that generate efficient solutions relative to two objectives. To increase the efficiency of the solutions, we propose some lower and upper bounding procedures. The results of our experiments show that total overdeviation problem is easier to solve compared to maximum overdeviation problem and the bin capacity, the weight of items and the number of items are important factors that effect the solution time and quality. Our procedures can solve the problems with up to 100 items in reasonable solution times.

In network design, a communication network is optimized for a given set of parameters like cost, reliability and delay. This study analyzes network design problem using Genetic Algorithms in detail and makes comparison of different approaches and representations. Encoding of a problem is one of the most crucial design choices in Genetic Algorithms. For network design problem, this study compares adjacency matrix representation with list of edges representation. Also, another problem is defining a fair fitness function that will not favor one optimization parameter to the other. Multi-objective optimization is a recommended solution for such problems. This study describes and compares some of those approaches for different combinations in network design problem.

In this thesis, single undesirable and semi-desirable facility location problems are analyzed in a continuous planar region considering the interaction between the facility and the existing demand points. In both problems, the distance between the facility and the demand points is measured with the rectilinear metric. The aim in the first part where the location of a pure undesirable facility is considered, is to maximize the distance of the facility from the closest demand point. In the second part, where the location of a semi-desirable facility is considered, a conflicting objective measuring the service cost of the facility is added to the problem of the first part. For the solution of the first problem, a mixed integer programming model is used. In order to increase the solution efficiency of the model, new branch and bound strategies and bounding schemes are suggested. In addition, a geometrical method is presented which is based on upper and lower bounds. For the biobjective problem, a three-phase interactive geometrical branch and bound algorithm is suggested to find the most preferred efficient solution.

Reservoir management typically focuses on maximizing oil and gas recovery from a reservoir based on facts and information while minimizing capital and operating investments. Modern reservoir management uses history-matched simulation model to predict the range of recovery or to provide the economic assessment of different field development strategies. Geological models are becoming increasingly complex and more detailed with several hundred thousand to million cells, which include large sets of subsurface uncertainties. Current issues associated with history matching, therefore, involve extensive computation (flow simulations) time, preserving geologic realism, and non-uniqueness problem. Many of recent rate optimization methods utilize constrained optimization techniques, often making them inaccessible for field reservoir management. Field-scale rate optimization problems involve highly complex reservoir models, production and facilities constraints and a large number of unknowns. We present a hierarchical multiscale calibration approach using global and local updates in coarse and fine grid. We incorporate a multiscale framework into hierarchical updates: global and local updates. In global update we calibrate large-scale parameters to match global field-level energy (pressure), which is followed by local update where we match well-by-well performances by calibration of local cell properties. The inclusion of multiscale calibration, integrating production data in coarse grid and successively finer grids sequentially, is critical for history matching high-resolution geologic models through significant reduction in simulation time. For rate optimization, we develop a hierarchical analytical method using streamline-assisted flood efficiency maps. The proposed approach avoids use of complex optimization tools; rather we emphasize the visual and the intuitive appeal of streamline method and utilize analytic solutions derived from relationship between streamline time of flight and flow rates. The proposed approach is analytic, easy to implement and well-suited for large-scale field applications. Finally, we present a hierarchical Pareto-based approach to history matching under conflicting information. In this work we focus on multiobjective optimization problem, particularly conflicting multiple objectives during history matching of reservoir performances. We incorporate Pareto-based multiobjective evolutionary algorithm and Grid Connectivity-based Transformation (GCT) to account for history matching with conflicting information. The power and effectiveness of our approaches have been demonstrated using both synthetic and real field cases.