Power distribution network expansion scheduling using dynamic programming genetic algorithm

2008 ◽  
Vol 2 (3) ◽  
pp. 444 ◽  
Author(s):  
E.G. Carrano ◽  
R.T.N. Cardoso ◽  
R.H.C. Takahashi ◽  
C.M. Fonseca ◽  
O.M. Neto
2013 ◽  
Vol 22 (06) ◽  
pp. 1350041 ◽  
Author(s):  
CHEN LIAO ◽  
JIA WANG ◽  
SHIYAN HU

The reliability of power distribution network is important. For high reliability, it is necessary for some nodes to have backup connections to other feeders in the network. The substation operator wants to expand the network such that some nodes have k redundant connection lines (i.e., k redundancy) in case the current feeder line does not work. The corporation is given this task to design the expansion planning to construct new connection lines. The substation operator will choose the minimum charged k redundant connection lines based on both of the existing network and the expansion network, which is designed by the corporation. The existing network has the cost for the redundant connection due to the operational expense. The corporation proposes the design with its own price, which may include the operational expense and the construction expense. Thus, for the corporation, how to assign the low price on the connection lines while maximizing the revenue becomes a Stackelberg minimum weight k-star game for the power distribution network expansion. A heuristic algorithm is proposed to solve this Stackelberg minimum weight k-star game for the power distribution network expansion, using three heuristic rules for price setting in a scenario by scenario fashion. The experimental results show that the proposed algorithm always outperforms the greedy algorithm which is natural to k-star game in terms of corporation revenue. Compared to the greedy algorithm, the proposed algorithm improves up to 60.7% in the corporation revenue in the chosen minimum weight k-star, which is the minimum charged k connection lines. The average improvement is 7.5%. This effectively handles k redundancy in the power distribution network expansion while maximizing the corporation revenue.


2021 ◽  
Vol 13 (14) ◽  
pp. 7760
Author(s):  
Urooj Javed ◽  
Saif Ullah ◽  
Muhammad Imran ◽  
Asif Iqbal Malik ◽  
Nokhaiz Tariq Khan

Planning the power distribution network is critical and challenging; the main challenges include the multiple costs involved, selecting the appropriate locations of different nodes of the network at minimal cost, and minimizing the cost of energy loss for both the primary and secondary networks. Literature on the power distribution network presents different approaches, however, lacks to address the several issues of the complex power distribution networks and many aspects are yet to be explored; for example, the uncertain cost of energy loss. This study intends to address the gaps in the literature by proposing a four-phased approach. In doing so, first, an integer linear programming model is formulated with the objective of cost minimization. Secondly, fuzzy variables are used to tackle the parameters with uncertainty; cost of energy loss. In the third phase, a fine-tuned genetic algorithm (FT-GA) that uses the Taguchi Orthogonal Array is introduced to solve the mathematical model. It is worth mentioning that during the design of the experiment, the input parameters are crossover rate, elite count, and population size. In the last phase, a pragmatic approach is adopted and a Pakistan-based case study is used to validate the proposed model and its implication in real-life scenarios. The results exhibit that our proposed approach outperforms traditional methods like the genetic algorithm (GA) and inter-point methods in terms of fitness function value, number of generations, and computational time. This research contributes at both theoretical and managerial levels and may help decision-makers to design networks more efficiently and cost-effectively in Pakistan, Asia, and beyond.


Sign in / Sign up

Export Citation Format

Share Document