Orientador: Renato Pavanello / Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Mecânica / Made available in DSpace on 2018-08-27T18:05:36Z (GMT). No. of bitstreams: 1 QuispeRodriguez_Sergio_M.pdf: 51003475 bytes, checksum: 7e557fe0fe0448fd7cae415ebca527f8 (MD5) Previous issue date: 2015 / Resumo: A otimização estrutural topológica é uma ferramenta aplicada atualmente em muitos campos da engenharia tendo se consolidado no meio acadêmico e industrial. Em muitos casos práticos os carregamentos mecânicos e térmicos ocorrem simultaneamente nas estruturas. Nestas situações, a aplicação do método de otimização estrutural topológica deve contemplar tanto os requisitos mecânicos, como os requisitos térmicos. Assim, uma abordagem multi-física e multi-objetivo precisa ser desenvolvida para a solução desta classe de problemas. O presente trabalho é dedicado ao estudo da aplicação do método BESO (BESO - Bi-directional Evolutionary Structural Optimization) à sistemas multi-físicos considerando inicialmente os carregamentos termo-mecânicos como forças de corpo ou seja, forças dependentes do projeto. As funções objetivo consideradas são a flexibilidade média da estrutura e a capacidade térmica do sistema. A análise termo-mecânica é realizada usando o método de acoplamento sequencial, onde obtêm-se inicialmente a resposta do campo térmico, ou aplica-se um campo previamente conhecido do ponto da estrutura e na sequência calculam-se as forças térmicas geradas e a dilatação da estrutura. Explora-se também a otimização termo-mecânica multiobjetivo, em que duas funções objetivo são consideradas simultaneamente. Considera-se como o objetivo do problema de otimização, a minimização da flexibilidade média e a minimização da capacidade térmica, usando o método de soma ponderada. Para a validação dos procedimentos de otimização implementados neste trabalho, são apresentados exemplos de otimização para sistemas termo-mecânicos bidimensionais. A viabilidade do método para aplicação em problemas de engenharia e a comparação de resultados com outros métodos de otimização, permite afirmar que as técnicas propostas podem ser usadas na solução de problemas de otimização topológica de sistemas termo-mecânicos / Abstract: The structural topology optimization is an usefull tool applied in many engineering fields, having been established in the academic and industrial environments. In many practical cases, the mechanical and thermal loads occur simultaneously in a structure. In these cases, the aplication of structural topology optimization should consider the thermal and mechanical requirements. For this reason, a multi-physic and multi-objective approach needs to be developed for the solution of these types of problems. The present work is dedicated to the study of the BESO method (BESO - Bi-directional Evolutionary Structural Optimization) applied to multi-physic systems taking in consideration thermo-mechanical loads as design dependent body loads. The objective functions considered are the compliance and heat capacity of the system. The thermo-mechanical analysis is carried out using a sequential coupling method, where the thermal field response is obtained initially, and in the sequence, the thermal loads or dilation loads are calculated. The bi-objective thermo-mechanical optimization problem is also analysed, where two objective functions are considered simultaneously. To validate the procedures implemented in this work, some 2-D examples of thermo-mechancial systems optimization are presented. The feasibility of the method for the aplication in engineering problems and the comparison of the results obtained using other methods, alows to state that the proposed techniques can be used in the solution of optimization problems of thermo-mechanical systems / Mestrado / Mecanica dos Sólidos e Projeto Mecanico / Mestre em Engenharia Mecânica

The job scheduling problem is a type of scheduling problem where a list of jobs and machines are given. A solution consists of a schedule where each job is assigned to one or multiple machines at a certain time. In this study, a multiobjective evolutionary algorithm called NSGA-II was applied to optimize schedules for a particular scheduling problem given by a board game made by the Swedish educative company INSU. The scheduling problem features novel restrictions on the schedules, such as transportation delay between the jobs, skill requirements for the machines to fulfill. The board game also allows pre-emption, i.e., that the jobs can be paused and resumed by the same or other machines. These restrictions impose a challenge for creating a genetic representation for the evolutionary algorithm and a decoder which decodes the representation into a schedule. This problem was solved by proposing a new genetic representation based on previous work and testing it with a few crossover and mutation methods in two experiments. The experiments found that the new representation is effective in creating high-quality schedules, but it is inconclusive as to which crossover and mutation method is the most effective. The decoder’s execution time was also measured, which showed that the decoder scales rapidly with an increasing number of jobs. Despite this, the new representation and decoder are useful for optimizing other scheduling problems with pre-emption and other restrictions.

京都大学 / 0048 / 新制・課程博士 / 博士(工学) / 甲第21752号 / 工博第4569号 / 新制||工||1712(附属図書館) / 京都大学大学院工学研究科機械理工学専攻 / (主査)教授 西脇 眞二, 准教授 泉井 一浩, 教授 椹木 哲夫, 教授 松原 厚 / 学位規則第4条第1項該当 / Doctor of Philosophy (Engineering) / Kyoto University / DFAM

Formulation space exploration is a new strategy for multiobjective optimization that facilitates both divergent searching and convergent optimization during the early stages of design. The formulation space is the union of all variable and design objective spaces identified by the designer as being valid and pragmatic problem formulations. By extending a computational search into the formulation space, the solution to an optimization problem is no longer predefined by any single problem formulation, as it is with traditional optimization methods. Instead, a designer is free to change, modify, and update design objectives, variables, and constraints and explore design alternatives without requiring a concrete understanding of the design problem a priori. To facilitate this process, a new vector/matrix-based definition for multiobjective optimization problems is introduced, which is dynamic in nature and easily modified. Additionally, a set of exploration metrics is developed to help guide designers while exploring the formulation space. Finally, several examples are presented to illustrate the use of this new, dynamic approach to multiobjective optimization.

Over the past two decades, the Define-Measure-Analyze-Improve-Control (DMAIC) framework of the Six Sigma methodology and a host of statistical tools have been brought to bear on process improvement efforts in today’s businesses. However, a major challenge of implementing the Six Sigma methodology is maintaining the process improvements and providing real-time performance feedback and control after solutions are implemented, especially in the presence of multiple process performance objectives. The consideration of a multiplicity of objectives in business and process improvement is commonplace and, quite frankly, necessary. However, balancing the collection of objectives is challenging as the objectives are inextricably linked, and, oftentimes, in conflict. Previous studies have reported varied success in enhancing the Six Sigma methodology by integrating optimization methods in order to reduce variability. These studies focus these enhancements primarily within the Improve phase of the Six Sigma methodology, optimizing a single objective. The current research and practice of using the Six Sigma methodology and optimization methods do little to address the real-time feedback and control for online process control in the case of multiple objectives. This research proposes an innovative integrated Six Sigma multiobjective optimization (SSMO) approach for online process control. It integrates the Six Sigma DMAIC framework with a nature-inspired optimization procedure that iteratively perturbs a set of decision variables providing feedback to the online process, eventually converging to a set of tradeoff process configurations that improves and maintains process stability. For proof of concept, the approach is applied to a general business process model – a well-known inventory management model – that is formally defined and specifies various process costs as objective functions. The proposed iv SSMO approach and the business process model are programmed and incorporated into a software platform. Computational experiments are performed using both three sigma (3σ)-based and six sigma (6σ)-based process control, and the results reveal that the proposed SSMO approach performs far better than the traditional approaches in improving the stability of the process. This research investigation shows that the benefits of enhancing the Six Sigma method for multiobjective optimization and for online process control are immense.

In this thesis, two distinct problems in data-driven computational science are considered. The main problem of interest is the multiobjective optimization problem, where the tradeoff surface (called the Pareto front) between multiple conflicting objectives must be approximated in order to identify designs that balance real-world tradeoffs. In order to solve multiobjective optimization problems that are derived from computationally expensive blackbox functions, such as engineering design optimization problems, several methodologies are combined, including surrogate modeling, trust region methods, and adaptive weighting. The result is a numerical software package that finds approximately Pareto optimal solutions that are evenly distributed across the Pareto front, using minimal cost function evaluations. The second problem of interest is the closely related problem of multivariate interpolation, where an unknown response surface representing an underlying phenomenon is approximated by finding a function that exactly matches available data. To solve the interpolation problem, a novel algorithm is proposed for computing only a sparse subset of the elements in the Delaunay triangulation, as needed to compute the Delaunay interpolant. For high-dimensional data, this reduces the time and space complexity of Delaunay interpolation from exponential time to polynomial time in practice. For each of the above problems, both serial and parallel implementations are described. Additionally, both solutions are demonstrated on real-world problems in computer system performance modeling. / Doctor of Philosophy / Science and engineering are full of multiobjective tradeoff problems. For example, a portfolio manager may seek to build a financial portfolio with low risk, high return rates, and minimal transaction fees; an aircraft engineer may seek a design that maximizes lift, minimizes drag force, and minimizes aircraft weight; a chemist may seek a catalyst with low viscosity, low production costs, and high effective yield; or a computational scientist may seek to fit a numerical model that minimizes the fit error while also minimizing a regularization term that leverages domain knowledge. Often, these criteria are conflicting, meaning that improved performance by one criterion must be at the expense of decreased performance in another criterion. The solution to a multiobjective optimization problem allows decision makers to balance the inherent tradeoff between conflicting objectives. A related problem is the multivariate interpolation problem, where the goal is to predict the outcome of an event based on a database of past observations, while exactly matching all observations in that database. Multivariate interpolation problems are equally as prevalent and impactful as multiobjective optimization problems. For example, a pharmaceutical company may seek a prediction for the costs and effects of a proposed drug; an aerospace engineer may seek a prediction for the lift and drag of a new aircraft design; or a search engine may seek a prediction for the classification of an unlabeled image. Delaunay interpolation offers a unique solution to this problem, backed by decades of rigorous theory and analytical error bounds, but does not scale to high-dimensional "big data" problems. In this thesis, novel algorithms and software are proposed for solving both of these extremely difficult problems.

Optimization problems of location-assignment correspond to a wide range of real situations, such as factory network design. However most of the previous works seek in most cases at minimizing a cost function. Traffic incidents routinely impact the performance and the safety of the supply. These incidents can not be totally avoided and must be regarded. A way to consider these incidents is to design a network on which multiple assignments are performed. Precisely, the problem we focus on deals with power supplying that has become a more and more complex and crucial question. Many international companies have customers who are located all around the world; usually one customer per country. At the other side of the scale, power extraction or production is done in several sites that are spread on several continents and seas. A strong willing of becoming less energetically-dependent has lead many governments to increase the diversity of supply locations. For each kind of energy, many countries expect to deal ideally with 2 or 3 location sites. As a decrease in power supply can have serious consequences for the economic performance of a whole country, companies prefer to balance equally the production rate among all sites as the reliability of all the sites is considered to be very similar. Sharing equally the demand between the 2 or 3 sites assigned to a given area is the most common way. Despite the cost of the network has an importance, it is also crucial to balance the loading between the sites to guarantee that no site would take more importance than the others for a given area. In case an accident happens in a site or in case technical problems do not permit to satisfy the demand assigned to the site, the overall power supply of this site is still likely to be ensured by the one or two available remaining site(s). It is common to assign a cost per open power plant and another cost that depends on the distance between the factory or power extraction point and the customer. On the whole, such companies who are concerned in the quality service of power supply have to find a good trade-off between this factor and their overall functioning cost. This situation exists also for companies who supplies power at the national scale. The expected number of areas as well that of potential sites, can reach 100. However the targeted size of problem to be solved is 50. This thesis focuses on devising an efficient methodology to provide all the solutions of this bi-objective problem. This proposal is an investigation of close problems to delimit the most relevant approaches to this untypical problem. All this work permits us to present one exact method and an evolutionary algorithm that might provide a good answer to this problem. / Master of Science

En el proceso de diseño e las construcciones industriales, es de vital importancia conocer cual es la ubicación óptima de las diferentes áras de trabajo que conforman un proceso de fabricación, así como de las instalaciones y servicios auxiliares. El problema de distribución en planta (Facilities Layout Problem, FLP) integra a todas las actividades industriales y se ha convertido desde los años 60 en uno de los problemas clásicos de optimización combinatoria, en el que trabajan multiutd de investigadores a nivel internacional. Hasta los años 90, el enfoque que se realizaba del problema era básicamente un enfoque monobjetivo, en el que se primaba fundamentalmente la minimización del coste de transporte de material o personas entre las diferentes áreas productivas o de servicios. Para ello se han venido empleando diferentes técnicas de optimización heurística, que persiguen minimizar el tiempo de cálculo y facilitar la búsqueda de mínimos, aunque sean locales, pues el espacio de soluciones es tan grande, que es difícil garantizar la existencia de un mínimo global del problema. No obstante, el criterio de coste no es el único que se debe considerar en este tipo de planteamientos, pues existen otra serie de indicadores que son de vital importancia, para garantizar que la solución propuesta tiene un nivel de desarrollo tecnológico con la aparición de equipos y programas informáticos más desarrollados, han prosperado las aproximaciones multiobjetivos al problema de distribución en planta. Entre los objetivos principales del presente trabajo se encuentran; la realización de un estado del arte de los indicadores que se han empleado en la bibliografía para la resolución en planta, obteniendo un conjunto de indicadores independientes y suficientes que puedan ser empleados en la obtención de distribuciones en planta óptimas. Se investigará si es necesario definir algún nuevo indicador que cubra los objetivos fundamentales de la distribución en planta establecidos por distintos autores. Una vez seleccionados los indicadores se propone una técnica de optimización multiobjetivo basada en un algoritmo de recocido simulado (Simulated Annealing). Finalmente se presentan los resultados de los experimentos realizados, empleando la técnica de optimización multiobjetivo propuesta, sobre un problema ampliamente utilizado en la bibliografía, el propuesto por Armour y Buffa de 20 actividades. Se obtienen las fronteras de Pareto para diferentes bicriterios, introduciendo puntos que completan las existentes hasta la actualidad, estudiando la posibilidad de extender la optimización a 3 indicadores. / Montalva Subirats, JM. (2011). Optimización multiobjetivo de la distribución en planta de procesos industriales. Estudio de objetivos [Tesis doctoral]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/11147

The purpose of this research project is the design and optimization of complex chemical engineering problems, by employing evolutionary algorithms (EAs). EAs are optimization techniques which mimic the principles of genetics and natural selection. Given their population-based approach, EAs are well suited for solving multiobjective optimization problems (MOOPs) to determine Pareto-optimal solutions. The Pareto front refers to the set of non-dominated solutions which highlight trade-offs among the different objectives. A broad range of applications have been studied, all of which are drawn from the chemical engineering field. The design of an industrial packed bed styrene reactor is initially studied with the goal of maximizing the productivity, yield and selectivity of styrene. The dual population evolutionary algorithm (DPEA) was used to circumscribe the Pareto domain of two and three objective optimization case studies for three different configurations of the reactor: adiabatic, steam-injected and isothermal. The Pareto domains were then ranked using the net flow method (NFM), a ranking algorithm that incorporates the knowledge and preferences of an expert into the optimization routine. Next, a multiobjective optimization of the heat transfer area and pumping power of a shell-and-tube heat exchanger is considered to provide the designer with multiple Pareto-optimal solutions which capture the trade-off between the two objectives. The optimization was performed using the fast and elitist non-dominated sorting genetic algorithm (NSGA-II) on two case studies from the open literature. The algorithm was also used to determine the impact of using discrete standard values of the tube length, diameter and thickness rather than using continuous values to obtain the optimal heat transfer area and pumping power. In addition, a new hybrid algorithm called the FP-NSGA-II, is developed in this thesis by combining a front prediction algorithm with the fast and elitist non-dominated sorting genetic algorithm-II (NSGA-II). Due to the significant computational time of evaluating objective functions in real life engineering problems, the aim of this hybrid approach is to better approximate the Pareto front of difficult constrained and unconstrained problems while keeping the computational cost similar to NSGA-II. The new algorithm is tested on benchmark problems from the literature and on a heat exchanger network problem.

Ces travaux proposent une méthode d’assistance à la sélection des techniques d’assemblage et à l’allocation de tolérances sur les écarts géométriques des composants dans le cadre de l’assemblage de structures aéronautiques composites. Cette méthode consiste à formuler et à résoudre un problème d’optimisation multiobjectif afin de minimiser un indicateur de cout et un indicateur de non-conformité des structures assemblées. L’indicateur de coût proposé prend en compte le coût associé à l’allocation des tolérances géométriques ainsi que le coût associé aux opérations d’assemblage. Les indicateurs de non-conformités proposés sont évalués à partir des probabilités de non-respect des exigences géométriques sur les structures assemblées. Ces probabilités sont évaluées en propageant les tolérances géométriques allouées et les dispersions des techniques sélectionnées au travers d’une fonction appelée Relation de Comportement de l’assemblage (RdCa). Dans le cas de l’assemblage de structures aéronautiques composites, des exigences peuvent porter sur les jeux aux interfaces entre composants. Dans ce cas, la RdCa est évaluée par la résolution d’un problème mécanique quasi-statique non-linéaire par la méthode des éléments finis. Un méta-modèle de la RdCa est construit afin de la rendre compatible avec les méthodes probabilistes utilisées pour évaluer la non-conformité. Finalement, la définition d’un modèle structuro-fonctionnel du produit et d’une bibliothèque de techniques d’assemblage permet de construire un avant-projet de gamme d’assemblage paramétrique. Ce paramétrage permet de formuler le problème d’optimisation multiobjectif résolu à l’aide d’un algorithme génétique. / The purpose of this PhD is to develop a method to assist assembly technique selection and component geometrical tolerance allocation in the context of composite aeronautical structure assembly. The proposed method consists in formulating and solving a multiobjective optimisation problem aiming at minimising a cost indicator and a non-conformity indicator. The cost indicator account for both the cost involved by the geometrical tolerance allocation and the cost associated with the assembly operations. The proposed non-conformity indicators are evaluated according to the probabilities of non-satisfied requirements on the assembled structures. These probabilities are computed thanks to Geometrical Variation Propagation Relation (GVPR) that expresses the characteristics of the product as a function of the geometrical deviation of the components and the dispersion occurring during the assembly. In the case of composite aeronautical structures, the product characteristics can be gaps at interfaces between components. In this case, the GVPR is evaluated by solving a non-linear quasi-static mechanical problem by the mean of the finite element method. A metamodel of the GVPR is built in order to reduce the computing time and to make it compatible with the probabilistic methods used to evaluate the non-conformity. Finally, the use of a structure-functional model of the product together with an assembly technique library allows defining a parametric assembly process plan. The multiobjective optimisation problem built thanks to set of parameters defining the assembly process plan is solved using a genetic algorithm.