Submitted by Luciana Ferreira (lucgeral@gmail.com) on 2014-11-20T11:31:40Z No. of bitstreams: 2 Dissertação - Danilo Alves Martins de Faria - 2013.pdf: 1188393 bytes, checksum: c56b169690f22bbbeaa2ee6fa46ade1c (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) / Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2014-11-20T14:17:45Z (GMT) No. of bitstreams: 2 Dissertação - Danilo Alves Martins de Faria - 2013.pdf: 1188393 bytes, checksum: c56b169690f22bbbeaa2ee6fa46ade1c (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) / Made available in DSpace on 2014-11-20T14:17:45Z (GMT). No. of bitstreams: 2 Dissertação - Danilo Alves Martins de Faria - 2013.pdf: 1188393 bytes, checksum: c56b169690f22bbbeaa2ee6fa46ade1c (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) Previous issue date: 2013-10-23 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES / Network Design Problems (NDPs) are present in many areas, such as electric power distribution, communication networks, vehicle routing, phylogenetic trees among others. Many NDPs are classified as NP-Hard problems. Among the techniques used to solve them, we highlight the Evolutionary Algorithms (EA). These algorithms simulate the natural evolution of the species. However, in its standard form EAs have limitations to solve large scale NDPs, or with very specific characteristics. To solve these problems, many researchers have studied specific forms of representation of NDPs. Among these stands we show Node-Depth-Degre Encoding (NDDE). This representation produces only feasible solutions, regardless of the network characteristics. NDDE has two mutation operators Preserve Ancestor Operator (PAO) and Ancestor Change Operator (CAO) and the recombination operator EHR (Evolutionary History Recombination Operator) that uses historical applications of mutation, and was applied to NDPs more than one tree and had good results. Thus, this work proposes adapt EHR for NDPs classics represented by a single tree. In addition, two evolutionary algorithms are developed: the AE-RNPG, which uses only NDDE, with mutation operators. And the AE-EHR, which makes use of mutation operators and recombination operator EHR to the One Max Tree Problem. The results showed that the AE-EHR obtained better solutions than the EA-RNPG for most instances analyzed. / Problemas de Projeto de Redes (PPRs) estão presentes em diversas áreas, tais como reconfiguração de sistemas de distribuição de energia elétrica, projetos de redes de comunicação, roteamento de veículos, reconstrução de árvores filogenéticas entre outros. Vários PPRs pertencem à classe de problemas NP-Difíceis. Dentre as técnicas utilizadas para resolvê-los, destacam-se os Algoritmos Evolutivos (AE), cujo processo de resolução de um problema simula a evolução natural das espécies. Entretanto, os AEs em sua forma padrão também possuem limitações quanto a PPRs de larga escala, ou com características muito específicas. Para solucionar esses problemas, diversas pesquisas têm estudado formas específicas de estruturas de dados dos PPRs. Dentre essas destaca-se a representação Nó-Profundidade-Grau (RNPG). Essa representação produz apenas soluções factíveis, independente da característica da rede. A RNPG possui dois operadores de mutação Preserve Ancestor Operator (PAO) e Change Ancestor Operator (CAO) e o operador de recombinação EHR (Evolutionary History Recombination Operator), que utiliza o histórico de aplicações dos operadores de mutação, o qual tem sido aplicado a PPRs com mais de uma árvore com bons resultados. Este trabalho propõem a adequação do EHR para PPRs clássicos de uma única árvore. Além disso, são desenvolvidos dois algoritmos evolutivos: o AE-RNPG, que utiliza a RNPG somente com os operadores de mutação; e o AE-EHR, que faz uso tanto dos operadores de mutação quanto do operador de recombinação EHR para o problema da Árvore máxima. Os resultados obtidos mostram que o AE-EHR obtém melhores soluções do que o AE-RNPG para a maioria das instâncias analisadas.

Submitted by Marlene Santos (marlene.bc.ufg@gmail.com) on 2014-12-16T20:28:04Z No. of bitstreams: 2 Dissertação - Carlos Antônio Campos Jorge - 2014.pdf: 703425 bytes, checksum: 664e77c2f8e857788e0128256d76d4b7 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) / Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2014-12-22T10:40:49Z (GMT) No. of bitstreams: 2 Dissertação - Carlos Antônio Campos Jorge - 2014.pdf: 703425 bytes, checksum: 664e77c2f8e857788e0128256d76d4b7 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) / Made available in DSpace on 2014-12-22T10:40:49Z (GMT). No. of bitstreams: 2 Dissertação - Carlos Antônio Campos Jorge - 2014.pdf: 703425 bytes, checksum: 664e77c2f8e857788e0128256d76d4b7 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) Previous issue date: 2014-04-08 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES / This work proposes the use of a multi-objective evolutionary algorithm that makes use of subsets stored in a data structure called table in which the best individuals from each objective considered are preserved. This approach is compared in this work with the traditional mono-objective evolutionary algorithm (GA), classical algorithms (PLS and SPA) and another classic multi-objective algorithm (NSGA-II). As a case study, a multivariate calibration problem is presented which involves the prediction of protein concentration in samples of whole wheat from the spectrophotometric measurements. The results showed that the proposed formulation has a smaller prediction error when compared to the mono-objective formulation and with a lower number of variables. Finally,astudyofnoisesensitivityobtainedbythemulti-objectiveformulationshoweda better resultwhen compared tothe other classical algorithmforvariable selection. / Este trabalho propõe o uso de algoritmo multi-objetivo evolutivo que faz uso de subconjuntos armazenados em uma estrutura de dados chamada tabela em que os melhores indivíduos de cada objetivo são preservadas. Esta abordagem é comparada neste trabalho com o algoritmo evolutivo tradicional mono-objetivo e outros algoritmos clássicos (MONO-GA-MLR, PLS, APS-MLR) e com o algoritmo multi-objetivo clássico NSGAII-MLR.Comoestudodecaso,oproblemadecalibraçãomultivariadaenvolveaprevisão daconcentraçãodeproteínasemamostrasdetrigoapartirdasmediçõesespectrofotométricas. Os resultados mostraram que a formulação proposta seleciona um número menor de variáveis e apresenta um erro de predição menor quando comparada com o algoritmo evolutivo mono-objetivo. Quando comparado com os algoritmos clássicos PLS e APSMLR e com o algoritmo multi-objetivo clássico NSGA-II-MLR, o algoritmo proposto apresenta um erro de predição menor, porém com um número maior de variáveis selecionadas. Finalmente, um estudo de sensibilidade à ruído foi realizado. A solução obtida pela formulação proposta apresentou melhores resultados quando comparado com o algoritmo mono-objetivo e NSGA-II-MLR e desempenho similar à solução obtida com o SPA-MLR.

Made available in DSpace on 2016-03-15T19:37:52Z (GMT). No. of bitstreams: 1 Danilo Souza da Cunha.pdf: 1082171 bytes, checksum: 4d2c64017c5641baf212b0fe377da373 (MD5) Previous issue date: 2013-10-23 / Fundo Mackenzie de Pesquisa / E-commerce has been growing rapidly over the past years. Various products, services, and information are constantly offered to millions of internet users. Defining an adequate strategy to offer a product to a customer is the main goal of a recommender system. To do so, the items to be offered have to take into account the interests of each customer. This association of items is a data mining task, more specifically a task called association rule mining. This dissertation investigated the use of bioinspired algorithms, particularly evolutionary and im-mune algorithms, to build associations among items of a database. Three sets of experiments were performed: an investigation into the influence of different selection and crossover mech-anisms in an evolutionary algorithm for association rule mining; the use of a probabilistic selection in the immune algorithm; and a comparison of the bioinspired algorithms with the standard deterministic algorithm called Apriori. The data bases for comparison were taken from real e-commerce applications. The results allowed the identification of a suitable combi-nation of the selection and crossover mechanisms for the evolutionary algorithm, and to iden-tify the strengths and weaknesses of all approaches when applied to real-world recommender systems. / O comércio eletrônico vem crescendo rapidamente ao longo dos últimos anos. Produtos, serviços e informações dos mais variados tipos são oferecidos todos os dias para milhares de usuários na Internet. Definir uma estratégia adequada para oferecer um produto a clientes é o objetivo dos sistemas de recomendação. Para isso leva em conta itens que podem ser ofertados considerando o interesse de cada cliente. Essa associação entre itens é uma tarefa que recai sobre a competência da mineração de dados, mais especificamente a área chamada de mineração de regras de associação. Esta dissertação investigou o uso de algoritmos bioinspirados, mais especificamente algoritmos evolutivos e imunológicos, a fim de construir associações entre os itens de uma base de dados. Foram feitos três estudos: a influência de diferentes mecanismos de seleseleção e cruzamento no algoritmo evolutivo; o uso de seleção probabilística no algoritmo imunológico; e a comparação dos algoritmos bioinspirados com o algoritmo determinístico clássico aplicado a essa tarefa, chamado de Apriori. As bases de dados para efeitos comparativos foram coletadas em lojas nacionais de comércio eletrônico. Os resulta-dos apresentados permitiram identificar uma combinação adequada dos mecanismos de sele-ção e cruzamento do algoritmo evolutivo, assim como identificar os pontos fortes e fracos dos algoritmos bioinspirados quando comparados ao algoritmo tradicional.

Orientadores: Romis Ribeiro de Faissol Attux, Leonardo Tomazeli Duarte / Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de Computação / Made available in DSpace on 2018-08-23T17:30:21Z (GMT). No. of bitstreams: 1 Ando_RafaelAssato_M.pdf: 1700685 bytes, checksum: 9befef5632e55e27a24af3e73c648c47 (MD5) Previous issue date: 2013 / Resumo: Neste trabalho, estudamos o problema de BSS no contexto de misturas polinomiais sob três perspectivas: uma teórica - voltada ao estudo de separabilidade estrutural -, uma ligada à proposta de novas abordagens - especialmente como extensões de metodologias baseadas em redes recorrentes - e uma relacionada ao tratamento de problemas práticos como redução do efeito show-through na digitalização de documentos. A primeira dessas perspectivas levou à proposta de uma nova abordagem do problema de separação não-linear baseada numa formulação do problema instantâneo de inversão como uma tarefa de solução de um sistema de equações algébricas não-lineares. Essa abordagem levou à proposição de novos métodos para lidar com o problema LQ e também pode ser aplicada a outros modelos de mistura. A segunda perspectiva levou à construção de um arcabouço para tratamento do problema LQ baseado numa rede imunológica artificial, o qual trouxe uma menor demanda por informação a priori sobre o problema e provê maior robustez em termos de convergência global. Por fim, a aplicação do ferramental desenvolvido a problemas práticos de tratamento de imagens levou a um desempenho bastante satisfatório, encorajando a extensão futura para outros cenários de teste (como sensores químicos) / Abstract: In this work, the BSS problem in the context of polynomial mixtures will be studied under three perspectives: a theoretical one, regarding the structural separability analysis; another related to the proposal of new methodologies - especially as extensions of algorithms based on recurrent networks - and finally, one regarding the solutions to real world problems, such as the reduction of the show-through effect produced by digitally scanning documents. The first such perspectives led to the proposal of a new approach to the nonlinear BSS problem, based on a formulation to the instantaneous inversion problem as the solution of a non-linear algebraic equation system. This approach led to the proposal of new methods to deal with the LQ problem, which may also be applied to other mixing models. The second perspective led to the development of an algorithm based on artificial immune system (AIS) to solve the LQ model, requiring less a priori information about the problem and providing better robustness in terms of global convergence. Finally, the application of the pro-posed methods to the practical problem of image treatment presented a very satisfactory performance, encouraging the possible extension to other test scenarios in the future, such as chemical sensors / Mestrado / Engenharia de Computação / Mestre em Engenharia Elétrica

Afin de réduire les bruits rayonnés en sortie de guide d’onde, des traitements acoustiques localement réactifs, comme les structures « Plaque perforée/Nid d’abeilles », peuvent être appliqués en liner. La conception de ces liners devient alors un challenge important avec l’apparition de nouvelles normes sur le bruit et impose de posséder une très bonne connaissance du comportement de ces traitements, en particulier leur impédance de surface. Néanmoins, la caractérisation de cette impédance n’est pas une chose facile et est généralement réalisée via des modèles semi-empiriques comme ceux de Guess, Elnady, Allam ou expérimentalement par des méthodes de mesures directes ou inverses. Ces approches inverses permettent, par la confrontation d’une modélisation du problème avec des observations expérimentales, de retourner, au travers d’une fonction coût, l’impédance du traitement. Ces méthodes ont l’avantage de réaliser une observation dans les conditions réelles d’utilisation du traitement. En effet, de nombreux paramètres influencent l’impédance de surface comme la présence d’un écoulement, l’incidence de l’onde… Dans cette thèse, une méthode d’identification de l’impédance est proposée. A partir de l’impédance de surface d’un traitement « Plaque perforée/Nid d’abeille » prédite par un modèle empirique via ses paramètres géométriques (épaisseur de la plaque, diamètre des perforations…), une méthode basée sur l’approche Bayésienne est implémentée afin de remonter à l’impédance réelle du traitement. Le problème étudié consiste en la propagation d’une onde dans un tronçon rectangulaire traité sur sa face supérieure et la mesure des pressions acoustiques est réalisée sur le banc d’essai de l’Université Technologique de Compiègne avec un écoulement rasant. Un modèle de propagation d’ondes dans le conduit est développé via la technique du raccordement modal, afin de prédire la pression aux positions des microphones pour n’importe quelle valeur d’impédance. A partir de la mesure et de la simulation, la règle de Bayes peut être appliquée afin de construire la densité de probabilité a posteriori. Cette densité de probabilité est alors échantillonnée au travers d’un algorithme Évolutionnaire de Monte Carlo par Chaîne de Markov (EMCMC). L’intérêt principale de cette méthode, est d’obtenir de nombreuses d’informations statistiques sur les paramètres caractérisant l’impédance de surface comme leur distribution et leur corrélation. / Locally reactive acoustic liners such as honeycomb structures with perforated panels can be modeled with a surface impedance in standard numerical models. However, the characterization of this impedance is not always straightforward. Empirical models or standing wave tube measurements are generally used to get the behavior of these acoustic treatments. Unfortunately, these methods provide only an evaluation of the impedance under specific conditions. Moreover, the conditions of use can change significantly the acoustic liners behavior as grazing flow conditions or oblique incident waves. A characterization of locally reactive acoustic liners is presented here. Starting from a set of parameters and represents a surface impedance using empirical model, an inverse method based on Bayesian approach is used to return the surface impedance taking in consideration the real conditions of use. A rectangular duct treated by a liner on its upper face is considered and these conditions are similar to the experiment present at the Université de Technologie de Compiègne. This inverse method requires a direct model to predict the pressure at some microphone positions with any surface impedance. The model used in the following is based on the Mode-Matching method. From the direct analytical model, the Bayes'rule is then used to get the posterior probability density function of the estimated impedance. An Evolutionary Monte Carlo by Markov chain (EMCMC) method is used to sample this posterior probability density. This method provides not only the best set of parameters but also some statistical information for each parameter.

De nos jours, l’intérêt porté à la préservation de l’environnement à travers la réduction des émissions de gaz à effet de serre prend de plus en plus d’ampleur. Depuis 2006,la politique multimodale a évolué vers une politique co-modale qui n’oppose plus la voiture au transport public mais encourage une combinaison de tous les modes de transport sans favorisation dans le but d’une optimisation du service. Placés dans ce cadre, le but de cette thèse est de mettre en œuvre un système de gestion de véhicules partagés qui recouvre tous les services de transports existants tel que le transport public, le covoiturage, les véhicules en libre service et qui capable de satisfaire les demandes des utilisateurs en leur fournissant des itinéraires co-modaux optimisés en terme de temps, coût et émission des gaz à effet de serre tout en respectant leurs préférences et priorités. En recevant plusieurs requêtes simultanées en un court laps de temps, le système doit être capable à la fois de décomposer les solutions en tronçons que nous appelons Routes, en respectant toutes les similarités entre les différentes demandes et de regrouper les informations de manière cohérente pour déterminer les combinaisons de Routes possibles. Vu l’aspect dynamique et distribué du problème, une stratégie de résolution efficace mettant à profit une mixture de concepts ; à savoir les systèmes multi-agents et l’optimisation a été mise en place. Les résultats expérimentaux présentés dans cette thèse justifient l’importance de la co-modalité et la nécessité de mettre à profit la complémentarité entre les véhicules partagés et les autres moyens de transport à travers un système intelligent et global / Nowadays, the protection of the environment through the reduction of greenhouse gases is becoming more and more important. In order to resolve environmental problems, a multimodal policy is firstly adopted in order to encourage the use of public transport. Since 2006, a new notion: the co-modality is introduced and it consists on developing infrastructures and taking measures and actions that will ensure optimum combination of individual and public transport modes. In this context, the purpose of this thesis is to implement co-modal transport system that covers all the existing transport services such as the public transport, the carpooling or the free use vehicles (bikes, cars). In order to satisfy the user’s requests, the system offers optimized co-modal itineraries in terms of three criteria: total time, total cost and greenhouse gases emission taking into account their preferences and constraints. In a short time interval, many transport users can formulate simultaneously a set of requests. So the system should find feasible decompositions in terms of independent sub-itineraries called Routes recognizing similarities and recognize the different possibilities of Routes Combinations to compose each itinerary demand. Considering the dynamic and distributed aspect of the problem, an effective strategy combining different concepts like multi-agent system and optimization methods is applied. The experimental results presented in this thesis justify the importance of co-modality and the necessity of taking advantage of the complementarity between the shared vehicles and other means of transportation through an intelligent and global system

In this work, we propose a novel method for a supervised dimensionality reduc- tion, which learns weights of a neural network using an evolutionary algorithm, CMA-ES, optimising the success rate of the k-NN classifier. If no activation func- tions are used in the neural network, the algorithm essentially performs a linear transformation, which can also be used inside of the Mahalanobis distance. There- fore our method can be considered to be a metric learning algorithm. By adding activations to the neural network, the algorithm can learn non-linear transfor- mations as well. We consider reductions to low-dimensional spaces, which are useful for data visualisation, and demonstrate that the resulting projections pro- vide better performance than other dimensionality reduction techniques and also that the visualisations provide better distinctions between the classes in the data thanks to the locality of the k-NN classifier. 1

Local search algorithms have been proved to be effective in refining solutions that have been found by other algorithms. Evolutionary algorithms, in particular global search algorithms, have shown to be successful in producing approximate solutions for optimisation and classification problems in acceptable computation times. A relatively new method, memetic algorithms, uses local search to refine the approximate solutions produced by global search algorithms. This thesis develops such a memetic algorithm. The global search algorithm used as part of the new memetic algorithm is a genetic program that implements the building block hypothesis by building simplistic decision trees representing valid solutions, and gradually increases the complexity of the trees. The specific building block hypothesis implementation is known as the building block approach to genetic programming, BGP. The effectiveness and efficiency of the new memetic algorithm, which combines the BGP algorithm with a local search algorithm, is demonstrated. / Dissertation (MSc)--University of Pretoria, 2006. / Computer Science / unrestricted

Dans cette thèse, nous nous sommes intéressés à la résolution approchée de problèmes de tournées de véhicules. Nous avons exploité des travaux menés sur les graphes d'intervalles et des propriétés de dominance relatives aux tournées saturées pour traiter les problèmes de tournées sélectives plus efficacement. Des approches basées sur un algorithme d'optimisation par essaim particulaire et un algorithme mémétique ont été proposées. Les métaheuristiques développées font appel à un ensemble de techniques particulièrement efficaces telles que le découpage optimal, les opérateurs de croisement génétiques ainsi que des méthodes de recherches locales. Nous nous sommes intéressés également aux problèmes de tournées classiques avec fenêtres de temps. Différents prétraitements ont été introduits pour obtenir des bornes inférieures sur le nombre de véhicules. Ces prétraitements s'inspirent de méthodes issues de modèles de graphes, de problème d'ordonnancement et de problèmes de bin packing avec conflits. Nous avons montré également l'utilité des méthodes développées dans un contexte industriel à travers la réalisation d'un portail de services mobilité. / In this thesis, we focused on the development of heuristic approaches for solvingvehicle routing problems. We exploited researches conducted on interval graphsand dominance properties of saturated tours to deal more efficiently with selectivevehicle routing problems. An adaptation of a particle swarm optimization algorithmand a memetic algorithm is proposed. The metaheuristics that we developed arebased on effective techniques such as optimal split, genetic crossover operatorsand local searches. We are also interested in classical vehicle problems with timewindows. Various pre-processing methods are introduced to obtain lower boundson the number of vehicles. These methods are based on many approaches usinggraph models, scheduling problems and bin packing problems with conflicts. Wealso showed the effectiveness of the developed methods with an industrial applicationby implementing a portal of mobility services.

Orientador: Celso Pascoli Bottura / Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação / Made available in DSpace on 2018-08-22T08:49:57Z (GMT). No. of bitstreams: 1 Giesbrecht_Mateus_D.pdf: 4188992 bytes, checksum: a2d91ff20132430d1389b8cd758b80bc (MD5) Previous issue date: 2012 / Resumo: Nesta tese é descrito como alguns problemas relacionados à identificação de sistemas discretos multivariáveis, à realização de séries temporais discretas multivariáveis e à modelagem de séries temporais discretas multivariáveis, podem ser formulados como problemas de otimização. Além da formulação dos problemas de otimização, nesta tese também são apresentadas algumas propostas imuno-inspiradas para a solução de cada um dos problemas, assim como os resultados e conclusões da aplicação dos métodos propostos. Os métodos aqui propostos apresentam resultados e performance melhores que aqueles obtidos por métodos conhecidos para solução dos problemas estudados, e podem ser aplicados em problemas cujas condições não sejam favoráveis para aplicação dos métodos conhecidos na literatura / Abstract: In this thesis it is described how some problems related to multivariable system identification, multivariable time series realization and multivariable time series modeling, can be formulated as optimization problems. Additionally, in this thesis some immune-inspired methods to solve each problem are also shown, and also the results and conclusions resultant from the application of the proposed methods. The performance and the results obtained with the methods here proposed are better than the results produced by known methods to solve the studied problems and can be applied even if the problem conditions are not suitable to the methods presented in the literature / Doutorado / Automação / Doutor em Engenharia Elétrica