Power distribution network expansion scheduling using dynamic programming genetic algorithm

Access Full Text

Power distribution network expansion scheduling using dynamic programming genetic algorithm

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Generation, Transmission & Distribution — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© The Institution of Engineering and Technology
Published

A genetic algorithm that is dedicated to the expansion planning of electric distribution systems is presented, with incremental expansion scheduling along a time horizon of several years and treated as a dynamic programming problem. Such a genetic algorithm (called dynamic programming genetic algorithm) is endowed with problem-specific crossover and mutation operators, dealing with the problem through a heuristic search in the space of dynamic programming variables. Numerical tests have shown that the proposed algorithm has found good solutions that considerably enhance the solutions found by non-dynamic programming methods. The algorithm has also shown to work for problem sizes that would be computationally infeasible for exact dynamic programming techniques.

Inspec keywords: genetic algorithms; scheduling; dynamic programming; power distribution planning

Other keywords: mutation operator; genetic algorithm; dynamic programming; electric distribution system planning; power distribution network expansion scheduling

Subjects: Distribution networks; Optimisation techniques; Power system planning and layout

References

    1. 1)
      • T.S.T. Mak , K.P. Lam . Equivalence-set genes partitioning using an evolucionary-DP approach. IEEE Trans. Nano Biosciense , 295 - 300
    2. 2)
    3. 3)
    4. 4)
    5. 5)
      • S. Ćurčić , G. Strbac , X.-P. Zhang . Effect of losses in design of distribution circuits. IEE Proc., Gener. Transm. Distrib. , 343 - 349
    6. 6)
    7. 7)
      • D.P. Bertsekas . (1985) Dynamic programming – deterministic and stochastic models.
    8. 8)
    9. 9)
      • I. Ramirez-Rosado , J. Bernal-Agustín . Genetic algorithms applied to the design of large power distribution systems. IEEE Trans. Power Syst. , 696 - 702
    10. 10)
      • Baker, J.E.: `Reducing bias and inefficiency in the selection algorithm', Proc. Int. Conf. Genetic Algorithms, 1987, Massachusetts, US, p. 14–21.
    11. 11)
    12. 12)
    13. 13)
    14. 14)
    15. 15)
      • R. Bellman . (1957) Dynamic programming.
    16. 16)
    17. 17)
    18. 18)
    19. 19)
    20. 20)
      • P.M.S. Carvalho , L.A.F.M. Ferreira , F.G. Lobo , L.M.F. Barruncho . Optimal distribution network expansion planning under uncertainty by evolutionary decision convergence. Electr. Power Energy Syst. , 125 - 129
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-gtd_20070174
Loading

Related content

content/journals/10.1049/iet-gtd_20070174
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading