Skip to main content
Top
Published in: Energy Systems 3/2017

13-10-2016 | Original Paper

An economic dispatch algorithm for congestion management of smart power networks

An oblivious routing approach

Authors: Kianoosh G. Boroojeni, M. Hadi Amini, S. S. Iyengar, Mohsen Rahmani, Panos M. Pardalos

Published in: Energy Systems | Issue 3/2017

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

We present a novel oblivious routing economic dispatch (ORED) algorithm for power systems. The method is inspired by the oblivious network design which works perfectly for networks in which different sources (generators) send power flow toward their destinations (load points) while they are unaware of the current network state and other flows. Basically, our focus is on the economic dispatch while managing congestion and mitigating power losses. Furthermore, we studied a loss-minimizing type of the economic dispatch which aims to minimize the emission by optimizing the total power generation rather than system cost. Comparing to state-of-the-art economic dispatch methods, our algorithm is independent of network topology and works for both radial and non-radial networks. Our algorithm is thus suited for large-scale economic dispatch problems that will emerge in the future smart distribution grids with host of small, decentralized, and flexibly controllable prosumers; i.e., entities able to consume and produce electricity. The effectiveness of the proposed ORED is evaluated via the IEEE 57-bus standard test system. The simulation results verify the superior performance of the proposed method over the current methods in the literature in terms of congestion management and power loss minimization.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Appendix
Available only for authorised users
Footnotes
1
Asymptotic analysis is a method of describing limiting behaviors of functions. Assuming that f(n) and g(n) are two functions defined on some subset of the real numbers, \(f(n)=O(g(n))\) if there exists constants c and N such that \(f(n)\le cg(n)\) for all \(n>N\). In this definition, g(n) is called an asymptotic high-threshold (upper-bound) for f(n), or f(n) is called to be asymptotically bounded to g(n).
 
2
As this paper focuses on the novel method for solving the economic dispatch problem, we assume the throughput of the generator to be deterministic. This way, the method can be illustrated more clearly.
 
3
Diameter of a graph is defined as the maximum distance between any pair of nodes in the graph.
 
4
Partition of set A is a set of A subsets \(\{A_i|i\in [1,k]\}\) such that \(\bigcup \nolimits _{i=1}^k A_i = A\), \(\forall i\in [1,k]:A_i\ne \emptyset \), and \(\forall i\ne j: A_i\cap A_j = \emptyset \).
 
5
The distance \(d_{\mathcal {G}}(u,v)\) between nodes uv is defined as the length of shortest path between u and v in \(\mathcal {G}\). The length of a path in a weighted graph is defined as the total weight of the edges participating in the path.
 
6
Set \(B_{\mathcal {G}}(v,r)\in V\) is called a ball of center \(v\in V\) of radius r if \(u\in B_{\mathcal {G}}(v,r)\) iff \(d_{\mathcal {G}}(u,v)\le r\).
 
7
Permutation \(\pi \) on finite set A of size n is a one-to-one and onto function mapping set \(\{1,2,\ldots ,n\}\) to set A.
 
8
In this paper, path of a graph is considered as a simple path and represented by a subset of edge set E such that there exist a permutation of edges in a path where the first edge is incident to the start node of the path, each two consecutive edges are incident to a common node, and the last edge is incident to the end node of the path.
 
Literature
1.
go back to reference Kar, S., Hug, G., Mohammadi, J., Moura, J.M.F.: Distributed state estimation and energy management in smart grids: a consensus+ innovations approach. IEEE Trans. Select. Topics Signal Process. 8(6), 1022–1038 (2014)CrossRef Kar, S., Hug, G., Mohammadi, J., Moura, J.M.F.: Distributed state estimation and energy management in smart grids: a consensus+ innovations approach. IEEE Trans. Select. Topics Signal Process. 8(6), 1022–1038 (2014)CrossRef
2.
go back to reference U.S. Department of Energy: The Smart Grid: An Introduction. (2008) U.S. Department of Energy: The Smart Grid: An Introduction. (2008)
3.
go back to reference Zidan, A., El-Saadany, E.F.: A cooperative multi-agent framework for self-healing mechanisms in distribution systems. IEEE Trans. Smart Grid 3(3), 1525–1539 (2012)CrossRef Zidan, A., El-Saadany, E.F.: A cooperative multi-agent framework for self-healing mechanisms in distribution systems. IEEE Trans. Smart Grid 3(3), 1525–1539 (2012)CrossRef
4.
go back to reference Brown, R.E.: Impact of smart grid on distribution system design. In: Proceedings of IEEE Power and Energy Society General Meeting, pp. 1–4, Pittsburgh, PA (2008) Brown, R.E.: Impact of smart grid on distribution system design. In: Proceedings of IEEE Power and Energy Society General Meeting, pp. 1–4, Pittsburgh, PA (2008)
5.
go back to reference Chowdhury, B.H., Rahman, S.: A review of recent advances in economic dispatch. IEEE Trans. Power Syst. 5(4), 1248–1259 (1990)MathSciNetCrossRef Chowdhury, B.H., Rahman, S.: A review of recent advances in economic dispatch. IEEE Trans. Power Syst. 5(4), 1248–1259 (1990)MathSciNetCrossRef
6.
go back to reference Pappu, V., Carvalho, M., Pardalos, P.: Optimization and Security Challenges in Smart Power Grids. Springer, New York (2013)CrossRef Pappu, V., Carvalho, M., Pardalos, P.: Optimization and Security Challenges in Smart Power Grids. Springer, New York (2013)CrossRef
7.
go back to reference Zhu, J.: Optimization of Power System Operation. Wiley, Amsterdam (2014) Zhu, J.: Optimization of Power System Operation. Wiley, Amsterdam (2014)
8.
go back to reference Padhy, N.: Unit commitment: a bibliographical survey. IEEE Trans. Power Syst. 19(2), 1196–1205 (2004)CrossRef Padhy, N.: Unit commitment: a bibliographical survey. IEEE Trans. Power Syst. 19(2), 1196–1205 (2004)CrossRef
9.
go back to reference Selvakumar, A.I., Thanushkodi, K.: A new particle swarm optimization solution to nonconvex economic dispatch problems. IEEE Trans. Power Syst. 22(1), 42–51 (2007)CrossRef Selvakumar, A.I., Thanushkodi, K.: A new particle swarm optimization solution to nonconvex economic dispatch problems. IEEE Trans. Power Syst. 22(1), 42–51 (2007)CrossRef
10.
go back to reference Amini, M.H., Nabi, B., Haghifam, M.-R.: Load management using multi-agent systems in smart distribution network. In: Proceedings of IEEE Power and Energy Society General Meeting, Vancouver, BC, Canada, pp. 1–5 (2013) Amini, M.H., Nabi, B., Haghifam, M.-R.: Load management using multi-agent systems in smart distribution network. In: Proceedings of IEEE Power and Energy Society General Meeting, Vancouver, BC, Canada, pp. 1–5 (2013)
11.
go back to reference Lavaei, J., Tse, D., Zhang, B.: Geometry of power flows and optimization in distribution networks. IEEE Trans. Power Syst. 29(2), 572–583 (2014)CrossRef Lavaei, J., Tse, D., Zhang, B.: Geometry of power flows and optimization in distribution networks. IEEE Trans. Power Syst. 29(2), 572–583 (2014)CrossRef
12.
go back to reference Sanjari, M.J., Karami, H., Gooi, H.B.: Micro-generation dispatch in a smart residential multi-carrier energy system considering demand forecast error. Energy Convers. Manag. 120, 90–99 (2016)CrossRef Sanjari, M.J., Karami, H., Gooi, H.B.: Micro-generation dispatch in a smart residential multi-carrier energy system considering demand forecast error. Energy Convers. Manag. 120, 90–99 (2016)CrossRef
13.
go back to reference Kellerer, E., Steinke, F.: Scalable economic dispatch for smart distribution networks. IEEE Trans. Power Syst. 99, 1–8 (2014) Kellerer, E., Steinke, F.: Scalable economic dispatch for smart distribution networks. IEEE Trans. Power Syst. 99, 1–8 (2014)
14.
go back to reference Carrion, M., Arroyo, J.: A computationally efficient mixed-integer linear formulation for the thermal unit commitment problem. IEEE Trans. Power Syst. 21(3), 1371–1378 (2006)CrossRef Carrion, M., Arroyo, J.: A computationally efficient mixed-integer linear formulation for the thermal unit commitment problem. IEEE Trans. Power Syst. 21(3), 1371–1378 (2006)CrossRef
15.
go back to reference Botterud, A., Zhi, Z., Wang, J., et al.: Demand dispatch and probabilistic wind power forecasting in unit commitment and economic dispatch: a case study of Illinois. IEEE Trans. Sustain. Energy 4(1), 250–261 (2012)CrossRef Botterud, A., Zhi, Z., Wang, J., et al.: Demand dispatch and probabilistic wind power forecasting in unit commitment and economic dispatch: a case study of Illinois. IEEE Trans. Sustain. Energy 4(1), 250–261 (2012)CrossRef
16.
go back to reference Li, Z., Guo, Q., Sun, H., Wang, J.: Sufficient conditions for exact relaxation of complementarity constraints for storage-concerned economic dispatch. IEEE Trans. Power Syst. 99, 1–2 (2015) Li, Z., Guo, Q., Sun, H., Wang, J.: Sufficient conditions for exact relaxation of complementarity constraints for storage-concerned economic dispatch. IEEE Trans. Power Syst. 99, 1–2 (2015)
17.
go back to reference Khator, S.K., Leung, L.C.: Power distribution planning: a review of models and issues. IEEE Trans. Power Syst. 12(3), 1151–1159 (1997)CrossRef Khator, S.K., Leung, L.C.: Power distribution planning: a review of models and issues. IEEE Trans. Power Syst. 12(3), 1151–1159 (1997)CrossRef
18.
go back to reference Liu, Y., Ul Hassan, N., Huang, S., Yuen, C.: Electricity cost minimization for a residential smart grid with distributed generation and bidirectional power transactions. IEEE Innovat. Smart Grid Technol. (ISGT), pp. 1–6, Washington, DC (2013) Liu, Y., Ul Hassan, N., Huang, S., Yuen, C.: Electricity cost minimization for a residential smart grid with distributed generation and bidirectional power transactions. IEEE Innovat. Smart Grid Technol. (ISGT), pp. 1–6, Washington, DC (2013)
19.
go back to reference Papavasiliou, A., Oren, S.S.: Supplying renewable energy to deferrable loads: algorithms and economic analysis. In: Proceedings of IEEE Power and Energy Society General Meeting, pp. 1–8, Minneapolis, MN (2010) Papavasiliou, A., Oren, S.S.: Supplying renewable energy to deferrable loads: algorithms and economic analysis. In: Proceedings of IEEE Power and Energy Society General Meeting, pp. 1–8, Minneapolis, MN (2010)
20.
go back to reference Boroojeni, K.G., et al.: Optimal two-tier forecasting power generation model in smart grids. Int. J. Inf. Process. 8(4), 79–88 (2014) Boroojeni, K.G., et al.: Optimal two-tier forecasting power generation model in smart grids. Int. J. Inf. Process. 8(4), 79–88 (2014)
21.
go back to reference Iyengar, S.S., Boroojeni, K.G.: Oblivious Network Routing: Algorithms and Applications. MIT Press, New York (2015)MATH Iyengar, S.S., Boroojeni, K.G.: Oblivious Network Routing: Algorithms and Applications. MIT Press, New York (2015)MATH
22.
go back to reference Gupta, A., Hajiaghayi, M.T., Racke, H.: Oblivious network design. In: SODA 06: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithm. New York, NY, USA: ACM, pp. 970–979 (2006) Gupta, A., Hajiaghayi, M.T., Racke, H.: Oblivious network design. In: SODA 06: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithm. New York, NY, USA: ACM, pp. 970–979 (2006)
23.
go back to reference Maknouninejad, A., Lin, W., Harno, H.G., Qu, Z., Simaan, M.A.: Cooperative control for self-organizing microgrids and game strategies for optimal dispatch of distributed renewable generations. Energy Syst. 3(1), 23–60 (2012)CrossRef Maknouninejad, A., Lin, W., Harno, H.G., Qu, Z., Simaan, M.A.: Cooperative control for self-organizing microgrids and game strategies for optimal dispatch of distributed renewable generations. Energy Syst. 3(1), 23–60 (2012)CrossRef
24.
go back to reference Tuffaha, M., Gravdahl, J.T.: Discrete state-space model to solve the unit commitment and economic dispatch problems. Energy Syst. pp. 1–23, in Press (2016) Tuffaha, M., Gravdahl, J.T.: Discrete state-space model to solve the unit commitment and economic dispatch problems. Energy Syst. pp. 1–23, in Press (2016)
25.
go back to reference Frank, S., Rebennack, S.: An introduction to optimal power flow: theory, formulation, and examples. IIE Trans. to appear (2016) Frank, S., Rebennack, S.: An introduction to optimal power flow: theory, formulation, and examples. IIE Trans. to appear (2016)
26.
go back to reference Nolden, C., Schönfelder, M., Eßer-Frey, A., Bertsch, V., Fichtner, W.: Network constraints in techno-economic energy system models: towards more accurate modeling of power flows in long-term energy system models. Energy Syst. 4(3), 267–287 (2013)CrossRef Nolden, C., Schönfelder, M., Eßer-Frey, A., Bertsch, V., Fichtner, W.: Network constraints in techno-economic energy system models: towards more accurate modeling of power flows in long-term energy system models. Energy Syst. 4(3), 267–287 (2013)CrossRef
27.
go back to reference Kargarian, A., Mohammadi, J., Guo, J., Chakrabarti, S., Barati, M., Hug, G., Kar, S., Baldick, R.: Toward distributed/decentralized DC optimal power flow implementation in future electric power systems. IEEE Trans Smart Grid (2016, to appear) Kargarian, A., Mohammadi, J., Guo, J., Chakrabarti, S., Barati, M., Hug, G., Kar, S., Baldick, R.: Toward distributed/decentralized DC optimal power flow implementation in future electric power systems. IEEE Trans Smart Grid (2016, to appear)
28.
go back to reference Rebennack, S., Flach, B., Pereira, M.V.F., Pardalos, P.M.: Stochastic hydro-thermal scheduling under CO2 emissions constraints. IEEE Trans. Power Syst. 27(1), 58–68 (2012)CrossRef Rebennack, S., Flach, B., Pereira, M.V.F., Pardalos, P.M.: Stochastic hydro-thermal scheduling under CO2 emissions constraints. IEEE Trans. Power Syst. 27(1), 58–68 (2012)CrossRef
29.
go back to reference Shortle, J., et al.: Transmission-capacity expansion for minimizing blackout probabilities. IEEE Trans. Power Syst. 29(1), 43–52 (2014)CrossRef Shortle, J., et al.: Transmission-capacity expansion for minimizing blackout probabilities. IEEE Trans. Power Syst. 29(1), 43–52 (2014)CrossRef
31.
go back to reference Kumar, A., Gupta, A., Roughgarden, T.: Simpler and better approximation algorithms for network design. In: Proceedings of the 35th STOC, pp. 365–372 (2003) Kumar, A., Gupta, A., Roughgarden, T.: Simpler and better approximation algorithms for network design. In: Proceedings of the 35th STOC, pp. 365–372 (2003)
32.
go back to reference Bartal, Y.: On approximating arbitrary metrics by tree metrics. In: Proceedings of the 30th STOC, pp. 161–168 (1998) Bartal, Y.: On approximating arbitrary metrics by tree metrics. In: Proceedings of the 30th STOC, pp. 161–168 (1998)
33.
go back to reference Alman, F.S.S., Heriyan, J.C., Avi, R.R., Ubramanian, S.S.: Approximating the single-sink link-installation problem in network design. SIAM J. Optim. 11, 595–610 (2000)MathSciNetCrossRef Alman, F.S.S., Heriyan, J.C., Avi, R.R., Ubramanian, S.S.: Approximating the single-sink link-installation problem in network design. SIAM J. Optim. 11, 595–610 (2000)MathSciNetCrossRef
34.
go back to reference Arger, D.R.K., Inkoff, M.M.: Building Steiner trees with incomplete global knowledge. In: Proceedings of the 41st FOCS, pp. 613–623 (2000) Arger, D.R.K., Inkoff, M.M.: Building Steiner trees with incomplete global knowledge. In: Proceedings of the 41st FOCS, pp. 613–623 (2000)
35.
go back to reference Uha, S.G., Eyerson, A.M., Ungala, K.M.: Hierarchical placement and network design problems. In: Proceeding of the 41st FOCS, pp. 603–612 (2000) Uha, S.G., Eyerson, A.M., Ungala, K.M.: Hierarchical placement and network design problems. In: Proceeding of the 41st FOCS, pp. 603–612 (2000)
36.
go back to reference Uha, S.G., Eyerson, A.M., Ungala, K.M.: A constant factor approximation for the single sink edge installation problem. In: Proceedings of the 33rd STOC, pp. 383–388 (2001) Uha, S.G., Eyerson, A.M., Ungala, K.M.: A constant factor approximation for the single sink edge installation problem. In: Proceedings of the 33rd STOC, pp. 383–388 (2001)
37.
go back to reference Eyerson, A.M., Ungala, K.M., Lotkin, S.A.P.: Cost-distance: two metric network design. In: Proceedings of the 41st FOCS, pp. 624–630 (2000) Eyerson, A.M., Ungala, K.M., Lotkin, S.A.P.: Cost-distance: two metric network design. In: Proceedings of the 41st FOCS, pp. 624–630 (2000)
38.
go back to reference Rebennack, S., Nahapetyan, A., Pardalos, P.M.: Bilinear modeling solution approach for fixed charge network flow problems. Optim. Lett. 3(3), 347–355 (2009)MathSciNetCrossRefMATH Rebennack, S., Nahapetyan, A., Pardalos, P.M.: Bilinear modeling solution approach for fixed charge network flow problems. Optim. Lett. 3(3), 347–355 (2009)MathSciNetCrossRefMATH
39.
go back to reference Srinivasagopalan, S., Busch, C., Iyengar, S.S.: An oblivious spanning tree for single-sink buy-at-bulk in low doubling-dimension graphs. IEEE Trans. Comput. 61(5), 700–712 (2012)MathSciNetCrossRef Srinivasagopalan, S., Busch, C., Iyengar, S.S.: An oblivious spanning tree for single-sink buy-at-bulk in low doubling-dimension graphs. IEEE Trans. Comput. 61(5), 700–712 (2012)MathSciNetCrossRef
40.
go back to reference Kumar, A., Gupta, A., Roughgarden, T.: Approximations via cost-sharing: a simple approximation algorithm for the multicommodity rent-or-buy problem. In: Proceedings of the 44th FOCS, pp. 606–615 (2003) Kumar, A., Gupta, A., Roughgarden, T.: Approximations via cost-sharing: a simple approximation algorithm for the multicommodity rent-or-buy problem. In: Proceedings of the 44th FOCS, pp. 606–615 (2003)
41.
go back to reference Garg, N., Khandekar, R., Konjevod, G., Ravi, R., Salman, F.S., Sinha, A.: On the integrality gap of a natural formulation of the single-sink buy-at-bulk network design formulation. In: Proceedings of the 8th IPCO, pp. 170–184 (2001) Garg, N., Khandekar, R., Konjevod, G., Ravi, R., Salman, F.S., Sinha, A.: On the integrality gap of a natural formulation of the single-sink buy-at-bulk network design formulation. In: Proceedings of the 8th IPCO, pp. 170–184 (2001)
42.
go back to reference Charikar, M., Karagiozova, A.: On non-uniform multicommodity buy-at-bulk network design. In: Proceedings of the 37th STOC, pp. 176–182 (2005) Charikar, M., Karagiozova, A.: On non-uniform multicommodity buy-at-bulk network design. In: Proceedings of the 37th STOC, pp. 176–182 (2005)
43.
go back to reference Alwar, K.T.: Single-sink buy-at-bulk LP has constant integrality gap. In: Proceedings of the 9th IPCO, pp. 475–486 (2002) Alwar, K.T.: Single-sink buy-at-bulk LP has constant integrality gap. In: Proceedings of the 9th IPCO, pp. 475–486 (2002)
44.
go back to reference Kumar, A., Gupta, A., Roughgarden, T.: A constant-factor approximation algorithm for the multicommodity rent-or-buy problem. In: Proceedings of the 43rd FOCS, pp. 333–342 (2002) Kumar, A., Gupta, A., Roughgarden, T.: A constant-factor approximation algorithm for the multicommodity rent-or-buy problem. In: Proceedings of the 43rd FOCS, pp. 333–342 (2002)
45.
go back to reference Werbuch, B.A., Zar, Y.A.: Buy-at-bulk network design. In: Proceedings of the 38th FOCS, pp. 542–547 (1997) Werbuch, B.A., Zar, Y.A.: Buy-at-bulk network design. In: Proceedings of the 38th FOCS, pp. 542–547 (1997)
46.
go back to reference Frank, S., Steponavice, I., Rebennack, S.: Optimal power flow: a bibliographic survey I: formulations and deterministic methods. Energy Syst. 3(3), 221–258 (2012)CrossRef Frank, S., Steponavice, I., Rebennack, S.: Optimal power flow: a bibliographic survey I: formulations and deterministic methods. Energy Syst. 3(3), 221–258 (2012)CrossRef
47.
go back to reference Frank, S., Steponavice, I., Rebennack, S.: Optimal power flow: a bibliographic survey II: non-deterministic and hybrid methods. Energy Syst. 3(3), 259–289 (2012)CrossRef Frank, S., Steponavice, I., Rebennack, S.: Optimal power flow: a bibliographic survey II: non-deterministic and hybrid methods. Energy Syst. 3(3), 259–289 (2012)CrossRef
48.
go back to reference Amini, M.H., et al.: Distributed security constrained economic dispatch. IEEE Innovative Smart Grid Technologies-Asia (ISGT ASIA) (2015) Amini, M.H., et al.: Distributed security constrained economic dispatch. IEEE Innovative Smart Grid Technologies-Asia (ISGT ASIA) (2015)
49.
go back to reference Wood, A.J., Wollenberg, B.F.: Power Generation, Operation, and Control. Wiley, Amsterdam (2012) Wood, A.J., Wollenberg, B.F.: Power Generation, Operation, and Control. Wiley, Amsterdam (2012)
50.
go back to reference Fakcharoenphol, J., Rao, S.B., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. In: Proceedings of the 35th STOC, pp. 448–455 (2003) Fakcharoenphol, J., Rao, S.B., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. In: Proceedings of the 35th STOC, pp. 448–455 (2003)
51.
go back to reference MATLAB version 8.5. Miami, Florida: The MathWorks Inc. (2015) MATLAB version 8.5. Miami, Florida: The MathWorks Inc. (2015)
52.
go back to reference Abdollahi, A., Moghaddam, M.P., Rashidinejad, M., Sheikh-El-Eslami, M.K.: Investigation of economic and environmental-driven demand response measures incorporating UC. IEEE Trans. Smart Grids 3(1), 12–25 (2012)CrossRef Abdollahi, A., Moghaddam, M.P., Rashidinejad, M., Sheikh-El-Eslami, M.K.: Investigation of economic and environmental-driven demand response measures incorporating UC. IEEE Trans. Smart Grids 3(1), 12–25 (2012)CrossRef
54.
go back to reference Zimmerman, R.D., Murillo-Sanchez, C.E., Thomas, R.J.: MATPOWER: Steady-state operations, planning and analysis tools for power systems research and education. IEEE Trans. Power Syst. 26(1), 12–19 (2011)CrossRef Zimmerman, R.D., Murillo-Sanchez, C.E., Thomas, R.J.: MATPOWER: Steady-state operations, planning and analysis tools for power systems research and education. IEEE Trans. Power Syst. 26(1), 12–19 (2011)CrossRef
Metadata
Title
An economic dispatch algorithm for congestion management of smart power networks
An oblivious routing approach
Authors
Kianoosh G. Boroojeni
M. Hadi Amini
S. S. Iyengar
Mohsen Rahmani
Panos M. Pardalos
Publication date
13-10-2016
Publisher
Springer Berlin Heidelberg
Published in
Energy Systems / Issue 3/2017
Print ISSN: 1868-3967
Electronic ISSN: 1868-3975
DOI
https://doi.org/10.1007/s12667-016-0224-6

Other articles of this Issue 3/2017

Energy Systems 3/2017 Go to the issue