Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
Models of Strategic Bidding in Electricity Markets Under Network Constraints Read chapter Read first chapter

2012 | OriginalPaper | Chapter

An Approximate Dynamic Programming Algorithm for the Allocation of High-Voltage Transformer Spares in the Electric Grid

Authors : Johannes Enders, Warren B. Powell, David Egan

Published in: Handbook of Networks in Power Systems I

Publisher: Springer Berlin Heidelberg

Log in

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

search-config
loading …

Abstract

This paper addresses the problem of allocating high-voltage transformer spares (not installed) throughout the electric grid to mitigate the risk of random transformer failures. With this application we investigate the use of approximate dynamic programming (ADP) for solving large scale stochastic facility location problems. The ADP algorithms that we develop consistently obtain near optimal solutions for problems where the optimum is computable and outperform a standard heuristic on more complex problems. Our computational results show that the ADP methodology can be applied to large scale problems that cannot be solved with exact algorithms.

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!

inform now

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!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

inform now
previous chapter Algorithms and Models for Transmission Expansion Planning
next chapter Decentralized Intelligence in Energy Efficient Power Systems
Literature
1.
Bertsekas D, Tsitsiklis J (1996) Neuro-dynamic programming. Athena Scientific, BelmontMATH
2.
Powell WB, George A, Bouzaiene-Ayari B Simao H (2005) Approximate dynamic programming for high dimensional resource allocation problems. In: Proceedings of the IJCNN, IEEE Press, New York
3.
Birge J, Louveaux F (1997) Introduction to stochastic programming. Springer, New YorkMATH
4.
Kall P, Wallace S (1994) Stochastic programming. Wiley, New YorkMATH
5.
Sen S (2005) Algorithms for stochastic mixed-integer programming models. In: Aardal K, Nemhauser GL, Weismantel R (eds) Handbooks in operations research and management science: discrete optimization. North Holland, Amsterdam
6.
Laporte G, Louveaux FV, van Hamme L (1994) Excact solution to a location problem with stochastic demands. Transp Sci 28(2):95–103CrossRef
7.
8.
Ntaimo L, Sen S (2005) The million-variable “march” for stochastic combinatorial optimization. J Global Optim 32(3):385–400MathSciNetCrossRef
9.
Powell WB, Ruszczyński A, Topaloglu H (2004) Learning algorithms for separable approximations of stochastic optimization problems. Math Oper Res 29(4):814–836MathSciNetCrossRef
10.
Topaloglu H (2001) Dynamic programming approximations for dynamic programming problems. Ph.d. Dissertation, Department of Operations Research and Financial Engineering, Princeton University
11.
Mirchandani PB (1990) The p-median problem and generalizations. In: Mirchandani PB, Francis RL (eds) Discrete location theory. Wiley, New YorkMATH
12.
Labbé M, Peeters D, Thisse J-F (1995) Location on networks. In: Ball M, Magnanti TL, Monma CL, Nemhauser GL (eds) Handbooks in operations research and management science: network routing. Elsevier, Amsterdam
13.
Chowdhury AA, Koval DO (2005) Development of probabilistic models for computing optimal distribution substation spare transformers. IEEE Trans Ind Appl 41(6):1493–1498CrossRef
14.
Kogan VI, Roeger CJ, Tipton DE (1996) Substation distribution transformers failures and spares. IEEE Trans Power Syst 11(4):1905–1912CrossRef
15.
Li W, Vaahedi E, Mansour Y (1999) Determining number and timing of substation spare transformers using a probabilistic cost analysis approach. IEEE Trans Power Deliver 14(3):934–939CrossRef
16.
Godfrey G, Powell WB (2002) An adaptive, dynamic programming algorithm for stochastic resource allocation problems I: single period travel times. Transp Sci 36(1):21–39CrossRef
17.
Topaloglu H, Powell WB (2006) Dynamic programming approximations for stochastic, time-staged integer multicommodity flow problems. Informs J Comput 18(1):31–42MathSciNetCrossRef
18.
Powell WB, Topaloglu H (2004) Fleet management. In: Wallace S, Ziemba W (eds) Applications of stochastic programming, SIAM series in optimization. Math Programming Society, PhiladelphiaMATH
19.
20.
Powell WB (2007) Approximate dynamic programming: solving the curses of dimensionality. Wiley, New YorkCrossRef
21.
Powell WB, Shapiro JA, Simão HP (2002) An adaptive dynamic programming algorithm for the heterogeneous resource allocation problem. Transp Sci 36(2):231–249CrossRef
22.
Powell WB, Van Roy B (2004) Approximate dynamic programming for high dimensional resource allocation problems. In: Si J, Barto AG, Powell WB, Wunsch D II (eds) Handbook of learning and approximate dynamic programming. IEEE Press, New York
23.
Helmberg C (2000) Semidefinite programming for combinatorial optimization. Technical report, Konrad-Zuse-Zentrum fuer Informationstechnik Berlin, Berlin
24.
Godfrey GA, Powell WB (2001) An adaptive, distribution-free approximation for the newsvendor problem with censored demands, with applications to inventory and distribution problems. Manage Sci 47(8):1101–1112CrossRef
25.
Topaloglu H, Powell WB (2003) An algorithm for approximating piecewise linear concave functions from sample gradients. Oper Res Lett 31(1):66–76MathSciNetCrossRef
26.
Chen QM, Egan DM (2006) A bayesian method for transformer life estimation using perks’ hazard function. IEEE Trans Power Syst 21(4):1954–1965CrossRef
Metadata
Title
An Approximate Dynamic Programming Algorithm for the Allocation of High-Voltage Transformer Spares in the Electric Grid
Authors
Johannes Enders
Warren B. Powell
David Egan
Copyright Year
2012
Publisher
Springer Berlin Heidelberg
Book
Handbook of Networks in Power Systems I

Print ISBN: 978-3-642-23192-6

Electronic ISBN: 978-3-642-23193-3

Copyright Year: 2012

DOI
https://doi.org/10.1007/978-3-642-23193-3_17

Premium Partner

    Image Credits