Academia.eduAcademia.edu

Ant Colony Algorithm

description1,019 papers
group35 followers
lightbulbAbout this topic
The Ant Colony Algorithm is a computational optimization technique inspired by the foraging behavior of ants. It utilizes a population of artificial agents (ants) that explore solutions to a problem, communicating via pheromone trails to guide the search process towards optimal or near-optimal solutions in complex search spaces.
lightbulbAbout this topic
The Ant Colony Algorithm is a computational optimization technique inspired by the foraging behavior of ants. It utilizes a population of artificial agents (ants) that explore solutions to a problem, communicating via pheromone trails to guide the search process towards optimal or near-optimal solutions in complex search spaces.
Decision support system for road traffic management can be used for freight transport, people transport but also for site evacuation. We deal with two aspects of the decision support system in a same global architecture: one for road... more
Aquaculture is one of many industries where the use of artificial intelligence (AI) techniques has increased dramatically in recent years. Internet of things (IoT), AI, and big data are just a few of the technologies being used in smart... more
An algorithm inspired on ant behavior is developed in order to find out the topology of an electric energy distribution network with minimum power loss. The algorithm performance is investigated in hypothetical and actual circuits. When... more
A Service-specific Overlay Network (SSON) is a virtualization concept proposed for customized media delivery in the Ambient Networks architecture . The service specific media delivery network has to be constructed dynamically without... more
In this paper we present a new optimization algorithm based on a model of the foraging behavior of a population of primitive ants (Pachycondyla apicalis). These ants are characterized by a relatively simple but efficient strategy for prey... more
In this paper we consider the well known p-median problem. We introduce a new large neighborhood based on ideas of S.Lin and B.W. Kernighan for the graph partition problem. We study the behavior of the local improvement and Ant Colony... more
The Los Alamos Message Passing Interface (LA-MPI) is an end-to-end network-failure-tolerant message-passing system designed for terascale clusters. LA-MPI is a standard-compliant implementation of MPI designed to tolerate network-related... more
A component-based approach to model Ant Colony System (ACS) for the Traveling Salesman Problem (TSP) is shown in this paper. The used components to solve the TSP with ACS technique and the collaboration rules between components are also... more
In this paper we propose an ant colony optimization variant where several independent colonies try to simultaneously solve the same problem. The approach includes a migration mechanism that ensures the exchange of information between... more
This paper presents an evolving method for a self-organizing multirobot exploration of an unknown environment. In such problem, a big consideration is given to the coordination behavior of robots in order to achieve the common tasks in an... more
In this study, Travelling Salesman Problem (TSP), an NP-hard problem, is addressed. In order to get the best results with a view to directing TSP heuristics, the ant colony algorithm was used for solution purposes. The purpose was to... more
We present two heuristic mesh-partitioning methods, both of which build on the multiple ant-colony algorithm in order to improve the quality of the mesh partitions. The first method augments the multiple ant-colony algorithm with a... more
The concept of trust has become very relevant in the late years as a consequence of the growth of fields such as internet transactions or electronic commerce. In general, trust has become of paramount importance for any kind of... more
Two Ant Colony Optimization algorithms are proposed to tackle multiobjective structural optimization problems with an additional constraint. A cardinality constraint is introduced in order to limit the number of distinct values of the... more
Wireless sensor networks (WSNs) have received significant scholarly attentionwithin the scientific community lately. The use of small and energy efficient devices with restricted computing capabilities has gained traction in various... more
Grid computing is recognized as one of the most powerful vehicles for high performance computing for data-intensive scientific applications. Grid is alternative to traditional distributed computing. It addresses issues such as resource... more
The increasing number of digitized texts presently available notably on the Web has developed an acute need in text mining techniques. Clustering systems are used more and more often in text mining, especially to analyze texts and to... more
Ant algorithms are usually derived from a stochastic modeling based on some specific probability laws. We consider in this paper a full deterministic model of "logistic ants" which uses chaotic maps to govern the behavior of the... more
Summary. In this paper we introduce the notion of protein interaction network. This is a graph whose vertices are the proteins amino acids and whose edges are the interactions between them. We consider the problem of reconstructing... more
In this paper we introduce the notion of protein interaction network. This is a graph whose vertices are the proteins amino acids and whose edges are the interactions between them. We consider the problem of reconstructing protein's... more
In this paper we propose an ant colony optimization variant where several independent colonies try to simultaneously solve the same problem. The approach includes a migration mechanism that ensures the exchange of information between... more
The network field has been very popular in recent times and has aroused much of the attention of researchers. The network must keep working with the varying infrastructure and must adapt to rapid topology changes. Graphical representation... more
Our understanding of social insect behavior has significantly influenced A.I. and multi-robot systems' research (e.g. ant algorithms and swarm robotics). In this work, however, we focus on the opposite question, namely: "how can... more
Metaheuristics are very useful methods because they can find (approximate) solutions of a great variety of problems. One of them, which interests us, is graph partitioning. We present a new metaheuristic based on nuclear fusion and... more
Recently, agent techniques in electronic marketplaces (e-marketplaces) bring B-to-B trading into a new era. However, not much analysis on the behavior of agents has been reported. In this paper, based on the ant algorithm in network... more
Etude expérimentale et modélisation des choix collectifs chez un insecte grégaire (Unpublished doctoral dissertation). Université libre de Bruxelles, Faculté des sciences, Bruxelles.
In this thesis, a Revised Multiple Ant Colony System (RMACS) approach is applied to the Vehicle Routing Problem with Time Windows (VRPTW). Our primary objective is to minimize the number of vehicles and the secondary objective is to... more
Download research papers for free!