Ant colony optimization with immigrants schemes in dynamic environments

This is the post-print version of this article. The official published version can be accessed from the link below - Copyright @ 2010 Springer-VerlagIn recent years, there has been a growing interest in addressing dynamic optimization problems (DOPs) using evolutionary algorithms (EAs). Several approaches have been developed for EAs to increase the diversity of the population and enhance the performance of the algorithm for DOPs. Among these approaches, immigrants schemes have been found beneficial for EAs for DOPs. In this paper, random, elitismbased, and hybrid immigrants schemes are applied to ant colony optimization (ACO) for the dynamic travelling salesman problem (DTSP). The experimental results show that random immigrants are beneficial for ACO in fast changing environments, whereas elitism-based immigrants are beneficial for ACO in slowly changing environments. The ACO algorithm with hybrid immigrants scheme combines the merits of the random and elitism-based immigrants schemes. Moreover, the results show that the proposed algorithms outperform compared approaches in almost all dynamic test cases and that immigrant schemes efficiently improve the performance of ACO algorithms in DTSP.This work was supported by the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/1

Memory-based immigrants for ant colony optimization in changing environments

Copyright @ 2011 SpringerAnt colony optimization (ACO) algorithms have proved that they can adapt to dynamic optimization problems (DOPs) when they are enhanced to maintain diversity. DOPs are important due to their similarities to many real-world applications. Several approaches have been integrated with ACO to improve their performance in DOPs, where memory-based approaches and immigrants schemes have shown good results on different variations of the dynamic travelling salesman problem (DTSP). In this paper, we consider a novel variation of DTSP where traffic jams occur in a cyclic pattern. This means that old environments will re-appear in the future. A hybrid method that combines memory and immigrants schemes is proposed into ACO to address this kind of DTSPs. The memory-based approach is useful to directly move the population to promising areas in the new environment by using solutions stored in the memory. The immigrants scheme is useful to maintain the diversity within the population. The experimental results based on different test cases of the DTSP show that the memory based immigrants scheme enhances the performance of ACO in cyclic dynamic environments.This work was supported by the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/2

Analyzing Trails in Complex Networks

Even more interesting than the intricate organization of complex networks are the dynamical behavior of systems which such structures underly. Among the many types of dynamics, one particularly interesting category involves the evolution of trails left by moving agents progressing through random walks and dilating processes in a complex network. The emergence of trails is present in many dynamical process, such as pedestrian traffic, information flow and metabolic pathways. Important problems related with trails include the reconstruction of the trail and the identification of its source, when complete knowledge of the trail is missing. In addition, the following of trails in multi-agent systems represent a particularly interesting situation related to pedestrian dynamics and swarming intelligence. The present work addresses these three issues while taking into account permanent and transient marks left in the visited nodes. Different topologies are considered for trail reconstruction and trail source identification, including four complex networks models and four real networks, namely the Internet, the US airlines network, an email network and the scientific collaboration network of complex network researchers. Our results show that the topology of the network influence in trail reconstruction, source identification and agent dynamics.Comment: 10 pages, 16 figures. A working manuscript, comments and criticisms welcome

Vector bundles on the projective line and finite domination of chain complexes

Finitely dominated chain complexes over a Laurent polynomial ring in one indeterminate are characterised by vanishing of their Novikov homology. We present an algebro-geometric approach to this result, based on extension of chain complexes to sheaves on the projective line. We also discuss the K-theoretical obstruction to extension.Comment: v1: 11 page

Ant colony optimisation and local search for bin-packing and cutting stock problems

The Bin Packing Problem and the Cutting Stock Problem are two related classes of NP-hard combinatorial optimization problems. Exact solution methods can only be used for very small instances, so for real-world problems, we have to rely on heuristic methods. In recent years, researchers have started to apply evolutionary approaches to these problems, including Genetic Algorithms and Evolutionary Programming. In the work presented here, we used an ant colony optimization (ACO) approach to solve both Bin Packing and Cutting Stock Problems. We present a pure ACO approach, as well as an ACO approach augmented with a simple but very effective local search algorithm. It is shown that the pure ACO approach can compete with existing evolutionary methods, whereas the hybrid approach can outperform the best-known hybrid evolutionary solution methods for certain problem classes. The hybrid ACO approach is also shown to require different parameter values from the pure ACO approach and to give a more robust performance across different problems with a single set of parameter values. The local search algorithm is also run with random restarts and shown to perform significantly worse than when combined with ACO

The initial investigation of the design and energy sharing algorithm using two-ways communication mechanism for Swarm Robotic System

Swarm Robotics (SR) is a new field of study that is mainly concerned with con-trolling and coordinating a multiple small robots. SR has several key characteristics that make it a preferable choice for a variety of tasks. The characteristics include lower cost, easiness to program, scalability of tasks and fault tolerance. The robustness from fault tolerance in SR comes from having a group of small robots working on the same task and thus enabling them to tolerate the loss of a few members of the swarm as the other members can still continue with the mission. However it has shown that continuous failure of members of a swarm such as those due to low energy have a significant impact on the overall performance of the swarm. In addition, the possibility of completion of the task is also dependent on the percentage of the swarm falling out of the group due insufficient energy. Some of the work that has been proposed by the researchers is by adding a charging station or a removable charger. However, these techniques have their own limitations. Therefore a work on having the robot(s) to charger themselves without the help of the charging station or a removable charger is proposed. But the work is only proven successful in simulation without a proper design and testing in a real robots scenario. This paper is therefore will describe our initial investigation on the design and the implementation of energy sharing algorithm using two-ways robotic swarm communication mechanism with NRF2401

Solving Optimization Problems by the Public Goods Game

This document is the Accepted Manuscript version of the following article: Marco Alberto Javarone, ‘Solving optimization problems by the public goods game’, The European Physical Journal B, 90:17, September 2017. Under embargo. Embargo end date: 18 September 2018. The final, published version is available online at doi: https://doi.org/10.1140/epjb/e2017-80346-6. Published by Springer Berlin Heidelberg.We introduce a method based on the Public Goods Game for solving optimization tasks. In particular, we focus on the Traveling Salesman Problem, i.e. a NP-hard problem whose search space exponentially grows increasing the number of cities. The proposed method considers a population whose agents are provided with a random solution to the given problem. In doing so, agents interact by playing the Public Goods Game using the fitness of their solution as currency of the game. Notably, agents with better solutions provide higher contributions, while those with lower ones tend to imitate the solution of richer agents for increasing their fitness. Numerical simulations show that the proposed method allows to compute exact solutions, and suboptimal ones, in the considered search spaces. As result, beyond to propose a new heuristic for combinatorial optimization problems, our work aims to highlight the potentiality of evolutionary game theory beyond its current horizons.Peer reviewedFinal Accepted Versio

GLEAM v3 : satellite-based land evaporation and root-zone soil moisture

The Global Land Evaporation Amsterdam Model (GLEAM) is a set of algorithms dedicated to the estimation of terrestrial evaporation and root-zone soil moisture from satellite data. Ever since its development in 2011, the model has been regularly revised, aiming at the optimal incorporation of new satellite-observed geophysical variables, and improving the representation of physical processes. In this study, the next version of this model (v3) is presented. Key changes relative to the previous version include (1) a revised formulation of the evaporative stress, (2) an optimized drainage algorithm, and (3) a new soil moisture data assimilation system. GLEAM v3 is used to produce three new data sets of terrestrial evaporation and root-zone soil moisture, including a 36-year data set spanning 1980-2015, referred to as v3a (based on satellite-observed soil moisture, vegetation optical depth and snow-water equivalent, reanalysis air temperature and radiation, and a multi-source precipitation product), and two satellite-based data sets. The latter share most of their forcing, except for the vegetation optical depth and soil moisture, which are based on observations from different passive and active C-and L-band microwave sensors (European Space Agency Climate Change Initiative, ESA CCI) for the v3b data set (spanning 2003-2015) and observations from the Soil Moisture and Ocean Salinity (SMOS) satellite in the v3c data set (spanning 2011-2015). Here, these three data sets are described in detail, compared against analogous data sets generated using the previous version of GLEAM (v2), and validated against measurements from 91 eddy-covariance towers and 2325 soil moisture sensors across a broad range of ecosystems. Results indicate that the quality of the v3 soil moisture is consistently better than the one from v2: average correlations against in situ surface soil moisture measurements increase from 0.61 to 0.64 in the case of the v3a data set and the representation of soil moisture in the second layer improves as well, with correlations increasing from 0.47 to 0.53. Similar improvements are observed for the v3b and c data sets. Despite regional differences, the quality of the evaporation fluxes remains overall similar to the one obtained using the previous version of GLEAM, with average correlations against eddy-covariance measurements ranging between 0.78 and 0.81 for the different data sets. These global data sets of terrestrial evaporation and root-zone soil moisture are now openly available at www.GLEAM.eu and may be used for large-scale hydrological applications, climate studies, or research on land-atmosphere feedbacks

Neuronal assembly dynamics in supervised and unsupervised learning scenarios

The dynamic formation of groups of neurons—neuronal assemblies—is believed to mediate cognitive phenomena at many levels, but their detailed operation and mechanisms of interaction are still to be uncovered. One hypothesis suggests that synchronized oscillations underpin their formation and functioning, with a focus on the temporal structure of neuronal signals. In this context, we investigate neuronal assembly dynamics in two complementary scenarios: the first, a supervised spike pattern classification task, in which noisy variations of a collection of spikes have to be correctly labeled; the second, an unsupervised, minimally cognitive evolutionary robotics tasks, in which an evolved agent has to cope with multiple, possibly conflicting, objectives. In both cases, the more traditional dynamical analysis of the system’s variables is paired with information-theoretic techniques in order to get a broader picture of the ongoing interactions with and within the network. The neural network model is inspired by the Kuramoto model of coupled phase oscillators and allows one to fine-tune the network synchronization dynamics and assembly configuration. The experiments explore the computational power, redundancy, and generalization capability of neuronal circuits, demonstrating that performance depends nonlinearly on the number of assemblies and neurons in the network and showing that the framework can be exploited to generate minimally cognitive behaviors, with dynamic assembly formation accounting for varying degrees of stimuli modulation of the sensorimotor interactions