This paper presents an efficient algorithm for the loss minimization by automatic sectionalizing switch operation in distribution systems. Ant colony algorithm is a multi-agent system in which the behaviour of each single agent, called artificial ant, is inspired by the behaviour of real ants. Ant colony algorithm is suitable for combinatorial optimization. The proposed methodology with some mo...

In this paper we first provide a thorough performance comparison of the three main Ant Colony Optimization (ACO) paradigms for the Vehicle Routing Problem (VRP), namely the Rank based Ant System, the Max-Min Ant System and the Ant Colony System. Based on the results of this comparison we then implement a parallelization strategy to increase computational efficiency and study the effects of incr...

optimization of reservoir parameters is an important issue in petroleum exploration and production. the ant colony optimization(aco) is a recent approach to solve discrete and continuous optimization problems. in this paper, the ant colony optimization is usedas an intelligent tool to estimate reservoir rock properties. the methodology is illustrated by using a case study on shear wave velocity...

the heterogeneous fixed fleet open vehicle routing problem (hffovrp) is one of the most significant extension problems of the open vehicle routing problem (ovrp). the hffovrp is the problem of designing collection routes to a number of predefined nodes by a fixed fleet number of vehicles with various capacities and related costs. in this problem, the vehicle doesn’t return to the depot after se...

A hybrid ant colony optimization technique to solve the stagnation problem in grid computing is proposed in this paper. The proposed algorithm combines the techniques from Ant Colony System and Max – Min Ant System and focused on local pheromone trail update and trail limit. The agent concept is also integrated in this proposed technique for the purpose of updating the grid resource table. This...

The traveling salesman problem (TSP) is one of the most important combinational optimization problems that have nowadays received much attention because of its practical applications in industrial and service problems. In this paper, a hybrid two-phase meta-heuristic algorithm called MACSGA used for solving the TSP is presented. At the first stage, the TSP is solved by the modified ant colony s...

Ant System, the first Ant Colony Optimization algorithm, showed to be a viable method for attacking hard combinatorial optimization problems. Yet, its performance, when compared to more fine-tuned algorithms, was rather poor for large instances of traditional benchmark problems like the Traveling Salesman Problem. To show that Ant Colony Optimization algorithms could be good alternatives to exi...

Ant System, the first Ant Colony Optimization algorithm, showed to be a viable method for attacking hard combinatorial optimization problems. Yet, its performance, when compared to more fine-tuned algorithms, was rather poor for large instances of traditional benchmark problems like the Traveling Salesman Problem. To show that Ant Colony Optimization algorithms could be good alternatives to exi...

The prevalent communications networks suffer from lack of spectrum and spectrum inefficiency. This has motivated researchers to develop cognitive radio (CR) as a smart and dynamic radio access promised solution. A major challenge to this new technology is how to make fair assignment of available spectrum to unlicensed users, particularly for smart grids communication. This paper introduces an i...