Analysis of Crowding Population Based Ant Colony Optimization for Service Restoration Problem in Distribution System
Abstract
The crowding population based ant colony optimization algorithm (CP-ACO) uses a different pheromone update in comparison to other ACO algorithms. In this paper, crowding population based ant colony optimization algorithm is proposed to solve service restoration problem. The most notable achievement featured in this paper is run time reduction of algorithm to solve the service restoration task. The results on three test systems show the prominent efficiency of CP-ACO algorithm.
Keywords: Non dominated sorting; crowding population based ant colony optimization; priority customers; service restoration
Full Text:
PDFDOI: https://doi.org/10.26483/ijarcs.v4i2.1519
Refbacks
- There are currently no refbacks.
Copyright (c) 2016 International Journal of Advanced Research in Computer Science

