A Otimização Multidisciplinar em Projeto (em inglês, Multidisciplinary Design Optimization - MDO) é uma ferramenta de projeto importante e versátil e seu uso está se expandindo em diversos campos da engenharia. O foco desta metodologia é unir disciplinas envolvidas no projeto para que trabalhem suas variáveis concomitantemente em um ambiente de otimização, para obter soluções melhores. É possível utilizar MDO em qualquer fase do projeto, seja a fase conceitual, preliminar ou detalhada, desde que os modelos numéricos sejam ajustados às necessidades de cada uma delas. Este trabalho descreve o desenvolvimento de um código de MDO para o projeto conceitual de asas flexíveis de aeronaves, com restrição quanto ao fenômeno denominado flutter. Como uma ferramenta para o projetista na fase conceitual, os modelos numéricos devem ser razoavelmente precisos e rápidos. O intuito deste estudo é analisar o uso de metamodelos para a previsão do flutter de asas de aeronaves no código de MDO, ao invés de um modelo convencional, o que pode alterar significativamente o custo computacional da otimização. Para este fim são avaliados três técnicas diferentes de metamodelagem, que foram escolhidas por representarem duas classes básicas de metamodelos, a classe de métodos de interpolação e a de métodos de aproximação. Para representá-las foram escolhidos o método de interpolação por funções de base radial e o método de redes neurais artificiais, respectivamente. O terceiro método, que é considerado um método híbrido dos dois anteriores, é chamado de redes neurais por funções de bases radiais e é uma tentativa de acoplar as características de ambos em um único metamodelo. Os metamodelos são preparados utilizando um código para solução aeroelástica baseado no método dos elementos finitos acoplado com um modelo aerodinâmico linear de faixas. São apresentados resultados de desempenho dos três metamodelos, de onde se pode notar que a rede neural artificial é a mais adequada para previsão de flutter. O processo de MDO é realizado com o uso de um algoritmo genético multi-objetivo baseado em não-dominância, cujos objetivos são a maximização da velocidade crítica de flutter e a minimização da massa estrutural. Dois estudos de caso são apresentados para avaliar o desempenho do código de MDO, revelando que o processo global de otimização realiza de fato a busca pela fronteira de Pareto. / The Multidisciplinary Design Optimization, MDO, is an important and versatile design tool and its use is spreading out in several fields of engineering. The focus of this methodology is to put together disciplines involved with the design to work all their variables concomitantly, at an optimization environment to obtain better solutions. It is possible to use MDO in any stage of the design process, that is in the conceptual, preliminary or detailed design, as long as the numerical models are fitted to the needs of each of these stages. This work describes the development of a MDO code for the conceptual design of flexible aircraft wings, with restrictions regarding the phenomenon called flutter. As a tool for the designer at the conceptual stage, the numerical models must be fairly accurate and fast. The aim of this study is to analyze the use of metamodels for the flutter prediction of aircraft wings in the MDO code, instead of a conventional model itself, what may affect significantly the computational cost of the optimization. For this purpose, three different metamodeling techniques have been evaluated, representing two basic metamodel classes, that are, the interpolation and the approximation class. These classes are represented by the radial basis function interpolation method and the artificial neural networks method, respectively. The third method, which is considered as a hybrid of the other two, is called radial basis function neural networks and is an attempt of coupling the features of both in single code. Metamodels are prepared using an aeroelastic code based on finite element model coupled with linear aerodynamics. Results of the three metamodels performance are presented, from where one can note that the artificial neural network is best suited for flutter prediction. The MDO process is achieved using a non-dominance based multi-objective genetic algorithm, whose objectives are the maximization of critical flutter speed and minimization of structural mass. Two case studies are presented to evaluate the performance of the MDO code, revealing that overall optimization process actually performs the search for the Pareto frontier.

Im Mittelpunkt unserer Untersuchungen steht das mehrkriterielle Optimierungsproblem, in einer beliebigen nichtleeren Menge eines halbgeordneten endlich dimensionalen Raumes. Zu dessen Lösung betrachten wir ein Dialogverfahren, in dem der Entscheidungsträger in jedem Schritt seine Wünsche äußert. Bei der Bestimmung einer Lösung, die den Entscheidungsträger zufriedenstellt, müssen wir ein im Allgemeinen nichtkonvexes und nicht triviales skalares Optimierungsproblem lösen. Zur Lösung dieses Problems haben wir zwei Klassen einparametrischer Optimierungsprobleme (Einbettungen) konstruiert. Mit Hilfe der Projektion auf den konvexen Ordungskegel haben wir gezeigt, dass diese Einbettungen wohldefiniert sind. Im Gegensatz zu der in der Literatur untersuchten Standardeinbettung, sind die in dieser Arbeit betrachteten Einbettungen durch die Skalarisierungen der Vektoroptimierungsprobleme mittels streng monotoner skalarisierender Funktionen motiviert. Diese Untersuchung wird unter dem Gesichtspunkt der Theorie der einparametrischen Optimierungsprobleme für den Fall eines beliebigen spitzen polyedrischen Ordnungskegels durchgeführt. Sie umfasst z.B. Fragestellungen nach der Art der Singularitäten, die für die verschiedenen Einbettungen auftreten können, nach den Bedingungen, unter denen eine Zusammenhangskomponente in der Menge stationärer oder verallgemeinerter kritischer Punkte mit Hilfe von Kurvenverfolgungsmethoden numerisch beschrieben werden kann und nach den hinreichenden Bedingungen für die Existenz einer Lösungskurve. Anschließend haben wir das von Guddat und Jongen eingeführte Konzept der strukturellen Stabilität eines skalaren Optimierungsproblems in der Vektoroptimierung verallgemeinert und einen Zusammenhang zur strukturellen Stabilität eines Minimaxproblems erstellt. Dieses Minimaxproblem steht in starker Beziehung zur Skalarisierungsmethode der Vektoroptimierungsprobleme. / In this work we consider the multiobjective optimization in a subset of a partially orded finite dimensional space. In order to solve this problem we use a dialogue procedure in which the decision maker has to determine in each step the aspiration and reservation level expressing his wishes (goals). This leads to an optimization problem which is not easy to solve in the nonconvex case. We solve it proposing two classes of one-parametric optimization problems (embeddings). Using the projection in the ordering cone, we show that these embeddings are well defined, i.e. the corresponding constraint sets depending on real-valued parameters are not empty. Contrary to the very known standard embedding the proposed embeddings are motivated by the use of strongly monotonically increasing functions, which play an important role by the scalarization of multiobjective optimization problems. The two classes of embeddings are investigated from the point of view of parametric optimization considering a pointed polyhedral cone. This investigation includes the determination of the kind of singularities which can appear, the conditions under which a connected component in the set of stationary or generalized critical point can be numerically described using pathfollowing methods and a solution curve may exist. Finally, we extend the concept of structural stability by Guddat and Jongen to the multiobjective optimization problems and establish a connection to the problem of Minimax type, which is related to the scalarization of multiobjective optimization problems.

Submitted by Jadson Francisco de Jesus SILVA (jadson@uefs.br) on 2018-07-18T21:55:12Z No. of bitstreams: 1 Disserta??o.pdf: 2639155 bytes, checksum: af49bdcdf83d4a063546324a223124a4 (MD5) / Made available in DSpace on 2018-07-18T21:55:12Z (GMT). No. of bitstreams: 1 Disserta??o.pdf: 2639155 bytes, checksum: af49bdcdf83d4a063546324a223124a4 (MD5) Previous issue date: 2018-03-27 / Coordena??o de Aperfei?oamento de Pessoal de N?vel Superior - CAPES / Wireless visual sensor networks can provide valuable information for a lot of moni- toring and control applications, which has driven much attention from the academic community in last years. For some applications, a set of targets have to be covered by visual sensors and sensing redundancy may be desired in many cases, especially when applications have availability requirements or demands for multiple coverage perspectives for viewed targets. For rotatable visual sensors, the sensing orientations can be adjusted for optimized coverage and redundancy, with different optimization approaches available to address this problem. Particularly, as different optimization parameters may be considered, the redundant coverage maximization issue may be treated as a multi-objective problem, with some potential solutions to be conside- red. In this context, two different evolutionary algorithms are proposed to compute redundant coverage maximization for target viewing, intending to be more efficient alternatives to greedy-based algorithms. Simulation results reinforce the benefits of employing evolutionary algorithms for adjustments of sensors? orientations, poten- tially benefiting deployment and management of wireless visual sensor networks for different applications. / As redes de sensores visuais sem fio podem obter, atrav?s de c?meras, informa??es importantes para aplica??es de controle e monitoramento, e tem ganhado aten??o da comunidade acad?mica nos ?ltimos anos. Para algumas aplica??es, um conjunto de alvos deve ser coberto por sensores visuais, e por vezes com demanda de redund?ncia de cobertura, especialmente quando h? requisitos de disponibilidade ou demandas de m?ltiplas perspectivas de cobertura para os alvos visados. Para sensores visuais rotacion?veis, as orienta??es de detec??o podem ser ajustadas para otimizar cobertura e redund?ncia, existindo diferentes abordagens de otimiza??o dispon?veis para solucionar esse problema. Particularmente, como diferentes par?metros de otimizac?o podem ser considerados, o problema de maximiza??o de cobertura redundante pode ser tratado como um problema multiobjetivo, com algumas solu??es potenciais a serem consideradas. Neste contexto, dois algoritmos evolutivos diferentes s?o propostos para calcular a maximiza??o de cobertura redundante para visualiza??o de alvos, pretendendo ser alternativas mais eficientes para algoritmos gulosos. Os resultados da simula??o refor?am os benef?cios de empregar algoritmos evolutivos para ajustes das orienta??es dos sensores, potencialmente beneficiando a implanta??o e o gerenciamento de redes de sensores visuais sem fio para diferentes aplica??es.

[pt] Estudos empíricos na área de séries temporais indicam que combinar modelos preditivos, originados a partir de diferentes técnicas de modelagem, levam a previsões consensuais superiores, em termos de acurácia, às previsões individuais dos modelos envolvidos na combinação. No presente trabalho é apresentada uma metodologia de combinação convexa de modelos estatísticos de previsão, cujo sucesso depende da forma como os pesos de combinação de cada modelo são estimados. Uma Rede Neural Artificial Perceptron Multi-camada (Multilayer Perceptron - MLP) é utilizada para gerar dinamicamente vetores de pesos ao longo do horizonte de previsão, sendo estes dependentes da contribuição individual de cada previsor observada nos dados históricos da série. O ajuste dos parâmetros da rede MLP é efetuado através de um algoritmo de treinamento híbrido, que integra técnicas de busca global, baseadas em computação evolucionária, junto com o algoritmo de busca local backpropagation, de modo a otimizar de forma simultânea tanto os pesos quanto a arquitetura da rede, visando, assim, a gerar de forma automática um modelo de ponderação dinâmica de previsores de alto desempenho. O modelo proposto, batizado de Neural Expert Weighting - Genetic Algorithm (NEW-GA), foi avaliado em diversos experimentos comparativos com outros modelos de ponderação de previsores, assim como também com os modelos individuais envolvidos na combinação, contemplando 15 séries temporais divididas em dois estudos de casos: séries de derivados de petróleo e séries da versão reduzida da competição NN3, uma competição entre metodologias de previsão, com maior ênfase nos modelos baseados em Redes Neurais. Os resultados demonstraram o potencial do NEWGA em fornecer modelos acurados de previsão de séries temporais. / [en] Empirical studies on time series indicate that the combination of forecasting models, generated from different modeling techniques, leads to higher consen+sus forecasts, in terms of accuracy, than the forecasts of individual models involved in the combination scheme. In this work, we present a methodology for convex combination of statistical forecasting models, whose success depends on how the combination weights of each model are estimated. An Artificial Neural Network Multilayer Perceptron (MLP) is used to generate dynamically weighting vectors over the forecast horizon, being dependent on the individual contribution of each forecaster observed over historical data series. The MLP network parameters are adjusted via a hybrid training algorithm that integrates global search techniques, based on evolutionary computation, along with the local search algorithm backpropagation, in order to optimize simultaneously both weights and network architecture. This approach aims to automatically generate a dynamic weighted forecast aggregation model with high performance. The proposed model, called Neural Expert Weighting - Genetic Algorithm (NEW-GA), was com- pared with other forecaster combination models, as well as with the individual models involved in the combination scheme, comprising 15 time series divided into two case studies: Petroleum Products and the reduced set of NN3 forecasting competition, a competition between forecasting methodologies, with greater emphasis on models based on neural networks. The results obtained demonstrated the potential of NEW-GA in providing accurate models for time series forecasting.

Esta Tese propõe uma nova ferramenta para Otimização Robusta Multiobjetivo por Análise de Intervalo Não Probabilística (Non-probabilistic Interval Analysis for Multiobjective Robust Design Optimization ou NPIA-MORDO). A ferramenta desenvolvida visa à otimização dos parâmetros concentrados de suspensão em um modelo veicular completo, submetido a uma manobra direcional percorrendo diferentes perfis de pista, a fim de garantir maior conforto e segurança ao motorista. O modelo multicorpo possui 15 graus de liberdade (15-GDL), dentre os quais onze pertencem ao veículo e assento, e quatro, ao modelo biodinâmico do motorista. A função multiobjetivo é composta por objetivos conflitantes e as suas tolerâncias, como a raiz do valor quadrático médio (root mean square ou RMS) da aceleração lateral e da aceleração vertical do assento do motorista, desenvolvidas durante a manobra de dupla troca de faixa (Double Lane Change ou DLC). O curso da suspensão e a aderência dos pneus à pista são tratados como restrições do problema de otimização. As incertezas são quantificadas no comportamento do sistema pela análise de intervalo não probabilística, por intermédio do Método dos Níveis de Corte-α (α-Cut Levels) para o nível α zero (de maior dispersão), e realizada concomitantemente ao processo de otimização multiobjetivo. Essas incertezas são aplicáveis tanto nos parâmetros do problema quanto nas variáveis de projeto. Para fins de validação do modelo, desenvolvido em ambiente MATLAB®, a trajetória do centro de gravidade da carroceria durante a manobra é comparada com o software CARSIM®, assim como as forças laterais e verticais dos pneus. Os resultados obtidos são exibidos em diversos gráficos a partir da fronteira de Pareto entre os múltiplos objetivos do modelo avaliado Os indivíduos da fronteira de Pareto satisfazem as condições do problema, e a função multiobjetivo obtida pela agregação dos múltiplos objetivos resulta em uma diferença de 1,66% entre os indivíduos com o menor e o maior valor agregado obtido. A partir das variáveis de projeto do melhor indivíduo da fronteira, gráficos são gerados para cada grau de liberdade do modelo, ilustrando o histórico dos deslocamentos, velocidades e acelerações. Para esse caso, a aceleração RMS vertical no assento do motorista é de 1,041 m/s² e a sua tolerância é de 0,631 m/s². Já a aceleração RMS lateral no assento do motorista é de 1,908 m/s² e a sua tolerância é de 0,168 m/s². Os resultados obtidos pelo NPIA-MORDO confirmam que é possível agregar as incertezas dos parâmetros e das variáveis de projeto à medida que se realiza a otimização externa, evitando a necessidade de análises posteriores de propagação de incertezas. A análise de intervalo não probabilística empregada pela ferramenta é uma alternativa viável de medida de dispersão se comparada com o desvio padrão, por não utilizar uma função de distribuição de probabilidades prévia e por aproximar-se da realidade na indústria automotiva, onde as tolerâncias são preferencialmente utilizadas. / This thesis proposes the development of a new tool for Non-probabilistic Interval Analysis for Multi-objective Robust Design Optimization (NPIA-MORDO). The developed tool aims at optimizing the lumped parameters of suspension in a full vehicle model, subjected to a double-lane change (DLC) maneuver throughout different random road profiles, to ensure comfort and safety to the driver. The multi-body model has 15 degrees of freedom (15-DOF) where 11-DOF represents the vehicle and its seat and 4-DOF represents the driver's biodynamic model. A multi-objective function is composed by conflicted objectives and their tolerances, like the root mean square (RMS) lateral and vertical acceleration in the driver’s seat, both generated during the double-lane change maneuver. The suspension working space and the road holding capacity are used as constraints for the optimization problem. On the other hand, the uncertainties in the system are quantified using a non-probabilistic interval analysis with the α-Cut Levels Method for zero α-level (the most uncertainty one), performed concurrently in the multi-objective optimization process. These uncertainties are both applied to the system parameters and design variables to ensure the robustness in results. For purposes of validation in the model, developed in MATLAB®, the path of the car’s body center of gravity during the maneuver is compared with the commercial software CARSIM®, as well as the lateral and vertical forces from the tires. The results are showed in many graphics obtained from the Pareto front between the multiple conflicting objectives of the evaluated model. The obtained solutions from the Pareto Front satisfy the conditions of the evaluated problem, and the aggregated multi-objective function results in a difference of 1.66% for the worst to the best solution. From the design variables of the best solution choose from the Pareto front, graphics are created for each degree of freedom, showing the time histories for displacements, velocities and accelerations. In this particular case, the RMS vertical acceleration in the driver’s seat is 1.041 m/s² and its tolerance is 0.631 m/s², but the RMS lateral acceleration in the driver’s seat is 1.908 m/s² and its tolerance is 0.168 m/s². The overall results obtained from NPIA-MORDO assure that is possible take into account the uncertainties from the system parameters and design variables as the external optimization loop is performed, reducing the efforts in subsequent evaluations. The non-probabilistic interval analysis performed by the proposed tool is a feasible choice to evaluate the uncertainty if compared to the standard deviation, because there is no need of previous well-known based probability distribution and because it reaches the practical needs from the automotive industry, where the tolerances are preferable.

Depuis la fermeture de Phénix en 2010 le CEA ne possède plus de réacteur au sodium. Vus les enjeux énergétiques et le potentiel de la filière, le CEA a lancé un programme de démonstrateur industriel appelé ASTRID (Advanced Sodium Technological Reactor for Industrial Demonstration), réacteur d’une puissance de 600MW électriques (1500 MW thermiques). L’objectif du prototype est double, être une réponse aux contraintes environnementales et démontrer la viabilité industrielle :• De la filière RNR-Na, avec un niveau de sureté au moins équivalent aux réacteurs de 3ème génération, du type de l’EPR. ASTRID intégrera dès la conception le retour d’expérience de Fukushima ;• Du retraitement des déchets (transmutation d’actinide mineur) et de la filière qui lui serait liée.La sûreté de l’installation est prioritaire, aucun radioélément ne doit être rejeté dans l’environnement, et ce dans toutes les situations. Pour atteindre cet objectif, il est impératif d’anticiper l’impact des nombreuses sources d’incertitudes sur le comportement du réacteur et ce dès la phase de conception. C’est dans ce contexte que s’inscrit cette thèse dont l’ambition est le développement de nouvelles méthodes d’optimisation des cœurs des RNR-Na. L’objectif est d’améliorer la robustesse et la fiabilité des réacteurs en réponse à des incertitudes existantes. Une illustration sera proposée à partir des incertitudes associées à certains régimes transitoires dimensionnant. Nous utiliserons le modèle ASTRID comme référence pour évaluer l’intérêt des nouvelles méthodes et outils développés.L’impact des incertitudes multi-Physiques sur le calcul des performances d’un cœur de RNR-Na et l’utilisation de méthodes d’optimisation introduisent de nouvelles problématiques :• Comment optimiser des cœurs « complexes » (i.e associés à des espaces de conception de dimensions élevée avec plus de 20 paramètres variables) en prenant en compte les incertitudes ?• Comment se comportent les incertitudes sur les cœurs optimisés par rapport au cœur de référence ?• En prenant en compte les incertitudes, les réacteurs sont-Ils toujours considérés comme performants ?• Les gains des optimisations obtenus à l’issue d’optimisations complexes sont-Ils supérieurs aux marges d’incertitudes (qui elles-Mêmes dépendent de l’espace paramétrique) ?La thèse contribue au développement et à la mise en place des méthodes nécessaires à la prise en compte des incertitudes dans les outils de simulation de nouvelle génération. Des méthodes statistiques pour garantir la cohérence des schémas de calculs multi-Physiques complexes sont également détaillées.En proposant de premières images de cœur de RNR-Na innovants, cette thèse présente des méthodes et des outils permettant de réduire les incertitudes sur certaines performances des réacteurs tout en les optimisant. Ces gains sont obtenus grâce à l’utilisation d’algorithmes d’optimisation multi-Objectifs. Ces méthodes permettent d’obtenir tous les compromis possibles entre les différents critères d’optimisations comme, par exemple, les compromis entre performance économique et sûreté. / Since Phenix shutting down in 2010, CEA does not have Sodium Fast Reactor (SFR) in operating condition. According to global energetic challenge and fast reactor abilities, CEA launched a program of industrial demonstrator called ASTRID (Advanced Sodium Technological Reactor for Industrial Demonstration), a reactor with electric power capacity equal to 600MW. Objective of the prototype is, in first to be a response to environmental constraints, in second demonstrates the industrial viability of:• SFR reactor. The goal is to have a safety level at least equal to 3rd generation reactors. ASTRID design integrates Fukushima feedback;• Waste reprocessing (with minor actinide transmutation) and it linked industry.Installation safety is the priority. In all cases, no radionuclide should be released into environment. To achieve this objective, it is imperative to predict the impact of uncertainty sources on reactor behaviour. In this context, this thesis aims to develop new optimization methods for SFR cores. The goal is to improve the robustness and reliability of reactors in response to existing uncertainties. We will use ASTRID core as reference to estimate interest of new methods and tools developed.The impact of multi-Physics uncertainties in the calculation of the core performance and the use of optimization methods introduce new problems:• How to optimize “complex” cores (i.e. associated with design spaces of high dimensions with more than 20 variable parameters), taking into account the uncertainties?• What is uncertainties behaviour for optimization core compare to reference core?• Taking into account uncertainties, optimization core are they still competitive? Optimizations improvements are higher than uncertainty margins?The thesis helps to develop and implement methods necessary to take into account uncertainties in the new generation of simulation tools. Statistical methods to ensure consistency of complex multi-Physics simulation results are also detailed.By providing first images of innovative SFR core, this thesis presents methods and tools to reduce the uncertainties on some performance while optimizing them. These gains are achieved through the use of multi-Objective optimization algorithms. These methods provide all possible compromise between the different optimization criteria, such as the balance between economic performance and safety.

Maximum asset performance is one of the major goals for electric power distribution system operators (DSOs). To reach this goal minimal life cycle cost and maintenance optimization become crucial while meeting demands from customers and regulators. One of the fundamental objectives is therefore to relate maintenance and reliability in an efficient and effective way. Furthermore, this necessitates the determination of the optimal balance between pre¬ventive and corrective maintenance, which is the main problem addressed in the thesis. The balance between preventive and corrective maintenance is approached as a multiobjective optimization problem, with the customer interruption costs on one hand and the maintenance budget of the DSO on the other. Solutions are obtained with meta-heuristics, developed for the specific problem, as well as with an Evolutionary Particle Swarm Optimization algorithm. The methods deliver a Pareto border, a set of several solutions, which the operator can choose between, depending on preferences. The optimization is built on component reliability importance indices, developed specifically for power systems. One vital aspect of the indices is that they work with several supply and load points simultaneously, addressing the multistate-reliability of power systems. For the computation of the indices both analytical and simulation based techniques are used. The indices constitute the connection between component reliability performance and system performance and so enable the maintenance optimization. The developed methods have been tested and improved in two case studies, based on real systems and data, proving the methods’ usefulness and showing that they are ready to be applied to power distribution systems. It is in addition noted that the methods could, with some modifications, be applied to other types of infrastructures. However, in order to perform the optimization, a reliability model of the studied power system is required, as well as estimates on effects of maintenance actions (changes in failure rate) and their related costs. Given this, a generally decreased level of total maintenance cost and a better system reliability performance can be given to the DSO and customers respectively. This is achieved by focusing the preventive maintenance to components with a high potential for improvement from system perspective. / QC 20100810

Aquesta tesi es centra en algorismes de clustering multiobjectiu, que estan basats en optimitzar varis objectius simultàniament obtenint una col•lecció de solucions potencials amb diferents compromisos entre objectius. El propòsit d'aquesta tesi consisteix en dissenyar i implementar un nou algorisme de clustering multiobjectiu basat en algorismes evolutius per afrontar tres reptes actuals relacionats amb aquest tipus de tècniques. El primer repte es centra en definir adequadament l'àrea de possibles solucions que s'explora per obtenir la millor solució i que depèn de la representació del coneixement. El segon repte consisteix en escalar el sistema dividint el conjunt de dades original en varis subconjunts per treballar amb menys dades en el procés de clustering. El tercer repte es basa en recuperar la solució més adequada tenint en compte la qualitat i la forma dels clusters a partir de la regió més interessant de la col•lecció de solucions ofertes per l’algorisme. / Esta tesis se centra en los algoritmos de clustering multiobjetivo, que están basados en optimizar varios objetivos simultáneamente obteniendo una colección de soluciones potenciales con diferentes compromisos entre objetivos. El propósito de esta tesis consiste en diseñar e implementar un nuevo algoritmo de clustering multiobjetivo basado en algoritmos evolutivos para afrontar tres retos actuales relacionados con este tipo de técnicas. El primer reto se centra en definir adecuadamente el área de posibles soluciones explorada para obtener la mejor solución y que depende de la representación del conocimiento. El segundo reto consiste en escalar el sistema dividiendo el conjunto de datos original en varios subconjuntos para trabajar con menos datos en el proceso de clustering El tercer reto se basa en recuperar la solución más adecuada según la calidad y la forma de los clusters a partir de la región más interesante de la colección de soluciones ofrecidas por el algoritmo. / This thesis is focused on multiobjective clustering algorithms, which are based on optimizing several objectives simultaneously obtaining a collection of potential solutions with different trade¬offs among objectives. The goal of the thesis is to design and implement a new multiobjective clustering technique based on evolutionary algorithms for facing up three current challenges related to these techniques. The first challenge is focused on successfully defining the area of possible solutions that is explored in order to find the best solution, and this depends on the knowledge representation. The second challenge tries to scale-up the system splitting the original data set into several data subsets in order to work with less data in the clustering process. The third challenge is addressed to the retrieval of the most suitable solution according to the quality and shape of the clusters from the most interesting region of the collection of solutions returned by the algorithm.

From the Proceedings of the 1976 Meetings of the Arizona Section - American Water Resources Assn. and the Hydrology Section - Arizona Academy of Science - April 29-May 1, 1976, Tucson, Arizona / The case study of an Upper San Pedro River watershed is developed to show how a multiple objective approach to decision-making may be used in watershed management. The effects of various land treatments and management practices on water runoff, sediment, recreation,, wildlife levels, and commercial potential of a study area are investigated while observing constraints' on available land and capital. The example involves the optimization of five objective functions subject to eighteen constraints. In an iterative manner, the decision-maker proceeds from one noninferior solution to another, comparing sets of land management activities for reaching specified goals, and evaluating trade-offs between individual objective functions. This technique, which involves the formulation of a surrogate objective function and the use of the cutting plane method to solve the general nonlinear problem, hopefully provides a compromise between oversimplified and computationally intractable approaches to multiobjective watershed management.

No description available.