Search Results

The paper presents the adaptation process of an Ant Colony Optimization system to the task of composing music. The main aims of the study include designing and implementing the above-mentioned system, conducting research, measuring the obtained ...

The following paper demonstrates the possibilities of adapting the Ant Colony Algorithm with Social Interaction coming from Game Theory. This novel algorithm, named Social Interaction Ant Colony Optimization (SIACO), were based on the Ant System ...

High-utility itemset mining (HUIM) is a major contemporary data mining issue. It is different from frequent itemset mining (FIM), which only considers the quantity factor. HUIM applies both the quantity and profit factors to be used to reveal the most ...

The Vehicle Routing Problem VRP is one of the most important problems in the field of Operations Research and logistics. This paper presents a novel Ant Colony Optimization algorithm abbreviated as ACO_PLM to solve the Vehicle Routing Problem ...

We consider a path planning problem wherein an agent needs to safely and swiftly navigate from a given source location to a destination through an arrangement of disk-shaped obstacles. The agent possesses a limited neutralization capability in the sense ...

This paper presents an example of a multi-criteria optimization problem for vehicle navigation in the presence of multiple criteria and method of employing Ant Colony Optimization metaheuristic to solve it. The paper presents an approach based on the ...

In this paper, we propose a novel ant system algorithm for balancing node energy distribution with maximum the number of complete data transmission in ocean buoy communication sensor network. In our algorithm, a complete transmission process is regarded ...

The paper describes the parallel ant-based vehicle navigation algorithm adapted to run on GPUs. Experiments performed on realworld data show, that this new algorithm is more efficient and gives as good results as its predecessors. The algorithm's ...

In this paper we introduce an ant-based algorithm on continuous domains used to create procedural animations. We focus our approach on finding movement sequences that satisfy both the physical constraints as well as animator requirements. The proposed ...

Advent of Network-on-Chip (NoC) based complex system designs made on-chip power management a challenging issue. Power management schemes have been proposed to tackle the problem. But they fail to provide optimal sharing when the power budget ...

In this paper, a multilevel approach of Ant Colony Optimization to solve the Job Shop Scheduling Problem (JSSP) is introduced. The basic idea is to split the heuristic search performed by ants into two stages; only the Ant System algorithm belonging to ...

Ant Colony Optimization (ACO) algorithm is a modern Optimization technique solving problems of power system field. It is inspired by the behavior of ants in finding paths of the ant colonies to food. In this paper, the Max-Min Ant System, an Ant Colony ...

Achieving acceptable application performance in a grid environment remains a difficult challenge. In particular, this is true for applications composed of services that require certain criteria regarding quality to be fulfilled in order to satisfy users'...

This paper presents the solution of the Economic Load Dispatch (ELD) problem using an Ant Colony Optimization (ACO) algorithm: the Ant System with elitist strategy (AS_e). The idea of the elitist strategy in the context of the Ant System is to give extra ...

This paper presents a novel approach to solve the constrained unit commitment problem using Selective Self-Adaptive Ant System (SSAS) for improving search performance by automatically adapting ant populations and their transition probability parameters, ...

This paper presents an ant-based approach for solving the Traveling Salesman Problem (TSP). Novel concepts of this algorithm that distinguish it from the other heuristics are the inclusion of a preprocessing stage and the use of a modified version of an ...

The utilization of pseudo-random proportional rule to balance between the exploitation and exploration of the search process was shown in Ant Colony System (ACS) algorithm. In ACS, this rule is governed by a parameter so-called exploiting parameter ...

In this paper, we present an efficient clustering approach for large databases. Our simulation results indicate that the proposed novel clustering method (called ant colony optimization with different favor algorithm) performs better than the fast self-...

Using the idea of probabilistic routing, calls in an ant based decentralized scheme are not routed according to the largest probabilities in the pheromone tables but randomly according to these probabilities. This principle can be particularly helpful ...

Ant system algorithms have been used successfully to solve many hard combinatorial problems. In this paper we introduce an ant system method to solve the mixed vehicle routing problem with backhauls. Some enhancements to the general characteristics of ...