Bio-inspired optimization in integrated river basin management

Water resources worldwide are facing severe challenges in terms of quality and quantity. It is essential to conserve, manage, and optimize water resources and their quality through integrated water resources management (IWRM). IWRM is an interdisciplinary field that works on multiple levels to maximize the socio-economic and ecological benefits of water resources. Since this is directly influenced by the river’s ecological health, the point of interest should start at the basin-level. The main objective of this study is to evaluate the application of bio-inspired optimization techniques in integrated river basin management (IRBM). This study demonstrates the application of versatile, flexible and yet simple metaheuristic bio-inspired algorithms in IRBM. In a novel approach, bio-inspired optimization algorithms Ant Colony Optimization (ACO) and Particle Swarm Optimization (PSO) are used to spatially distribute mitigation measures within a basin to reduce long-term annual mean total nitrogen (TN) concentration at the outlet of the basin. The Upper Fuhse river basin developed in the hydrological model, Hydrological Predictions for the Environment (HYPE), is used as a case study. ACO and PSO are coupled with the HYPE model to distribute a set of measures and compute the resulting TN reduction. The algorithms spatially distribute nine crop and subbasin-level mitigation measures under four categories. Both algorithms can successfully yield a discrete combination of measures to reduce long-term annual mean TN concentration. They achieved an 18.65% reduction, and their performance was on par with each other. This study has established the applicability of these bio-inspired optimization algorithms in successfully distributing the TN mitigation measures within the river basin. Stakeholder involvement is a crucial aspect of IRBM. It ensures that researchers and policymakers are aware of the ground reality through large amounts of information collected from the stakeholder. Including stakeholders in policy planning and decision-making legitimizes the decisions and eases their implementation. Therefore, a socio-hydrological framework is developed and tested in the Larqui river basin, Chile, based on a field survey to explore the conditions under which the farmers would implement or extend the width of vegetative filter strips (VFS) to prevent soil erosion. The framework consists of a behavioral, social model (extended Theory of Planned Behavior, TPB) and an agent-based model (developed in NetLogo) coupled with the results from the vegetative filter model (Vegetative Filter Strip Modeling System, VFSMOD-W). The results showed that the ABM corroborates with the survey results and the farmers are willing to extend the width of VFS as long as their utility stays positive. This framework can be used to develop tailor-made policies for river basins based on the conditions of the river basins and the stakeholders' requirements to motivate them to adopt sustainable practices. It is vital to assess whether the proposed management plans achieve the expected results for the river basin and if the stakeholders will accept and implement them. The assessment via simulation tools ensures effective implementation and realization of the target stipulated by the decision-makers. In this regard, this dissertation introduces the application of bio-inspired optimization techniques in the field of IRBM. The successful discrete combinatorial optimization in terms of the spatial distribution of mitigation measures by ACO and PSO and the novel socio-hydrological framework using ABM prove the forte and diverse applicability of bio-inspired optimization algorithms

An Intelligent Mobility Prediction Scheme for Location-Based Service over Cellular Communications Network

One of the trickiest challenges introduced by cellular communications networks is mobility prediction for Location Based-Services (LBSs). Hence, an accurate and efficient mobility prediction technique is particularly needed for these networks. The mobility prediction technique incurs overheads on the transmission process. These overheads affect properties of the cellular communications network such as delay, denial of services, manual filtering and bandwidth. The main goal of this research is to enhance a mobility prediction scheme in cellular communications networks through three phases. Firstly, current mobility prediction techniques will be investigated. Secondly, innovation and examination of new mobility prediction techniques will be based on three hypothesises that are suitable for cellular communications network and mobile user (MU) resources with low computation cost and high prediction success rate without using MU resources in the prediction process. Thirdly, a new mobility prediction scheme will be generated that is based on different levels of mobility prediction. In this thesis, a new mobility prediction scheme for LBSs is proposed. It could be considered as a combination of the cell and routing area (RA) prediction levels. For cell level prediction, most of the current location prediction research is focused on generalized location models, where the geographic extent is divided into regular-shape cells. These models are not suitable for certain LBSs where the objectives are to compute and present on-road services. Such techniques are the New Markov-Based Mobility Prediction (NMMP) and Prediction Location Model (PLM) that deal with inner cell structure and different levels of prediction, respectively. The NMMP and PLM techniques suffer from complex computation, accuracy rate regression and insufficient accuracy. In this thesis, Location Prediction based on a Sector Snapshot (LPSS) is introduced, which is based on a Novel Cell Splitting Algorithm (NCPA). This algorithm is implemented in a micro cell in parallel with the new prediction technique. The LPSS technique, compared with two classic prediction techniques and the experimental results, shows the effectiveness and robustness of the new splitting algorithm and prediction technique. In the cell side, the proposed approach reduces the complexity cost and prevents the cell level prediction technique from performing in time slots that are too close. For these reasons, the RA avoids cell-side problems. This research discusses a New Routing Area Displacement Prediction for Location-Based Services (NRADP) which is based on developed Ant Colony Optimization (ACO). The NRADP, compared with Mobility Prediction based on an Ant System (MPAS) and the experimental results, shows the effectiveness, higher prediction rate, reduced search stagnation ratio, and reduced computation cost of the new prediction technique

Using MapReduce Streaming for Distributed Life Simulation on the Cloud

Distributed software simulations are indispensable in the study of large-scale life models but often require the use of technically complex lower-level distributed computing frameworks, such as MPI. We propose to overcome the complexity challenge by applying the emerging MapReduce (MR) model to distributed life simulations and by running such simulations on the cloud. Technically, we design optimized MR streaming algorithms for discrete and continuous versions of Conway’s life according to a general MR streaming pattern. We chose life because it is simple enough as a testbed for MR’s applicability to a-life simulations and general enough to make our results applicable to various lattice-based a-life models. We implement and empirically evaluate our algorithms’ performance on Amazon’s Elastic MR cloud. Our experiments demonstrate that a single MR optimization technique called strip partitioning can reduce the execution time of continuous life simulations by 64%. To the best of our knowledge, we are the first to propose and evaluate MR streaming algorithms for lattice-based simulations. Our algorithms can serve as prototypes in the development of novel MR simulation algorithms for large-scale lattice-based a-life models.https://digitalcommons.chapman.edu/scs_books/1014/thumbnail.jp

Evolving Test Environments to Identify Faults in Swarm Robotics Algorithms

Swarm robotic systems are often considered to be dependable. However, there is little empirical evidence or theoretical analysis showing that dependability is an inherent property of all swarm robotic systems. Recent literature has identified potential issues with respect to dependability within certain types of swarm robotic control algorithms. However, there is little research on the testing of swarm robotic systems; this provides the motivation for developing a novel testing method for swarm robotic systems. An evolutionary testing method is proposed in this thesis to identify unintended behaviours during the execution of swarm robotic systems autonomously. Three case studies are carried out on flocking control algorithm, foraging algorithm, and task partitioning algorithm. These case studies not only show that the evolutionary testing method has the ability to identify faults in swarm robotic system, but also show that this evolutionary testing method is able to reveal failures in various swarm control algorithms. The experimental results show that the evolutionary testing method can lead to worse swarm performance and reveal more failures than the random testing method within the same number of computing evaluations. Moreover, the case study of flocking control algorithm also shows that the evolutionary testing method covers more failure types than the random testing method. In all three case studies, the dependability of each swarm robotic system has been improved by tackling the faults identified during the testing phase. Consequently, the evolutionary testing method has the potential to be used to help the developers of swarm robotic systems to design and calibrate the swarm control algorithms thereby assuring the dependability of swarm robotic systems

Proposition d’une architecture holonique auto-organisée et évolutive pour le pilotage des systèmes de production

The manufacturing world is being deeply challenged with a set of ever demanding constraints where from one side, the costumers are requiring products to be more customizable, with higher quality at lower prices, and on other side, companies have to deal on a daily basis with internal disturbances that range from machine breakdown to worker absence and from demand fluctuation to frequent production changes. This dissertation proposes a manufacturing control architecture, following the holonic principles developed in the ADAptive holonic COntrol aRchitecture (ADACOR) and extending it taking inspiration in evolutionary theories and making use of self- organization mechanisms. The use of evolutionary theories enrich the proposed control architecture by allowing evolution in two distinct ways, responding accordingly to the type and degree of the disturbance that appears. The first component, named behavioural self- organization, allows each system’s entity to dynamically adapt its internal behaviour, addressing small disturbances. The second component, named structural self-organization, addresses bigger disturbances by allowing the system entities to re-arrange their rela- tionships, and consequently changing the system in a structural manner. The proposed self-organized holonic manufacturing control architecture was validated at a AIP-PRIMECA flexible manufacturing cell. The achieved experimental results have also shown an improvement of the key performance indicators over the hierarchical and heterarchical control architecture.Le monde des entreprises est profondément soumis à un ensemble de contraintes toujours plus exigeantes provenant d’une part des clients, exigeant des produits plus personnalisables, de qualité supérieure et à faible coût, et d’autre part des aléas internes auxentreprises, comprenant les pannes machines, les défaillances humaines, la fluctuation de la demande, les fréquentes variations de production. Cette thèse propose une architecture de contrôle de systèmes de production, basée sur les principes holoniques développées dans l’architecture ADACOR (ADAptive holonic COntrol aRchitecture), et l’étendant en s’inspirant des théories de l’évolution et en utilisant des mécanismes d’auto-organisation. L’utilisation des théories de l’évolution enrichit l’architecture de contrôle en permettant l’évolution de deux manières distinctes, en réponse au type et au degré de la perturbation apparue. Le premier mode d’adaptation, appelé auto-organisation comportementale, permet à chaque entité qui compose le système d’adapter dynamiquement leur comportement interne, gérant de cette façon de petites perturbations. Le second mode, nommé auto-organisation structurelle, traite de plus grandes perturbations, en permettant aux entités du système de ré-organiser leurs relations, et par conséquent modifier structurellement le système. L’architecture holonique auto-organisée de contrôle de systèmes de production proposée dans cette thèse a été validée sur une cellule de production flexible AIP-PRIMECA. Les résultats ont montré une amélioration des indicateurs clés de performance par rapport aux architectures de contrôle hiérarchiques et hétérarchiques

INCUBATION OF METAHEURISTIC SEARCH ALGORITHMS INTO NOVEL APPLICATION FIELDS

Several optimization algorithms have been developed to handle various optimization issues in many fields, capturing the attention of many researchers. Algorithm optimizations are commonly inspired by nature or involve the modification of existing algorithms. So far, the new algorithms are set up and focusing on achieving the desired optimization goal. While this can be useful and efficient in the short term, in the long run, this is not enough as it needs to repeat for any new problem that occurs and maybe in specific difficulties, therefore one algorithm cannot be used for all real-world problems. This dissertation provides three approaches for implementing metaheuristic search (MHS) algorithms in fields that do not directly solve optimization issues. The first approach is to study parametric studies on MHS algorithms that attempt to understand how parameters work in MHS algorithms. In this first direction, we choose the Jaya algorithm, a relatively recent MHS algorithm defined as a method that does not require algorithm-specific control parameters. In this work, we incorporate weights as an extra parameter to test if Jaya’s approach is actually "parameter-free." This algorithm’s performance is evaluated by implementing 12 unconstrained benchmark functions. The results will demonstrate the direct impact of parameter adjustments on algorithm performance. The second approach is to embed the MHS algorithm on the Blockchain Proof of Work (PoW) to deal with the issue of excessive energy consumption, particularly in using bitcoin. This study uses an iterative optimization algorithm to solve the Traveling Salesperson Problem (TSP) as a model problem, which has the same concept as PoW and requires extending the Blockchain with additional blocks. The basic idea behind this research is to increase the tour cost for the best tour found for n blocks, extended by adding one more city as a requirement to include a new block in the Blockchain. The results reveal that the proposed concept can improve the way the current system solves complicated cryptographic problems Furthermore, MHS are implemented in the third direction approach to solving agricultural problems, especially the cocoa flowers pollination. We chose the problem in pollination in cacao flowers since they are distinctive and different from other flowers due to their small size and lack of odor, allowing just a few pollinators to successfully pollinate them, most notably a tiny midge called Forcipomyia Inornatipennis (FP). This concept was then adapted and implemented into an Idle-Metaheuristic for simulating the pollination of cocoa flowers. We analyze how MHS algorithms derived from three well-known methods perform when used to flower pollination problems. Swarm Intelligence Algorithms, Individual Random Search, and Multi-Agent Systems Search are the three methodologies studied here. The results shows that the Multi-Agent System search performs better than other methods. The findings of the three approaches reveal that adopting an MHS algorithms can solve the problem in this study by indirectly solving the optimization problem using the same problem model concept. Furthermore, the researchers concluded that parameter settings in the MHS algorithms are not so difficult to use, and each parameter can be adjusted to solve the real-world issue. This study is expected to encourage other researchers to improve and develop the performance of MHS algorithms used to deal with multiple real-world problems.九州工業大学博士学位論文 学位記番号: 情工博甲第367号 学位授与年月日: 令和4年3月25日1 Introduction|2 Traditional Metaheuristic Search Optimization|3 Parametric Study of Metaheuristic Search Algorithms|4 Embedded Metaheuristic Search Algorithms for Blockchain Proof-of-Work|5 Idle-Metaheuristic for Flower Pollination Simulation|6 Conclusion and Future Works九州工業大学令和3年

Fire ant self-assemblages

Fire ants link their legs and jaws together to form functional structures called self- assemblages. Examples include floating rafts, towers, bridges, and bivouacs. We investigate these self-assemblages of fire ants. Our studies are motivated in part by the vision of providing guidance for programmable robot swarms. The goal for such systems is to develop a simple programmable element from which complex patterns or behaviors emerge on the collective level. Intelligence is decentralized, as is the case with social insects such as fire ants. In this combined experimental and theoretical study, we investigate the construction of two fire ant self-assemblages that are critical to the colony’s survival: the raft and the tower. Using time-lapse photography, we record the construction processes of rafts and towers in the laboratory. We identify and characterize individual ant behaviors that we consistently observe during assembly, and incorporate these behaviors into mathematical models of the assembly process. Our models accurately predict both the assemblages’ shapes and growth patterns, thus providing evidence that we have identified and analyzed the key mechanisms for these fire ant self-assemblages. We also develop novel techniques using scanning electron microscopy and micro-computed tomography scans to visualize and quantify the internal structure and packing properties of live linked fire ants. We compare our findings to packings of dead ants and similarly shaped granular material packings to understand how active arranging affects ant spacing and orientation. We find that ants use their legs to increase neighbor spacing and hence reduce their packing density by one-third compared to packings of dead ants. Also, we find that live ants do not align themselves in parallel with nearest neighbors as much as dead ants passively do. Our main contribution is the development of parsimonious mathematical models of how the behaviors of individuals result in the collective construction of fire ant assemblages. The models posit only simple observed behaviors based on local information, yet their mathe- matical analysis yields accurate predictions of assemblage shapes and construction rates for a wide range of ant colony sizes.Ph.D