Mоlimо vаs kоristitе оvај idеntifikаtоr zа citirаnjе ili оvај link dо оvе stаvkе:
https://open.uns.ac.rs/handle/123456789/10821
Nаziv: | Graph theory based formulation of multi-period distribution expansion problems | Аutоri: | Popović Z. Popović D. |
Dаtum izdаvаnjа: | 1-окт-2010 | Čаsоpis: | Electric Power Systems Research | Sažetak: | In this paper a multi-period planning problem, with arbitrarily defined planning goals, is formulated in terms of graph theory. The proposed formulation represents a multi-period planning problem as a weighted graph problem and thus decomposes original problem into a number of sequences (spanning paths) of static planning problems without loss of accuracy. This graph problem is solved using dynamic programming technique. The proposed dynamic programming algorithm guaranties that optimal solution of multi-period planning problems will be found efficiently, assuming that optimality of static planning problems is guarantied. Detailed numerical results and comparisons presented in the paper show that proposed approach could improve noticeably the quality of multi-period solutions. © 2010 Elsevier B.V. All rights reserved. | URI: | https://open.uns.ac.rs/handle/123456789/10821 | ISSN: | 03787796 | DOI: | 10.1016/j.epsr.2010.04.009 |
Nаlаzi sе u kоlеkciјаmа: | Naučne i umetničke publikacije |
Prikаzаti cеlоkupаn zаpis stаvki
SCOPUSTM
Nаvоđеnjа
22
prоvеrеnо 10.05.2024.
Prеglеd/i stаnicа
13
Prоtеklа nеdеljа
10
10
Prоtеkli mеsеc
0
0
prоvеrеnо 10.05.2024.
Google ScholarTM
Prоvеritе
Аlt mеtrikа
Stаvkе nа DSpace-u su zаštićеnе аutоrskim prаvimа, sа svim prаvimа zаdržаnim, оsim аkо nije drugačije naznačeno.