Orientador: Marcia A. Gomes Ruggiero / Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matematica, Estatistica e Computação Cientifica / Made available in DSpace on 2018-08-05T23:37:23Z (GMT). No. of bitstreams: 1 Haeser_Gabriel_M.pdf: 906525 bytes, checksum: ea7e3eb42abe6b8b451f99c4c63a3da4 (MD5) Previous issue date: 1996 / Resumo: Neste trabalho estudamos a teoria de algumas heurísticas para otimização global, e também a generalização do algoritmo genético de Aarts, Eiben e van Hee. Propomos um algoritmo para otimização global de problemas canalizados e diferenciáveis utilizando simulated annealing e o solver local GENCAN. Experimentos numéricos com o problema OVO ( Order- Value Optimization) são apresentados, e também com 28 problemas clássicos da literatura. Para problemas de otimização com restrições, apontamos idéias de como utilizar solvers locais e heurísticas globais em busca de bons algoritmos para otimização global, e propomos um algoritmo baseado em simulated annealing com solver local ALGENCAN / Abstract: In this work we study the theory behind some classical heuristics for global optimization, and a generalization of genetic algorithms from Aarts, Eiben and van Hee. We propose an algorithm for global optimization of box-constrained differentiable problems, using simulated annealing and the local solver GENCAN. Numerical experiments are presented for the OVO problem (Order-Value Optimization) and 28 classical problems. For general nonlinear programming problems, we mention some ideas of how to use local solvers and global heuristics towards good algorithms for global optimization, we also propose an algorithm based on simulated annealing with local solver ALGENCAN / Mestrado / Otimização / Mestre em Matemática Aplicada

Orientador: Katia Lucchesi Cavalca / Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Mecanica / Made available in DSpace on 2018-08-09T12:41:08Z (GMT). No. of bitstreams: 1 Castro_HelioFioride_D.pdf: 2921981 bytes, checksum: 83a1aae9466f9a33a00043c950bea261 (MD5) Previous issue date: 2007 / Resumo: Neste trabalho, foi realizada a análise e validação de um modelo de sistema rotativo sustentado por mancais hidrodinâmicos. Para isto, considerou-se um modelo não-linear de mancal hidrodinâmico. A parte girante do sistema foi modelada pelo Método dos Elementos Finitos. Este modelo é capaz de simular a resposta do sistema a auto-excitação causada pelo ilme de óleo no mancal hidrodinâmico. Para calibração do modelo, um método de ajuste metaheurístico, baseado em Algoritmo Genético e Recozimento Simulado foi aplicado. Após o ajuste do modelo, compararam-se os resultados da simulação, considerando o resultado do ajuste, e resultados adquiridos na bancada experimental de teste do Laboratório de Máquinas Rotativas (DPM) na Faculdade de Engenharia Mecânica da UNICAMP. Uma especial atenção foi dada na análise dos esforços hidrodinâmicos, pois se buscou levantar os coeficientes dinâmicos lineares (coeficientes de amortecimento e rigidez) dos mancais através dos resultados obtidos experimentalmente e pelas simulações. Além disto, foram estimados coeficientes não-lineares das forças, os quais são relacionados a termos quadráticos de deslocamentos e velocidades e suas combinações, ressaltando o caratê não-linear deste tipo de mancais. Os resultados demonstraram que o modelo não-linear de mancais hidrodinâmicos é capaz de representar a instabilidade fluidoinduzida / Abstract: In this investigation, the analysis and validation of rotative system supported by hydrodynamic journal bearings was accomplished. A non-linear hydrodynamic bearing model was considered. The rotary shaft and rotor mass were modeled by The Finite Element Method. The combination of these models is able to simulate the system response to the auto-excitation caused by the oil film instabilities in the journal bearing. In order to calibrate the model, a metaheuristic method, based in Genetic Algorithm and Simulated Annealing, was applied. After the model fitting, the simulation results, taking into account the fitting results, and experimental results acquired from the experimental set-up at the Rotating Machine Laboratory in the Department of Mechanical Design of the Mechanical Engineering Faculty at UNICAMP. A special attention was directed to the hydrodynamic forces, because the dynamic bearing coefficients (stiffness and damping coefficients) were evaluated through simulated and experimental results. Moreover, non-linear coefficients of the forces were also estimated. These coefficients are related to quadratic terms of displacements and velocities and ççtheir combinations, highlighting the non-linear feature of this kind of bearing. The results showed hat the non-linear journal bearing model is able to represent the fluid-induced instability / Doutorado / Mecanica dos Sólidos e Projeto Mecanico / Doutor em Engenharia Mecânica

Orientador: Antonio Carlos Moretti / Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matemática, Estatística e Computação Científica / Made available in DSpace on 2018-08-19T18:37:54Z (GMT). No. of bitstreams: 1 Souza_JulianodaSilvade_M.pdf: 2798780 bytes, checksum: b977e17cdf141668422f1dd2f3ef4eb0 (MD5) Previous issue date: 2012 / Resumo: Neste trabalho é apresentada uma nova abordagem da heurística Simulated Annealing, no que se refere a geração de soluções na vizinhança de uma solução factível, para encontrar a solução ótima de uma formulação de programação linear inteira para o Problema de Corte de Estoque Unidimensional. O desempenho do novo algoritmo é comparado à metodologia publicada em A simulated annealing heuristic for the one-dimensional cutting stock problem apresentada em [2]. Os resultados dos experimentos computacionais indicam que essa nova abordagem, fornece soluções muito melhores em relação ao valor objetivo em tempo equivalente de execução. Além disso, uma comparação qualitativa é feita com o solver CPLEX. Para os experimentos numéricos utiliza-se o gerador de problemas CUTGEN1: A problem generator for the Standard One-dimensional Cutting Stock Problem, proposto em [6], o qual fornece um gerador de classes de problemas de acordo com os critérios de tamanho dos itens finais e demandas. Finalmente, são reportados resultados dos experimentos computacionais baseados na metodologia apresentada em [1] no artigo Guidelines for Designing and Reporting on Computational Experiments with Heuristic Methods / Abstract: This work presents a new approach to heuristic Simulated Annealing, in refers to the generation of solutions in the neighborhood of a feasible solution, to _nd the solution an optimal integer linear programming formulation for the Cutting Stock Problem One-dimensional. The performance of the new algorithm is compared to the methodology published in A simulated annealing heuristic for the one-dimensional cutting stock problem presented in [2]. The results of computational experiments indicate that this new approach provides much better solutions in relation to the objective value time equivalent execution. In addition, a qualitative comparison is made to the CPLEX solver. For the numerical experiments we use the generator of problems CUTGEN1: A problem generator for the Standard One-dimensional Cutting Stock Problem, in [6], which provides a generator classes of problems according to criteria size and demands of end items. Finally, results of experiments are reported computer-based method presented in [1] by article Guidelines for Designing and Reporting on Computational Experiments with Heuristic Methods / Mestrado / Matematica Aplicada / Mestre em Matemática Aplicada

In this thesis a simulated annealing algorithm is employed as an optimization tool for a large scale optimization problem in wireless communication. In this application, we have 100 places for transition antennas and 100 places for receivers, and also a channel between each position in both areas. Our aim is to nd, say the best 3 positions there, in a way that the channel capacity is maximized. The number of possible combinations is huge. Hence, nding the best channel will take a very long time using an exhaustive search. To solve this problem, we use a simulated annealing algorithm and estimate the best answer. The simulated annealing algorithm chooses a random element, and then from the local search algorithm, compares the selected element with its neighbourhood. If the selected element is the maximum among its neighbours, it is a local maximum. The strength of the simulated annealing algorithm is its ability to escape from local maximum by using a random mechanism that mimics the Boltzmann statistic.

This thesis reports the work of using simulated annealing to design more efficient fuzzy logic systems to model problems with associated uncertainties. Simulated annealing is used within this work as a method for learning the best configurations of type-1 and type-2 fuzzy logic systems to maximise their modelling ability. Therefore, it presents the combination of simulated annealing with three models, type-1 fuzzy logic systems, interval type-2 fuzzy logic systems and general type-2 fuzzy logic systems to model four bench-mark problems including real-world problems. These problems are: noise-free Mackey-Glass time series forecasting, noisy Mackey-Glass time series forecasting and two real world problems which are: the estimation of the low voltage electrical line length in rural towns and the estimation of the medium voltage electrical line maintenance cost. The type-1 and type-2 fuzzy logic systems models are compared in their abilities to model uncertainties associated with these problems. Also, issues related to this combination between simulated annealing and fuzzy logic systems including type-2 fuzzy logic systems are discussed. The thesis contributes to knowledge by presenting novel contributions. The first is a novel approach to design interval type-2 fuzzy logic systems using the simulated annealing algorithm. Another novelty is related to the first automatic design of general type-2 fuzzy logic system using the vertical slice representation and a novel method to overcome some parametrisation difficulties when learning general type-2 fuzzy logic systems. The work shows that interval type-2 fuzzy logic systems added more abilities to modelling information and handling uncertainties than type-1 fuzzy logic systems but with a cost of more computations and time. For general type-2 fuzzy logic systems, the clear conclusion that learning the third dimension can add more abilities to modelling is an important advance in type-2 fuzzy logic systems research and should open the doors for more promising research and practical works on using general type-2 fuzzy logic systems to modelling applications despite the more computations associated with it.

Self-assembly is a process of non-intrusive transformation of a system from a disordered to an ordered state. For engineering purposes, self-assembly of microscopic objects can benefit significantly from macroscopic guidance and control. This dissertation is concerned with controlling self-assembly in binary monolayers of electrically charged particles that follow basic laws of statistical mechanics. First, a simple macroscopic model is used to determine an optimal thermal control for self-assembly. The model assumes that a single rate-controlling mechanism is responsible for the formation of spatially ordered structures and that its rate follows an Arrhenius form. The model parameters are obtained using molecular dynamics simulations. The optimal control is derived in an analytical form using classical optimization methods. Two major lessons were learned from that work: (i) isothermal control was almost as effective as optimal time-dependent thermal control, and (ii) neither electrostatic interactions nor thermal control were particularly effective in eliminating voids formed during self-assembly. Accordingly, at the next stage, the focus is on temperature-pressure control under isothermal-isobaric conditions. In identifying optimal temperature and pressure conditions, several assumptions, that allow one to relate the optimal conditions to the phase diagram, are proposed. Instead of verifying the individual assumptions, the entire approach is verified using molecular dynamics simulations. It is estimated that under optimal isothermal-isobaric conditions the rate of self-assembly is about five time faster than that under optimal temperature control conditions. It is argued that the proposed approach of relating optimal conditions to the phase diagram is applicable to other systems. Further, the work reveals numerous and useful parallels between self-assembly and crystal physics, which are important to exploit for developing robust engineering self-assembly processes. / text

No description available.

Spatial layout design must consider not only ease of movement for pedestrians under normal conditions, but also their safety in panic situations, such as an emergency evacuation in a theatre, stadium or hospital. Using pedestrian simulation statistics, the movement of crowds can be used to study the consequences of different spatial layouts. Previous works either create an optimal spatial arrangement or an optimal pedestrian circulation. They do not automatically optimise both problems simultaneously. Thus, the idea behind the research in this thesis is to achieve a vital architectural design goal by automatically producing an optimal spatial layout that will enable smooth pedestrian flow. The automated process developed here allows the rapid identification of layouts for large, complex, spatial layout problems. This is achieved by using Cellular Automata (CA) to model pedestrian simulation so that pedestrian flow can be explored at a microscopic level and designing a fitness function for heuristic search that maximises these pedestrian flow statistics in the CA simulation. An analysis of pedestrian flow statistics generated from feasible novel design solutions generated using the heuristic search techniques (hill climbing, simulated annealing and genetic algorithm style operators) is conducted. The statistics that are obtained from the pedestrian simulation is used to measure and analyse pedestrian flow behaviour. The analysis from the statistical results also provides the indication of the quality of the spatial layout design generated. The technique has shown promising results in finding acceptable solutions to this problem when incorporated with the pedestrian simulator when demonstrated on simulated and real-world layouts with real pedestrian data.

Modelling of biochemical systems has received considerable attention over the last decade from bioengineering, biochemistry, computer science, and mathematics. This thesis investigates the applications of computational techniques to computational systems biology, for the construction of biochemical models in terms of topology and kinetic rates. Due to the complexity of biochemical systems, it is natural to construct models representing the biochemical systems incrementally in a piecewise manner. Syntax and semantics of two patterns are defined for the instantiation of components which are extendable, reusable and fundamental building blocks for models composition. We propose and implement a set of genetic operators and composition rules to tackle issues of piecewise composing models from scratch. Quantitative Petri nets are evolved by the genetic operators, and evolutionary process of modelling are guided by the composition rules. Metaheuristic algorithms are widely applied in BioModel Engineering to support intelligent and heuristic analysis of biochemical systems in terms of structure and kinetic rates. We illustrate parameters of biochemical models based on Biochemical Systems Theory, and then the topology and kinetic rates of the models are manipulated by employing evolution strategy and simulated annealing respectively. A new hybrid modelling framework is proposed and implemented for the models construction. Two heuristic algorithms are performed on two embedded layers in the hybrid framework: an outer layer for topology mutation and an inner layer for rates optimization. Moreover, variants of the hybrid piecewise modelling framework are investigated. Regarding flexibility of these variants, various combinations of evolutionary operators, evaluation criteria and design principles can be taken into account. We examine performance of five sets of the variants on specific aspects of modelling. The comparison of variants is not to explicitly show that one variant clearly outperforms the others, but it provides an indication of considering important features for various aspects of the modelling. Because of the very heavy computational demands, the process of modelling is paralleled by employing a grid environment, GridGain. Application of the GridGain and heuristic algorithms to analyze biological processes can support modelling of biochemical systems in a computational manner, which can also benefit mathematical modelling in computer science and bioengineering. We apply our proposed modelling framework to model biochemical systems in a hybrid piecewise manner. Modelling variants of the framework are comparatively studied on specific aims of modelling. Simulation results show that our modelling framework can compose synthetic models exhibiting similar species behaviour, generate models with alternative topologies and obtain general knowledge about key modelling features.

In this thesis we have presented a mathematical model of a scheduling problem which arises in the Brewing Industry. We have implemented two different types of global optimization algorithms to find the global minimum of the problem. Several instances of the scheduling problem are considered and the results thereof are presented. The results show that significant savings can be made if the global optimization techniques are used in brewery Industry.