1,697 research outputs found
Big data clustering using grid computing and ant-based algorithm
Big data has the power to dramatically change the way institutes and organizations use their data. Transforming the massive amounts of data into knowledge will leverage the organizations performance to the maximum.Scientific and business organizations would benefit from utilizing big data. However, there are many challenges in dealing with big data such as storage, transfer, management and manipulation of big data.Many techniques are required to explore the hidden pattern inside the big data which have limitations in terms of hardware and software implementation. This paper presents a framework for big data clustering which utilizes grid technology and ant-based algorithm
Ant colonies: building complex organizations with minuscule brains and no leaders
Thus far the articles in the series JOD calls the “Organization Zoo” have employed the notion of a “zoo” metaphorically to describe an array of human institutions. Here we take the term literally to consider the design of the most complex organizations in the living world beside those of humans, a favorite of insect zoos around the world: ant colonies. We consider individuality and group identity in the functioning of ant organizations; advantages of a flat organization without hierarchies or leaders; self-organization; direct and indirect communication; job specialization; labor coordination; and the role of errors in innovation. The likely value and limitations of comparing ant and human organizations are briefly examined
Traveling Salesman Problem
The idea behind TSP was conceived by Austrian mathematician Karl Menger in mid 1930s who invited the research community to consider a problem from the everyday life from a mathematical point of view. A traveling salesman has to visit exactly once each one of a list of m cities and then return to the home city. He knows the cost of traveling from any city i to any other city j. Thus, which is the tour of least possible cost the salesman can take? In this book the problem of finding algorithmic technique leading to good/optimal solutions for TSP (or for some other strictly related problems) is considered. TSP is a very attractive problem for the research community because it arises as a natural subproblem in many applications concerning the every day life. Indeed, each application, in which an optimal ordering of a number of items has to be chosen in a way that the total cost of a solution is determined by adding up the costs arising from two successively items, can be modelled as a TSP instance. Thus, studying TSP can never be considered as an abstract research with no real importance
Hybrid Honey Bees Mating Optimization Algorithm for Identifying the Near-Optimal Solution in Web Service Composition
This paper addresses the problem of optimality in semantic Web service composition by proposing a hybrid nature-inspired method for selecting the optimal or near-optimal solution in semantic Web Service Composition. The method hybridizes the Honey-Bees Mating Optimization algorithm with components inspired from genetic algorithms, reinforcement learning, and tabu search. To prove the necessity of hybridization, we have analyzed comparatively the experimental results provided by our hybrid selection algorithm versus the ones obtained with the classical Honey Bees Mating Optimization algorithm and with the genetic-inspired algorithm of Canfora et al
Emergent communication enhances foraging behaviour in evolved swarms controlled by Spiking Neural Networks
Social insects such as ants communicate via pheromones which allows them to
coordinate their activity and solve complex tasks as a swarm, e.g. foraging for
food. This behavior was shaped through evolutionary processes. In computational
models, self-coordination in swarms has been implemented using probabilistic or
simple action rules to shape the decision of each agent and the collective
behavior. However, manual tuned decision rules may limit the behavior of the
swarm. In this work we investigate the emergence of self-coordination and
communication in evolved swarms without defining any explicit rule. We evolve a
swarm of agents representing an ant colony. We use an evolutionary algorithm to
optimize a spiking neural network (SNN) which serves as an artificial brain to
control the behavior of each agent. The goal of the evolved colony is to find
optimal ways to forage for food and return it to the nest in the shortest
amount of time. In the evolutionary phase, the ants are able to learn to
collaborate by depositing pheromone near food piles and near the nest to guide
other ants. The pheromone usage is not manually encoded into the network;
instead, this behavior is established through the optimization procedure. We
observe that pheromone-based communication enables the ants to perform better
in comparison to colonies where communication via pheromone did not emerge. We
assess the foraging performance by comparing the SNN based model to a rule
based system. Our results show that the SNN based model can efficiently
complete the foraging task in a short amount of time. Our approach illustrates
self coordination via pheromone emerges as a result of the network
optimization. This work serves as a proof of concept for the possibility of
creating complex applications utilizing SNNs as underlying architectures for
multi-agent interactions where communication and self-coordination is desired.Comment: 27 pages, 16 figure
The Use of Persistent Explorer Artificial Ants to Solve the Car Sequencing Problem
Ant Colony Optimisation is a widely researched meta-heuristic which uses the behaviour and pheromone laying activities of foraging ants to find paths through graphs. Since the early 1990’s this approach has been applied to problems such as the Travelling Salesman Problem, Quadratic Assignment Problem and Car Sequencing Problem to name a few. The ACO is not without its problems it tends to find good local optima and not good global optima. To solve this problem modifications have been made to the original ACO such as the Max Min ant system. Other solutions involve combining it with Evolutionary Algorithms to improve results. These improvements focused on the pheromone structures. Inspired by other swarm intelligence algorithms this work attempts to develop a new type of ant to explore different problem paths and thus improve the algorithm. The exploring ant would persist throughout the running time of the algorithm and explore unused paths. The Car Sequencing problem was chosen as a method to test the Exploring Ants. An existing algorithm was modified to implement the explorers. The results show that for the car sequencing problem the exploring ants did not have any positive impact, as the paths they chose were always sub-optimal
- …