Advertisement
Published in:
2010 | OriginalPaper | Chapter
Algorithms for Finding Optimal Flows in Dynamic Networks
Author : Maria Fonoberova
Published in: Handbook of Power Systems II
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
This article presents an approach for solving some power systems problems by using optimal dynamic flow problems. The classical optimal flow problems on networks are extended and generalized for the cases of nonlinear cost functions on arcs, multicommodity flows, and time- and flow-dependent transactions on arcs of the network. All parameters of networks are assumed to be dependent on time. The algorithms for solving such kind of problems are developed by using special dynamic programming techniques based on the time-expanded network method together with classical optimization methods.