A Cycle-Based Formulation and Valid Inequalities for DC Power Transmission Problems with Switching

Published Online:https://doi.org/10.1287/opre.2015.1471

References

  • Barahona F, Mahjoub AR (1986) On the cut polytope. Math. Program. 36:157–173.CrossrefGoogle Scholar
  • Barrows C, Blumsack S, Bent R (2012) Computationally efficient optimal transmission switching: Solution space reduction. IEEE Power and Energy Soc. General Meeting, 1–8.CrossrefGoogle Scholar
  • Barrows C, Blumsack S, Hines P (2014) Correcting optimal transmission switching for AC power flows. 47th Hawaii Internat. Conf. System Sci. (HICSS) (IEEE, Piscataway, NJ), 2374–2379.Google Scholar
  • Bienstock D, Mattia S (2007) Using mixed-integer programming to solve power grid blackout problems. Discret. Optim. 4(1):115–141.CrossrefGoogle Scholar
  • Blumsack SA (2006) Network topologies and transmission investment under electric-industry restructuring. Unpublished doctoral dissertation, Carnegie Mellon University, Pittsburgh, Pennsylvania.Google Scholar
  • Bollobás B (2002) Modern Graph Theory (Springer, New York).Google Scholar
  • Coffrin C, Hijazi H, Van Hentenryck P, Lehmann K (2014) Primal and dual bounds for optimal transmission switching. Power Systems Comput. Conf. (PSCC) (IEEE, Piscataway, NJ), 1–8.CrossrefGoogle Scholar
  • CPLEX (2011) User’s Manual for CPLEX Version 12.4. IBM.Google Scholar
  • Dolan ED, Moré JJ (2002) Benchmarking optimization software with performance profiles. Math. Program. Ser. A 91:201–213.CrossrefGoogle Scholar
  • Ferreira CE, Martin A, de Souza CC, Weismantel R, Wolsey LA (1996) Formulations and valid inequalities for the node capacitated graph partitioning problem. Math. Program. 74:247–266.CrossrefGoogle Scholar
  • Fisher EB, O’Neill RP, Ferris MC (2008) Optimal transmission switching. IEEE Trans. Power Systems 1346–1355.CrossrefGoogle Scholar
  • Fuller JD, Ramasra R, Cha A (2012) Fast heuristics for transmission-line switching. IEEE Trans. Power Systems 27(3):1377–1386.CrossrefGoogle Scholar
  • Garey MR, Johnson DS (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness (W. H. Freeman & Co., New York).Google Scholar
  • Hariharan R, Kavitha T, Mehlhorn K (2008) Faster algorithms for minimum cycle basis in directed graphs. SIAM J. Comput. 38(4):1430–1447.CrossrefGoogle Scholar
  • Hedman KW, Ferris MC, O’Neill RP, Fisher EB, Oren SS (2010) Co-optimization of generation unit commitment and transmission switching with n − 1 reliability. IEEE Trans. Power Systems 25(2):1052–1063.CrossrefGoogle Scholar
  • Hedman KW, O’Neill RP, Fisher EB, Oren SS (2009) Optimal transmission switching with contingency analysis. IEEE Trans. Power Systems 24(3):1577–1586.CrossrefGoogle Scholar
  • Hedman KW, Oren SS, O’Neill RP (2011) A review of transmission switching and network topology optimization. IEEE Power and Energy Soc. General Meeting, 1–7.CrossrefGoogle Scholar
  • Hijazi H, Coffrin C, Hentenryck PV (2013) Convex quadratic relaxations of nonlinear programs in power systems. Technical report, NICTA.Google Scholar
  • Kavitha T, Liebchen C, Mehlhorn K, Michail D, Rizzi R, Ueckerdt T, Zweig K (2009) Cycle bases in graphs: Characterization, algorithms, complexity, and applications. Comput. Sci. Rev. 3:199–243.CrossrefGoogle Scholar
  • Khodaei A, Shahidehpour M, Kamalinia S (2010) Transmission switching in expansion planning. IEEE Trans. Power Systems 25(3):1722–1733.CrossrefGoogle Scholar
  • Lehmann K, Grastien A, Van Hentenryck P (2014) The complexity of DC-Switching problems. Technical report, NICTA.Google Scholar
  • O’Neill R, Baldick R, Helman U, Rothkopf M, Stewart J (2005) Dispatchable transmission in RTO markets. IEEE Trans. Power Systems 20(1):171–179.CrossrefGoogle Scholar
  • Padberg M (1973) On the facial structure of set packing polyhedra. Math. Program. 5:199–215.CrossrefGoogle Scholar
  • Soroush M, Fuller JD (2014) Accuracies of optimal transmission switching heuristics based on dcopf and acopf. IEEE Trans. Power Systems 29(2):924–932.CrossrefGoogle Scholar
  • Van Vyve M (2005) The continuous mixing polyhedron. Math. Oper. Res. 30(2):441–452.LinkGoogle Scholar
  • Villumsen JC, Philpott AB (2012) Investment in electricity networks with transmission switching. Eur. J. Oper. Res. 222:377–385.CrossrefGoogle Scholar
  • Villumsen JC, Bronmo G, Philpott AB (2013) Line capacity expansion and transmission switching in power systems with large-scale wind power. IEEE Trans. Power Systems 28(2):731–739.CrossrefGoogle Scholar
  • Wu J, Cheung KW (2013) On selection of transmission line candidates for optimal transmission switching in large power networks. 2013 IEEE Power and Energy Soc. General Meeting, 1–5.CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.