5 resultados para multi-objective genetic algorithms
em Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco
Resumo:
This study developed a framework for the shape optimization of aerodynamics profiles using computational fluid dynamics (CFD) and genetic algorithms. Agenetic algorithm code and a commercial CFD code were integrated to develop a CFD shape optimization tool. The results obtained demonstrated the effectiveness of the developed tool. The shape optimization of airfoils was studied using different strategies to demonstrate the capacity of this tool with different GA parameter combinations.
Resumo:
This paper describes Mateda-2.0, a MATLAB package for estimation of distribution algorithms (EDAs). This package can be used to solve single and multi-objective discrete and continuous optimization problems using EDAs based on undirected and directed probabilistic graphical models. The implementation contains several methods commonly employed by EDAs. It is also conceived as an open package to allow users to incorporate different combinations of selection, learning, sampling, and local search procedures. Additionally, it includes methods to extract, process and visualize the structures learned by the probabilistic models. This way, it can unveil previously unknown information about the optimization problem domain. Mateda-2.0 also incorporates a module for creating and validating function models based on the probabilistic models learned by EDAs.
Resumo:
Quantum Computing is a relatively modern field which simulates quantum computation conditions. Moreover, it can be used to estimate which quasiparticles would endure better in a quantum environment. Topological Quantum Computing (TQC) is an approximation for reducing the quantum decoherence problem1, which is responsible for error appearance in the representation of information. This project tackles specific instances of TQC problems using MOEAs (Multi-objective Optimization Evolutionary Algorithms). A MOEA is a type of algorithm which will optimize two or more objectives of a problem simultaneously, using a population based approach. We have implemented MOEAs that use probabilistic procedures found in EDAs (Estimation of Distribution Algorithms), since in general, EDAs have found better solutions than ordinary EAs (Evolutionary Algorithms), even though they are more costly. Both, EDAs and MOEAs are population-based algorithms. The objective of this project was to use a multi-objective approach in order to find good solutions for several instances of a TQC problem. In particular, the objectives considered in the project were the error approximation and the length of a solution. The tool we used to solve the instances of the problem was the multi-objective framework PISA. Because PISA has not too much documentation available, we had to go through a process of reverse-engineering of the framework to understand its modules and the way they communicate with each other. Once its functioning was understood, we began working on a module dedicated to the braid problem. Finally, we submitted this module to an exhaustive experimentation phase and collected results.
Resumo:
This paper sets out an optimum synthesis methodology for wheel profiles of railway vehicles in order to secure good dynamic behaviour with different track configurations. Specifically, the optimisation process has been applied to the case of rail wheelsets mounted on double gauge bogies, that move over two different gauges, which also have different types of rail: the Iberian gauge (1668 mm) and the UIC gauge (1435 mm). Optimisation is performed using Genetic Algorithms and traditional optimisation methods in a complementary way. The objective function used is based on an ideal equivalent conicity curve which ensures good stability on straight sections and also proper negotiation of curves. To this end the curve is constructed in such a way that it is constant with a low value for small lateral wheelset displacements (with regard to stability), and increases as the displacements increase (to facilitate negotiation of curved sections). Using this kind of ideal conicity curve also enables a wheel profile to be secured where the contact points have a larger distribution over the active contact areas, making wear more homogeneous and reducing stresses. The result is a wheel profile with a conicity that is closer to the target conicity for both gauges studied, producing better curve negotiation while maintaining good stability on straight sections of track. The paper shows the resultant wheel profile, the contact curves it produces, and a number of dynamic analyses demonstrating better dynamic behaviour of the synthesised wheel on curved sections with respect to the original wheel.
Resumo:
131 p.: graf.