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.

This thesis deals with robot path planning by means of ant colony optimization algorithms. The theoretical part of this thesis introduces basics of path planning problematics. The theoretical part either deals with ant algorithms as optimization and path planning tools. The practical part deals with design and implementation of path planning by means of ant algorithms in Java language.

A common type of problems that exist in both industrial and scientific spaces are optimization problems. These problems can be found in among other things manufacturing, pathfinding, network routing and more. Because of the wide area of application, optimization is well a studied area. One solution to these types of problems is the Ant Colony Optimization algorithm that has been around since 1991 and has undergone a lot of developments over the years. This algorithm draws inspiration from real ant colonies and their procedure for foraging. However, a common criticism of this algorithm is its poor scalability. To tackle the scalability problem this thesis will combine the concept of binary space partitioning with the Ant Colony Optimization algorithm. The goal is to examine the algorithms convergence times and lengths of the paths produced. The results are measured in intervals by calculating the best possible path found at every interval. The findings showed that given an unlimited execution time the original Ant Colony Optimization algorithm produced shorter paths. But when a limit on execution time was introduced and the problem sizes grew the performance began to favor the partitioned versions. These findings could be useful in areas where complex optimization problems need to be solved within a limited timeframe. / <p>The presentation took place via an online conference call using the software "Zoom"</p>

Metaheuristics is a term for optimization procedures/algorithms that can be applied to a wide range of problems. These problems for which metaheuristics are used usually fall in the NP-hard category, meaning that they cannot be solved in polynomial time. This means that as the input dataset gets larger the time to solve increases exponentially. One such problem is the traveling salesman problem (TSP) which is and has been widely used as a benchmark problem to test optimization algorithms. This study focused on two such algorithms called ant colony optimization (ACO) and genetic algorithm (GA) respectively. Development of such optimization algorithms can have huge implications in several areas of business and industry. They can for example be used by delivery companies to optimize routing of delivery vehicles as well as in material science/industry where they can be used to calculate the most optimal mix of ingredients to produce materials with the desired characteristics. The approach taken in this study was to compare the performance of the two algorithms in three different programming languages (python, javascript and C#).  Previous studies comparing the two algorithms have reported conflicting results where some studies found that ACO yielded better results but was slower than GA, while others found that GA yielded better results than ACO. Results of this study suggested that both ACO and GA could find the benchmark solution, but  ACO did so much more consistently. Furthermore javascript was found to be the most efficient language with which to run the algorithms in the setup used in this study.

Tesis por compendio / [EN] The long-lasting trend in the field of computation of stress and resource distribution has found its way into computer networks via the concept of peer-to-peer (P2P) connectivity. P2P is a symmetrical model, where each network node is enabled a comparable range of capacities and resources. It stands in a stark contrast to the classical, strongly asymmetrical client-server approach. P2P, originally considered only a complimentary, server-side structure to the straightforward client-server model, has been shown to have the substantial potential on its own, with multiple, widely known benefits: good fault tolerance and recovery, satisfactory scalability and intrinsic load distribution. However, contrary to client-server, P2P networks require sophisticated solutions on all levels, ranging from network organization, to resource location and managing. In this thesis we address one of the key issues of P2P networks: performing efficient resource searches of semantic nature under realistic, dynamic conditions. There have been numerous solutions to this matter, with evolutionary, stigmergy-based, and simple computational foci, but few attempt to resolve the full range of challenges this problem entails. To name a few: real-life P2P networks are rarely static, nodes disconnect, reconnect and change their content. In addition, a trivial incorporation of semantic searches into well-known algorithms causes significant decrease in search efficiency. In our research we build a solution incrementally, starting with the classic Ant Colony System (ACS) within the Ant Colony Optimization metaheuristic (ACO). ACO is an algorithmic framework used for solving combinatorial optimization problems that fits contractually the problem very well, albeit not providing an immediate solution to any of the aforementioned problems. First, we propose an efficient ACS variant in structured (hypercube structured) P2P networks, by enabling a path-post processing algorithm, which called Tabu Route Optimization (TRO). Next, we proceed to resolve the issue of network dynamism with an ACO-compatible information diffusion approach. Consequently, we attempt to incorporate the semantic component of the searches. This initial approximation to the problem was achieved by allowing ACS to differentiate between search types with the pheromone-per-concept idea. We called the outcome of this merger Routing Concept ACS (RC-ACS). RC-ACS is a robust, static multipheromone implementation of ACS. However, we were able to conclude from it that the pheromone-per-concept approach offers only limited scalability and cannot be considered a global solution. Thus, further progress was made in this respect when we introduced to RC-ACS our novel idea: dynamic pheromone creation, which replaces the static one-to-one assignment. We called the resulting algorithm Angry Ant Framework (AAF). In AAF new pheromone levels are created as needed and during the search, rather than prior to it. The final step was to enable AAF, not only to create pheromone levels, but to reassign them to optimize the pheromone usage. The resulting algorithm is called EntropicAAF and it has been evaluated as one of the top-performing algorithms for P2P semantic searches under all conditions. / [ES] La popular tendencia de distribución de carga y recursos en el ámbito de la computación se ha transmitido a las redes computacionales a través del concepto de la conectividad peer-to-peer (P2P). P2P es un modelo simétrico, en el cual a cada nodo de la red se le otorga un rango comparable de capacidades y recursos. Se trata de un fuerte contraste con el clásico y fuertemente asimétrico enfoque cliente-servidor. P2P, originalmente considerado solo como una estructura del lado del servidor complementaria al sencillo modelo cliente-servidor, ha demostrado tener un potencial considerable por sí mismo, con múltiples beneficios ampliamente conocidos: buena tolerancia a fallos y recuperación, escalabilidad satisfactoria y distribución de carga intrínseca. Sin embargo, al contrario que el modelo cliente-servidor, las redes P2P requieren de soluciones sofisticadas a todos los niveles, desde la organización de la red hasta la gestión y localización de recursos. Esta tesis aborda uno de los problemas principales de las redes P2P: la búsqueda eficiente de recursos de naturaleza semántica bajo condiciones dinámicas y realistas. Ha habido numerosas soluciones a este problema basadas en enfoques evolucionarios, estigmérgicos y simples, pero pocas han tratado de resolver el abanico completo de desafíos. En primer lugar, las redes P2P reales son raramente estáticas: los nodos se desconectan, reconectan y cambian de contenido. Además, la incorporación trivial de búsquedas semánticas en algoritmos conocidos causa un decremento significativo de la eficiencia de la búsqueda. En esta investigación se ha construido una solución de manera incremental, comenzando por el clásico Ant Colony System (ACS) basado en la metaheurística de Ant Colony Optimization (ACO). ACO es un framework algorítmico usado para búsquedas en grafos que encaja perfectamente con las condiciones del problema, aunque no provee una solución inmediata a las cuestiones mencionadas anteriormente. En primer lugar, se propone una variante eficiente de ACS para redes P2P estructuradas (con estructura de hipercubo) permitiendo el postprocesamiento de las rutas, al que hemos denominado Tabu Route Optimization (TRO). A continuación, se ha tratado de resolver el problema del dinamismo de la red mediante la difusión de la información a través de una estrategia compatible con ACO. En consecuencia, se ha tratado de incorporar el componente semántico de las búsquedas. Esta aproximación inicial al problema ha sido lograda permitiendo al ACS diferenciar entre tipos de búsquedas através de la idea de pheromone-per-concept. El resultado de esta fusión se ha denominado Routing Concept ACS (RC-ACS). RC-ACS es una implementación multiferomona estática y robusta de ACS. Sin embargo, a partir de esta implementación se ha podido concluir que el enfoque pheromone-per-concept ofrece solo escalabilidad limitada y que no puede ser considerado una solución global. Por lo tanto, para lograr una mejora a este respecto, se ha introducido al RC-ACS una novedosa idea: la creación dinámica de feromonas, que reemplaza la asignación estática uno a uno. En el algoritmo resultante, al que hemos denominado Angry Ant Framework (AAF), los nuevos niveles de feromona se crean conforme se necesitan y durante la búsqueda, en lugar de crearse antes de la misma. La mejora final se ha obtenido al permitir al AAF no solo crear niveles de feromona, sino también reasignarlos para optimizar el uso de la misma. El algoritmo resultante se denomina EntropicAAF y ha sido evaluado como uno de los algoritmos más exitosos para las búsquedas semánticas P2P bajo todas las condiciones. / [CA] La popular tendència de distribuir càrrega i recursos en el camp de la computació s'ha estès cap a les xarxes d'ordinadors a través del concepte de connexions d'igual a igual (de l'anglès, peer to peer o P2P). P2P és un model simètric on cada node de la xarxa disposa del mateix nombre de capacitats i recursos. P2P, considerat originàriament només una estructura situada al servidor complementària al model client-servidor simple, ha provat tindre el suficient potencial per ella mateixa, amb múltiples beneficis ben coneguts: una bona tolerància a errades i recuperació, una satisfactòria escalabilitat i una intrínseca distribució de càrrega. No obstant, contràriament al client-servidor, les xarxes P2P requereixen solucions sofisticades a tots els nivells, que varien des de l'organització de la xarxa a la localització de recursos i la seua gestió. En aquesta tesi s'adreça un dels problemes clau de les xarxes P2P: ser capaç de realitzar eficientment cerques de recursos de naturalesa semàntica sota condicions realistes i dinàmiques. Existeixen nombroses solucions a aquest tema basades en la computació simple, evolutiva i també basades en l'estimèrgia (de l'anglès, stigmergy), però pocs esforços s'han realitzat per intentar resoldre l'ampli conjunt de reptes existent. En primer lloc, les xarxes P2P reals són rarament estàtiques: els nodes es connecten, desconnecten i canvien els seus continguts. A més a més, la incorporació trivial de cerques semàntiques als algorismes existents causa una disminució significant de l'eficiència de la cerca. En aquesta recerca s'ha construït una solució incremental, començant pel sistema clàssic de colònia de formigues (de l'anglés, Ant Colony System o ACS) dins de la metaheurística d'optimització de colònies de formigues (de l'anglès, Ant Colony Optimization o ACO). ACO és un entorn algorísmic utilitzat per cercar en grafs i que aborda el problema de forma satisfactòria, tot i que no proveeix d'una solució immediata a cap dels problemes anteriorment mencionats. Primer, s'ha proposat una variant eficient d'ACS en xarxes P2P estructurades (en forma d'hipercub) a través d'un algorisme de processament post-camí el qual s'ha anomenat en anglès Tabu Route Optimization (TRO). A continuació, s'ha procedit a resoldre el problema del dinamisme de les xarxes amb un enfocament de difusió d'informació compatible amb ACO. Com a conseqüència, s'ha intentat incorporar la component semàntica de les cerques. Aquest enfocament inicial al problema s'ha realitzat permetent a ACS diferenciar entre tipus de cerques amb la idea de ''feromona per concepte'', i s'ha anomenat a aquest producte Routing Concept ACS o RC-ACS. RC-ACS és una implementació multi-feromona robusta i estàtica d'ACS. No obstant, s'ha pogut concloure que l'enfocament de feromona per concepte ofereix només una escalabilitat limitada i no pot ser considerada una solució global. En aquest respecte s'ha realitzat progrés posteriorment introduint una nova idea a RC-ACS: la creació dinàmica de feromones, la qual reemplaça a l'assignació un a un de les mateixes. A l'algorisme resultant se l'ha anomenat en anglès Angry Ant Framework (AAF). En AAF es creen nous nivells de feromones a mesura que es necessiten durant la cerca, i no abans d'aquesta. El progrés final s'ha aconseguit quan s'ha permès a AAF, no sols crear nivells de feromones, sinó reassignar-los per optimitzar la utilització de feromones. L'algorisme resultant s'ha anomenat EntropicAAF i ha sigut avaluat com un dels algorismes per a cerques semàntiques P2P amb millors prestacions. / Krynicki, KK. (2016). Ant Colony Algorithms for the Resolution of Semantic Searches in P2P Networks [Tesis doctoral]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/61293 / TESIS / Premios Extraordinarios de tesis doctorales / Compendio

Indiana University-Purdue University Indianapolis (IUPUI) / This thesis discusses about developing a routing protocol of mobile ad hoc networks in a bio inspired manner. Algorithms inspired by collective behaviour of social insect colonies, bird flocking, honey bee dancing, etc., promises to be capable of catering to the challenges faced by tiny wireless sensor networks. Challenges include but are not limited to low bandwidth, low memory, limited battery life, etc. This thesis proposes an energy efficient multi-path routing algorithm based on foraging nature of ant colonies and considers many other meta-heuristic factors to provide good robust paths from source node to destination node in a hope to overcome the challenges posed by resource constrained sensors. / 2020-12-31