O desenvolvimento e aperfeiçoamento de métodos de otimização são pontos de profundo interesse em todas as áreas de pesquisa. Tais técnicas muitas vezes envolvem a aquisição de métodos de controle novos ou melhores, o que está diretamente ligado a duas tarefas importantes: a escolha de formas eficientes de monitoramento do processo e a obtenção de modelos confiáveis para a variável de interesse a partir de dados experimentais. Graças às suas diversas vantagens, os sensores óticos vêm sendo amplamente aplicados na primeira tarefa. Uma vez que é possível a utilização de vários tipos de espectroscopia através deste tipo de sensor, modelos capazes de lidar com dados espectrais estão se tornando cada vez mais atraentes. A segunda tarefa, por sua vez, depende não só de quais preditores são utilizados na construção do modelo, mas também de quantos. Como a qualidade do modelo depende também do número de variáveis selecionadas, é importante desenvolver métodos que identifiquem aqueles que explicam o máximo possível da variabilidade dos dados. O método de otimização Colônia de Formigas (ACO) aparece como uma ferramenta bastante útil na seleção de variáveis, podendo-se encontrar muitas variações desse algoritmo na literatura. O propósito deste trabalho é desenvolver métodos de seleção de variáveis com base no algoritmo ACO, conceitos estatísticos e testes de hipóteses. Para isso, diversos critérios de decisão foram implementados nas etapas do algoritmo referentes à atualização de trilha de feromônios (C1) e à seleção de modelos (C2). A fim de estudar estas modificações, foram realizados dois estudos de caso: o primeiro na área de bioprocessos e o segundo na área de caracterização de alimentos. Ambos os estudos mostraram que, em geral, os modelos com menores erros são obtidos utilizando-se métricas dos componentes do modelo, tal como o tamanho do intervalo de confiança de cada parâmetro e o teste-t de hipóteses. Além disso, a modificação do critério de seleção de modelos parece não interferir significativamente no resultado final do algoritmo. Por último, foi feito um estudo da aplicação dessas versões do ACO no campo de caracterização de combustíveis, mais especificamente diesel, associando-se duas análises espectroscópicas para predição do conteúdo de enxofre. Algumas das versões desenvolvidas mostraram-se superior ao algoritmo ACO utilizado como base para este trabalho, proposto por Ranzan (2014), e todas os versões forneceram melhores resultados na quantificação de enxofre que aqueles obtidos por PCR. Dessa forma, comprova-se a potencialidade de métricas implementadas no algoritmo ACO, associadas à espectroscopia, na seleção de preditores significativos. / The development and improvement of optimization methods are points of deep interest in all areas of research. These techniques are often related to the acquisition of new or better control methods, which are directly attached to two importante tasks: choosing efficient forms of process monitoring and obtaining reliable models for the monitored variable from experimental data. Due to their several advantagens, optical sensors are being widely applied in the first task. Since several types of spectroscopy are possible through this type of sensor, models capable of dealing with spectral data are becoming increasingly attractive. The second task depends not only on which predictors are used in the model, but also on how many. Since the quality of the model depends on the number of selected variables, it is important to develop methods that identify those that explain the greater amount of data variability as possible, without compromising the reliability of the model. The Ant Colony Optimization is an important tool for variable selection, being possible to find a lot of variations of this method in literature. The purpose of this work is to develop a method of variable selection based on the Ant Colony Optimization (ACO) algorithm, statistical concepts and hypothesis testing. For this purpose, several decision criteria for trail update (C1) and model selection (C2) were implemented within the routine. In order to study these modifications, two case study was conducted: one related to bioprocess monitoring and another one envolving the characterization of food products. Both studies showed that, in general, the models with the lowest errors were obtained through the use of model component metrics, such as the length of the confidence interval associated with each parameter and the t hypothesis test. Besides, the modification of the model selection criterion doesn’t seem to affect the algorithm final result. Finally, the aplicattion of these methods in the field of fuels characterization, specifically diesel fuel, was studied, associating two spectroscopical analyses in order to predict the sulfur content. Some of the new developed methods appeared to be better than the ACO algorithm used as basis in this work, proposed by Ranzan (2014), and all methods showed better results than those from the models constructed by PCR. Thus, it is proved the high potencial of using different metrics within ACO algorithm, associated with spectroscopy, in order to select significative predictors.

No description available.

O desenvolvimento e aperfeiçoamento de métodos de otimização são pontos de profundo interesse em todas as áreas de pesquisa. Tais técnicas muitas vezes envolvem a aquisição de métodos de controle novos ou melhores, o que está diretamente ligado a duas tarefas importantes: a escolha de formas eficientes de monitoramento do processo e a obtenção de modelos confiáveis para a variável de interesse a partir de dados experimentais. Graças às suas diversas vantagens, os sensores óticos vêm sendo amplamente aplicados na primeira tarefa. Uma vez que é possível a utilização de vários tipos de espectroscopia através deste tipo de sensor, modelos capazes de lidar com dados espectrais estão se tornando cada vez mais atraentes. A segunda tarefa, por sua vez, depende não só de quais preditores são utilizados na construção do modelo, mas também de quantos. Como a qualidade do modelo depende também do número de variáveis selecionadas, é importante desenvolver métodos que identifiquem aqueles que explicam o máximo possível da variabilidade dos dados. O método de otimização Colônia de Formigas (ACO) aparece como uma ferramenta bastante útil na seleção de variáveis, podendo-se encontrar muitas variações desse algoritmo na literatura. O propósito deste trabalho é desenvolver métodos de seleção de variáveis com base no algoritmo ACO, conceitos estatísticos e testes de hipóteses. Para isso, diversos critérios de decisão foram implementados nas etapas do algoritmo referentes à atualização de trilha de feromônios (C1) e à seleção de modelos (C2). A fim de estudar estas modificações, foram realizados dois estudos de caso: o primeiro na área de bioprocessos e o segundo na área de caracterização de alimentos. Ambos os estudos mostraram que, em geral, os modelos com menores erros são obtidos utilizando-se métricas dos componentes do modelo, tal como o tamanho do intervalo de confiança de cada parâmetro e o teste-t de hipóteses. Além disso, a modificação do critério de seleção de modelos parece não interferir significativamente no resultado final do algoritmo. Por último, foi feito um estudo da aplicação dessas versões do ACO no campo de caracterização de combustíveis, mais especificamente diesel, associando-se duas análises espectroscópicas para predição do conteúdo de enxofre. Algumas das versões desenvolvidas mostraram-se superior ao algoritmo ACO utilizado como base para este trabalho, proposto por Ranzan (2014), e todas os versões forneceram melhores resultados na quantificação de enxofre que aqueles obtidos por PCR. Dessa forma, comprova-se a potencialidade de métricas implementadas no algoritmo ACO, associadas à espectroscopia, na seleção de preditores significativos. / The development and improvement of optimization methods are points of deep interest in all areas of research. These techniques are often related to the acquisition of new or better control methods, which are directly attached to two importante tasks: choosing efficient forms of process monitoring and obtaining reliable models for the monitored variable from experimental data. Due to their several advantagens, optical sensors are being widely applied in the first task. Since several types of spectroscopy are possible through this type of sensor, models capable of dealing with spectral data are becoming increasingly attractive. The second task depends not only on which predictors are used in the model, but also on how many. Since the quality of the model depends on the number of selected variables, it is important to develop methods that identify those that explain the greater amount of data variability as possible, without compromising the reliability of the model. The Ant Colony Optimization is an important tool for variable selection, being possible to find a lot of variations of this method in literature. The purpose of this work is to develop a method of variable selection based on the Ant Colony Optimization (ACO) algorithm, statistical concepts and hypothesis testing. For this purpose, several decision criteria for trail update (C1) and model selection (C2) were implemented within the routine. In order to study these modifications, two case study was conducted: one related to bioprocess monitoring and another one envolving the characterization of food products. Both studies showed that, in general, the models with the lowest errors were obtained through the use of model component metrics, such as the length of the confidence interval associated with each parameter and the t hypothesis test. Besides, the modification of the model selection criterion doesn’t seem to affect the algorithm final result. Finally, the aplicattion of these methods in the field of fuels characterization, specifically diesel fuel, was studied, associating two spectroscopical analyses in order to predict the sulfur content. Some of the new developed methods appeared to be better than the ACO algorithm used as basis in this work, proposed by Ranzan (2014), and all methods showed better results than those from the models constructed by PCR. Thus, it is proved the high potencial of using different metrics within ACO algorithm, associated with spectroscopy, in order to select significative predictors.

O desenvolvimento e aperfeiçoamento de métodos de otimização são pontos de profundo interesse em todas as áreas de pesquisa. Tais técnicas muitas vezes envolvem a aquisição de métodos de controle novos ou melhores, o que está diretamente ligado a duas tarefas importantes: a escolha de formas eficientes de monitoramento do processo e a obtenção de modelos confiáveis para a variável de interesse a partir de dados experimentais. Graças às suas diversas vantagens, os sensores óticos vêm sendo amplamente aplicados na primeira tarefa. Uma vez que é possível a utilização de vários tipos de espectroscopia através deste tipo de sensor, modelos capazes de lidar com dados espectrais estão se tornando cada vez mais atraentes. A segunda tarefa, por sua vez, depende não só de quais preditores são utilizados na construção do modelo, mas também de quantos. Como a qualidade do modelo depende também do número de variáveis selecionadas, é importante desenvolver métodos que identifiquem aqueles que explicam o máximo possível da variabilidade dos dados. O método de otimização Colônia de Formigas (ACO) aparece como uma ferramenta bastante útil na seleção de variáveis, podendo-se encontrar muitas variações desse algoritmo na literatura. O propósito deste trabalho é desenvolver métodos de seleção de variáveis com base no algoritmo ACO, conceitos estatísticos e testes de hipóteses. Para isso, diversos critérios de decisão foram implementados nas etapas do algoritmo referentes à atualização de trilha de feromônios (C1) e à seleção de modelos (C2). A fim de estudar estas modificações, foram realizados dois estudos de caso: o primeiro na área de bioprocessos e o segundo na área de caracterização de alimentos. Ambos os estudos mostraram que, em geral, os modelos com menores erros são obtidos utilizando-se métricas dos componentes do modelo, tal como o tamanho do intervalo de confiança de cada parâmetro e o teste-t de hipóteses. Além disso, a modificação do critério de seleção de modelos parece não interferir significativamente no resultado final do algoritmo. Por último, foi feito um estudo da aplicação dessas versões do ACO no campo de caracterização de combustíveis, mais especificamente diesel, associando-se duas análises espectroscópicas para predição do conteúdo de enxofre. Algumas das versões desenvolvidas mostraram-se superior ao algoritmo ACO utilizado como base para este trabalho, proposto por Ranzan (2014), e todas os versões forneceram melhores resultados na quantificação de enxofre que aqueles obtidos por PCR. Dessa forma, comprova-se a potencialidade de métricas implementadas no algoritmo ACO, associadas à espectroscopia, na seleção de preditores significativos. / The development and improvement of optimization methods are points of deep interest in all areas of research. These techniques are often related to the acquisition of new or better control methods, which are directly attached to two importante tasks: choosing efficient forms of process monitoring and obtaining reliable models for the monitored variable from experimental data. Due to their several advantagens, optical sensors are being widely applied in the first task. Since several types of spectroscopy are possible through this type of sensor, models capable of dealing with spectral data are becoming increasingly attractive. The second task depends not only on which predictors are used in the model, but also on how many. Since the quality of the model depends on the number of selected variables, it is important to develop methods that identify those that explain the greater amount of data variability as possible, without compromising the reliability of the model. The Ant Colony Optimization is an important tool for variable selection, being possible to find a lot of variations of this method in literature. The purpose of this work is to develop a method of variable selection based on the Ant Colony Optimization (ACO) algorithm, statistical concepts and hypothesis testing. For this purpose, several decision criteria for trail update (C1) and model selection (C2) were implemented within the routine. In order to study these modifications, two case study was conducted: one related to bioprocess monitoring and another one envolving the characterization of food products. Both studies showed that, in general, the models with the lowest errors were obtained through the use of model component metrics, such as the length of the confidence interval associated with each parameter and the t hypothesis test. Besides, the modification of the model selection criterion doesn’t seem to affect the algorithm final result. Finally, the aplicattion of these methods in the field of fuels characterization, specifically diesel fuel, was studied, associating two spectroscopical analyses in order to predict the sulfur content. Some of the new developed methods appeared to be better than the ACO algorithm used as basis in this work, proposed by Ranzan (2014), and all methods showed better results than those from the models constructed by PCR. Thus, it is proved the high potencial of using different metrics within ACO algorithm, associated with spectroscopy, in order to select significative predictors.

The Ant Colony Optimization and Particle Swarm Optimization are two Swarm Intelligence algorithms often utilized for optimization. Swarm Intelligence relies on agents that possess fragmented knowledge, a concept not often utilized in games. The aim of this study is to research whether there are any benefits to using these Swarm Intelligence algorithms in comparison to standard algorithms such as A* for pathfinding in a game. Games often consist of dynamic environments with mobile agents, as such all experiments were conducted with dynamic destinations. Algorithms were measured on the length of their path and the time taken to calculate that path. The algorithms were implemented with minor modifications to allow them to better function in a grid based environment. The Ant Colony Optimization was modified in regards to how pheromone was distributed in the dynamic environment to better allow the algorithm to path towards a mobile target. Whereas the Particle Swarm Optimization was given set start positions and velocity in order to increase initial search space and modifications to increase particle diversity. The results obtained from the experimentation showcased that the Swarm Intelligence algorithms were capable of performing to great results in terms of calculation speed, they were however not able to obtain the same path optimality as A*. The algorithms' implementation can be improved but show potential to be useful in games.

Supply chain optimization is one of the key components for the effective management of a company with a complex manufacturing process and distribution network. Companies with a global presence in particular are motivated to optimize their distribution plans in order to keep their operating costs low and competitive. Changing condition in the global market and volatile energy prices increase the need for an automatic decision and optimization tool. In recent years, many techniques and applications have been proposed to address the problem of supply chain optimization. However, such techniques are often too problemspecific or too knowledge-intensive to be implemented as in-expensive, and easy-to-use computer system. The effort required to implement an optimization system for a new instance of the problem appears to be quite significant. The development process necessitates the involvement of expert personnel and the level of automation is low. The aim of this project is to develop a set of strategies capable of increasing the level of automation when developing a new optimization system. An increased level of automation is achieved by focusing on three areas: multi-objective optimization, optimization algorithm usability, and optimization model design. A literature review highlighted the great level of interest for the problem of multiobjective optimization in the research community. However, the review emphasized a lack of standardization in the area and insufficient understanding of the relationship between multi-objective strategies and problems. Experts in the area of optimization and artificial intelligence are interested in improving the usability of the most recent optimization algorithms. They stated the concern that the large number of variants and parameters, which characterizes such algorithms, affect their potential applicability in real-world environments. Such characteristics are seen as the root cause for the low success of the most recent optimization algorithms in industrial applications. Crucial task for the development of an optimization system is the design of the optimization model. Such task is one of the most complex in the development process, however, it is still performed mostly manually. The importance and the complexity of the task strongly suggest the development of tools to aid the design of optimization models. In order to address such challenges, first the problem of multi-objective optimization is considered and the most widely adopted techniques to solve it are identified. Such techniques are analyzed and described in details to increase the level of standardization in the area. Empirical evidences are highlighted to suggest what type of relationship exists between strategies and problem instances. Regarding the optimization algorithm, a classification method is proposed to improve its usability and computational requirement by automatically tuning one of its key parameters, the termination condition. The algorithm understands the problem complexity and automatically assigns the best termination condition to minimize runtime. The runtime of the optimization system has been reduced by more than 60%. Arguably, the usability of the algorithm has been improved as well, as one of the key configuration tasks can now be completed automatically. Finally, a system is presented to aid the definition of the optimization model through regression analysis. The purpose of the method is to gather as much knowledge about the problem as possible so that the task of the optimization model definition requires a lower user involvement. The application of the proposed algorithm is estimated that could have saved almost 1000 man-weeks to complete the project. The developed strategies have been applied to the problem of Caterpillar’s global supply chain optimization. This thesis describes also the process of developing an optimization system for Caterpillar and highlights the challenges and research opportunities identified while undertaking this work. This thesis describes the optimization model designed for Caterpillar’s supply chain and the implementation details of the Ant Colony System, the algorithm selected to optimize the supply chain. The system is now used to design the distribution plans of more than 7,000 products. The system improved Caterpillar’s marginal profit on such products by a factor of 4.6% on average.

Numerous organizations collect and distribute non-aggregate personal data for a variety of different purposes, including demographic and public health research. In these situations, the data distributor is responsible with the protection of the anonymity and personal information of individuals. Microaggregation is one of the most commonly used statistical disclosure control methods. In microaggregation, the set of original records is first partitioned into several groups. The records in the same group are similar to each other. The minimum number of records in each group is k. Each record is replaced by the mean value of the group (centroid). The confidentiality of records is protected by ensuring that each group has at least a minimum of k records and each record is indistinguishable from at least k-1 other records in the microaggregated dataset. The goal of this process is to keep the within-group homogeneity higher and the information loss lower, where information loss is the sum squared deviation between the actual records and the group centroids. Several heuristics have been proposed for the NP-hard minimum information loss microaggregation problem. Among the most promising methods is the multivariate Hansen-Mukherjee (MHM) algorithm that uses a shortest path algorithm to identify the best partition consistent with a specified ordering of records. Developing improved heuristics for ordering multivariate points for microaggregation remains an open research challenge. This dissertation adapts a version of the population-based ant colony optimization algorithm (PACO) to order records within which MHM algorithm is used iteratively to improve the quality of grouping. Results of computational experiments using benchmark test problems indicate that P-ACO/MHM based microaggregation algorithm yields comparable or improved information loss than those obtained by extant methods.

As estratégias de mapeamento utilizando múltiplos robôs móveis possuem uma série de vantagens quando comparadas àquelas estratégias baseadas em um único robô. As principais vantagens que podem ser elucidadas são: flexibilidade, ganho de informação e redução do tempo de construção do mapa do ambiente. No presente trabalho, um método de integração de mapas locais é proposto baseado em observações inter-robôs, considerando uma nova abordagem para a exploração do ambiente. Tal abordagem é conhecida como Sistema de Vigilância baseado na Modificação do Sistema Colônias de Formigas, ou IAS-SS. A estratégia IAS-SS é inspirada em mecanismos biológicos que definem a organização social de sistemas de enxames. Especificamente, esta estratégia é baseada em uma modificação do tradicional algoritmo de otimização por colônias de formiga. A principal contribuição do presente trabalho é a adaptação de um modelo de compartilhamento de informações utilizado em redes de sensores móveis, adaptando o mesmo para tarefas de mapeamento. Outra importante contribuição é a colaboração entre o método proposto de integração de mapas e a estratégia de coordenação de múltiplos robôs baseada na teoria de colônias de formigas. Tal colaboração permite o desenvolvimento de uma abordagem de exploração que emprega um mecanismo não físico para depósito e detecção de feromônios em ambientes reais por meio da elaboração do conceito de feromônios virtuais integrados. Resultados obtidos em simulação demonstram que o método de integração de mapas é eficiente, de modo que os ensaios experimentais foram realizados considerando-se um número variável de robôs móveis durante o processo de exploração de ambientes internos com diferentes formas e estruturas. Os resultados obtidos com os diversos experimentos realizados confirmam que o processo de integração é efetivo e adequado para executar o mapeamento do ambiente durante tarefas de exploração e vigilância do mesmo / The multiple robot map building strategies have several advantages when compared to strategies based on a single robot, in terms of flexibility, gain of information and reduction of map building time. In this work, a local map integration method is proposed based on the inter-robot observations, considering a recent approach for the environment exploration. This approach is based on the Inverse Ant System-Based Surveillance System strategy, called IASSS. The IAS-SS strategy is inspired on biological mechanisms that define the social organization of swarm systems. Specifically, it is based on a modified version of the known ant colony algorithm. The main contribution of this work is the fit of an information sharing model used in an mobile sensor network, adapting the method for mapping tasks. Another important contribution is the collaboration between the local map integration method and the multiple robot coordination strategy based on ant colony theory. Through this collaboration it is possible to develop an approach that uses a mechanism for controlling the access to pheromones in real environments. Such mechanism is based on the integrated virtual pheromones concept. Simulation results show that the map integration method is efficient, the trials are performed considering a variable number of robots and environments with different structures. Results obtained from several experiments confirm that the integration process is effective and suitable to execute mapping during the exploration task

Clustering is actively used in several research fields, such as pattern recognition, machine learning and data mining. This dissertation focuses on clustering algorithms in the data mining area. Clustering algorithms can be applied to solve the unsupervised learning problem, which deals with finding clusters in unlabeled data. Most clustering algorithms require the number of cluster centers be known in advance. However, this is often not suitable for real world applications, since we do not know this information in most cases. Another question becomes, once clusters are found by the algorithms, do we believe the clusters are exactly the right ones or do there exist better ones? In this dissertation, we present two new Swarm Intelligence based approaches for data clustering to solve the above issues. Swarm based approaches to clustering have been shown to be able to skip local extrema by doing a form of global search, our two newly proposed ant clustering algorithms take advantage of this. The first algorithm is a kernel-based fuzzy ant clustering algorithm using the Xie-Beni partition validity metric, it is a two stage algorithm, in the first stage of the algorithm ants move the cluster centers in feature space, the cluster centers found by the ants are evaluated using a reformulated kernel-based Xie-Beni cluster validity metric. We found when provided with more clusters than exist in the data our new ant-based approach produces a partition with empty clusters and/or very lightly populated clusters. Then the second stage of this algorithm was applied to automatically detect the number of clusters for a data set by using threshold solutions. The second ant clustering algorithm, using chemical recognition of nestmates is a combination of an ant based algorithm and a consensus clustering algorithm. It is a two-stage algorithm without initial knowledge of the number of clusters. The main contributions of this work are to use the ability of an ant based clustering algorithm to determine the number of cluster centers and refine the cluster centers, then apply a consensus clustering algorithm to get a better quality final solution. We also introduced an ensemble ant clustering algorithm which is able to find a consistent number of clusters with appropriate parameters. We proposed a modified online ant clustering algorithm to handle clustering large data sets. To our knowledge, we are the first to use consensus to combine multiple ant partitions to obtain robust clustering solutions. Experiments were done with twelve data sets, some of which were benchmark data sets, two artificially generated data sets and two magnetic resonance image brain volumes. The results show how the ant clustering algorithms play an important role in finding the number of clusters and providing useful information for consensus clustering to locate the optimal clustering solutions. We conducted a wide range of comparative experiments that demonstrate the effectiveness of the new approaches.

A mobile ad hoc network is a collection of wireless mobile devices which dynamically form a temporary network, without using any existing network infrastructure or centralised administration. Each node in the network effectively becomes a router, and forwards packets towards the packet’s destination node. Ad hoc networks are characterized by frequently changing network topology, multi-hop wireless connections and the need for dynamic, efficient routing protocols. <p.This work considers the routing problem in a network of uniquely addressable sensors. These networks are encountered in many industrial applications, where the aim is to relay information from a collection of data gathering devices deployed over an area to central points. The routing problem in such networks are characterised by: <ul> <li>The overarching requirement for low power consumption, as battery powered sensors may be required to operate for years without battery replacement;</li> <li>An emphasis on reliable communication as opposed to real-time communication, it is more important for packets to arrive reliably than to arrive quickly; and</li> <li>Very scarce processing and memory resources, as these sensors are often implemented on small low-power microprocessors.</li> </ul> This work provides overviews of routing protocols in ad hoc networks, swarm intelligence, and swarm intelligence applied to ad hoc routing. Various mechanisms that are commonly encountered in ad hoc routing are experimentally evaluated under situations as close to real-life as possible. Where possible, enhancements to the mechanisms are suggested and evaluated. Finally, a routing protocol suitable for such low-power sensor networks is defined and benchmarked in various scenarios against the Ad hoc On-Demand Distance Vector (AODV) algorithm. / Dissertation (MSc)--University of Pretoria, 2005. / Computer Science / Unrestricted