Applying Ant Colony Optimization For Load Balancing On Grid

767 words - 4 pages

IV. PROPOSED ALGORITHM
In this article, a new approach based on ant colony optimization is proposed. In Antz Algorithm which is proposed in [17], ants choose the lightest node from the node’s table according to the nodes’ loads. When an ant selects a node as the lightest node, this node may have been chosen as the lightest node sooner in the table of another node, and the ant, corresponding to that node has chosen this node earlier than this ant, but the current ant does not know about this selection and it chooses this node as the lightest node too. So, whenever an ant meets a node, there must be a counter which counts the ants, meeting this node and must take this number as a probability that this node will be taken as the lightest node by other ants. This number is noted by the ant and this factor and the node`s load are the parameters to choose the lightest node.
A. Description of the Algorithm
The proposed algorithm is inspired from ant colony optimization. In the real world, ...view middle of the document...

They look at the paths and they realize one of the paths has stronger pheromone. So, they select this path as the shortest one too (Step 4). This procedure is shown in Fig. 5.


Fig 5. The act of ants in real world

This concept is used in ant colony optimization. In this approach, pheromone is as the nodes’ tables and will be a leader for other ants to find the lightest node sooner.
In Table 1, the proposed algorithm is shown. Whenever a job is inserted to the Grid, an ant is initialized for it. In the first steps, the ant begins to wander in the environment randomly with a probability (Probability) in order to fill its table and the nodes’ tables. The ant’s table contains information about the nodes that this ant have visited in its route and the node’s table contains information about other nodes’ load which are placed in this table when ants visited this node.
When the ant reaches to a node, it notes the load of the node in its table and increases the counter, which is defined as the number of ants, passed this node and notes it too (Ant_Counter). Then, the ant puts its table in the node’s table and simultaneously, if there is any information in the node’s table, the ant will note it in its table and if both of them contain the same information, the most updated one will replace to both tables (Update). As time passes, the next ant`s movement should be more dependent on the node’s table and it must choose the next node from the node’s table. This one is achieved by decreasing the factor Decrease with the factor Probability.
For choosing the next node from node’s table, the ant selects the current node as the best node and computes a factor which is the multiple of the node`s load and the Ant_Counter of the node, and named it as M. Then, it begins to compare this factor of the current node with this factor of each entry of the node’s table. The entry which has the least M, will be the lightest node and in case of a tie, the ant chooses one with an equal probability. The algorithm for choosing the next node from the node’s table is shown in Table 2. When the ant finds the lightest node from the node’s table, it moves to it and this process will be continued until the ant goes the MaxSteps number of steps. After these steps, the lightest node is selected and the job will be delivered to it.

Find Another Essay On Applying Ant Colony Optimization for Load Balancing on Grid

Multi-objective Reconfiguration of Electrical Distribution Networks

2532 words - 10 pages reconfiguration method is propounded to minimize resistive line losses in EDSs; although the method is fast in terms of computation but it suffers from premature convergence. In Ref. [3] a heuristic branch exchange reconfiguration method for power loss reduction and load balancing in radial EDSs is propounded; however in terms of computational time their solution technique is highly expensive and dependent on the initial network configuration. In Refs

Multiobjective Planning of Recloser-Based Protection Systems on DG Enhanced Feeders

1068 words - 5 pages systems planning by applying the aforementioned methods. Dehgani et al. [2] realize a compound index optimization such that SAIFI, SAIDI and MAIFIe are minimized by using a genetic algorithm (GA). In the case of distributed generation (DG) enhanced feeders, Wang et al. [3] implement ant colony system (ACS) to minimize an index composed by SAIFI and SAIDI. In this line, Li et al. [4] apply a multi-population GA to solve this index optimization problem

Reliability in Smart Grids

1786 words - 8 pages reliability and optimization of supply and consumption. The main concern of Niyato et al.’s (2013) was on the load balancing and to optimize its power consumption, scheduling and a model has been used called constrained Markov decision process. The model applied there was connectivity between the data communication infrastructure and meter data management system servers and hence go for scheduling decision. To optimize the power supply; a model

Pareto-Based Multi-Stage and Multi-Objective Planning of DG Enhanced Distribution System

767 words - 4 pages objectives. According to the literature, the optimal placement of devices in a DS is a complex problem. A Pareto multiobjective optimization is presented in [1], based on ant colony system (ACS), which minimizes both total costs and reliability indices such as SAIFI and SAIDI. A non-linear programming approach, along with a genetic algorithm (GA), is proposed in [2]. This approach identifies the position of reclosers on a radial feeder

What's The Construction Schedule Optimization?

1083 words - 4 pages • Nontraditional optimization techniques such as Genetic Algorithm, Ant Colony, Fuzzy Optimization, Neural Networks, etc.. In the attempt to solve the optimization problem of construction scheduling several methods were used in different problems cases and justification of the use of the optimization techniques are presented in these researches. Literature Review The widely known and the most famous algorithm to solve the original time optimization

Ant-Aphid Interactions

1556 words - 6 pages reciprocal positive effect on the overall fitness of both partners (Stadler and Dixon 2005), but can also be viewed as complementary exploitation that results in net benefits for each partner (Flatt and Weisser 2000). Many aphid species are partners in mutualistic relationships with several ant taxa (Flatt and Weisser 2000). The degree of this mutualism can be either obligate or facultative depending on several ecological and physiological factors

Fire Ants

1985 words - 8 pages areas depends on many factors: the existing level of fire ant population, climate, competition, and natural predators . In areas where other ant populations are well established and an abundance of natural enemies exist, colony establishment is hindered because of the threat to the queen and the competition for resources. Man and his need for cleared land has created open sunny areas free of natural enemies and fewer competitors and

TLBO ALgorithms and Optimization

977 words - 4 pages fitness function. There are many EAs available viz. Genetic Algorithm (GA) [1] , Artificial Immune Algorithm (AIA) [2], Ant Colony Optimization (ACO) [3], Particle Swarm Optimization (PSO) [4], Differential Evolution (DE) [5, 6], Harmony Search (HS) [7], Bacteria Foraging Optimization (BFO) [8], Shuffled Frog Leaping (SFL) [9], Artificial Bee Colony (ABC) [10, 11], Biogeography-Based Optimization (BBO) [12], Gravitational Search Algorithm (GSA) [13

Smart Grid Benefits

1877 words - 8 pages pricing, and serious peak rebates. It also includes direct load control applications which offer the ability for power companies to set air conditioners and water heaters on and off during periods of peak demand in exchange for an economical motivation and reduce electric bills. The electric power industry considers demand response applications as an increasingly valuable resource option whose abilities and potential effects are expanded by grid

Energy Management Systems

2524 words - 11 pages , Energy Management Systems are used to analyse and operate the transmission power system. On the other hand, in distribution operations, Distribution Management Systems are used for analysing and operating the distribution system. Market: The markets are where grid services are bought and sold, exchanging price and balancing supply and demand within the power system. The the Market is connected to the Operations domain where control takes place, the

Six week Ant Study and Observations

668 words - 3 pages categories to include sleep/rest time viewed during my observation period which was usually around twelve noon each week on Wednesday. These measures taken produced a common schema of these particular common nine reddish colored ants and denoted that their activities had a common collective goal for the greater good of their community (colony).Due to the very limited and structure natural observation viewing schedule the data that has been collected is

Similar Essays

Advanced Adaptive Particle Swarm Optimization Based Svc Controller For Power System Stability

1240 words - 5 pages ant colony approach for clustering,’ Analytica Chimica Acta Vol. 509(2): pp.187-195, 2004 [11] Shah-Hosseini, H. (2009) ‘The intelligentwater drops algorithm: a nature-inspired swarm-based optimisation algorithm’, Int. J.Bio-Inspired Computation, Vol. 1, Nos. 1/2, pp.71–79. [12] Wang Meihong, Zeng Wenhua*, Wu Keqing. Grid task scheduling based on advanced no velocity PSO’. [13] Herby Dallard and Sarah S. Lam ‘Solving the Orienteering Problem

Evolutionary Programming Technique For Voltage Control

3081 words - 13 pages graphical optimization problem. Many published papers have presented the application of Ant Colony Algorithm as an optimization technique in power system [21-22]. Reference [23] presents the application of Ant Colony Optimization (ACO) technique for searching the optimal point of maximum loadability point at a load bus. From this research, the advantage of Ant Colony Optimization (ACO) over Evolutionary Programming (EP) and Automatic Voltage

Electrical Distribution Networks Essay

1846 words - 8 pages matroid theory and developed a GA approach to minimize power losses in distribution networks. Zhang et al. [13] introduced a Tabu search algorithm to find minimum loss configuration in large-scale EDSs. In Ref. [16] Ant colony optimization algorithm is deployed to solve the problem for the minimum loss configuration. There are also some other research works designed on hybrid EA reconfiguration optimizers such as PSO and shuffled frog leaping

Biologically Inspired Qo S Aware Routing Protocol To Optimize Lifetime In Sensor Networks

3126 words - 13 pages for load balancing in mobile ad hoc networks”, International Journal of Computer Applications, 2012, Vol. 39, No. 5. [25] Kwang-Seon Yoo, Seog-Young Han, “A modified ant colony optimization for dynamic topology optimization”, International Journal of Computers and Structures, 2013, Vol. 123, pp. 68-78. [26] Bibash Roy, Suman Banik, Parthi Dey, Sugata Sanyal, Nabendu Cahki, “Ant colony based routing for mobile ad-hoc networks towards improved