Related papers: Extension of Max-Min Ant System with Exponential P…
We develop and analyse a finite volume scheme for a nonlocal active matter system known to exhibit a rich array of complex behaviours. The model under investigation was derived from a stochastic system of interacting particles describing a…
Colonies of the arboreal turtle ant create networks of trails that link nests and food sources on the graph formed by branches and vines in the canopy of the tropical forest. Ants put down a volatile pheromone on edges as they traverse…
In this paper we analyze a system of PDEs recently introduced in [P. Amorim, {\it Modeling ant foraging: a {chemotaxis} approach with pheromones and trail formation}], in order to describe the dynamics of ant foraging. The system is made of…
The Ant Colony System (ACS) is, next to Ant Colony Optimization (ACO) and the MAX-MIN Ant System (MMAS), one of the most efficient metaheuristic algorithms inspired by the behavior of ants. In this article we present three novel parallel…
In this work we present an algorithm for covering continuous connected domains by ant-like robots with very limited capabilities. The robots can mark visited places with pheromone marks and sense the level of the pheromone in their local…
This paper studies the asymptotic behavior of several continuous-time dynamical systems which are analogs of ant colony optimization algorithms that solve shortest path problems. Local asymptotic stability of the equilibrium corresponding…
Currently available dynamic optimization strategies for Ant Colony Optimization (ACO) algorithm offer a trade-off of slower algorithm convergence or significant penalty to solution quality after each dynamic change occurs. This paper…
So far, only few bounds on the runtime behavior of Ant Colony Optimization (ACO) have been reported. To alleviate this situation, we investigate the ACO variant we call Bivalent ACO (BACO) that uses exactly two pheromone values. We provide…
An ant colony optimization approach for partitioning a set of objects is proposed. In order to minimize the intra-variance, or within sum-of-squares, of the partitioned classes, we construct ant-like solutions by a constructive approach…
Applications of ACO algorithms to obtain better solutions for combinatorial optimization problems have become very popular in recent years. In ACO algorithms, group of agents repeatedly perform well defined actions and collaborate with…
We propose a method to derive the stationary size distributions of a system, and the degree distributions of networks, using maximisation of the Gibbs-Shannon entropy. We apply this to a preferential attachment-type algorithm for systems of…
In this work, the multiplier method is extended to obtain a general lower bound of the exponential decay rate in terms of the physical parameters for port-Hamiltonian systems in one space dimension with boundary dissipation. The physical…
Ant Colony Optimization (ACO) is a metaheuristic proposed by Marco Dorigo in 1991 based on behavior of biological ants. Pheromone laying and selection of shortest route with the help of pheromone inspired development of first ACO algorithm.…
This paper presents the Multi-Objective Ant Nesting Algorithm (MOANA), a novel extension of the Ant Nesting Algorithm (ANA), specifically designed to address multi-objective optimization problems (MOPs). MOANA incorporates adaptive…
Detecting communities from complex networks has recently triggered great interest. Aiming at this problem, a new ant colony optimization strategy building on the Markov random walks theory, which is named as MACO, is proposed in this paper.…
We propose an active walker model for the motion of individual ants communicating via chemical signals. It is assumed that communication takes the form of a time-dependent pheromone field that feedbacks into the motion ants through…
This paper proposes a new method to provide the exponential convergence of both the parameter and tracking errors of the composite adaptive control system without the persistent excitation (PE) requirement. Instead, the derived composite…
In this paper we define a discrete dynamical system that governs the evolution of a population of agents. From the dynamical system, a variant of Differential Evolution is derived. It is then demonstrated that, under some assumptions on the…
We propose a new, flexible approach for dynamically maintaining successful mutation rates in evolutionary algorithms using $k$-bit flip mutations. The algorithm adds successful mutation rates to an archive of promising rates that are…
We investigate the three-dimensional compressible Euler-Maxwell system, a model for simulating the transport of electrons interacting with propagating electromagnetic waves in semiconductor devices. First, we show the global well-posedness…