Genetic Algorithms And Simulated Annealing
Mostrando 1-11 de 11 artigos, teses e dissertações.
-
1. DEVELOPMENT OF A HYBRID FUZZY GENETIC ALGORITHM MODEL FOR SOLVING TRANSPORTATION SCHEDULING PROBLEM
ABSTRACT There has been an increasing public demand for passenger rail service in the recent times leading to a strong focus on the need for effective and efficient use of resources and managing the increasing passenger requirements, service reliability and variability by the railway management. Whilst shortening the passengers’ waiting and travelling time
JISTEM J.Inf.Syst. Technol. Manag.. Publicado em: 2015-12
-
2. Comparison between simulated annealing algorithms and rapid chain delineation in the construction of genetic maps
The efficiency of simulated annealing algorithms and rapid chain delineation in establishing the best linkage order, when constructing genetic maps, was evaluated. Linkage refers to the phenomenon by which two or more genes, or even more molecular markers, can be present in the same chromosome or linkage group. In order to evaluate the capacity of algorithms
Genetics and Molecular Biology. Publicado em: 23/04/2010
-
3. Modelagem dos algorítmos simples e Simulated Annealing por cadeias de Markov
Os Algoritmos Genético (AG) e o Simulated Annealing (SA) são algoritmos construídos para encontrar máximo ou mínimo de uma função que representa alguma característica do processo que está sendo modelado. Esses algoritmos possuem mecanismos que os fazem escapar de ótimos locais, entretanto, a evolução desses algoritmos no tempo se dá de forma com
Publicado em: 2010
-
4. Hydrodynamic journal bearing analysis under fluid-induced instabilities / Analise de mancais hidrodinamicos em rotores sob instabilidade fluido-induzida
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 cau
Publicado em: 2007
-
5. Uma anÃlise de otimizaÃÃo de redes neurais MLP por exames de partÃculas
This work presents a methodology for global optimization of MLP artificial neural networks. The main objective here is the simultaneous optimization of architectures and connection weights of MLP networks, aiming good classification performance for most data sets. The simultaneous adjustment of architectures and connection weights of MLP networks represents
Publicado em: 2007
-
6. Análise de técnicas baseadas em metaheurísticas e dominação de grafos para clustering em redes ad hoc / Metaheuristics and graph domination techniques analisys for clustering in wireless mobile AD HOC networks
As redes ad hoc são caracterizadas pela ausência de infra-estrutura de comunicação. Uma forma de comunicação entre os nós, assim como a manutenção de mudanças de conexão podem utilizar uma estrutura hierárquica baseada em clusters [EPH87]. Um cluster agrupa dinamicamente um conjunto de nós em torno de um nó central, responsável pelo roteamento
Publicado em: 2006
-
7. A study and applications of differential evolution / Estudo e aplicaÃÃes da evoluÃÃo diferencial
In the last few decades, the application of optimization in engineering problems has grown considerably. There are various optimization methods and the performance of each one depends on the type of problem considered. The natural methods, which are based on probabilistic rules, have been widely studied. The purpose of this work is to present a detailed stud
Publicado em: 2006
-
8. Metaheuristicas aplicadas ao planejamento da expansão da transmissão de energia eletrica em ambientes de processamento distribuido
In this work, several combinatorial metaheuristics are developed for solving the transmission expansion planning problem of electric power systems that is analysed considering the static and long-term approach, e.g. a parallel version of the simulated annealing methodology and several parallel versions of a genetic algorithms, besides an asynchronous team wh
Publicado em: 2004
-
9. Otimização extrema generalizada: um novo algoritmo estocástico para o projeto ótimo / x
In this work a new numerical tool for application on optimal design is presented. Based on the theory of Self-Organized Criticality (SOC), it is intended to be used in problems that present complex characteristics such as a non-convex or even disjoint design space, the presence of multiple sub-optimal solutions on it, severe non-linearities on the objective
Publicado em: 2002
-
10. Tecnicas de busca aplicadas a deteção de contornos
Edge detection is an important task in image processing. It plays a crucial role in object recognition and image understanding systems, what explains the great deal of research that has been dedicated to detect region edges in images obtained from different contexts. Nevertheless, the automatic edge detection is still a great challenge to today s technology.
Publicado em: 1997
-
11. PARALLEL ADAPTIVE SEARCH TECHNIQUES FOR STRUCTURAL OPTIMIZATION
This thesis investigates the capabilities of two alternative search techniques from the field of Artificial Intelligence (AI), the Simulated Annealing (SA) and the Genetic Algorithm (GA), as general purpose procedures for optimum structural design. A number of studies from different researchers have proved that both SA and GA are capable of solving a variety
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 199611