Related papers: Load Balancing using Ant Colony in Cloud Computing
Path finding algorithm addresses problem of finding shortest path from source to destination avoiding obstacles. There exist various search algorithms namely A*, Dijkstra's and ant colony optimization. Unlike most path finding algorithms…
We study the problem of distributed task allocation inspired by the behavior of social insects, which perform task allocation in a setting of limited capabilities and noisy environment feedback. We assume that each task has a demand that…
Navigation through narrow passages during colony relocation by the tandem-running ants, $\textit{Diacamma}$ $\textit{indicum}$, is a tour de force of biological traffic coordination. Even on one-lane paths, the ants tactfully manage a…
Cloud computing is a newly emerging distributed computing which is evolved from Grid computing. Task scheduling is the core research of cloud computing which studies how to allocate the tasks among the physical nodes so that the tasks can…
The Generalized Traveling Salesman Problem (GTSP) is an extension of the well-known Traveling Salesman Problem (TSP), where the node set is partitioned into clusters, and the objective is to find the shortest cycle visiting each cluster…
Using a simple model for the trail formation of ants, the relation between i)the schedule of feeding which represents the unsteady natural environment, ii)emerging patterns of trails connecting a nest with food resources, and iii)the…
Data mining focuses on discovering interesting, non-trivial and meaningful information from large datasets. Data clustering is one of the unsupervised and descriptive data mining task which group data based on similarity features and…
This paper addresses the Capacitated Arc Routing Problem (CARP) using an Ant Colony Optimization scheme. Ant Colony schemes can compute solutions for medium scale instances of VRP. The proposed Ant Colony is dedicated to large-scale…
Taking inspiration from nature for meta-heuristics has proven popular and relatively successful. Many are inspired by the collective intelligence exhibited by insects, fish and birds. However, there is a question over their scalability to…
If a computer node is infected by a virus, worm or a backdoor, then this is a security risk for the complete network structure where the node is associated. Existing Network Intrusion Detection Systems (NIDS) provide a certain amount of…
There is still a long way to go before artificial mini robots are really used for search and rescue missions in disaster-hit areas due to hindrance in power consumption, computation load of the locomotion, and obstacle-avoidance system.…
Fire ants use their claws to grip diverse surfaces, including each other. As a result of their mutual adhesion and large numbers, ant colonies flow like inanimate fluids. In this sequence of films, we demonstrate how ants behave similarly…
This paper discusses the problem of placing weighted items in a circular container in two-dimensional space. This problem is of great practical significance in various mechanical engineering domains, such as the design of communication…
With IoT systems' increasing scale and complexity, maintenance of a large number of nodes using stationary devices is becoming increasingly difficult. Hence, mobile devices are being employed that can traverse through a set of target…
Efficient transportation, a hot topic in nonlinear science, is essential for modern societies and the survival of biological species. Biological evolution has generated a rich variety of successful solutions, which have inspired engineers…
Mobile ad hoc network (MANET) is a collection of wireless mobile nodes. It dynamically forms a temporary network without using any pre existing network infrastructure or centralized administration i.e. with minimal prior planning. All nodes…
Cloud resource management is often modeled by two-dimensional bin packing with a set of items that correspond to tasks having fixed CPU and memory requirements. However, applications running in clouds are much more flexible: modern…
A few of ant robots are dropped to a labirynth, formed by a square lattice with a small number of nodes removed. Ants move according to a deterministic algorithm designed to explore all corridors. Each ant remembers the shape of corridors…
We present a dynamic algorithm for solving the Longest Common Subsequence Problem using Ant Colony Optimization Technique. The Ant Colony Optimization Technique has been applied to solve many problems in Optimization Theory, Machine…
In this paper we focus on finding high quality solutions for the problem of maximum partitioning of graphs with supply and demand (MPGSD). There is a growing interest for the MPGSD due to its close connection to problems appearing in the…